ThatQuiz Test Library Take this test now
Euler's totient function - Quiz
Contributed by: Herbert
  • 1. What property of Euler's totient function allows phi(m)phi(n) = phi(mn) when gcd(m, n) = 1?
A) Additive
B) Constant
C) Linear
D) Multiplicative
  • 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) Euclid's theorem
D) Chinese remainder theorem
  • 3. For a prime p and integer k >= 1, what is the value of phi(pk)?
A) pk - pk-1
B) pk - 1
C) pk-1 - 1
D) pk - p
  • 4. Which formula for phi(pk) is expressed using the product pk-1(p-1)?
A) pk-1(p+1)
B) pk-1(p-1)
C) pk(p-1)
D) pk-2(p-1)
  • 5. What is the alternative product formula for phi(pk) involving 1 - 1/p?
A) pk-1(1 - 1/p)
B) pk(1 + 1/p)
C) pk(1 - 1/p)
D) pk-1(1 + 1/p)
  • 6. How many multiples of p are there in the set {1, 2, ..., pk}?
A) pk-2
B) pk
C) p
D) pk-1
  • 7. If gcd(m, n) = 1, what is phi(mn) equivalent to?
A) phi(m)phi(n)
B) phi(m) / phi(n)
C) phi(m) + phi(n)
D) phi(m+n)
  • 8. In the proof for prime power arguments, what are the possible values for gcd(pk, m)?
A) p, p2, ..., pk
B) 1, p, ..., pk-1
C) 1, p, p2, ..., pk
D) 1, 2, ..., k
  • 9. The set A is defined as integers coprime to m and less than what value?
A) mn
B) 1
C) p
D) m
  • 10. What is the condition on m for gcd(pk, m) to be greater than 1?
A) m is a multiple of p
B) m is coprime to p
C) m is prime
D) m is a divisor of p
  • 11. Which of the following is equivalent to Euler's product formula?
A) The product of all integers less than n
B) The square root of n
C) The formula involving prime factorization exponents
D) The sum of all prime numbers less than n
  • 12. In the prime factorization n = p1k1 * p2k2... * prkr, what are p1, p2, ..., pr?
A) Any set of positive integers
B) Distinct prime numbers
C) Even numbers only
D) Consecutive integers
  • 13. Which formula uses the expression p_ik_i-1(p_i - 1)?
A) The equivalent prime factorization formula
B) The formula for the sum of divisors
C) The product formula with fractions
D) The definition of prime numbers
  • 14. What is the subject of the provided text regarding formula computation?
A) Calculus integration
B) Euler's totient function
C) Probability theory
D) Prime factorization
  • 15. What are the integers k in the range 1 to n such that gcd(n, k) = 1 called?
A) Units
B) Totatives
C) Multiples
D) Primes
  • 16. What is the value of φ(9)?
A) 9
B) 3
C) 1
D) 6
  • 17. In which cryptographic system is Euler's totient function used?
A) DES encryption system
B) AES encryption system
C) Diffie-Hellman key exchange
D) RSA encryption system
  • 18. For n=9, which numbers are NOT totatives?
A) 1, 2, 4
B) 1, 3, 9
C) 3, 6, 9
D) 5, 7, 8
  • 19. In what year did Leonhard Euler first introduce the totient function?
A) 1763
B) 1784
C) 1801
D) 1879
  • 20. Which Greek letter did Euler use to denote the function in his 1784 publication?
A) sigma
B) tau
C) pi
D) phi
  • 21. Who introduced the now-standard notation φ(A)?
A) Gauss
B) Jordan
C) Sylvester
D) Euler
  • 22. In which work did Gauss introduce the notation for the phi function?
A) Principia Mathematica
B) The Elements
C) Disquisitiones Arithmeticae
D) Arithmetica
  • 23. Who coined the term 'totient' in 1879?
A) Camille Jordan
B) J. J. Sylvester
C) Carl Friedrich Gauss
D) Leonhard Euler
  • 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 is undefined
B) It equals 1
C) It equals 0
D) It corresponds to the empty product
  • 26. Which principle is suggested as an alternative proof for Euler's product formula?
A) Inclusion-exclusion principle
B) Mathematical induction
C) Proof by contradiction
D) Binomial theorem
Created with That Quiz — where test making and test taking are made easy for math and other subject areas.