Divisors [2]

Let φ(n) the amount of numbers ≤ n and coprime with n (that is with GCD(x, n) = 1)
Let γ(n) the largest square-free divisor of n.

Solve φ(n) = γ(n) ? Solution

φ(n) = γ(n)² ? Solution

Details

 

Home Arithmetic Geometric Misc Topics Scripts Games Mail Version Franšaise Previous Next