Back to Search
Start Over
On integer sequences in product sets.
- Source :
-
Journal of Number Theory . Nov2017, Vol. 180, p756-768. 13p. - Publication Year :
- 2017
-
Abstract
- Let B be a finite set of natural numbers or complex numbers. Product set corresponding to B is defined by B . B : = { a b : a , b ∈ B } . In this paper we give an upper bound for longest length of consecutive terms of a polynomial sequence present in a product set accurate up to a positive constant. We give a sharp bound on the maximum number of Fibonacci numbers present in a product set when B is a set of natural numbers and a bound which is accurate up to a positive constant when B is a set of complex numbers. [ABSTRACT FROM AUTHOR]
- Subjects :
- *MATHEMATICS
*NATURAL numbers
*INTEGERS
*COMPLEX numbers
*ALGEBRA
Subjects
Details
- Language :
- English
- ISSN :
- 0022314X
- Volume :
- 180
- Database :
- Academic Search Index
- Journal :
- Journal of Number Theory
- Publication Type :
- Academic Journal
- Accession number :
- 124357039
- Full Text :
- https://doi.org/10.1016/j.jnt.2017.06.001