New answers tagged combinatorics
0
votes
What are the benefits of cutting by half the number of multiplications needed to calculate n?
I just wanted to remind you that multiplication of numbers can be performed in O(n*log(n)*loglog(n)) time using the Schönhage–Strassen algorithm.
Thus, 1000000! can be calculated in 100-200 ...
Top 50 recent answers are included