The minimal number of solutions to $\phi(n)=\phi(n+k)$ (Q4417178): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sur l'équation φ (x+k)=φ (k) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sur l'équation φ (x+k)=φ (x). II / rank | |||
Normal rank | |||
Latest revision as of 17:26, 5 June 2024
scientific article; zbMATH DE number 1955337
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimal number of solutions to $\phi(n)=\phi(n+k)$ |
scientific article; zbMATH DE number 1955337 |
Statements
The minimal number of solutions to $\phi(n)=\phi(n+k)$ (English)
0 references
28 July 2003
0 references
Euler's totient function
0 references
computation
0 references
