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(x) = 3/5 and x is in the first quadrant, what is cos(x)?
View QuestionIf a+b = 10 and ab = 21, what is the value of (a-b)^2?
View QuestionIf the sum of three consecutive integers is 72, what are the integers?
View QuestionA number is increased by 20% and then decreased by 20%. What is the net change?
View QuestionIf sin(θ) = 0.6 and θ is acute, what is cos(θ)?
View QuestionIf x^2 - 5x + 6 = 0, what are the roots?
View QuestionWhat is the remainder when 5^100 is divided by 3?
View QuestionA car travels 240 km in 4 hours. What is its average speed?
View QuestionThe sides of a triangle are 7, 24, and 25. Is this a right triangle?
View QuestionIf a + b = 10 and ab = 21, what is the value of a^2 + b^2?
View Question