Talk:Greatest prime dividing the n-th cubefree number

From Rosetta Code
Revision as of 04:09, 7 March 2024 by Horst (talk | contribs) (→‎The logic of cubes_before(): legendre Prime countiing)

The logic of cubes_before()

Fairly obviously there are 31 multiples of 8(2^3) less than 249, and 9 multiples of 27(3^3), however of course we have to account for 8*27 = 216 being in both. I'm pretty sure it's fairly standard fare, but the logic of accounting for >=3 such clashes is eluding me. --Petelomax (talk) 02:07, 6 March 2024 (UTC)

Would something like a modified Legendre_prime_counting_function something adequate.
Instead testing with primes than only with primes cubed.Legendre_prime_counting_function#Non-recursive_partial_sieve --Horst (talk) 04:09, 7 March 2024 (UTC)