|
|
|
|
|
by tjgq
4277 days ago
|
|
> 2. If it's not prime, it has divisors. This proof claims it must include divisors that are prime but are not among those we started with. <-- THIS IS THE BIT I DON'T GET This step of the proof invokes the Fundamental Theorem of Arithmetic [0]: the statement that every natural number can be expressed as a unique product of primes (uniqueness isn't the important bit here, just the fact that such a factorization exists). So you need to accept the Fundamental Theorem of Arithmetic as true before you can fully understand this proof. [0] http://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmet... |
|
In order to be able to understand and appreciate mathematical proofs, you have to develop the ability to accept the truthness of a result - and to realize the consequences of it being true - even though you do not yet understand why it is true. You have to learn to accept the ensuing confusion as a natural state of mind (read [0] if this idea intrigues you).
[0] http://j2kun.svbtle.com/mathematicians-are-chronically-lost-...