Mersenne Prime Prediction Tool Savant

[ONeil]

I designed an intense tool to help you fetter out if you should test a certain exponent to be a Mersenne Prime Number. Whenever one needs to know something about numbers well the obvious route is to utilize statistics. This tool which is not 100% accurate can help with predicting if your Prime Exponent may produce a Mersenne Prime. We have three types of exponents which produce Mersenne Primes, they are low end twins, mids and high end twins. I vigorously ran some models on the averages which numbers produces so if your number is closer to an Mersenne prime value than a non-prime value it might be a go. Now for the number which can upset the model. Number 37 is an outlier as it always seems to be when predicting Mersenne Primes so don't trust it. As a matter of fact I found the mids to be hard to predict. Have fun and I hope this helps you find your World Record Prime, Good Luck & Prime ON!

while True:
	print('''If the output of your number is closer to one 
	of these numbers for low twin, mid and high twin than this should
	predict if the outcome of your number is Mprime or not.  This
	is a very loose prediction model.  Remember the exponent 
	you use if its a Low Twin, mid or High Twin, so you can
	check against averages.  Certain numbers like 37 throw off this tool.
	
	Non-primes Averages:
	Low end Twin 35.6      non-twin mid number 28.37    High end Twin 26.2
	
	Mersenne Primes Averages:
	Low end Twin 31.7      non-twin mid number 22       High end Twin 25.3''')
	p = int(input('Enter prime number: '))

	n = ((pow(2,p-1)*2-1)*2)
	
	
	print(n%2+n%3+n%5+n%6+n%7+n%8+n%9+n%10+n%11)

[Uncwilly]

import random
z = random.randint(1,6000001)

p = int(input('Enter prime number: '))

if z > 6000000 :
print ("Test it")
else: 
print ("Likely not prime")

Try this code, it is as effective.

[ONeil]

Originally Posted by Uncwilly

import random
z = random.randint(1,6000001)

p = int(input('Enter prime number: '))

if z > 6000000 :
print ("Test it")
else: 
print ("Likely not prime")

Try this code, it is as effective.

Nice Joke Uncwilly

[Uncwilly]

No joke it is as effective as your numerology.

[ONeil]

Originally Posted by Uncwilly

No joke it is as effective as your numerology.

I'M NOT USING NUMEROLOGY!

[retina]

Originally Posted by ONeil

I'M NOT USING NUMEROLOGY!

Prove it. Show us some actual mathematics.

[ONeil]

Originally Posted by retina

Prove it. Show us some actual mathematics.

Well retina that's very easy I'm not using this code which is for numerology.

n = (((42- 1) % 9 + 1 if 42 else 0))

[retina]

Originally Posted by ONeil

Well retina that's very easy I'm not using this code which is for numerology.

n = (((42- 1) % 9 + 1 if 42 else 0))

Random numbers selected from "the air" and inserted into a random formula ... that isn't even close to mathematics. The is pure numerology.

Thanks for proving Uncwilly's comment true.

So where is your mathematics? We are still waiting ....

[Dr Sardonicus]

Originally Posted by ONeil

I designed an intense tool to help you fetter out if you should test a certain exponent to be a Mersenne Prime Number.

"Intense tool?" "Fetter out?"

Whenever one needs to know something about numbers well the obvious route is to utilize statistics.

Uh,...

[ONeil]

Look this is a tool you can weed out the numbers that are far from the average of an Mprime. Also if a number if found to be close or on top of an Mprime average take it with a grain of salt.

I tell you what though some numbers are probably worth testing more than others by following these stats.

[retina]

Originally Posted by ONeil

Look this is a tool you can weed out the numbers that are far from the average of an Mprime. Also if a number if found to be close or on top of an Mprime average take it with a grain of salt.

I tell you what though some numbers are probably worth testing more than others by following these stats.

Show your mathematics.

Do you have any?