|Alan McConnell on Fri, 21 Oct 2011 01:32:55 +0200|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|Re: issquare() for t_INTMOD's|
On Fri, Oct 21, 2011 at 01:11:08AM +0200, Bill Allombert wrote: > > > This is still much better than issquare(). > > Why? > > because issquare is actually doing factor(p), which for some reason is much > slower than isprime(p). Bill, and other pari-developers: can some serious work be done on this issue? A lot of us mathematicians(and IT crackers) really need for factor(p) to be as fast as isprime(p). Surely some polishing of the algorithms could make this possible??? Please Really Hasten! Yours in hope and anticipation, Alan, Really Hopeful -- Alan McConnell : http://patriot.net/users/alan If you don't know your rights, you don't have any. If it can't be abused, it's not freedom.