MM127

Stan · 2015-05-09, 19:25

I believe I have a hard and fast proof that MM₁₂₇ is prime.
How can I get it verified without broadcasting the method on the web?

legendarymudkip · 2015-05-09, 20:13

You probably wanted the miscellaneous math forum. If you really do have a proof, which I doubt you do, a lot of people (especially on this forum) would be very interested to see it, so don't hide it. What if someone comes across it and publishes it, but you didn't want to? You get no credit for the "proof".

R.D. Silverman · 2015-05-09, 21:01

Quote:

Originally Posted by Stan

I believe I have a hard and fast proof that MM₁₂₇ is prime.
How can I get it verified without broadcasting the method on the web?

Why would you want to hide the method? Existing methods are inadequate.
If you have a new method, then publish it. You'll be famous.

Where did you get you math degree?

Would a moderator move this to misc. math please?

NBtarheel_33 · 2015-05-09, 21:22

Quote:

Originally Posted by Stan

I believe I have a hard and fast proof that MM₁₂₇ is prime.
How can I get it verified without broadcasting the method on the web?

Stan, the fact that you have made this public, time-stamped post on the Internet is enough to prove your ownership of the proof, should you indeed (which is quite unlikely) have one.

You may therefore feel free to outline and discuss your research, safe in the knowledge that (1) you are protected against plagiarism by your very own original post, and (2) you are among some of the best and most interested minds that you shall ever meet outside of a formal academic setting - both lay and professional - in mathematics and computer science.

If your result is indeed correct, there would be cause for great celebration in mathematics. We would therefore be most interested in seeing your work, and assure you that your ownership of it is fully secure.

R.D. Silverman · 2015-05-09, 22:09

Quote:

Originally Posted by NBtarheel_33

Stan, the fact that you have made this public, time-stamped post on the Internet is enough to prove your ownership of the proof, should you indeed (which is quite unlikely) have one.

You may therefore feel free to outline and discuss your research, safe in the knowledge that (1) you are protected against plagiarism by your very own original post, and (2) you are among some of the best and most interested minds that you shall ever meet outside of a formal academic setting - both lay and professional - in mathematics and computer science.

If your result is indeed correct, there would be cause for great celebration in mathematics. We would therefore be most interested in seeing your work, and assure you that your ownership of it is fully secure.

One major hallmark of a crank is that they believe others will "steal" their ideas if they post them.
They make extremely bold claims then fail to back them up.

Uncwilly · 2015-05-09, 22:19

Don't forget that there is an award available. You want to be the first to claim it, before anyone else does. GIMPS has over a thousand outstanding assignments above the 100M threshold, so we might get it first if you don't hurry up and publish your method.

TheMawn · 2015-05-10, 00:13

If you are able to prove that MM127 is prime without using the LL test, you'll have accomplished something which hasn't been done in years. The largest prime number at a given time has "belonged" to GIMPS for a very long time.

retina · 2015-05-10, 00:44

Quote:

Originally Posted by TheMawn

If you are able to prove that MM127 is prime without using the LL test, you'll have accomplished something which hasn't been done in years. The largest prime number at a given time has "belonged" to GIMPS for a very long time.

Well no one has found a factor yet so it must be prime.

science_man_88 · 2015-05-10, 01:26

though I know I'll make no progress as usual it's still getting me to think of applying the multinomial theorem to the thought about $s_{p-2}=a*x$ where a or x is a mersenne number and knowing a modular result on a power of that mersenne number I'm thinking of how I can apply it to the whole multinomial theorem and the values it gives when all x values are the same but as usual I'm painfully stupid.

TheMawn · 2015-05-10, 03:48

Quote:

Originally Posted by retina

Well no one has found a factor yet so it must be prime.

Quote:

Originally Posted by davar55

And then there's a proof by challenge, where you challenge everyone and anyone to explain (briefly) why they believe, and when the result is nothing additional, one concludes there is no dog.

Yes, I have seen this proof before. You apply the same sort of reasoning as in the proof of no dogs and voilà!

My cats give a slightly smaller number of shits about the MM127 proof, however..

retina · 2015-05-10, 05:11

Quote:

Originally Posted by TheMawn

Yes, I have seen this proof before.

Plenty of people have come up with this "proof" so it must be right by sheer popularity.

Quote:

Originally Posted by TheMawn

You apply the same sort of reasoning as in the proof of no dogs and voilà!

There is no spoon.

2015-05-09, 19:25	#1
Stan Dec 2011 100100₂ Posts	MM127 I believe I have a hard and fast proof that MM₁₂₇ is prime. How can I get it verified without broadcasting the method on the web?

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Is MM127 a PRP?	aketilander	Operazione Doppi Mersennes	6	2012-10-31 16:02
MM127	antimath	Lone Mersenne Hunters	12	2012-01-11 03:46
MM127	Dougal	LMH > 100M	26	2009-12-13 09:57
Is MM127 Prime? Just a Poll	jinydu	Miscellaneous Math	57	2008-11-08 17:48
MM127 Checkout Page	clowns789	Lone Mersenne Hunters	44	2004-09-30 08:06

2015-05-09, 20:13	#2
legendarymudkip Jun 2014 2³×3×5 Posts	You probably wanted the miscellaneous math forum. If you really do have a proof, which I doubt you do, a lot of people (especially on this forum) would be very interested to see it, so don't hide it. What if someone comes across it and publishes it, but you didn't want to? You get no credit for the "proof".

2015-05-09, 22:19	#6
Uncwilly 6809 > 6502 """"""""""""""""""" Aug 2003 101×103 Posts 19·499 Posts	Don't forget that there is an award available. You want to be the first to claim it, before anyone else does. GIMPS has over a thousand outstanding assignments above the 100M threshold, so we might get it first if you don't hurry up and publish your method.

2015-05-10, 00:13	#7
TheMawn May 2013 East. Always East. 11×157 Posts	If you are able to prove that MM127 is prime without using the LL test, you'll have accomplished something which hasn't been done in years. The largest prime number at a given time has "belonged" to GIMPS for a very long time.

2015-05-10, 01:26	#9
science_man_88 "Forget I exist" Jul 2009 Dumbassville 8384₁₀ Posts	though I know I'll make no progress as usual it's still getting me to think of applying the multinomial theorem to the thought about $s_{p-2}=a*x$ where a or x is a mersenne number and knowing a modular result on a power of that mersenne number I'm thinking of how I can apply it to the whole multinomial theorem and the values it gives when all x values are the same but as usual I'm painfully stupid.