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 QuestionIf the length of a rectangle is doubled and the width is halved, what is the change in area?
View QuestionA triangle has angles 60°, 60°, and 60°. What type of triangle is it?
View QuestionWhat is the HCF of 72 and 120?
View QuestionHow many diagonals does a pentagon have?
View QuestionIf 2x = 16, what is the value of x?
View QuestionIf x:y = 2:3 and z:y = 4:3, what is x:z?
View QuestionThe LCM of 12 and 15 is:
View QuestionA man rows downstream at 6 km/h and upstream at 4 km/h. What is the speed of the stream?
View QuestionIf a right triangle has legs of 9 cm and 12 cm, what is the length of the hypotenuse?
View Question