Topic 3 · Test
Unit 3 test: Number Theory
15 questions. Answer them all, then submit to see your score. Solutions unlock after you submit.
This mock contest covers the whole Number Theory unit: divisor formulas, modular arithmetic, linear Diophantine equations, the Euclidean algorithm, bases and digits, Legendre's formula, and floor functions.
How many positive divisors does have?
Enter a number. Fractions like 3/4 and sqrt(2) are OK.
What is the sum of the positive divisors of ?
What is the remainder when is divided by ?
What are the last two digits of ? (Enter them as a number.)
Enter a number. Fractions like 3/4 and sqrt(2) are OK.
How many ordered pairs of positive integers satisfy ?
Enter a number. Fractions like 3/4 and sqrt(2) are OK.
A game awards points or points per play. What is the largest total score that is impossible to reach?
What is ?
Enter a number. Fractions like 3/4 and sqrt(2) are OK.
As ranges over the positive integers, which of the following describes all possible values of ?
How many digits does have in base ten?
Write in base . (Enter the digits as a number.)
Enter a number. Fractions like 3/4 and sqrt(2) are OK.
How many zeros does end in when written in base ?
Enter a number. Fractions like 3/4 and sqrt(2) are OK.
For how many integers with is odd?
Find the positive real number such that . (Enter a fraction or decimal.)
Enter a number. Fractions like 3/4 and sqrt(2) are OK.
What is ?
What are the last three digits of ? (Enter them as a number.)
Enter a number. Fractions like 3/4 and sqrt(2) are OK.