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 man rows downstream at 6 km/h and upstream at 4 km/h. What is the speed of the stream?
View QuestionA man invests Rs. 5000 at 5% per annum simple interest. What is the total amount after 3 years?
View QuestionIf the radius of a circle is doubled, what happens to its area?
View QuestionThe simple interest on Rs. 4000 at 5% per annum for 2 years is:
View QuestionIf x^3 - 3x^2 + 4 = 0, what is one root of the equation?
View QuestionIf a = 2 and b = 3, what is the value of (a^2 + b^2)?
View QuestionIf x:y = 2:3 and z:y = 4:3, what is x:z?
View QuestionThe base of a triangle is 10 cm and its height is 6 cm. What is its area?
View QuestionIf 8x = 512, what is the value of x?
View QuestionWhat is the sum of the first 50 positive integers?
View Question