Subject: Mathematics
Book: Maths Mastery
Also known as the Greatest Common Factor (GCF), the GCD of two numbers is the largest positive integer that divides them both without leaving a remainder. The standard method is the Euclidean Algorithm: if you want the GCD of 48 and 18, for instance, repeatedly apply gcd(a, b) = gcd(b, a mod b). With 48 and 18, 48 mod 18 = 12, so gcd(48, 18) = gcd(18, 12). Next, gcd(18, 12) = gcd(12, 6), and finally gcd(12, 6) = 6. So the GCD is 6. GCD calculations apply to simplifying fractions, finding common denominators, cryptography, and more. Mastering the Euclidean Algorithm also fosters efficiency in many integer-based math problems.
If a+b = 10 and ab = 21, what is the value of (a-b)^2?
View QuestionWhat is the sum of the first 50 positive integers?
View QuestionWhat is the sum of the first 10 positive even numbers?
View QuestionA sphere has a radius of 7 cm. What is its volume?
View QuestionIf the radius of a circle is doubled, what happens to its area?
View QuestionIf sin(A) = 3/5 and cos(B) = 5/13, where A and B are acute angles, what is sin(A+B)?
View QuestionIf x:y = 2:3 and z:y = 4:3, what is x:z?
View QuestionA train 150 m long passes a pole in 15 seconds. What is its speed?
View QuestionA car covers a distance of 150 km in 2.5 hours. What is its average speed?
View QuestionWhat is the 7th term of the arithmetic progression 3, 6, 9, 12,...?
View Question