|
|
|
|
|
|
by blevinstein
3504 days ago
|
|
|
This proof is nearly equivalent to that proof, but uses the sine function to generate a contradiction. The crucial step involves the fact that: 1 + 2 * product(p', p') must be divisible by some prime number, where product(p', p') is the product of all primes you were talking about. |
|
|