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 x² - 9x + 18 = 0, what are the roots of the equation?
View QuestionThe simple interest on Rs. 4000 at 5% per annum for 2 years is:
View QuestionIf 2x = 16, what is the value of x?
View QuestionWhat is the sum of all even numbers between 1 and 100?
View QuestionHow many ways can 4 people sit in a row?
View QuestionA car covers a distance of 150 km in 2.5 hours. What is its average speed?
View QuestionWhat is the probability of drawing a king from a standard deck of 52 playing cards?
View QuestionA sphere has a radius of 7 cm. What is its volume?
View QuestionA sum of money triples itself in 12 years at simple interest. What is the rate of interest per annum?
View QuestionIf x^3 - 3x^2 + 4 = 0, what is one root of the equation?
View Question