DP Further Mathematics HL Questionbank
The greatest common divisor, gcd(\(a\),\(b\)), and the least common multiple, lcm(\(a\),\(b\)), of integers \(a\) and \(b\).
| Path: |
Description
[N/A]Directly related questions
- 18M.1.hl.TZ0.1b: Hence find integers s and t such that 74s + 383t = 1.
- 18M.1.hl.TZ0.1a: Use the Euclidean algorithm to find the greatest common divisor of 74 and 383.
- 11M.1.hl.TZ0.4a: Prove that if \({\rm{gcd}}(a,b) = 1\) and \({\rm{gcd}}(a,c) = 1\) , then \({\rm{gcd}}(a,bc) = 1\) .
- 12M.1.hl.TZ0.2b: The positive integers \(M\) , \(N\) are such that \(\gcd (M,N) = 63\) and \(lcm(M,N) = 47502\) ....
