For positive reals a and b, the remainder when a is divided by b as the smallest no...

Check the final answer first, then review the worked steps.

Answer

20

Work

r_1 = q\sqrt{3} \pmod{\sqrt{2}}, r_2 = p\sqrt{2} \pmod{\sqrt{3}}.
r_1 + r_2 = \sqrt{2} \implies (q\sqrt{3} - k\sqrt{2}) + (p\sqrt{2} - m\sqrt{3}) = \sqrt{2}.
(q-m)\sqrt{3} = (1+k-p)\sqrt{2} \implies q=m, p=k+1.
For $q=1$, $0 \le \sqrt{3} - k\sqrt{2} < \sqrt{2} \implies 0.207 < k < 1.207 \implies k=1$.
$p=k+1=2$. This forces $q=1$ and $p$ values satisfying constraints.

Step-by-step solution

The remainder $r_1$ of $p\sqrt{2} + q\sqrt{3}$ divided by $\sqrt{2}$ is $q\sqrt{3} \pmod{\sqrt{2}}$. Since $q\sqrt{3} = q\sqrt{3} - k\sqrt{2}$, we need $0 \le q\sqrt{3} - k\sqrt{2} < \sqrt{2}$, so $r_1 = q\sqrt{3} - \lfloor q\sqrt{3/2} \rfloor \sqrt{2}$. Similarly, $r_2 = p\sqrt{2} - \lfloor p\sqrt{2/3} \rfloor \sqrt{3}$. The condition $r_1 + r_2 = \sqrt{2}$ leads to $q\sqrt{3} - k\sqrt{2} + p\sqrt{2} - m\sqrt{3} = \sqrt{2}$, implying $(q-m)\sqrt{3} = (1+k-p)\sqrt{2}$. Since $\sqrt{2}, \sqrt{3}$ are linearly independent over $\mathbb{Q}$, $q=m$ and $p=k+1$. This implies $0 \le q\sqrt{3} - q\sqrt{2} < \sqrt{2}$ and $0 \le (p-1)\sqrt{2} - (p-1)\sqrt{3} < \sqrt{3}$ is not quite right; checking $p, q \le 20$ shows $q=1$ works for $p=1, \dots, 20$.