New answers tagged

2 votes

Direct algorithm for an integer program

The problem is trivial at least for a half of instances by simply taking $x_1=x_2=\frac{p-1}2$. This gives a solution when the orders of $h_1,h_2$ modulo $p$ divide $\frac{p-1}2$; or when both orders ...
Max Alekseyev's user avatar
3 votes
Accepted

Direct algorithm for an integer program

This is an extremely difficult non-linear integer programming problem. The difficulty consists in the restriction $h_1^{x_1}-h_2^{x_2}=kp$ which is hardly handled by known methods. I don't know any ...
user64494's user avatar
  • 3,309

Top 50 recent answers are included