Number theory - Quiz
Number theory
  • 1. Number theory is a branch of mathematics that deals with the properties and relationships of numbers. It involves the study of integers, prime numbers, divisibility, equations, and various number systems. Number theory is essential in many areas of mathematics, including cryptography, computer science, and physics. It explores patterns in numbers and seeks to understand the fundamental nature of arithmetic operations. Overall, number theory plays a crucial role in solving mathematical problems and has practical applications in various fields.

    Which of the following is not a prime number?
A) 23
B) 17
C) 9
D) 31
  • 2. What is the sum of the first 5 prime numbers?
A) 35
B) 28
C) 18
D) 20
  • 3. What is the largest prime number less than 50?
A) 47
B) 53
C) 37
D) 43
  • 4. What is the smallest prime number?
A) 1
B) 5
C) 2
D) 3
  • 5. What is the result when an odd number is squared?
A) Always a multiple of 3.
B) Always an even number.
C) Always an odd number.
D) Can be either odd or even.
  • 6. What is the prime factorization of 36?
A) 6 * 6
B) 22 * 32
C) 4 * 9
D) 2 * 3 * 4
  • 7. What is the sum of the first 10 odd numbers?
A) 100
B) 120
C) 80
D) 110
  • 8. What is the least common multiple (LCM) of 12 and 18?
A) 24
B) 42
C) 36
D) 30
  • 9. What is the next prime number after 89?
A) 97
B) 91
C) 101
D) 93
  • 10. What is the product of the first 3 prime numbers?
A) 48
B) 30
C) 36
D) 42
  • 11. What is the sum of the squares of the first 3 natural numbers?
A) 18
B) 16
C) 12
D) 14
  • 12. What is the GCD of 18 and 24?
A) 6
B) 3
C) 8
D) 4
  • 13. What is the LCM of 12 and 15?
A) 30
B) 24
C) 45
D) 60
  • 14. What is the sum of the first 10 positive integers?
A) 50
B) 55
C) 60
D) 45
  • 15. How many divisors does the number 24 have?
A) 6
B) 8
C) 10
D) 12
  • 16. What is the next prime number after 19?
A) 23
B) 25
C) 29
D) 27
  • 17. What is the product of the first 5 prime numbers?
A) 2310
B) 210
C) 360
D) 120
  • 18. What is the sum of the first 10 even numbers?
A) 90
B) 120
C) 110
D) 100
  • 19. What is the smallest composite number?
A) 4
B) 6
C) 8
D) 5
  • 20. Which of the following is a highly composite number?
A) 18
B) 20
C) 12
D) 15
  • 21. Which algorithm computes the greatest common divisor of two integers?
A) The Euclidean algorithm
B) The Sieve of Eratosthenes
C) Euler's totient function
D) Fermat's little theorem
  • 22. Which civilization's mathematics included the Da-yan-shu method?
A) Egyptian
B) Greek
C) Chinese
D) Babylonian
  • 23. Which of the following is a primary subject of study in elementary number theory?
A) Divisibility
B) Algebraic geometry
C) Calculus
D) Topology
  • 24. Which extensions are relatively well understood in number theory?
A) Quadratic extensions
B) Non-abelian extensions
C) Cyclic extensions
D) Abelian extensions
  • 25. What is the name of the theorem that states every integer can be expressed as a sum of four squares?
A) Quadratic reciprocity law
B) Pythagorean theorem
C) Chinese remainder theorem
D) Four-square theorem
  • 26. What is a key question in combinatorics within number theory?
A) How to solve quadratic equations using integers.
B) The maximum value of a polynomial with integer coefficients.
C) Whether a thick infinite set contains many elements in arithmetic progression.
D) The distribution of composite numbers.
  • 27. An integer 'a' is divisible by a nonzero integer 'b' if there exists an integer 'q' such that:
A) ab = q
B) a = bq
C) a + b = q
D) a - b = q
  • 28. In modular arithmetic, what does it mean for two integers 'a' and 'b' to be congruent modulo 'n'?
A) 'n' divides (a - b).
B) a * b = n.
C) a - b is a prime number.
D) a + b = n.
  • 29. Who remarked, 'Mathematics is the queen of the sciences—and number theory is the queen of mathematics.'?
A) Leonhard Euler
B) Carl Friedrich Gauss
C) Joseph-Louis Lagrange
D) Pierre de Fermat
  • 30. Which conjecture remains unsolved since the 18th century?
