Hello,

Now I'm doubting. Is this graph correct?

Hello,

I was wondering why there is difference in computer speed between two almost the same calculations.

Example:

61! + 1 costs 271 sec and 59! + 1 almost 0? Why is that? When there are small prime factors, the

calculation goes often faster, why? hanks in advance!

Hello,

I try make 2 calculation with one commant. So there should be two seperate answers in the last line. Who can help me? So the last line should be 2.387 and 0.

restart;
restart;
st := time():
ifactor(49! + 1);
(1021) (3119969417) (7374967) (139935066631148413819385559764102\

  5027693) (18503)
time() -st;
                             2.387
restart;
st := time():
isprime(49! + 1);
                             false
time() -st;
                               0.