Re: New idea in my prime counting

In sci.math, James Harris
<[EMAIL PROTECTED]>
 wrote
on 25 Nov 2003 08:05:53 -0800
<[EMAIL PROTECTED]>:
> It occurs to me that despite my putting it up a lot, few of you
> understand how that partial difference equation I keep talking about
> works.
> 
> Basically, for dS(x,y), where x and y are positive integers, if y is a
> prime number p, dS(x,p) is the count of composites up to and including
> x that have p as a factor but do NOT have primes less than p as a
> factor.  For instance, dS(10,3) = 1 because 9 is the only composite up
> to 10 with 3 as a factor that doesn't have 2 as a factor.
> 

[rest snipped]

Give it up, James.  Your algorithm was plastered in my contest. :-P :-)
Even if one throws out all of the "memoized" variants.

http://home.earthlink.net/~ewill3/math/primecounters/index.html

And then there's Bau.  Christian Bau...

http://www.cbau.freeserve.co.uk/

:-)

-- 
#191, [EMAIL PROTECTED]
It's still legal to go .sigless.