Re: Computational complexity, number theory tidbits

From: David Kastrup (dak_at_gnu.org)
Date: 08/02/04 

Date: 02 Aug 2004 02:37:34 +0200

jstevh@msn.com (James Harris) writes:

> So finally some people came forward with some comments about
> derivation of floor((N-4)/6) which as has been noted works for even
> N>2, while there also exists (and I admit I didn't know it)
> floor((N-3)/6) which works for N>2, as both give the count of odd
> composites that have 3 as a factor.
>
> From here on in this post I'll use
>
> [x] = floor(x)
>
> as it's easier than repeatedly typing in "floor".

The usual convention would be ⌊x⌋ though this requires a
Unicode-enabled Newsreader. 

-- 
David Kastrup, Kriemhildstr. 15, 44793 Bochum

Relevant Pages

  • Re: Compare and contrast
    ... "James Harris" wrote in message ... > simple derivation of the prime counting function, ... > you have the other composites. ... the sum of the areas of the two smaller polygons is equal the area of the ...
    (sci.math)
  • Re: More number theory tidbits, paper?
    ... jstevh@msn.com (James Harris) wrote: ... > which is the fully compressed explicit formula. ... > The result itself is the count of composites up to N that are not ... single division. ...
    (sci.math)