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 the average of five consecutive odd numbers is 25, what is the largest number?
View QuestionIf the sum of three consecutive integers is 96, what are the integers?
View QuestionIf the product of two numbers is 120 and their sum is 26, what are the numbers?
View QuestionThe probability of rolling a sum of 7 with two dice is:
View QuestionWhat is the value of log₃(27)?
View QuestionIf 8x = 512, what is the value of x?
View QuestionThe sum of the reciprocals of two numbers is 1/4. If one number is 12, what is the other?
View QuestionWhat is the slope of a line passing through the points (2, 3) and (4, 7)?
View QuestionIf x + y = 10 and xy = 21, what is the value of x³ + y³?
View QuestionWhat is the cube of 4?
View Question