On the subset sums of exponential type sequences

Yong-Gao Chen¹ ; Jin-Hui Fang² ; Norbert Hegyvári³

¹ School of Mathematical Sciences and Institute of Mathematics Nanjing Normal University Nanjing 210023, P.R. China
² Department of Mathematics Nanjing University of Information Science and Technology Nanjing 210044, P.R. China
³ ELTE TTK Eötvös University Institute of Mathematics Pázmány St. 1/c H-1117 Budapest, Hungary

Acta Arithmetica, Tome 173 (2016) no. 2, pp. 141-150

Résumé

For a sequence $A\subseteq \mathbb{N}$, let $P(A)$ be the set of all sums of distinct terms taken from $A$. The sequence $A$ is said to be \lt i \gt complete \lt /i \gt if $P(A)$ contains all sufficiently large integers. Let $p \gt 1$ be an integer. The following main results are proved: (a) Let $A_t=\{ a_1\le \dots \le a_t\}$ be any sequence of positive integers (not necessarily distinct), $S_p=\{ p^i : i=0, 1, \dots \} $ and $S_p A_t=\{ p^i a_j : i=0, 1, \dots; \, j=1, \dots , t\}$. When $t\ge p-1$, the sequence $P(S_pA_t)$ has positive lower asymptotic density not less than $1/a_{p-1}$. The lower bounds $p-1$ and $1/a_{p-1}$ are both the best possible. (b) For any positive integer $k$, the sequence $\{ p^i F_j : i=0, 1, \dots ;\, j=k, k+1, \dots , n\}$ is complete, where $F_j$ is the $j$th Fibonacci number and $n=p^2 F_{k+2p-1}^2$.

Détail

DOI : 10.4064/aa8133-3-2016

Keywords: sequence subseteq mathbb set sums distinct terms taken sequence said complete contains sufficiently large integers integer following main results proved dots sequence positive integers necessarily distinct dots t j dots dots p sequence has positive lower asymptotic density p lower bounds p p best possible positive integer sequence j dots dots complete where jth fibonacci number p