According to Goldbach's Conjecture, every integer greater than 2 can be expressed as the sum of two of these numbers.
According to Goldbach's Conjecture, every integer greater than 2 can be expressed as the sum of two of these numbers. These numbers, which are used in finite field theory and public key cryptography, can be found using the Sieve of Eratosthenes. They are the subject of the Fundamental Theorem of Arithmetic, which states that every positive integer has a unique factorization into these numbers. For 10 points, name these numbers which are only divisible by one and themselves, often contrasted with composite numbers.
According to Goldbach's Conjecture, every integer greater than 2 can be expressed as the sum of two of these numbers.
{prime} numbers