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 perimeter of a square is 36 cm, what is the length of its diagonal?
View QuestionIf a cylinder has a radius of 7 cm and height of 10 cm, what is its volume?
View QuestionIf x^3 - 3x^2 + 4 = 0, what is one root of the equation?
View QuestionIf sin(A) = 1/2 and A is acute, what is the value of A?
View QuestionThe sides of a triangle are 5 cm, 12 cm, and 13 cm. What type of triangle is it?
View QuestionIf x - y = 5 and x + y = 15, what is the value of x?
View QuestionWhat is the HCF of 72 and 120?
View QuestionIf the sides of a triangle are 6 cm, 8 cm, and 10 cm, what is the area of the triangle?
View QuestionA sum of money triples itself in 12 years at simple interest. What is the rate of interest per annum?
View QuestionIf a rectangle has a length of 10 cm and a width of 6 cm, what is its perimeter?
View Question