Talk:Greatest prime dividing the n-th cubefree number: Difference between revisions
Talk:Greatest prime dividing the n-th cubefree number (view source)
Revision as of 15:38, 7 March 2024
, 3 months ago→Combinatronics: thanks
(A solution using combinatronics) |
(→Combinatronics: thanks) |
||
Line 5:
==Combinatronics==
I've added a reference to "The number of integers in a given interval which are a multiple of at least one of the given numbers". One way to do this is to calculate the number of numbers between 1 and 26 not divisible by 8, add it to the number of numbers between 28 and 124 not divisible by 8 or 27 ... until you find the 10 millionth, then find the highest prime factor.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 14:43, 7 March 2024 (UTC)
:Excellent, thanks. Turns out that was exactly what I was doing, so kudos to me, I suppose, for independently re-inventing an existing and well-known mathematical principle! --[[User:Petelomax|Petelomax]] ([[User talk:Petelomax|talk]]) 15:37, 7 March 2024 (UTC)
| |||