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.
What is the sum of all even numbers between 1 and 50?
View QuestionA rectangle has an area of 48 cm² and a length of 8 cm. What is its width?
View QuestionIf 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^2 + b^2?
View QuestionIf sin(A) = 3/5 and cos(B) = 5/13, where A and B are acute angles, what is sin(A+B)?
View QuestionWhat is the area of a sector of a circle with radius 14 cm and central angle 90°?
View QuestionIf a cone has a base radius of 3 cm and height of 4 cm, what is its slant height?
View QuestionIf the cost price of an item is Rs. 400 and the selling price is Rs. 500, what is the profit percentage?
View QuestionIf a = 5 and b = 12, what is the length of the hypotenuse of a right triangle?
View QuestionHow many ways can 4 people sit in a row?
View Question