Number theory › Divisibility › Assorted divisibility puzzles

Denominators of partial sums

University · ●●●●○ 100 pts

Olya wrote fractions of the form 1n\frac{1}{n} on cards, where nn runs over all positive divisors of 61006^{100} (including 11 and 61006^{100}). She arranged the cards in some order. She then wrote on the board the number on the first card, the sum of the numbers on the first two cards, the sum of the numbers on the first three cards, and so on, up to the sum of the numbers on all the cards. Each sum was written as an irreducible fraction. What is the smallest possible number of different denominators that could appear on the board?

Sign in to save your progress.

divisorsprime factorisationpartial sumscombinatorial construction