OpenCart Templates
Friday , July 28 2017
Home / Elementary Number Theory / For any integer k ≠ 0, gcd(ka, kb) = |k| gcd(a, b)

Check Also

Application of Euclidian’s algorithm in Diophantine equation

Problem-1: Which of the following Diophantine equations cannot be solved –   a) 6x + ...

Leave a Reply

Your email address will not be published. Required fields are marked *