Legendre prime counting function: Difference between revisions
m
→Iterative, partial sieving: Aligned with VLang.
m (→{{header|Vlang}}: Fixed trivial cases n = 3 to 8 (see talk page).) |
m (→Iterative, partial sieving: Aligned with VLang.) |
||
Line 3,537:
var countPrimes = Fn.new { |n|
if (n <
var rtlmt = n.sqrt.floor
var mxndx = Int.quo(rtlmt - 1, 2)
| |||