# Prime number: Quiz

### Did you know ...

More interesting facts on Prime number

Question 1: Many mathematicians have worked on ________ for large numbers, often restricted to specific number forms.
Integer factorizationPrimality testAKS primality testEuclidean algorithm

Question 2: Wilson's theorem says that an integer p > 1 is prime if and only if the ________ (p − 1)!
ExponentiationGamma functionFactorialPrime number

Question 3: The French monk ________ looked at primes of the form 2p − 1, with p a prime.
Marin MersenneGalileo GalileiGiovanni Pico della MirandolaPierre Gassendi

Question 4: The ________ mathematics department owns the computer on which the discovery was made and received half of the prize money, with the remainder going to charity and future research.
University of Southern CaliforniaUniversity of California, BerkeleyUniversity of California, Los AngelesCalifornia Institute of Technology

Question 5: Euclid also showed how to construct a perfect number from a ________.
Prime numberMersenne primeFermat numberDouble Mersenne number

Question 6: The occurrence of individual prime numbers among the ________ is (so far) unpredictable, even though there are laws (such as the prime number theorem and Bertrand's postulate) that govern their average distribution.
Natural numberIntegerReal numberCardinal number

Question 7: For example, in knot theory, a prime knot is a knot which is indecomposable in the sense that it cannot be written as the ________ of two nontrivial knots.
SurfaceManifoldFiber bundleConnected sum

Question 8: Primes are applied in several routines in information technology, such as ________, which makes use of the difficulty of factoring large numbers into their prime factors.
Public-key cryptographyPublic key infrastructureRSADiffie–Hellman key exchange

Question 9: Arithmetic questions related to, global fields such as Q may, in certain cases, be transferred back and forth to the completed fields (known as ________), a concept known as local-global principle.
Field (mathematics)Group (mathematics)Local fieldPrime number

Question 10: For example Fermat's little theorem, stating that ap − a is divisible by p for any ________ a, may be proved using these notions.
IntegerNatural numberField (mathematics)Rational number