Growth of The Function
In the words of Hardy & Wright, φ(n) is "always ‘nearly n’."
First
but as n goes to infinity, for all δ > 0
These two formulae can be proved by using little more than the formulae for φ(n) and the divisor sum function σ(n).
In fact, during the proof of the second formula, the inequality
true for n > 1, is proven.
We also have
Here γ is Euler's constant, γ = 0.577215665..., eγ = 1.7810724..., e−γ = 0.56145948... .
Proving this, however, requires the prime number theorem. Since log log (n) goes to infinity, this formula shows that
In fact, more is true.
for n > 2, and
for infinitely many n.
Concerning the second inequality, Ribenboim says "The method of proof is interesting, in that the inequality is shown first under the assumption that the Riemann hypothesis is true, secondly under the contrary assumption."
For the average order we have
The "Big O" stands for a quantity that is bounded by a constant times nlog n (which is small compared to n2).
This result can be used to prove that the probability of two randomly-chosen numbers being relatively prime is
Read more about this topic: Euler's Totient Function
Famous quotes containing the words growth of the, growth and/or function:
“You know that the nucleus of a time is not
The poet but the poem, the growth of the mind
Of the world, the heroic effort to live expressed
As victory. The poet does not speak in ruins
Nor stand there making orotund consolations.
He shares the confusions of intelligence.”
—Wallace Stevens (18791955)
“From infancy, a growing girl creates a tapestry of ever-deepening and ever- enlarging relationships, with her self at the center. . . . The feminine personality comes to define itself within relationship and connection, where growth includes greater and greater complexities of interaction.”
—Jeanne Elium (20th century)
“Morality and its victim, the motherwhat a terrible picture! Is there indeed anything more terrible, more criminal, than our glorified sacred function of motherhood?”
—Emma Goldman (18691940)