A) Riemann Hypothesis
B) Fermat's Last Theorem
C) Pell's equation
D) Goldbach's conjecture
  • 31. Which function approximates π(x) in the distribution of primes?
A) x/log(x)
B) log(x)2
C) ex
D) sqrt(x)
  • 32. Which method is better covered by the second definition of analytic number theory?
A) Modular forms
B) Sieve theory
C) L-functions
D) Circle method
  • 33. What is the name of the method close to the Euclidean algorithm used by Āryabhaṭa?
A) Pell's equation
B) Diophantine analysis
C) Kuṭṭaka
D) Algebraic geometry
  • 34. Which mathematical concept did Euler use in his work on number theory?
A) Analytic geometry
B) Quadratic forms
C) Reciprocity laws
D) Formal power series
  • 35. Which theorem did Carl Friedrich Gauss prove in 'Disquisitiones Arithmeticae'?
A) Four-square theorem
B) Prime number theorem
C) Wilson's theorem
D) Law of quadratic reciprocity
  • 36. Which ancient civilization's tablet contains a list of Pythagorean triples?
A) Chinese
B) Babylonian
C) Egyptian
D) Greek
  • 37. What is the name of the theorem that states a number is prime if it divides (p-1)! + 1?
A) Fermat's little theorem
B) Chinese remainder theorem
C) Wilson's theorem
D) Quadratic reciprocity law
  • 38. Which mathematician is known for the work on continued fractions and Pell's equation?
A) Leonhard Euler
B) Joseph-Louis Lagrange
C) Adrien-Marie Legendre
D) Carl Friedrich Gauss
  • 39. Which mathematician introduced ideal numbers to address the lack of unique factorization?
A) Kröncker
B) Gauss
C) Kummer
D) Eisenstein
  • 40. Which mathematical concept did Diophantus work on in his 'Arithmetica'?
A) Quadratic forms
B) Reciprocity laws
C) Analytic geometry
D) Diophantine equations
  • 41. Which theorem did Pierre de Fermat conjecture that involves modular arithmetic?
A) Fermat's little theorem
B) Chinese remainder theorem
C) Four-square theorem
D) Quadratic reciprocity law
  • 42. What is the subject of study in Diophantine geometry?
A) Prime numbers
B) Rational numbers
C) Algebraic integers
D) Integers as solutions to equations
  • 43. Which algorithm is based on the difficulty of factoring large composite numbers?
A) Sieve of Eratosthenes
B) Fast Fourier Transform
C) RSA
D) Euclidean Algorithm
  • 44. Which program attempts to generalize class field theory to non-abelian extensions?
A) The Langlands program
B) Ideal number theory
C) Class field theory itself
D) Iwasawa theory
  • 45. Which type of numbers are solutions to polynomial equations with rational coefficients?
A) Transcendental numbers
B) Irrational numbers
C) Complex numbers
D) Algebraic numbers
  • 46. What does it mean if two integers are coprime?
A) Their greatest common divisor is 1.
B) They have no common factors other than themselves.
C) One of them is a prime number.
D) Both numbers are even.
  • 47. Which theorem did Bernhard Riemann work on that is a canonical starting point for analytic number theory?
A) Four-square theorem
B) Chinese remainder theorem
C) Quadratic reciprocity law
D) Riemann zeta function
  • 48. Which theorem is associated with the infinitude of primes?
A) Wilson's theorem
B) Euclid's proof of the infinitude of primes
C) Chinese remainder theorem
D) Fermat's little theorem
  • 49. Who proved Fermat's Last Theorem for n=5?
A) Carl Friedrich Gauss
B) Joseph-Louis Lagrange
C) Adrien-Marie Legendre
D) Leonhard Euler
  • 50. Which mathematician's work spurred Leonhard Euler's interest in number theory?
A) Christian Goldbach
B) Pierre de Fermat
C) Carl Friedrich Gauss
D) Joseph-Louis Lagrange
  • 51. What are the two main questions regarding number theory computations?
A) "Is this problem unsolvable?" and "How many solutions exist?"
B) "Are there infinite solutions?" and "What is the complexity class?"
C) "Can this be computed?" and "Can it be computed rapidly?"
D) "Does this have a unique solution?" and "Can it be visualized?"
  • 52. Which branch of mathematics studies limits as arguments approach specific values?
A) Analysis
B) Geometry
C) Topology
D) Algebra
Created with That Quiz — where a math practice test is always one click away.