 In this case the total time for all of the steps of the algorithm can be analyzed using a telescoping series, showing that it is also "O"("h"2).Modern algorithmic techniques based on the Schönhage–Strassen algorithm for fast integer multiplication can be used to speed this up, leading to quasilinear algorithms for the GCD.The number of steps to calculate the GCD of two natural numbers, "a" and "b", may be denoted by "T"("a", "b").