18 JUN 2013 by ideonexus

## Proof That the Set of Prime Numbers is Infinite

Theorem: There are infinitely many prime numbers. Proof: Suppose, contrary to the theorem, that there is only a finite number of primes. Thus, there will be a largest which we can call p. Now define a number n as 1 plus the product of all the primes: n = (2 X 3 X 5 X 7 X 11 X...X p) 1 Is n itself prime or composite? If it is prime then our original supposition is false, since n is larger than the supposed largest prime p. So now letâ€™s consider it composite. This means that it must be div...There is always one larger.

19 MAY 2011 by ideonexus

## Conjecture versus Theorem

Mathematicians use the idea of proof to make a distinction between a 'conjecture' and a 'theorem', which bears a superficial resemblance to the OED's distinction between the two senses of 'theory'. A conjecture is a proposition that looks true but has never been proved. It will become a theorem when it has been proved. A famous example is the Goldbach Conjecture, which states that any even integer can be expressed as the sum of two primes. Mathematicians have failed to disprove it for all eve...in mathematics and how it applies to scientific "theory".