Number Theory Trivia Questions
- β 134+ questions
- ποΈ Mathematics
- ποΈ Easy to expert
- β¨ Free to play
Study of integers and their properties. Play Number Theory trivia solo to sharpen your knowledge, or challenge a friend head-to-head in Trivia Tango β every question comes with an explanation so you learn as you play. Questions span every level, from easy warm-ups to expert-level stumpers, so there's a real challenge here however much you already know.
Already playing?
Sample Number Theory Quiz Questions
A mix of easy, medium and hard β questions run from warm-up to expert, so there's a real challenge at every level. Think you know the answers? Play to find out.
Any whole number that can be divided by 2 with no remainder belongs to this category of integers.
Difficulty: Easy- Even numbers
- Odd numbers
- Prime numbers
- Composite numbers
In modular arithmetic, 17 mod 5 equals 2 because 17 leaves a remainder of 2 when divided by 5. Similarly, 23 mod 7 equals this.
Difficulty: Medium- 3
- 2
- 4
- 1
Vinogradov's theorem (1937) proves every sufficiently large odd integer is the sum of three numbers with exactly two divisors, establishing the "ternary" version of ______.
Difficulty: Hard- Fermat's Last Theorem
- Goldbach's conjecture
- The Twin Prime conjecture
- Waring's problem
The number 1 has exactly this many positive divisors, making it unique among natural numbers.
Difficulty: Easy- One
- Two
- Three
- Zero
Goldbach's conjecture, unproven since 1742, states that every integer greater than 2 that's divisible by 2 can be written as the sum of two numbers with exactly two divisors.
Difficulty: Medium- Odd numbers
- Composite numbers
- Perfect squares
- Primes
The AKS algorithm (2002) proved that testing whether n has exactly two divisors can be done in ______ time, earning a GΓΆdel Prize.
Difficulty: Hard- Exponential
- Quasi-polynomial
- Polynomial
- Constant
When you multiply any integer by the additive identity, the result is always this same value, regardless of how large the original number was.
Difficulty: Easy- One
- Zero
- Infinity
- Undefined
The function Ο(n) counts how many integers from 1 to n share no common factors with n. For n=10, Ο(10) equals this value.
Difficulty: Medium- 3
- 5
- 4
- 6
Think You Know Number Theory?
Play a free round in your browser, learn something new with every answer, and challenge your friends to beat your score.
Or get the app