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.
What is the HCF of 72 and 120?
View QuestionWhat is the value of x if log(x) + log(4) = log(32)?
View QuestionIf x^2 - 6x + 9 = 0, what is the value of x?
View QuestionThe area of an equilateral triangle with side length 6 cm is:
View QuestionIf a = 4 and b = 5, what is the value of (a+b)^2?
View QuestionIf sin(θ) = 3/5 and θ is an acute angle, what is tan(θ)?
View QuestionA car travels 240 km in 4 hours. What is its average speed?
View QuestionThe ratio of two numbers is 3:5, and their sum is 64. What are the numbers?
View QuestionA sum triples in 20 years at simple interest. What is the rate of interest per annum?
View QuestionWhat is the 7th term of the arithmetic progression 3, 6, 9, 12,...?
View Question