Hello can someone please help me find a formula for at least one integer solution to the following without brute force
$Y = ((g^x)-A)/p$
Where $g,p,A$ are constants, $P$ is a large prime, $Y$ and $X$ need to be integers
The solutions to the DH problem lie in points in this graph where $Y$ is an integer and $x$ is an integer. Actually $Y$ is $\lfloor(g^x/p)\rfloor$ which is always an integer which is why for any point in this graph where both $x$ and $Y$ are integers you find a correct solution to the DH problem ie you can reverse the $g^{x}\operatorname{mod} p=A$.
Wondering if it's even possible. Does anyone know if it has been solved or if its just not possible without brute force?
Thank you