Subject: Mathematics
Book: Maths Mastery
Fermat’s Little Theorem says that if p is prime and gcd(a,p)=1, then a^(p–1)≡1 (mod p). Euler’s theorem generalizes it, stating a^φ(n)≡1 (mod n) for gcd(a,n)=1. These reduce exponents in modular arithmetic. For example, to find 3^100 mod 11, note φ(11)=10, so 3^100 = (3^10)^(10) ≡1^(10)≡1 mod 11. Such exponentiation shortcuts appear in coding, cryptography (like RSA), or advanced number theory tasks. Familiarity with these theorems speeds up computations involving large powers mod n.
A number is increased by 20% and then decreased by 10%. What is the net change?
View QuestionIf the perimeter of a square is 40 cm, what is the area of the square?
View QuestionWhat is the probability of drawing a king from a standard deck of 52 playing cards?
View QuestionThe sides of a triangle are 13 cm, 14 cm, and 15 cm. What is its area?
View QuestionIf the sum of the squares of two consecutive positive integers is 365, what are the integers?
View QuestionIf the product of two numbers is 120 and their sum is 26, what are the numbers?
View QuestionWhat is the sum of all odd numbers from 1 to 99?
View QuestionIf sin(A) = 1/2 and A is acute, what is the value of A?
View QuestionIf x^2 - 5x + 6 = 0, what are the roots?
View QuestionIf a cylinder has a radius of 7 cm and height of 10 cm, what is its volume?
View Question