sysprog
- 2,617
- 1,796
We know that the uncountably infinite is of greater magnitude than the countably infinite, and we know that there are fewer algebraic irrationals than transcendentals, but we have not found a simple way to prove an arbitrary designatable real or imaginary number to be transcendental.Klystron said:I am fascinated by sequences of prime numbers among integers, twin prime occurrence, intervals between Mersenne primes and related numbers. I sense or intuit a relation to π and the above series utilizing prime numbers to approximate π from studying related numeric series that converge on trigonometric identities.
Pi is ratio of circle's circumference to diameter. Trigonometric functions defined on unit circle contain π. I intuit or perhaps remember an old text that describes a relation to prime number sequences yet cannot put my finger on it. Perhaps numeric sequences approximating transcendental functions and those approximating transcendental numbers such as π resemble each other such that I am conflating series. This connection has bothered me since this thread began. Thanks.
Regarding the special case of the transcendental number ##\pi##, Euler showed that ##\frac π 4 = \frac 3 4 \cdot \frac 5 4 \cdot \frac 7 8 \cdot \frac {11} {12} \cdot \frac {13} {12} \cdots## with the numerators being the odd primes (and the denominators being the nearest thereto multiples of 4) ##\dots##
Using e.g. the Sieve of Eratosthenes to find the odd primes to obtain that series to produce digits of ##\pi## is not as fast as using the more rapidly converging Gauss-Legendre Algorithm, but that algorithm is a core-hog (i.e. requires much memory) ##-## as you know, CPU time vs memory is a frequently-occurring trade-off.
Last edited: