1.★ Final term Spring 2010
If a and b are positive integers and a = b·q + r with q and r non-negative integers, then
- Agcd(a, b) = gcd(b, r)
- Bgcd(a, r) = gcd(b, r)
- Cgcd(a, q) = gcd(q, r)
This is the step used in the Euclidean algorithm.Euclidean algorithm isi step par chalta hai.
2.★ Final term Spring 2010
The greatest common divisor of 27 and 72 is
- A27
- B9
- C1
- DNone of these
27 = 3³ and 72 = 2³·3², so gcd = 3² = 9.27 = 3³ aur 72 = 2³·3², isliye gcd = 3² = 9.
3.★ Final term Spring 2010
Quotient–remainder theorem: for any integer n and positive integer d, there are unique integers q and r with n = d·q + r and
- A0 ≤ r < d
- B0 < r < d
- C0 ≤ d < r
- DNone of these
The remainder is at least 0 and less than the divisor.Remainder 0 ya us se zyada aur divisor se kam hota hai.