Sum-distinct sequences and Fibonacci numbers

DOI10.1007/BF01946384MaRDI QIDQ914722zbMATH OpenFDO

Authors Lael F. Kinch, Jeno Lehel

Publication date 1990

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01946384

zbMATH Keywords

Fibonacci numbersgeneralized Fibonacci numberssum-distinct sequence

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Special sequences and polynomials (11B83)

Review text

Positive integers \(a_ 1<a_ 2<...<a_ n\) are called a sum-distinct sequence if all the \(2^ n\) subsums are distinct. Two sequences \(A=\{a_ 1,a_ 2,...\}\) and \(B=\{b_ 1,b_ 2,...\}\) are said to be compatible sum-distinct sequences, if both A and B are sum-distinct and the subsums of A differ from those of B. By using Fibonacci numbers special compatible sum-distinct sequences are constructed. The same is done by using generalized Fibonacci numbers, defined by \(F_ t(n)=n\), \(n=1,...,t\), \(F_ t(n+1)=F_ t(n)+F_ t(n-t+1),\quad n\geq t;\) t a fixed natural number.

Cites work

• An improved lower bound on the greatest element of a sum-distinct set of fixed order
• Representation of Natural Numbers as Sums of Generalised Fibonacci Numbers
• Unsolved problems in number theory

Cited in

(5)

• Irregular networks, regular graphs and integer matrices with distinct row and column sums
• scientific article; zbMATH DE number 6985988 (Why is no real title available?)
• scientific article; zbMATH DE number 1408133 (Why is no real title available?)
• Partial Sums of the Fibonacci Sequence
• The order of appearance of the sum and difference between two Fibonacci numbers

This page was built for publication: Sum-distinct sequences and Fibonacci numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q914722)