Legendre prime counting function: Difference between revisions

Content added Content deleted
No edit summary
Line 83: Line 83:
N =< Last -> small_pi(N);
N =< Last -> small_pi(N);
true ->
true ->
A = pi(imath:sqrt(N)),
A = pi(floor(math:sqrt(N))),
phi(N, A) + A - 1
phi(N, A) + A - 1
end.
end.
Retrieved from "https://rosettacode.org/wiki/Legendre_prime_counting_function"