Transcript Document

Prime Numbers – True/False
There is a formula for the π‘›π‘‘β„Ž prime.
There is a formula for the number of primes below 𝑛.
There are infinitely many primes.
There are infinitely many twin primes.
All primes are one more or less than a multiple of 6.
Any even integer greater than 2 can be written as the
sum of two primes.
7. Every integer greater than 1 can be written uniquely
as the product of primes.
8. $100,000 was offered to factorise a 309 digit number.
1.
2.
3.
4.
5.
6.
Prime Numbers – True/False
1. There is a formula for the π‘›π‘‘β„Ž prime.
FALSE-ish
We know some about what it isn’t…
𝑛2 βˆ’ 𝑛 + 41 produces primes for 𝑛 = 0 to 𝑛 = 40
The rounded down part of 𝐴3𝑛 is prime for all 𝑛, but the
catch is that we don’t know what 𝐴 is (and currently can
only calculate it using primes, so it’s a bit of a circular
formula)
Prime Numbers – True/False
2. There is a formula for the number of primes below 𝑛.
True-ish
Mathematicians are working on it, and there are better
and better ways of finding new primes, but so far there is
no easy way to find the number of primes below 𝑛. We
do have a name for the formula: πœ‹(𝑛). And we know that
𝑛
𝑛
< πœ‹ 𝑛 < 1.25506
for 𝑛 > 10, so that’s a start…
ln 𝑛
ln 𝑛
Prime Numbers – True/False
3. There are infinitely many primes.
True
We can prove this by assuming there aren’t:
Multiply all the primes together, then add 1. This number
doesn’t divide by any of the primes, but all numbers
greater than 1 either are prime or divide by primes. So
this number either divides by primes not in our list, or is
itself a prime not in our list. Contradiction!
Prime Numbers – True/False
4. There are infinitely many twin primes.
Unknown
Twin primes are primes 2 apart. It is conjectured that this
is true (and even that there are an infinite number of
primes 4 apart, 6 apart, 8 apart, etc) but not yet proven.
Prime Numbers – True/False
5. All primes are one more or less than a multiple of 6.
Nearly True
All integers can be written as 6𝑛, 6𝑛 + 1, 6𝑛 + 2, 6𝑛 +
3, 6𝑛 + 4 or 6𝑛 + 5. Since 6𝑛, 6𝑛 + 2 and 6𝑛 + 4
numbers all divide by 2, and 6𝑛 + 3 divides by 3, all
primes apart from 2 and 3 must be of the form 6𝑛 + 1 or
6𝑛 + 5.
Prime Numbers – True/False
6. Any even integer greater than 2 can be written as the
sum of two primes.
Unknown
Known as Goldbach’s Conjecture, we suspect this to be
true (no counter-examples have been found), but it is still
unproven.
Prime Numbers – True/False
7. Every integer greater than 1 can be written uniquely as
the product of primes.
True
This fact is so important it has its own name:
The Fundamental Theorem of Arithmetic (FTA)
The proof follows from the basic properties of division,
and follows from the idea that a factor of π‘Žπ‘ is a factor of
either π‘Ž or 𝑏.
Prime Numbers – True/False
8. $100,000 was offered to factorise a 309 digit number.
True
RSA encryption is based on the difficulty of factorising
large numbers. Two large primes are multiplied together
to produce a β€˜Public Key’, meaning anyone can encrypt
data to send to you, but only you - the person who
generated the public key - can decrypt it. The only known
way to break the code is to factor the public key.