20191105, 20:05  #23  
∂^{2}ω=0
Sep 2002
República de California
2^{2}·3·7·139 Posts 
Quote:


20191106, 13:27  #24  
Mar 2013
7_{8} Posts 
Quote:
Also, consider using modhalvings, or even mixing modhalvings and moddoublings. When implemented well, I believe the worst case scenario will not have an extra loop iteration compared to positivepowering ladder. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Requestion for fast chebyshev theta function  danaj  Computer Science & Computational Number Theory  9  20180331 14:59 
Do normal adults give themselves an allowance? (...to fast or not to fast  there is no question!)  jasong  jasong  35  20161211 00:57 
Fast modular reduction for primes < 512 bits?  BenR  Computer Science & Computational Number Theory  2  20160327 00:37 
Fast Approximate Ceiling Function  R.D. Silverman  Programming  27  20101119 17:50 
Base6 speed for prime testing vs. base2  jasong  Conjectures 'R Us  36  20100803 06:25 