We consider the problem of finding lower bounds for integer linear combinations of $\sqrt{a_1},\ldots,\sqrt{a_K}$, where $a_1,\ldots,a_K$ are positive integers such that their square roots are linearly independent over the rationals. We use a probabilistic approach and prove that for $K\geq 8$ and nonzero integers $m_1...
Marco Aymone, Samuel Figueredo, Siddharth Iyer et al.· 0 citations
We consider the problem of finding lower bounds for integer linear combinations of $\sqrt{a_1},\ldots,\sqrt{a_K}$, where $a_1,\ldots,a_K$ are positive integers such that their square roots are linearly independent over the rationals. We use a probabilistic approach and prove that for any integers $m_1,\ldots,m_K$, not...
Marco Aymone, Samuel Figueredo, Christian Táfula· 0 citations
For $N\geq 2$ and $k\geq 1$, let $M_k(N):=\#\{x_1\cdots x_k : x_i\in\{1,\ldots,N\}\text{ for all } i\}$ be the $k$-dimensional multiplication table. Given $N$, Khovanskii's theorem implies that $M_k(N)$ agrees, for all sufficiently large $k$, with a polynomial in $k$ of degree $\pi(N)$. We determine the asymptotic size...
For a vector of positive integers $\mathbf{b} = (b_1,\ldots,b_h)$ with $\gcd(b_1,\ldots,b_h) = 1$, we study sets $A \subseteq \mathbb{N}$ for which every sufficiently large integer has a bounded positive number of representations \[ n = b_1 x_1 + \cdots + b_h x_h \qquad (x_1,\ldots,x_h\in A). \] We prove that such a se...
Christian Táfula· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
