Greatest prime dividing the n-th cubefree number: Difference between revisions
Greatest prime dividing the n-th cubefree number (view source)
Revision as of 14:35, 7 March 2024
, 3 months agoAdded a ref to "The number of integers in a given interval which are multiple of at least one of the given numbers"
(→{{header|Wren}}: Added a further version which uses a simple sieve.) |
(Added a ref to "The number of integers in a given interval which are multiple of at least one of the given numbers") |
||
Line 24:
;Reference
* [https://oeis.org/A370833 OEIS sequence: A370833: a(n) is the greatest prime dividing the n-th cubefree number, for n >= 2; a(1)=1.]
* [https://cp-algorithms.com/combinatorics/inclusion-exclusion.html#:~:text=The%20inclusion%2Dexclusion%20principle%20is,individual%20sets%20with%20their%20union The number of integers in a given interval which are multiple of at least one of the given numbers]
=={{header|Dart}}==
{{trans|Wren}}
| |||