From: "Chr. Rippel" <chr_news@...>
Date: 2002-01-25T16:51:44+09:00
Subject: Re: looking for an example problem to demonstrate TaskMaster

"Mathieu Bouchard" <matju@sympatico.ca> wrote in
....
> finding primes from m to n, using the simplest non-stupid algorithm,
> requires knowing all primes up to sqrt(n); that's primecount(sqrt(n)).
> this is approx:
>
> (0..sqrt(n)).integral {|x| 1/log(x) }
>
> which is close to:
>
> 1.1*sqrt(n)/log(n)

Following this OT - a slightly better value in the long run is

   sqrt(x) / (log(sqrt(x)) - 1 )  == sqrt(x) /(log(x)/log(2) -1)

/Christoph