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.
If x^2 - 6x + 9 = 0, what is the value of x?
View QuestionIf sin(x) = 3/5 and x is in the first quadrant, what is cos(x)?
View QuestionA man rows downstream at 6 km/h and upstream at 4 km/h. What is the speed of the stream?
View QuestionIf 8x = 512, what is the value of x?
View QuestionIf a + b = 10 and ab = 21, what is the value of a^2 + b^2?
View QuestionWhat is the area of a circle with a diameter of 14 cm?
View QuestionIf x² - 9x + 18 = 0, what are the roots of the equation?
View QuestionWhat is the square root of 0.25?
View QuestionIf the average of five consecutive odd numbers is 25, what is the largest number?
View QuestionIf x^2 - 5x + 6 = 0, what are the roots?
View Question