MathDB

J 5

Source:

May 25, 2007

floor functionnumber theoryrelatively primeDivisor Functions

Problem Statement

n

is composite, prove that

\phi(n) \le n- \sqrt{n}