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 area of an equilateral triangle with side length 10 cm?
View QuestionIf a:b = 2:3 and b:c = 4:5, what is a:c?
View QuestionA rectangle has a length of 10 cm and a width of 5 cm. What is the diagonal of the rectangle?
View QuestionIf two complementary angles differ by 30°, what are the angles?
View QuestionWhat is the sum of all even numbers between 1 and 50?
View QuestionWhat is the value of x if 3x + 7 = 16?
View QuestionThe sides of a triangle are 13 cm, 14 cm, and 15 cm. What is its area?
View QuestionIf sin(θ) = 3/5 and θ is an acute angle, what is tan(θ)?
View QuestionThe ratio of two numbers is 3:5, and their sum is 64. What are the numbers?
View QuestionThe sides of a triangle are 5 cm, 12 cm, and 13 cm. What type of triangle is it?
View Question