Sieve of Eratosthenes: primes up to 50
Primes up to 50
The first 15 primes up to 47. There are 15 primes below 50.
| Primzahl | # | Primzahl | # | Primzahl | # |
|---|---|---|---|---|---|
| 2 | 1 | 19 | 8 | 37 | 12 |
| 3 | 2 | 23 | 9 | 41 | 13 |
| 5 | 3 | 29 | 10 | 43 | 14 |
| 7 | 4 | 31 | 11 | 47 | 15 |
| 11 | 5 | 37 | 12 | 53 | 16 |
| 13 | 6 | 41 | 13 | 59 | 17 |
| 17 | 7 | 43 | 14 | 61 | 18 |
Euclid's proof: infinitely many primes
Assume finitely many primes: p₁, p₂, …, pₙ
N = p₁·p₂·…·pₙ + 1 → N is divisible by none of p₁…pₙ
So N is prime or has a prime factor not in the list – contradiction. ∴ infinitely many primes. QED (Euclid, ~300 BC)
Digunakan dalam
Matematika
✓
Fisika
✓
Teknik
–
Biologi
–
Ilmu Komputer
✓
Statistika
–
Keuangan
–
Seni
–
Arsitektur
–
Musik
–
Kriptografi
✓
Astronomi
–
Kimia
–
Filsafat
–
Geografi
–
Ekologi
–
Ingin menguji pengetahuan Anda?
Pertanyaan
Apa itu Teorema Dasar Aritmetika?
ketuk · spasi
1 / 10
Siap bermain?
Pi
Memorize pi, e, and 40+ mathematical constants using the numpad path method
Main sekarang - gratisTanpa akun. Bisa di perangkat apa saja.
Topic roundups