Talk:Legendre prime counting function: Difference between revisions
Talk:Legendre prime counting function (view source)
Revision as of 22:22, 5 August 2021
, 2 years agono edit summary
No edit summary |
|||
Line 15:
In the examples, the CoffeeScript uses the identity pi(n) = 0 when n < 2. The Erlang version performs a binary search on the sieved primes (method 3.)
--[[User:Davgot|Davgot]] ([[User talk:Davgot|talk]]) 19:07, 5 August 2021 (UTC)
Thanks for clarifying, and thanks for the update to the description, this makes it a lot more clear. Updated my Mathematica solution to have pi(1) = 0.
| |||