I have the following:
$$ab \pmod x = 1.$$
$a$ and $b$ are known. Is there an efficient procedure to find the largest possible value of $x$?
Edit: What if $a$ and $b$ are too large to factor efficiently though?
I have the following:
$$ab \pmod x = 1.$$
$a$ and $b$ are known. Is there an efficient procedure to find the largest possible value of $x$?
Edit: What if $a$ and $b$ are too large to factor efficiently though?