You are viewing a single comment's thread. Return to all comments →
What if LCM(A) = GCD(B)+1 ? or GCD(B) - LCM(A) <<<< LCM(A) ?
Also, step 3 seems to suggest that I must use brute force. Is that the best I can do? Or do we have a faster way to do that?
(Just curious)
For both cases LCM(A) = GCD(B)+1 and GCD(B) - LCM(A) <<<< LCM(A) the result would be 0.
For step-3 you need to run a loop from LCM upto GCD each time multiplying the LCM by 1,2,3.. so on. See the sudo code below.
GCD%(LCM*i)==0, where i=1,2,3... until LCM*i<=GCM;
If you think running a loop means brute forcing, then yes you have to use brute force. :)
Between Two Sets
You are viewing a single comment's thread. Return to all comments →
What if LCM(A) = GCD(B)+1 ? or GCD(B) - LCM(A) <<<< LCM(A) ?
Also, step 3 seems to suggest that I must use brute force. Is that the best I can do? Or do we have a faster way to do that?
(Just curious)
For both cases LCM(A) = GCD(B)+1 and GCD(B) - LCM(A) <<<< LCM(A) the result would be 0.
For step-3 you need to run a loop from LCM upto GCD each time multiplying the LCM by 1,2,3.. so on. See the sudo code below.
If you think running a loop means brute forcing, then yes you have to use brute force. :)