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.
If a right triangle has legs of 9 cm and 12 cm, what is the length of the hypotenuse?
View QuestionIf the perimeter of a square is 36 cm, what is the length of its diagonal?
View QuestionThe probability of getting an even number when rolling a die is:
View QuestionThe sides of a triangle are 13 cm, 14 cm, and 15 cm. What is its area?
View QuestionIf two complementary angles differ by 30°, what are the angles?
View QuestionThe LCM of two numbers is 60, and their HCF is 5. If one of the numbers is 20, what is the other number?
View QuestionThe sum of the reciprocals of two numbers is 1/4. If one number is 12, what is the other?
View QuestionA cone has a base radius of 7 cm and height of 24 cm. What is its volume?
View QuestionIf the length of a rectangle is doubled and the width is halved, what is the change in area?
View QuestionThe perimeter of a rectangle is 40 cm, and its length is 12 cm. What is its width?
View Question