On Mon, 21 Jul 2008, Brian M. Scott wrote:
>
> >> For any y in N let P(y) be the set of primes not
> >> exceeding sqrt(y), and let n(y) be the number of
> >> integers in [1, y] not divisible by any member of
> >> P(y). Then for sufficiently large values of y,
> >> n(y) is approximately p(y), the number of primes
> >> in [1, y].
>
> > Typo? n(y) is approximately P(y), the number of primes
>
> No typo. Your version makes no sense: P(y) is a set of
> primes, not a number.
>
Then what is p(y)?
> [...]
>
Whoops, all of your work removed from convenient consideration.
|
