Hi, what's the largest number J can compute?
I'm looking to compute 28433 * 2^7830457 + 1, which has 2357207 digits. I 
started calculating it, but it's taking a very long time (obviously), an I'm 
wondering how long it's likely to take, and whether it's even possible.

Thanks. 
___________________________

David Vaughan
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm

Reply via email to