|
|
COMMENTS
| This is a "Proof of existence of infinite primes" sequence. Proof. Let N = (Product_{0<=e_i<=1} (Product_{1<=i<=n} p_i^e_i + Product_{1<=i<=n} p_i^(1-e_i)))^(1/2) * (Sum_{1<=i<=n} (1/p_i*Product_{1<=k<=n} p_k) ) . Suppose there are only a finite number of primes p_i, 1<=i<=n. If N is prime, then for all i, not (N=p_i). Because, for all i, p_i<N. If N is composite, then it must have a prime divisor p which is different from primes p_i. Because, for all i, not (N=0, Mod p_i).
|
