Colossal Number Problem

Lee Bradley posed another great problem. Check it out over at his site, Prime Puzzle.


  1. Nice, Lee! That makes it a lot easier.

  2. 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.

Leave a comment