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 sin(θ) = 3/5 and θ is an acute angle, what is tan(θ)?
View QuestionHow many ways can 4 people sit in a row?
View QuestionA cube has a side length of 4 cm. What is its volume?
View QuestionIf a person can type 45 words per minute, how many words can they type in 2 hours?
View QuestionWhat is the square root of 144?
View QuestionIf two complementary angles differ by 30°, what are the angles?
View QuestionWhat is the probability of drawing a king from a standard deck of 52 playing cards?
View QuestionThe base of a triangle is 10 cm and its height is 6 cm. What is its area?
View QuestionWhat is the value of log₃(27)?
View QuestionIf the radius of a circle is doubled, what happens to its area?
View Question