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.
How many diagonals does a pentagon have?
View QuestionIf the sum of the angles of a polygon is 1080°, how many sides does the polygon have?
View QuestionA man invests Rs. 5000 at 5% per annum simple interest. What is the total amount after 3 years?
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 QuestionWhat is the value of x if log(x) + log(4) = log(32)?
View QuestionWhat is the sum of the first 50 positive integers?
View QuestionA car travels 240 km in 4 hours. What is its average speed?
View QuestionIf a right triangle has legs of 9 cm and 12 cm, what is the length of the hypotenuse?
View QuestionThe probability of getting an even number when rolling a die is:
View QuestionThe sum of the reciprocals of two numbers is 1/4. If one number is 12, what is the other?
View Question