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 x - y = 5 and x + y = 15, what is the value of x?
View QuestionThe perimeter of a rectangle is 50 cm, and its length is 15 cm. What is its width?
View QuestionA sum triples in 20 years at simple interest. What is the rate of interest per annum?
View QuestionIf the ratio of two numbers is 3:5 and their HCF is 4, what are the numbers?
View QuestionThe angles of a quadrilateral are in the ratio 3:4:5:6. What is the largest angle?
View QuestionIf the cost price of an item is Rs. 400 and the selling price is Rs. 500, what is the profit percentage?
View QuestionA cube has a side length of 4 cm. What is its volume?
View QuestionIf the sides of a triangle are 6 cm, 8 cm, and 10 cm, what is the area of the triangle?
View QuestionIf 2x = 16, what is the value of x?
View QuestionIf a:b = 3:4 and b:c = 5:6, what is a:c?
View Question