ThatQuiz Test Library Take this test now
Computational number theory
Contributed by: Wyatt
  • 1. Computational number theory is a branch of mathematics that focuses on using computer algorithms and techniques to study and solve problems related to numbers. It involves the utilization of computational tools to analyze number theoretic concepts and phenomena, such as prime numbers, factorization, modular arithmetic, and cryptographic schemes. Through the use of computational methods, researchers and mathematicians can explore complex number theoretic questions, develop efficient algorithms for solving mathematical problems, and analyze the behavior of various number sequences and properties. Computational number theory plays a crucial role in modern cryptography, data encryption, and the security of digital communication systems, making it a fundamental area of study in both mathematics and computer science.

    Which algorithm is commonly used to find the greatest common divisor (GCD) of two integers?
A) Binary Search
B) Sieve of Eratosthenes
C) Fermat's Little Theorem
D) Euclidean algorithm
  • 2. What is the Chinese Remainder Theorem used for in computational number theory?
A) Converting decimals to fractions
B) Solving systems of simultaneous congruences
C) Calculating factorials
D) Finding prime numbers
  • 3. What is the smallest prime number?
A) 5
B) 2
C) 3
D) 1
  • 4. What does the function Euler's Totient function count?
A) Number of positive integers less than n that are coprime to n
B) Number of divisors of n
C) Count of even numbers less than n
D) Number of prime factors of n
  • 5. What is Wilson's Theorem?
A) Every number is a factorial of another number
B) p is a prime number if and only if (p-1)! ≡ -1 (mod p)
C) The product of any k consecutive numbers is divisible by k!
D) The sum of consecutive odd numbers is always even
  • 6. How many prime numbers are there between 1 and 20 (inclusive)?
A) 7
B) 9
C) 6
D) 8
  • 7. Which theorem states that every even integer greater than 2 can be expressed as the sum of two prime numbers?
A) P vs NP Problem
B) Fermat's Last Theorem
C) Goldbach's Conjecture
D) Pythagorean Theorem
  • 8. What is a Sophie Germain prime?
A) Prime p such that 2p + 1 is also prime
B) Prime number greater than 100
C) Prime with only 1 factor
D) Prime whose square root is prime
  • 9. What is the common use of the Miller-Rabin primality test?
A) Finding the GCD of two numbers
B) Checking primality of large numbers
C) Sorting numbers in descending order
D) Calculating the Fibonacci sequence
  • 10. What is the term for a number that has no positive divisors other than 1 and itself?
A) Odd number
B) Composite number
C) Even number
D) Prime number
  • 11. What is a Mersenne prime?
A) Prime with exactly 2 factors
B) Perfect square that is prime
C) Prime number greater than 1000
D) Prime number that is one less than a power of 2
  • 12. What is the divisor function σ(n) used to calculate?
A) Euler's Totient function value of n
B) Number of prime factors of n
C) Sum of all positive divisors of n
D) Number of perfect numbers less than n
  • 13. What does the value of the Legendre symbol (a/p) indicate, where p is an odd prime?
A) Value of the function f(a, p) = ap
B) Indicates whether a is a quadratic residue modulo p
C) Number of divisors of p+a
D) Number of solutions to the equation a2 = p (mod m)
  • 14. What is a Niven number?
A) Perfect number with prime factors
B) Even number less than 10
C) Prime number greater than 100
D) Integer that is divisible by the sum of its digits
  • 15. How is the Mobius function defined for a positive integer n?
A) μ(n) = 1 if n is a square-free positive integer with an even number of distinct prime factors, μ(n) = -1 if n is square-free with an odd number of prime factors, and μ(n) = 0 if n has a squared prime factor
B) μ(n) = 1 if n is even and 0 if n is odd
C) μ(n) = -1 if n is prime and 0 otherwise
D) μ(n) = n2 - n for any positive integer n
  • 16. Which concept in number theory involves finding integer solutions to linear equations in multiple variables?
A) Euler's theorem
B) Diophantine equations
C) Pell's equation
D) Perfect numbers
  • 17. What is the order of the group of integers modulo 7 under multiplication modulo 7?
A) 7
B) 6
C) 4
D) 5
  • 18. What is the value of φ(12), where φ is Euler's totient function?
A) 6
B) 10
C) 4
D) 8
  • 19. What is the order of 2 modulo 11?
A) 5
B) 10
C) 11
D) 9
Created with That Quiz — a math test site for students of all grade levels.