01091nas a2200169 4500008004100000022001400041024002700055245007700082210006100159260001200220490000700232520054500239653002700784100002000811700002100831856006900852 2023 eng d a1530-7638 aArtcile number: 23.1.600aOn the Minimal Number of Solutions of the Equation φ(n+k)=Mφ(n), M=1,20 aMinimal Number of Solutions of the Equation φnkMφn M12 c01/20230 v263 aWe fix a positive integer $k$ and look for solutions $n \in \mathbb{N}$ of the equations $\phi(n + k) = \phi(n)$ and $φ(n + k) = 2 φ(n)$. For $k \le 12 \cdot 10^{100}$, we prove that Fermat primes can be used to build five solutions for the first equation when $k$ is even, and five for the second one when $k$ is odd. Furthermore, for $k \le 4 \cdot 10^{58}$, we show that for the second equation there are at least three solutions when $k$ is even. Our work increases the previously known minimal number of solutions for both equations.10aEuler’s phi function1 aFerrari, Matteo1 aSillari, Lorenzo uhttps://cs.uwaterloo.ca/journals/JIS/VOL26/Sillari/sillari3.html