Skip to content
Get started

Adding up divisor counts

MediumCombinatorics5 min

For each integer nn from 11 to 100100, let d(n)d(n) be the number of positive divisors of nn (for example d(1)=1d(1) = 1 and d(12)=6d(12) = 6). Compute d(1)+d(2)+d(3)+⋯+d(100).d(1) + d(2) + d(3) + \dots + d(100).

Show hints (3)+
  1. Swap the order: for each aa, how many n≤100n \le 100 is it a divisor of?
  2. The sum counts pairs (a,b)(a, b) with ab≤100ab \le 100.
  3. Every such pair has a≤10a \le 10 or b≤10b \le 10; use inclusion-exclusion on those two cases.

Answer

Reveal answer →

482

Create a free account to see the full worked solution and track your progress.

Interview format: Numerical Reasoning Tests, Prop Trading

Related questions