We have very big number $n$ and we are looking for such numbers $m$ satisfying the following condition:
$$m-1 \equiv n \pmod m$$
We only know that $n$ is integer (positive).
There is some very quick method, how can it be calculated? (sequential checking of successive numbers is tragically slow)
If such a method exists then I will ask for information about it and its computational complexity.