Legendre prime counting function: Difference between revisions
m
Minor edit to C++ and Java code
(Removed memoization from Java solution) |
m (Minor edit to C++ and Java code) |
||
Line 81:
if (x <= pa)
return 1;
return phi(x, a - 1) - phi(x /
}
Line 380:
if (x <= pa)
return 1;
return phi(x, a - 1) - phi(x /
}
| |||