1 problem

Let $N(p,q)$ be defined for $q\ge2$ by … where $\phi(q)$ is Euler's phi function. Recursion conjecture. The recursively computed values $N(p,q)$ are the actual numbers of solutions…