![]() |
'Dr.' Elphinstone
After being inspired by the mathematical research performed by 'Dr.' Elphinstone... ;) (http://www.mersenneforum.org/viewtopic.php?t=832) I'd thought I'd post the following puzzle...
Find a small factor (or any factor) of the Mersenne number 2^(157,456,128,945,769)-1. btw - I haven't actually found a factor for this number... and it would take longer than the age of the universe to test this number for primality on a P4, so if you can't find a small factor, you should probably just give up. But don't worry, it's only 47,399,017,813,816 digits long! Bragoria |
This is off topic.
"Puzzles" are restricted to problems for which the poster can, and will, post a solution after a few days. |
| All times are UTC. The time now is 02:59. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.