View Single Post
Old 2020-10-23, 07:56   #13
ONeil
 
Dec 2017

111100002 Posts
Default This is super fast don't listen to them

I think they have the inside scoop.

I have found the machine for finding factors very fast. You need to make a list of many primes that are at least 10 digits long or greater than the average for factors found length. That's work I know, but when you are done you save time. Instead of a month processing your machine will come back in seconds with a factor. Now granted its about your list so you could miss a factor. At least if you miss a factor you could either make you list bigger or test that number to see if its prime here is the code. This code opens the list in a text file and uses it as mod against your test 2^p-1.

Here you can at least assess the average factor length:
https://www.mersenne.org/report_fact...xp_lo=12354673



Here is a small portion of my list inside the text file:
Quote:
k = ( 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283)
Code:
import timeit
while True:
	p = int(input("Enter a prime number: "))
	if p == 1:
		print(p,"Come on man type a larger number or vote for Biden, because he is number 1")
		continue
	if p == 2:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 3:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 5:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 7:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 13:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 17:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 19:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 31:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 61:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 89: 
		print(p,"The input 'p' produces a Mersenne Prime")
		continue
	elif p == 107: 
		print(p,"The input 'p' produces a Mersenne Prime")
		continue
	elif p == 127: 
		print(p,"The input 'p' produces a Mersenne Prime")
		continue
	elif p == 521:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 607:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 1279:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 2203:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 2281:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 3217:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 4253:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 4423:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 9689:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 9941:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 11213:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 19937:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 21701:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 23209:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 44497:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 86243: 
		print(p,"The input 'p' produces a Mersenne Prime")
		continue
	elif p == 110503:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 132049:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 216091:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 756839:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 859433:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 1257787:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 1398269:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 2976221:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 3021377:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 6972593: 
		print(p,"The input 'p' produces a Mersenne Prime")
		continue
	elif p == 13466917:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 20996011:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 24036583:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 25964951:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 30402457:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 32582657:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 37156667:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 42643801:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 43112609:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 57885161:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 74207281:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 77232917:
		print(p,"The input 'p' produces a Mersenne Prime")
		continue 
	elif p == 82569933:
		
		print(p,"The input 'p' produces a Mersenne Prime")
		continue

	with open("C:\python37\k.txt",'r') as f:
		primes = f.read().split("(")[1].split(')')[0].split(',')  # int list of primes
		primes = [int(i.strip()) for i in primes]
		for prime in primes:
			if (2**p - 1) % int(prime) == 0:
				start_time = timeit.default_timer()
				print(prime)
				print(timeit.default_timer() - start_time,'seconds')
				break

Last fiddled with by ONeil on 2020-10-23 at 08:06
ONeil is offline