Author: Ingo Lindam
Date: 04:20:26 12/11/02
Go up one level in this thread
On December 10, 2002 at 18:24:40, Dann Corbit wrote: >On December 10, 2002 at 18:05:15, Ingo Lindam wrote: > >>so I guess the answer/solution/proof on the question: How many prime numbers >>exist? > >The number of primes is uncountable. Euclid proved it quite a while ago. I know that (the number of prime numbers is infinite). ;-) It's just another thing you can prove without counting every single example... >>is also 'provably not solvable' on current and all future hardware... >>because storage will ever be provable to small to store all existing prime >>numbers... > >We don't need to store them to count them. > >>people, I guess it's time now to invent mathematics! ;-) > >Apparently.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.