pi and phi

[Jeffrey Shallit]

You can find good upper and lower bounds for arithmetic functions
in my book with Eric Bach, _Algorithmic Number Theory_, Chapter 8.
In particular you can find the following bound of Rosser and
Schoenfeld,
	phi(n) > n/(e^gamma log log n + 3/(log log n)) for n >= 3.

Jeffrey Shallit