Project Euler #187: Semiprimes

  • + 1 comment

    Can someone help deduce a formula to calculate the number of Prime Numbers that comes before a certain number, say x.

    The closest i could reach was with an approximate function f(x) as:

        f(x)=x/(log x -1);