 In the original RSA paper, the Euler totient function is used instead of "λ"("n") for calculating the private exponent "d".Since "φ"("n") is always divisible by "λ"("n") the algorithm works as well.That the Euler totient function can be used can also be seen as a consequence of the Lagrange's theorem applied to the multiplicative group of integers modulo pq.