Yeah, my friend got the full expansion in about 4 seconds with Mathematica.
I was thinking perhaps, for example, instead of doing 2^100 which requires
99 multiplications, you can do (2^10)^10 which requires 18 multiplications.
Perhaps Mathematica is doing something like that?
On 2/21/06, John Randall <[EMAIL PROTECTED]> wrote:
>
> On a Sun, Maple gives
>
> 28433 * 2^7830457); --- 83 seconds
> 28433 * 2^7830457 mod 10000000000); --- 83 seconds
>
> so it really is calculating the 2 million digit product.
>
> To make Maple smart, you have to use neutral operators. This suppresses
> immediate execution and allows simplifications to be used. The neutral
> form of ^ is &^.
>
> 28433 * 2&^7830457 mod 10000000000); --- 0.06 seconds
>
> Best wishes,
>
> John
>
> bill lam wrote:
> > I realise how slow my PC is. (Celeron 1.7G / 512MB)
> > It cannot compute _10{. ": >: 28433 * 2^7830457x within an hour, so I
> > aborted it.
> >
> > My question is:
> > Can Maple actually calculate this 2 million digit product within 30
> > seconds,
> > or it just clever enough to make advantage of the "mod 10000000000"
> >
> > Is
> > time(((28433*2^7830457)+1));
> > still under 30 seconds?
> >
> > Skip Cave mentioned it took 15 minutes in J. so relative speed of Maple
> > and J is about 30.
> > Is there any chance of comparison on the same computer.
> >
> >
> > ----------------------------------------------------------------------
> > For information about J forums see http://www.jsoftware.com/forums.htm
> >
>
>
> ----------------------------------------------------------------------
> For information about J forums see http://www.jsoftware.com/forums.htm
>
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
