"The minimal number of solutions to phi(n) = phi(n + k)."

Jeffrey J. Holt (2003)

> Home

Details and statistics

DOI: 10.1090/S0025-5718-03-01509-6

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/moc/Holt03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/moc/Holt03
Jeffrey J. Holt:
The minimal number of solutions to phi(n) = phi(n + k). Math. Comput. 72(244): 2059-2061 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.