# Divisor: Quiz

Question 1: Both of these functions are examples of ________.
Euler's totient functionDivisor functionNumber theoryPrime number

Question 2: The total number of positive divisors of n is a ________ d(n) (e.g.
Möbius inversion formulaArithmetic functionMultiplicative functionMöbius function

Question 3: The name comes from the ________ operation of division: if a / b = c then a is the dividend, b the divisor, and c the quotient.

Question 4: If a number equals the sum of its proper divisors, it is said to be a ________.
Semiperfect numberHarmonic divisor numberPrime numberPerfect number

Question 5: The generalization can be said to be the concept of divisibility in any ________.
Field (mathematics)Commutative ringIntegral domainPrime number

Question 6: An integer n > 1 whose only proper divisor is 1 is called a ________.
Deficient numberPrime numberPractical numberPerfect number

Question 7: 1 and −1 divide (are divisors of) every integer, every integer (and its negation) is a divisor of itself, and every integer is a divisor of 0, except by convention 0 itself (see also ________).
Division by zeroInfinity0 (number)Algebra

Question 8: The meet operation ^ is given by the ________ and the join operation v by the least common multiple.
Euclidean algorithmGreatest common divisorExtended Euclidean algorithmInteger

Question 9: ________ — A table of prime factors for 1-1000
Table of divisors3 (number)Table of prime factors11 (number)

Question 10: This lattice is isomorphic to the dual of the lattice of subgroups of the infinite ________ Z.
General linear groupGroup theoryGroup (mathematics)Cyclic group