You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/unesp/360655
Title: 
The primes are infinite
Author(s): 
Pegg Jr, Ed
Language: 
eng
Description: 
  • 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
  • none
  • Componente Curricular::Ensino Fundamental::Séries Finais::Matemática
Issue Date: 
  • 2008
  • 11-Sep-2008
  • 11-Sep-2008
  • 11-Sep-2008
  • 9-Sep-2008
Keywords: 
  • Euclid's Elements
  • Prime Numbers
  • Representations of Numbers
  • Educação Básica::Ensino Fundamental Final::Matemática::Aritmética
Notes: 
Show that the primes are infinite
Credits: 
This demonstration needs the "MathematicaPlayer.exe" to run. Found in http://objetoseducacionais2.mec.gov.br/handle/mec/4737
Source: 
http://objetoseducacionais2.mec.gov.br/handle/mec/5269
URI: 
http://acervodigital.unesp.br/handle/unesp/360655
Rights: 
Demonstration freeware using Mathematica Player
Type: 
outro
Appears in Collections:MEC - Objetos Educacionais (BIOE) - OE

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.