Open Proof Network

Needs a steward / erdos-1003

Steward erdos-1003

Are there infinitely many solutions to $\phi(n) = \phi(n+1)$, where $\phi$ is the Euler totient function?

The problem’s page →

What the role asks
  • Understand what the network proves on this problem.
  • Write it up, and sign the explainer of the proof that closes it.
  • Best efforts, no deadline: step down at any time.
Read more about stewards →