Let $\mathbb{N}$ denote the set of positive integers. For every integer $k\in\mathbb{N}$ let $m(k)$ denote the minimal size of a finite set $S\subseteq \mathbb{N}$ such that $\sum_{j\in S}j^{-1}=k$.

Is there $z\in \mathbb{N}$ such that $m(k) = {\cal O}(k^z)$?

Let $\mathbb{N}$ denote the set of positive integers. For every integer $k\in\mathbb{N}$ let $m(k)$ denote the minimal size of a finite set $S\subseteq \mathbb{N}$ such that $\sum_{j\in S}j^{-1}=k$.

What is the asymptotic growth of $m(k)$?

Let $\mathbb{N}$ denote the set of positive integers. For every integer $k\in\mathbb{N}$ let $m(k)$ denote the minimal size of a finite set $S\subseteq \mathbb{N}$ such that $\sum_{j\in S}j=k$.

Is there $z\in \mathbb{N}$ such that $m(k) = {\cal O}(k^z)$?

Let $\mathbb{N}$ denote the set of positive integers. For every integer $k\in\mathbb{N}$ let $m(k)$ denote the minimal size of a finite set $S\subseteq \mathbb{N}$ such that $\sum_{j\in S}j^{-1}=k$.

Is there $z\in \mathbb{N}$ such that $m(k) = {\cal O}(k^z)$?