Please use this identifier to cite or link to this item:
- The primes are infinite
- Pegg Jr, Ed
- The prime numbers, 2, 3, 5, 7, 11, …, are integers divisible only by themselves and one. Euclid's Elements IX:20 proves the primes are infinite. "Consider any finite set of primes. Multiply all of them together and add one. The resulting number is not divisible by any of the primes in the finite set we considered, because dividing by any of these would give a remainder of one". This Demonstration allows you to study Euclid's method with various sets of primes
- Componente Curricular::Ensino Fundamental::Séries Finais::Matemática
- Euclid's Elements
- Prime Numbers
- Representations of Numbers
- Educação Básica::Ensino Fundamental Final::Matemática::Aritmética
- Show that the primes are infinite
- This demonstration needs the "MathematicaPlayer.exe" to run. Found in http://objetoseducacionais2.mec.gov.br/handle/mec/4737
- Demonstration freeware using Mathematica Player
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.