On Erdős' last equation
For a positive integer $n\ge 2$, we look at the number of solutions of the Diophantine equation $$ n(x_1+\cdots+x_n)=x_1\cdots x_n. $$ Denoting by $f(n)$ this number we show that $\liminf_{n\to\infty} \log f(n)/\log n=0$.
arXiv subjects
Publications and source records attributed to Csaba Sándor.
For a positive integer $n\ge 2$, we look at the number of solutions of the Diophantine equation $$ n(x_1+\cdots+x_n)=x_1\cdots x_n. $$ Denoting by $f(n)$ this number we show that $\liminf_{n\to\infty} \log f(n)/\log n=0$.
We study the Diophantine equation $$n^h(x_1 + \ldots + x_n) = x_1 x_2 \cdots x_n,$$ where $h \in \mathbb{Z}_{\ge 0}$, and $x_1 \le \ldots \le x_n \in \mathbb{Z}^+$. We define the solution set $ELE(h, n)$ consisting of all such integer tuples. We derive bounds on $x_n$ and $x_{n-1}$ in $ELE(h,n)$. We prove that $x_1 \cdot\ldots\cdot x_n \le n^h(n^h + 1)(n^h + n - 1)$. We also show that for $h = 1$, $x_{n-1} \le n + \max_{d \mid 2n^2 - 2n,\, d \le \sqrt{2n^2 - 2n}} d$, and for $h \ge 2$, the inequality $x_{n-1} \le 2n^h$ holds in $ELE(h, n)$. Moreover, we study the minimal value $g(h, n)$ of the largest coordinate $x_n$, and define $g(h) = \min_{n \ge 2} g(h,n)$. We prove that $$ \liminf_{n \to \infty} \frac{g(h,n)}{\frac{\log \log n \cdot \log \log \log \log n}{\log \log \log n}} \ge 1. $$ We also estimate the growth of the number of solutions. We show that for any $\varepsilon > 0,$ we have $\sum_{m \le n} |ELE(h,m)| < n^{h+1+\varepsilon} $ for sufficiently large $n$, and that $|ELE(h,n)| > n^{1 - \varepsilon}$ for infinitely many $n$.
Motivated by the classical study of additive representation functions and the combinatorial phenomenon of sum-difference asymmetry, we investigate the subtractive representation function $d_{\mathcal{B},\mathcal{A}}(n)$, which counts the number of solutions of the equation $n = b - a$ with $a\in \mathcal{A}$ and $b\in \mathcal{B}$. Specifically, we study lower bounds and the asymptotic behavior of $d_{\mathcal{B},\mathcal{A}}(n)$ under polynomial density constraints of orders $x^α$ and $x^{1-α}$, where $0 < α< 1$. We first establish a general lower bound for the first moment of $d_{\mathcal{B},\mathcal{A}}(n)$. Furthermore, by employing a recursive construction, we prove that this lower bound is essentially optimal under certain regularity assumptions on the counting functions. Finally, utilizing probabilistic methods, we show the existence of sets for which $d_{\mathcal{B},\mathcal{A}}(n)$ has a logarithmic point-wise upper bound.
Let $\mathbb{N}$ be the set of natural numbers and $\mathcal{S}_r=\big\{1^r, 2^r, 3^r,\cdots\big\}$ the set of $r$-th powers, where $r\ge 2$ is a natural number. Let $\mathcal{W}_r$ be an additive complement of $\mathcal{S}_r$ and $$ f_r(n)=\#\big\{(w,m^r)\in \mathcal{W}_r\times \mathcal{S}_r: n=w+m^r\big\}. $$ Motivated by a 1993 conjecture of Cilleruelo, we show that $$ \sum_{n\le N}f_r(n)-N\gg_r N^{1-\frac{1}{r}}. $$ Previously, the bound was only proved for $r=2$. In the case $r=2$, the lower bound above can be made more explicit as $$ \sum_{n\le N}f_2(n)-N\gg N^{3/4-o(1)}, $$ which improves the previous bound $N^{1/2}$ due to Ding, Sun, Wang and Xia.
Let $\mathbb{N}_0$ be the set of all nonnegative integers. For a nonempty set $\mathcal{A}\subseteq \mathbb{N}_0$ and integers $n,h\ge 2$, let $r_{h}(\mathcal{A},n)$ be the number of representations of $n$ as $a_1+\cdots+a_h$, where $a_1\le \cdots\le a_h$ and $a_i\in \mathcal{A}$ for $i=1,\cdots,h$. In 2016, Chen and Tang showed that, for any given distinct positive integers $u_1,\cdots,u_k$ and positive rational numbers $α_1,\cdots,α_k$ with $α_1+\cdots+α_k=1$, there are infinitely many sets $\mathcal{A}\subseteq \mathbb{N}_0$ such that $r_{h}(\mathcal{A},n)\ge 1$ for all nonnegative integers $n$ and the set of $n$ with $r_{h}(\mathcal{A},n)=u_i$ has density $α_i$ for all integer $i=1,\cdots,k$. In this paper, we consider the irrational numbers $α_i$ as well. As a main result, we prove that, for any nonnegative numbers $α_0,\cdots,α_m$ with $α_0+\cdots+α_m=1$, there are infinitely many sets $\mathcal{A}\subseteq \mathbb{N}_0$ such that the set of $n$ with $r_{2}(\mathcal{A},n)=i$ has density $α_i$ for all integer $i=0,\cdots,m$. Other related results are also contained.
For a positive integer $h$, let $R_{A,h}(n)$ denote the number of ordered representations $n=s_1+\cdots+s_h$ with all $s_i\in A$. Let \[ B=\{0\}\cup\{m\ge 1:\text{ the base-4 expansion of }m\text{ begins with }1\text{ or }2\}. \] Shallit proved that $R_{B,3}(n)$ is strictly increasing, thereby disproving a 2002 conjecture of Dombi. In this paper, by using linear bounds for $R_{B,3}(n+1)-R_{B,3}(n)$ and a convolution argument, we prove the polynomial order of $R_{B,h}(n+1)-R_{B,h}(n)$ for every integer $h\ge 3$. More precisely, for every integer $h\ge 3$, there exist constants $c_h,C_h>0$, depending only on $h$, such that \[ c_h n^{h-2}\le R_{B,h}(n+1)-R_{B,h}(n)\le C_h n^{h-2} \] for all integers $n\ge 1$. We also construct a co-infinite set $C\subset\mathbb N$ satisfying $\lim_{n\to\infty}C(n)/n=1$ such that $R_{C,h}(n)$ is strictly increasing for every integer $h\ge 3$. This answers a problem of Dombi posed in 2002. We also pose some problems for further research.
We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many solutions. Furthermore, we consider the equality of the values of the $n$th and $(n-2)$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. In particular, we show that the number of solutions of this equation tends to infinity if $n$ tends to infinity.
Let $ρ_k(N)$ denote the maximum size of a set $A\subseteq \{1,2,\dots,N\}$ such that no product of $k$ distinct elements of $A$ is a perfect $d$-th power. In this short note, we prove that $ρ_d(N)=\sum\limits_{k=1}^{d-1}π\left( \frac{N}{k} \right) +O_d(π(N^{1/2}))$, furthermore, for prime power $d$ and sufficiently large $N$ we have $ρ_d(N)=\sum\limits_{k=1}^{d-1}π\left( \frac{N}{k} \right)$. This answers a question of Verstraëte.
For a set of natural numbers $A$, let $R_{A}(n)$ be the number of representations of a natural number $n$ as the sum of two terms from $A$. Many years ago, Nathanson studied the conditions for the set $A$ and $B$ of natural numbers that are needed to guarantee that $R_{A}(n) = R_{B}(n)$ for every positive integer $n$. In the last decades, similar questions have been studied by many authors. In this paper, we extend Nathanson's result to representation functions associated to linear forms and we study related problems.
Denote by $N(n)$ the number of integer solutions $(x_1,\,x_2,\ldots ,x_n)$ of the equation $x_1+x_2+\ldots+x_n=x_1x_2\cdot\ldots\cdot x_n$ such that $x_1\ge x_2\ge\ldots\ge x_n\ge 1$, $n \in \mathbb{Z}^+$. The aim of this paper are is twofold: first we present an asymptotic formula for $\sum\limits_{2\le n\le x}N(n)$, then we verify that the counting function $N(n)$ takes very large value compared to its average value.
Let $n$ be a positive integer. The Diophantine equation $n(x_1+x_2+\dots +x_n)=x_1x_2\dots x_n$, $1 \le x_1\le x_2\le \dots \le x_n$ is called Erdős's last equation. We prove that $x_n\to \infty $ as $n\to \infty$ and determine all tuples $(n,x_1,\dots ,x_n)$ with $x_n\le 10$.
Let $F_{k,d}(n)$ be the maximal size of a set ${A}\subseteq [n]$ such that the equation \[a_1a_2\dots a_k=x^d, \; a_1<a_2<\ldots<a_k\] has no solution with $a_1,a_2,\ldots,a_k\in {A}$ and integer $x$. Erdős, Sárközy and T. Sós studied $F_{k,2}$, and gave bounds when $k=2,3,4,6$ and also in the general case. We study the problem for $d=3$, and provide bounds for $k=2,3,4,6$ and $9$, furthermore, in the general case, as well. In particular, we refute an 18 years old conjecture of Verstraëte. We also introduce another function $f_{k,d}$ closely related to $F_{k,d}$: While the original problem requires $a_1, \ldots , a_k$ to all be distinct, we can relax this and only require that the multiset of the $a_i$'s cannot be partitioned into $d$-tuples where each $d$-tuple consists of $d$ copies of the same number.
Let $\mathbb{N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_S(n)$ denote the number of solutions of the equation $n=s+s'$, $s, s'\in S$, $s<s'$. In this paper, we determine the structure of all sets $A$ and $B$ such that $A\cup B=\mathbb{N}\setminus\{r+mk:k\in\mathbb{N}\}$, $A\cap B=\emptyset$ and $R_{A}(n)=R_{B}(n)$ for every positive integer $n$, where $m$ and $r$ are two integers with $m\ge 2$ and $r\ge 0$.
Two infinite sets $A$ and $B$ of non-negative integers are called \emph{perfect additive complements of non-negative integers}, if every non-negative integer can be uniquely expressed as the sum of elements from $A$ and $B$. In this paper, we define a Lagrange-like spectrum of the perfect additive complements ($\mathfrak{L} $ for short). As a main result, we obtain the smallest accumulation point of the set $\mathfrak{L} $ and prove that the set $\mathfrak{L} $ is closed. Other related results and problems are also contained.
In this paper we prove that if $A$ and $B$ are infinite subsets of positive integers such that every positive integer $n$ can be written as $n=ab$, $a\in A$, $b\in B$, then $\displaystyle \lim_{x\to \infty}\frac{A(x)B(x)}{x}=\infty $. We also prove many other results about sets like this.
Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. For a $k$-tuple of positive integers $\underlineλ = (λ_{1}, \dots{} ,λ_{k})$ with $1 \le λ_{1} < λ_{2} < \dots{} < λ_{k}$, we define the additive representation function $R_{A,\underlineλ}(n) = |\{(a_{1}, \dots{} ,a_{k})\in A^{k}: λ_{1}a_{1} + \dots{} + λ_{k}a_{k} = n\}|$. For $k = 2$, Moser constructed a set $A$ of nonnegative integers such that $R_{A,\underlineλ}(n) = 1$ holds for every nonnegative integer $n$. In this paper we characterize all the $k$-tuples $\underlineλ$ and the sets $A$ of nonnegative integers with $R_{A,\underlineλ}(n) = 1$ for every integer $n\ge 0$.
Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. The representation function $R_{A,k}(n)$ for the set $A$ is the number of representations of a nonnegative integer $n$ as the sum of $k$ terms from $A$. Let $A(n)$ denote the counting function of $A$.Bell and Shallit recently gave a counterexample for a conjecture of Dombi and proved that if $A(n)=o(n^{\frac{k-2}{k}-ε})$ for some $ε>0$, then $R_{\mathbb{N}\setminus A,k}(n)$ is eventually strictly increasing. In this paper, we improve this result to $A(n)=O(n^{\frac{k-2}{k-1}})$. We also give an example to show that this bound is best possible.
For integer $h\geq2$ and $A\subseteq\mathbb{N}$, we define $hA$ to be all integers which can be written as a sum of $h$ elements of $A$. The set $A$ is called an asymptotic basis of order $h$ if $n\in hA$ for all sufficiently large integers $n$. An asymptotic basis $A$ of order $h$ is minimal if no proper subset of $A$ is an asymptotic basis of order $h$. For $W\subseteq\mathbb{N}$, denote by $\mathcal{F}^*(W)$ the set of all finite, nonempty subsets of $W$. Let $A(W)$ be the set of all numbers of the form $\sum_{f \in F} 2^f$, where $F \in \mathcal{F}^*(W)$. In this paper, we give some characterizations of the partitions $\mathbb{N}=W_1\cup\cdots \cup W_h$ with the property that $A=A(W_1)\cup\cdots \cup A(W_{h})$ is a minimal asymptotic basis of order $h$. This generalizes a result of Chen and Chen, recent result of Ling and Tang, and also recent result of Sun.