Tricky Totient

Find the total number of positive integers nn such that ϕ(n2+1)=6n\phi(n^2+1)=6n.

Details and assumptions

The Euler's totient function ϕ(m)\phi(m) is the number of integers from 11 to m1m-1 that are coprime to m.m.

×

Problem Loading...

Note Loading...

Set Loading...