The multiplication is currently O(n^2) so the number you described will take a very long time. How long? You can gauge it by timing the multiplication of numbers with 1e4, 2e4, 4e4, etc. digits.
The multiplication would be faster with: http://www.jsoftware.com/jwiki/Essays/FFT ----- Original Message ----- From: David Vaughan <[email protected]> Date: Wednesday, July 6, 2011 8:32 Subject: [Jprogramming] Large numbers To: Programming forum <[email protected]> > 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. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
