Number theoryDifficulty 5.0AIME, harderFind the answer
Let f(n) be the number of distinct prime divisors of n less than 6. Compute n=1∑2020f(n)2
A number or a short expression. Spacing and $ signs are ignored.
Solution
Define 1a∣n={10a∣n otherwise Then f(n)2=(12∣n+13∣n+15∣n)2=12∣n+13∣n+15∣n+2(12∣n13∣n+12∣n15∣n+13∣n15∣n)=12∣n+13∣n+15∣n+2(16∣n+110∣n+115∣n) So summing f(n)2 over integers 1≤n≤2020 is the same as summing 1 for each time n is divisible by 2,3, or 5, and additionally summing 2 for each time n is divisible by 6,10, or 15. n=1∑2020f(n)2=⌊22020⌋+⌊32020⌋+⌊52020⌋+2(⌊62020⌋+⌊102020⌋+⌊152020⌋)=1010+673+404+2(336+202+134)=3431
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.