Subject: Mathematics
Book: Maths Mastery
A modular inverse of a number a (mod m) is x such that ax ≡ 1 (mod m). It exists only if gcd(a,m)=1. The Extended Euclidean Algorithm finds x for which ax + my=1, implying ax≡1 (mod m). For instance, to find the inverse of 3 modulo 7, we solve 3x + 7y=1, yielding x=5 because 3×5=15≡1 (mod 7). Modular inverses power encryption algorithms (RSA), solve congruences, and handle advanced computations in computer science. Mastery ensures you can manipulate modular arithmetic quickly for a wide range of cryptographic and number-theoretic tasks.
The LCM of two numbers is 60, and their HCF is 5. If one of the numbers is 20, what is the other number?
View QuestionIf x = 2 and y = 3, what is the value of (x^2 + y^2)?
View QuestionIf the radius of a circle is 7 cm, what is its circumference?
View QuestionWhat is the sum of all odd numbers from 1 to 99?
View QuestionThe sides of a triangle are 13 cm, 14 cm, and 15 cm. What is its area?
View QuestionIf a + b = 10 and ab = 21, what is the value of a^2 + b^2?
View QuestionA car travels 240 km in 4 hours. What is its average speed?
View QuestionA car covers a distance of 150 km in 2.5 hours. What is its average speed?
View QuestionWhat is the area of a circle with a diameter of 14 cm?
View QuestionA train 150 m long passes a pole in 15 seconds. What is its speed?
View Question