Let $A=\{a_1,\ldots,a_n\}$, $B=\{b_1,\ldots,b_n\}$ and $C=\{\frac{a_1}{b_1},\ldots,\frac{a_n}{b_n}\}$ be three sets of integers. I would like to know when is it true that
$$\min C=\frac{\min A}{\max B}.$$
I tried to prove this equality but I failed.
We have, for positive integers only:
- $\min C\leqslant \frac{a_i}{b_i},\,\forall\,i\in\{1,\ldots,n\}$
- $\min A\leqslant a_i,\,\forall\,i\in\{1,\ldots,n\}$
- $\max B\geqslant b_i,\,\forall\,i\in\{1,\ldots,n\}$
Combining 1., 2. and 3., we get
$$\min C\leqslant \frac{a_i}{b_i},\,\forall\,i\in\{1,\ldots,n\},\\ \frac{\min A}{\max B}\leqslant \frac{a_i}{b_i},\,\forall\,i\in\{1,\ldots,n\}.$$
So I think I cannot conclude anything here, can I? Also, what happens when the integers are negative?