3 ms·
The way this is constructed is interesting, but it doesn't appear that a real sequence to generate primes is required, just a list of them: D=0 SUM=0 for n:
by pontifier 13y ago
The way this is constructed is interesting, but it doesn't appear that a real sequence to generate primes is required, just a list of them:
D=0
SUM=0
for n:
D += num_digits(PRIME[N]) // +1 for a nice single 0 between them
SUM += PRIME[n]/(10^D)
print fraction(SUM)
- pontifier 13y agoso, you could even skip the math and just append the string representations of the primes. It seems the really difficult part is finding a good simple fraction to express the string. Perhaps that's the key here. maybe the primes summed in the sequences are a subset that produces a relatively simple fractional representation.
- Someone 13y agoNo. If you know some theorems about continued fractions, finding such rational numbers is easy. Just generate best rational approximations until you have one that is close enough. See for example http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/cfINTRO.html#real http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci... or http://www.math.sunysb.edu/~tony/whatsnew/column/irrational-0799/irrational3.html http://www.math.sunysb.edu/~tony/whatsnew/column/irrational-...
- svnfv 13y agoThis method results in much shorter numerators and denominators than the list of primes it generates. Simplifying this fraction only chops off 2 or so digits on average.
- juliajuli45 13y agomy classmate's half-sister makes $72 every hour on the internet. She has been without a job for eight months but last month her payment was $16159 just working on the internet for a few hours.Here's the site to read more...... ------------------->http://www.works23.com http://www.works23.com