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.
The area of an equilateral triangle with side length 6 cm is:
View QuestionA number is increased by 20% and then decreased by 10%. What is the net change?
View QuestionIf x = 2 and y = 3, what is the value of (x^2 + y^2)?
View QuestionThe LCM of 12 and 15 is:
View QuestionHow many ways can 4 people sit in a row?
View QuestionA sum of money triples itself in 12 years at simple interest. What is the rate of interest per annum?
View QuestionIf a cone has a base radius of 3 cm and height of 4 cm, what is its slant height?
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 QuestionIf 5x - 2 = 13, what is the value of x?
View QuestionWhat is the probability of drawing an ace from a standard deck of 52 cards?
View Question