|
|
back to boardHow to solve this problem without cheating? Should I use some test of simplicity (from Cormen or somewhere else) or is there any better way for such numbers? Re: How to solve this problem without cheating? Posted by KingPin 22 Mar 2005 05:35 If someone knows how to solve this proble without cheatin' (if carefull reading of the definition is a cheat) then he can get a lot of money... :) Re: How to solve this problem without cheating? Sorry, I understood after all, as for me I just found all the numbers in the Internet:) Re: How to solve this problem without cheating? Posted by Neumann 27 Mar 2005 18:08 I don't think it is possible to solve it without cheating, otherwise, why now the largest one is only 43th? Any way, you can get most of the ans in the text, except 3~8... Re: How to solve this problem without cheating? Of course, you cannot solve it without "cheating". The most powerful tests work for months to test one number! You already have all numbers written in the text - why do you think it is cheating? And it's easy to find the rest - up to 7-th. It's enough to test all numbers 2^p-1 up to 2^30-1 (only 30 numbers!) using bruteforce. How to solve this problem without cheating? its just impossible to calculate it in 1 second. Re: How to solve this problem without cheating? Posted by 2rf 8 Aug 2007 21:48 If using Wikipedia and OEIS aren't cheating I know how to do it) Re: How to solve this problem without cheating? I wonder , who can? Re: How to solve this problem without cheating? Posted by Whyyes 13 Aug 2016 19:28 If using Wikipedia and OEIS aren't cheating I know how to do it) Using Wikipedia and OEIS may be cheating, but using the answers already in the problem definition definitely isn't. |
|
|