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.
The angles of a quadrilateral are in the ratio 3:4:5:6. What is the largest angle?
View QuestionIf the sum of the angles of a polygon is 1080°, how many sides does the polygon have?
View QuestionWhat is the sum of all even numbers between 1 and 50?
View QuestionA sum of money triples itself in 12 years at simple interest. What is the rate of interest per annum?
View QuestionA sum triples in 20 years at simple interest. What is the rate of interest per annum?
View QuestionIf 8x = 512, what is the value of x?
View QuestionA car covers a distance of 150 km in 2.5 hours. What is its average speed?
View QuestionIf x + 1/x = 5, what is the value of x^2 + 1/x^2?
View QuestionThe base of a triangle is 10 cm and its height is 6 cm. What is its area?
View QuestionIf the perimeter of a square is 40 cm, what is the area of the square?
View Question