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.
If a right triangle has legs of 9 cm and 12 cm, what is the length of the hypotenuse?
View QuestionIf x^2 - 5x + 6 = 0, what are the roots?
View QuestionIf a number is divisible by 9, it is also divisible by which of the following?
View QuestionThe probability of rolling a sum of 7 with two dice is:
View QuestionIf a + b = 10 and ab = 21, what is the value of a^2 + b^2?
View QuestionWhat is the HCF of 48 and 180?
View QuestionWhat is the cube of 4?
View QuestionIf sin(A) = 1/2 and A is acute, what is the value of A?
View QuestionIf a cone has a radius of 5 cm and a height of 12 cm, what is its slant height?
View QuestionThe sum of the squares of two consecutive integers is 145. What are the integers?
View Question