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^3 - 3x^2 + 4 = 0, what is one root of the equation?
View QuestionIf a right triangle has legs of 9 cm and 12 cm, what is the length of the hypotenuse?
View QuestionIf the average of five consecutive odd numbers is 25, what is the largest number?
View QuestionIf log(100) = 2 and log(10) = 1, what is log(1000)?
View QuestionWhat is the greatest common divisor (GCD) of 36 and 48?
View QuestionThe sum of the squares of two consecutive integers is 145. What are the integers?
View QuestionThe ratio of two numbers is 3:5, and their sum is 64. What are the numbers?
View QuestionIf the perimeter of a square is 40 cm, what is the area of the square?
View QuestionWhat is the square root of 121?
View QuestionIf x + y = 10 and xy = 21, what is the value of x³ + y³?
View Question