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.
If the radius of a circle is doubled, what happens to its area?
View QuestionIf the sides of a triangle are 6 cm, 8 cm, and 10 cm, what is the area of the triangle?
View QuestionWhat is the LCM of 15 and 20?
View QuestionIf sin(A) = 1/2 and A is acute, what is the value of A?
View QuestionThe perimeter of a rectangle is 50 cm, and its length is 15 cm. What is its width?
View QuestionIf a rectangle has a length of 10 cm and a width of 6 cm, what is its perimeter?
View QuestionHow many diagonals does a pentagon have?
View QuestionIf 5x - 2 = 13, what is the value of x?
View QuestionIf x:y = 4:5 and y:z = 2:3, what is x:z?
View QuestionIf the sum of three consecutive integers is 96, what are the integers?
View Question