The number of representations of rationals as a sum of unit fractions (Q351781)

For a positive integer \(k\geq 2\) and given positive integers \(m,n\), let \[ f_k(m,n) = \# \left\{ (t_1, \ldots, t_k): \frac{m}{n} = \frac{1}{t_1} + \ldots + \frac{1}{t_k} \right\}, \] where \(t_i\) denotes positive integers with \(t_1 \leq \ldots \leq t_k\). The authors prove that \[ f_2(m,n) \leq \exp\left((\log 3 + o(1))\frac{\log n}{\log \log n}\right). \] Further, for any \(\varepsilon > 0\), they show that \[ f_3(m,n)\ll_{\varepsilon} \left(\frac{n}{m}\right)^{\frac{2}{3}} n^{\varepsilon}, \] \[ f_4(m,n) \ll_{\varepsilon} n^{\varepsilon} \left\{\left(\frac{n}{m}\right)^{\frac{5}{3}} + \frac{n^\frac{4}{3}}{m^{\frac{2}{3}}} \right\}, \] and for \(k\geq 5\) \[ f_k(m,n) \ll_{\varepsilon} (kn)^{\varepsilon} \left(\frac{k^{\frac{4}{3}} n^2}{m}\right)^{\frac{5}{3} \cdot 2^{k-5}}. \] They also establish an upper bound on \(f_k(1,1)\) which gives a sharpening of \textit{Cs. Sándor}'s result [Period. Math. Hung. 47, No. 1--2, 215--219 (2003; Zbl 1047.11031)].