Mine is: 1 + 28433 * 2 ^ 7830457x But without an fft based implementation of extended precision multiply, I think this is an academic issue.
That said, the multiplication could be user code. Most of the details on how to do this were posted at http://www.jsoftware.com/jwiki/Essays/FFT -- Raul On Wed, Jul 6, 2011 at 1:27 PM, Tracy Harms <[email protected]> wrote: > My sense of the intended computation is > 28433* 1+ 2^ 7830457x > > On Wed, Jul 6, 2011 at 1:18 PM, <[email protected]> wrote: > >> 0. One of these numbers needs to have an x to get extended precision. >> >> 1. 28433 * 2^7830457 + 1 >> >> is the same as >> >> 28433 * 2^7830458 >> >> which seems unlikely to be what was meant. >> >> > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
