Help in number theory problem

Revision en2, by _MASTER__, 2023-02-21 22:09:34
The problem was to find two numbers, a and b
, such that their greatest common divisor and their least common multiple would add up to a given number, x
. Moreover, the difference between the two numbers should be as small as possible, and a
 must be less than or equal to b

X is between 2 and 1e9

.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English _MASTER__ 2023-02-21 22:09:34 42
en1 English _MASTER__ 2023-02-21 22:07:40 349 Initial revision (published)