# Tricky Totient

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

Details and assumptions

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

×

Problem Loading...

Note Loading...

Set Loading...