Hey supermanaccz!
If \(127 \equiv 7 \pmod{n}\), then n is a divisor of 127 - 7 = 120.
The prime factorization of 120 is \(2^3 \cdot 3 \cdot 5\)
which has \((3 + 1)(1 + 1)(1 + 1) = 16\) positive divisors.
Therefore, there are 16 possible values of n.
I hope this helps,
Gavin.
There was the same question 1 day ago, https://web2.0calc.com/questions/how-many-positive-integers-n-satisfy-127-equiv-7