In message <7384990EC1040E4C8BC31CADFFDD428001C2A304@cedarrapids>, james.jones@firstinvestors.com writes
From: Andreas Harnack <ah.boost.02@justmail.de> ...
You're right, there is a computational limit, but I wouldn't expect to a see a dimension with the power of 31. Exponends of 4 are about the highest I've ever seen, and (2*3*5*7*11*13*17)^3 still fits in 57 bits, so we might want to use long or even long long unsigned ints, but that should be fine for most situations.
If exponents of 4 are the highest you've seen, shouldn't you consider the size of (2*3*5*7*11*13*17)^4, which requires 76 bits? But ISTM that this information could be given by a sequence of powers for each prime in the sequence: ie 4 bits * 7 in this second example. What am I missing?
Alec -- Alec Ross