A -sequence with larger reciprocal sum
Author: Zhen Xiang Zhang
Journal: Math. Comp. 60 (1993), 835-839
MSC: Primary 11B37; Secondary 11B13, 11Y55
MathSciNet review: 1181334
Abstract: A sequence of positive integers is called a -sequence if the pairwise differences are all distinct. The Mian-Chowla sequence is the -sequence obtained by the greedy algorithm. Its reciprocal sum has been conjectured to be the maximum over all -sequences. In this paper we give a -sequence which disproves this conjecture. Our sequence is obtained as follows: the first 14 terms are obtained by the greedy algorithm, the 15th term is 229, from the 16th term on, the greedy algorithm continues. The reciprocal sum of the first 300 terms of our sequence is larger than .
-  P. Erdős and R. L. Graham, Old and new problems and results in combinatorial number theory, Enseign. Math. (2) (1980), 52-53.
-  Richard K. Guy, Unsolved problems in number theory, Unsolved Problems in Intuitive Mathematics, vol. 1, Springer-Verlag, New York-Berlin, 1981. Problem Books in Mathematics. MR 656313
Keywords: -sequences, Mian-Chowla sequence, Levine conjecture, greedy algorithm
Article copyright: © Copyright 1993 American Mathematical Society