Euler's totient function

Euler's totient function - Quiz

1. What property of Euler's totient function allows phi(m)phi(n) = phi(mn) when gcd(m, n) = 1?

A) Multiplicative
B) Linear
C) Additive
D) Constant

2. Which theorem is used to establish the bijection between A x B and C in the proof of multiplicativity?

A) Fundamental theorem of arithmetic
B) Fermat's little theorem
C) Chinese remainder theorem
D) Euclid's theorem

3. For a prime p and integer k >= 1, what is the value of phi(p^k)?

A) p^k - p
B) p^k - p^k-1
C) p^k - 1
D) p^k-1 - 1

4. Which formula for phi(p^k) is expressed using the product p^k-1(p-1)?

A) p^k-1(p+1)
B) p^k-1(p-1)
C) p^k-2(p-1)
D) p^k(p-1)

5. What is the alternative product formula for phi(p^k) involving 1 - 1/p?

A) p^k-1(1 - 1/p)
B) p^k(1 + 1/p)
C) p^k-1(1 + 1/p)
D) p^k(1 - 1/p)

6. How many multiples of p are there in the set {1, 2, ..., p^k}?

A) p
B) p^k
C) p^k-2
D) p^k-1

7. If gcd(m, n) = 1, what is phi(mn) equivalent to?

A) phi(m) + phi(n)
B) phi(m+n)
C) phi(m)phi(n)
D) phi(m) / phi(n)

8. In the proof for prime power arguments, what are the possible values for gcd(p^k, m)?

A) 1, p, p², ..., p^k
B) 1, p, ..., p^k-1
C) p, p², ..., p^k
D) 1, 2, ..., k

9. The set A is defined as integers coprime to m and less than what value?

A) m
B) mn
C) 1
D) p

10. What is the condition on m for gcd(p^k, m) to be greater than 1?

A) m is a multiple of p
B) m is prime
C) m is a divisor of p
D) m is coprime to p

11. Which of the following is equivalent to Euler's product formula?

A) The formula involving prime factorization exponents
B) The product of all integers less than n
C) The square root of n
D) The sum of all prime numbers less than n

12. In the prime factorization n = p1^k1 * p2^k2... * pr^kr, what are p1, p2, ..., pr?

A) Even numbers only
B) Any set of positive integers
C) Distinct prime numbers
D) Consecutive integers

13. Which formula uses the expression p_i^k_i-1(p_i - 1)?

A) The product formula with fractions
B) The equivalent prime factorization formula
C) The formula for the sum of divisors
D) The definition of prime numbers

14. What is the subject of the provided text regarding formula computation?

A) Prime factorization
B) Calculus integration
C) Euler's totient function
D) Probability theory

15. What are the integers k in the range 1 to n such that gcd(n, k) = 1 called?

A) Primes
B) Units
C) Multiples
D) Totatives

16. What is the value of φ(9)?

A) 6
B) 1
C) 9
D) 3

17. In which cryptographic system is Euler's totient function used?

A) Diffie-Hellman key exchange
B) RSA encryption system
C) AES encryption system
D) DES encryption system

18. For n=9, which numbers are NOT totatives?

A) 1, 3, 9
B) 3, 6, 9
C) 1, 2, 4
D) 5, 7, 8

19. In what year did Leonhard Euler first introduce the totient function?

A) 1763
B) 1879
C) 1784
D) 1801

20. Which Greek letter did Euler use to denote the function in his 1784 publication?

A) pi
B) sigma
C) tau
D) phi

21. Who introduced the now-standard notation φ(A)?

A) Jordan
B) Euler
C) Gauss
D) Sylvester

22. In which work did Gauss introduce the notation for the phi function?

A) The Elements
B) Principia Mathematica
C) Arithmetica
D) Disquisitiones Arithmeticae

23. Who coined the term 'totient' in 1879?

A) Leonhard Euler
B) Camille Jordan
C) J. J. Sylvester
D) Carl Friedrich Gauss

24. How did Gauss write the function notation in his 1801 treatise?

A) π(A)
B) πA
C) φ(A)
D) φA

25. What happens in Euler's product formula when n = 1?

A) It equals 0
B) It is undefined
C) It corresponds to the empty product
D) It equals 1

26. Which principle is suggested as an alternative proof for Euler's product formula?

A) Proof by contradiction
B) Inclusion-exclusion principle
C) Mathematical induction
D) Binomial theorem

Created with That Quiz — where test making and test taking are made easy for math and other subject areas.