Search problems

2 problems match “combinatorial construction”. Clear

Visitors search a sample. Sign in for free to search every problem. Sign in

1. Minimum distinct values in a ratio chain ●●●○○ 50 ptsLet $a_{1}, a_{2}, \ldots, a_{2006}$ be positive integers (not necessarily distinct) such that the 2005 ratios $\frac{a_{1}}{a_{2}}, \frac{a_{2}}{a_{3}}, \ldots, \frac{a_{2005}}{a_{2006}}$ are all distinct. What is the least possible number of different values among $a_{1}, a_{2}, \ldots, a_{2006}$?
2. Denominators of partial sums ●●●●○ 100 ptsOlya wrote fractions of the form $\frac{1}{n}$ on cards, where $n$ runs over all positive divisors of $6^{100}$ (including $1$ and $6^{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?