Lee Bradley posed another great problem. Check it out over at his site, Prime Puzzle.
This entry was posted on Monday, March 4th, 2013 at 8:44 am and is filed under problem.
You can follow any comments to this entry through the RSS 2.0 feed.
You can leave a comment, or trackback from your own site.
I wrote the following which might be useful.
Nice, Lee! That makes it a lot easier.
That does make it quite a bit easier, my lowly TI-83 couldn’t handle a number that big.
That idea reminds me part of Godel’s Incompleteness Theorem where you can use prime factorizations to represent any statement.
Very interesting problem with the encryption aspect.
© 2013. yofx. Powered by
WordPress. Theme design by WPShoppe.