Let and be positive integers such that and is as small as possible. What is ?
Solutions — 2
Solution 1
More generally, let and be positive integers such that and \frac ab 0,$ or \[bp-aq\geq1. \hspace{15mm} (1)
From or
Since note that:
Multiplying by multiplying by and adding the results, we get
Multiplying by multiplying by and adding the results, we get
To minimize we set from which Together, we can prove that \[\frac{a+c-1}{b+d}\leq\frac abk_1, \\ \frac{a+c}{b+d}&=\frac{bk_1+dk_2}{b+d}&&=k_2+\frac{bk_1-bk_2}{b+d}&&=k_2+\frac{b(k_1-k_2)}{b+d}&&<k_2. \end{alignat*}
Moreover, this part of is independent of the precondition
~MRENTHUSIASM
Solution 2
To solve the problem, we need to find the smallest positive integer such that there exists a positive integer satisfying the inequality:
1. **Express the inequalities in terms of and :**
This can be rewritten as:
2. **Manipulate the inequalities to find bounds for :**
- From :
- From :
3. Combine the inequalities:
4. **Find the smallest such that there exists an integer satisfying the combined inequality:**
- We need to find the smallest such that:
5. **Test values of starting from the smallest possible integer:**
- For :
- For :
- Continue this process until :
6. **Verify the values of and :**
- For and :
- Check:
- The inequality holds true.
7. **Calculate :**
The final answer is