8 Nov
2006
8 Nov
'06
4:16 p.m.
There's also the following paper (which was an ANTS 7 poster): "Computing Prime Harmonic Sums" by Eric Bach and Jonathan Sorenson http://euclid.butler.edu/~sorenson/papers/sum1p.pdf I realize that this isn't about the original problem (the first time the sum of the harmonic series exceeds n), but about a related but much harder problem -- the first time the sum of the reciprocals of the sums of the primes exceed n -- harder just because the latter series grows like log log n. Victor