Paul Underwood on Fri, 27 Sep 2019 15:03:50 +0200

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

qfbsolve (and ispseudoprime)

It is a pity that the function qfbsolve is much slower in 2.12 alpha where it solves for composite n too.

For example:


overflows the default stack whereas it gives an almost instantaneous answer with version 2.11 and version 2.9.

Also, qfbsolve(Qfb(1,0,1),n) *was* quicker than ispseudoprime for positive integers of the form 4*K+1,