Subject: Mathematics
Book: Maths Mastery
Euler’s Totient Function φ(n) counts how many integers ≤n are coprime to n. For prime p, φ(p)=p–1. For example, φ(8)=4 because only {1,3,5,7} are coprime with 8. This function is core in number theory and cryptography (Euler’s theorem, RSA encryption). Euler’s theorem states a^φ(n)≡1 (mod n) if gcd(a,n)=1. Understanding φ fosters advanced integer analysis, letting you compute exponents mod n or analyze prime-based structures. Mastery in totient calculations links to deeper insights in modern computer security and theoretical math.
A man invests Rs. 5000 at 5% per annum simple interest. What is the total amount after 3 years?
View QuestionWhat is the cube root of 729?
View QuestionWhat is the LCM of 15 and 20?
View QuestionWhat is the slope of a line passing through the points (2, 3) and (4, 7)?
View QuestionWhat is the area of a sector of a circle with radius 14 cm and central angle 90°?
View QuestionIf a + b = 10 and ab = 21, what is the value of a^2 + b^2?
View QuestionA number is increased by 20% and then decreased by 20%. What is the net change?
View QuestionIf 5x - 2 = 13, what is the value of x?
View QuestionIf the perimeter of a square is 36 cm, what is the length of its diagonal?
View QuestionThe probability of rolling a sum of 7 with two dice is:
View Question