mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Information & Answers

Reply
 
Thread Tools
Old 2012-01-20, 14:34   #23
Stan
 
Dec 2011

22·32 Posts
Lightbulb Mersenne Primes

Can anyone shed light on whether the attached theorem is true?
If it is not true, could you indicate where the problem is.Mersenne Primes.pdf
Stan is offline   Reply With Quote
Old 2012-01-20, 17:07   #24
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

100000110000002 Posts
Default

Quote:
Originally Posted by Stan View Post
Can anyone shed light on whether the attached theorem is true?
If it is not true, could you indicate where the problem is.

looks to me it assumes it's true the only proof type I know of that does that is a proof by contradiction. I also see a referral to proposition 4.1 which I don't see.
science_man_88 is offline   Reply With Quote
Old 2012-01-20, 19:16   #25
Stan
 
Dec 2011

22·32 Posts
Lightbulb Mersenne Primes

Can anyone shed light on whether the attached theorem is true?
If it is not true, could you indicate where the problem isMersenne Primes.pdf

Last fiddled with by Stan on 2012-01-20 at 19:18 Reason: Amended attachement
Stan is offline   Reply With Quote
Old 2012-01-20, 19:33   #26
ccorn
 
ccorn's Avatar
 
Apr 2010

2·3·52 Posts
Default

Quote:
Originally Posted by Stan View Post
Can anyone shed light on whether the attached theorem is true?
If it is not true, could you indicate where the problem isAttachment 7578
Check the part beginning at the fifth line from the bottom of the page.
ccorn is offline   Reply With Quote
Old 2012-01-20, 19:40   #27
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

Quote:
Originally Posted by Stan View Post
Can anyone shed light on whether the attached theorem is true?
If it is not true, could you indicate where the problem isAttachment 7578
Quote:
2^{n_3}= 1 (\text{ mod } n_4), ..., 2^{n_o}= 1 (\text { mod } n_1) \text { since each } n_i ,1 =< i =< 4, is a distinct prime.
I don't see how this only applies to primes 2^{x_y}-1 = x_{y+1} implies 2^{x_y} = 1 \text { mod x_{y+1}} regardless if the sequence they are in are all prime.

Last fiddled with by science_man_88 on 2012-01-20 at 19:42
science_man_88 is offline   Reply With Quote
Old 2012-01-20, 19:47   #28
ccorn
 
ccorn's Avatar
 
Apr 2010

100101102 Posts
Default

Quote:
Originally Posted by ccorn View Post
Check the part beginning at the fifth line from the bottom of the page.
And, regarding the fourth line from the bottom, note that
5*phi(5) | phi(33), but 25 does not divide 33.
ccorn is offline   Reply With Quote
Old 2012-01-20, 20:46   #29
Stan
 
Dec 2011

22·32 Posts
Default

Quote:
Originally Posted by ccorn View Post
And, regarding the fourth line from the bottom, note that
5*phi(5) | phi(33), but 25 does not divide 33.
Your note is correct, but my statement says 5 has to divide 32, which it does not.
Stan is offline   Reply With Quote
Reply



All times are UTC. The time now is 22:29.


Fri Aug 6 22:29:12 UTC 2021 up 14 days, 16:58, 1 user, load averages: 3.44, 3.32, 3.22

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.