EPTHahaha at the reference.
And yes Andrew Wiles did it, using more than the margin
. Also using math that wasn't invented until many, many years later.To a Mod: Now that this problem is known to be unsolved, can this thread be closed?
[Math] Prime number progression?! - Page 4
| Forum Index > General Forum |
|
Mithrandir
United States99 Posts
Hahaha at the reference. And yes Andrew Wiles did it, using more than the margin . Also using math that wasn't invented until many, many years later.To a Mod: Now that this problem is known to be unsolved, can this thread be closed? | ||
|
blah_blah
346 Posts
On May 15 2011 08:57 Samhax wrote: Maybe 2^127 -1 is not prime, if the op is lucky. But if 2^127 -1 is prime then you need for sure a super computer to prove it. 2^{127}-1 is prime. | ||
|
Samhax
1054 Posts
that's unfortunate for the OP :p | ||
|
n.DieJokes
United States3443 Posts
| ||
|
Wonders
Australia753 Posts
On May 15 2011 08:57 Samhax wrote: Maybe 2^127 -1 is not prime, if the op is lucky. But if 2^127 -1 is prime then you need for sure a super computer to prove it. This number was known to be prime in 1876, when they didn't have supercomputers. Even then there were much better techniques for testing primality than exhaustively checking divisibility. | ||
|
Samhax
1054 Posts
On May 15 2011 11:26 Wonders wrote: This number was known to be prime in 1876, when they didn't have supercomputers. Even then there were much better techniques for testing primality than exhaustively checking divisibility. I didn't say for 2^127 -1 you need a super computer, this number is "relatively" small (~10^38). But for 2^(2^127-1) -1, show me how you can do it whitout a super computer, knowing that 2^127 -1 is prime. I really want to see that. edit : when i talked about super computer, i was talking about the next iterations. | ||
|
UniversalSnip
9871 Posts
On May 15 2011 09:20 aoeua wrote: I have discovered a truly marvellous solution for this problem. Unfortunately, the post width here is too narrow to contain it. I've always wondered if fermat was just a huge troll or if he actually thought he had the proof - although of course he could not have. | ||
|
NB
Netherlands12045 Posts
about the math problem, use induction (basic 1st year math) | ||
|
Mithrandir
United States99 Posts
On May 15 2011 11:51 NB wrote: one of the rule of TL is do not ask homework here! about the math problem, use induction (basic 1st year math) You are wrong. This problem is unsolved. He was trolling. | ||
|
Mithrandir
United States99 Posts
On May 15 2011 11:41 Samhax wrote: I didn't say for 2^127 -1 you need a super computer, this number is "relatively" small (~10^38). But for 2^(2^127-1) -1, show me how you can do it whitout a super computer, knowing that 2^127 -1 is prime. I really want to see that. edit : when i talked about super computer, i was talking about the next iterations. 2^(2^127-1)-1 cannot be done even with today's super computers, although people have checked all possible factors up to 10^50 without success. | ||
|
Samhax
1054 Posts
On May 15 2011 11:55 Mithrandir wrote: 2^(2^127-1)-1 cannot be done even with today's super computers, although people have checked all possible factors up to 10^50 without success. Yeah i know, but knowing the size of the number it's impossible to test it without computers. It's my point. | ||
|
arbiter_md
Moldova1219 Posts
On May 15 2011 12:00 Samhax wrote: Yeah i know, but knowing the size of the number it's impossible to test it without computers. It's my point. If you'd put all the computers in the world to work on this problem for the next 10 billion years, you wouldn't yet know if that number is really prime. Assuming it is prime. That's how big that number is. Math has many simple ways to tell the people that some questions will never get responses. | ||
|
Samhax
1054 Posts
On May 15 2011 12:07 arbiter_md wrote: If you'd put all the computers in the world to work on this problem for the next 10 billion years, you wouldn't yet know if that number is really prime. Assuming it is prime. That's how big that number is. Math has many simple ways to tell the people that some questions will never get responses. hum not sure about that, do you know Quantum computer (search it on wikipedia if not). Maybe one day, it will be possible, who knows. | ||
|
Manit0u
Poland17243 Posts
Anyway, my point is, why the hell would you use 'hi TL' on a TL? Just 'Hi!' would be enough in my opinion. There's no need for redundant stuff, especially one that shares some similarities with 4chan... | ||
|
oBlade
United States5527 Posts
On May 15 2011 18:08 Manit0u wrote: On a sidenote: I've noticed an increasing amount of posts starting with 'hi TL' or something like that. It seems similar to 'sub /b/' or whatever. Anyway, my point is, why the hell would you use 'hi TL' on a TL? Just 'Hi!' would be enough in my opinion. There's no need for redundant stuff, especially one that shares some similarities with 4chan... Similarly, 4chan.org and teamliquid.net both have advertisements. I don't think teamliquid.net should have advertisements because 4chan.org has them. Also, 4chan.org has moderators, so I think the banlings should surrender their powers. 4chan is a website, so I think teamliquid should become a restaurant. Seriously. All he did was greet us, it's not the least bit rude. | ||
|
mcc
Czech Republic4646 Posts
On May 15 2011 12:07 arbiter_md wrote: If you'd put all the computers in the world to work on this problem for the next 10 billion years, you wouldn't yet know if that number is really prime. Assuming it is prime. That's how big that number is. Math has many simple ways to tell the people that some questions will never get responses. That assumes that checking divisibility is the only way to check this or even that our current methods for checking primality are the only ones. I agree that we won't find a solution to OP, but that does not mean that propositions here are the only way to get there. EDIT: by "we" I mean this thread/TL | ||
| ||
