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.
What is the probability of drawing an ace from a standard deck of 52 cards?
View QuestionHow many diagonals does a pentagon have?
View QuestionIf the radius of a circle is doubled, what happens to its area?
View QuestionIf the average of five consecutive odd numbers is 25, what is the largest number?
View QuestionIf a:b = 5:7 and b:c = 6:11, what is a:c?
View QuestionIf the sum of three consecutive integers is 72, what are the integers?
View QuestionA cube has a side length of 4 cm. What is its volume?
View QuestionThe simple interest on Rs. 4000 at 5% per annum for 2 years is:
View QuestionIf x - y = 5 and x + y = 15, what is the value of x?
View QuestionIf the radius of a circle is 7 cm, what is its circumference?
View Question