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 cone has a base radius of 3 cm and height of 4 cm, what is its slant height?
View QuestionIf sin(A) = 1/2 and A is acute, what is the value of A?
View QuestionIf a + b = 10 and ab = 21, what is the value of a^2 + b^2?
View QuestionThe sides of a triangle are 5 cm, 12 cm, and 13 cm. What type of triangle is it?
View QuestionA square is inscribed in a circle with a radius of 5 cm. What is the area of the square?
View QuestionA sphere has a radius of 7 cm. What is its volume?
View QuestionIf x^2 - 6x + 9 = 0, what is the value of x?
View QuestionIf 2a + b = 10 and a - b = 4, what is the value of a?
View QuestionA sum of money triples itself in 12 years at simple interest. What is the rate of interest per annum?
View Question