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.
A sum of money doubles itself in 5 years at simple interest. What is the rate of interest?
View QuestionA sphere has a radius of 7 cm. What is its volume?
View QuestionWhat is the remainder when 5^100 is divided by 3?
View QuestionIf x + y = 10 and xy = 21, what is the value of x³ + y³?
View QuestionIf 5x - 2 = 13, 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 QuestionA train 120 meters long is moving at a speed of 54 km/h. How long will it take to pass a pole?
View QuestionThe sides of a triangle are 7, 24, and 25. Is this a right triangle?
View QuestionHow many diagonals does a pentagon have?
View QuestionWhat is the length of the diagonal of a square with a side length of 7 cm?
View Question