%0 Journal Article %J Journal of Integer Sequences %D 2023 %T On the Minimal Number of Solutions of the Equation φ(n+k)=Mφ(n), M=1,2 %A Matteo Ferrari %A Lorenzo Sillari %K Euler’s phi function %X We 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. %B Journal of Integer Sequences %V 26 %8 01/2023 %G eng %U https://cs.uwaterloo.ca/journals/JIS/VOL26/Sillari/sillari3.html %9 Article