2017
DOI: 10.1112/blms.12078
|View full text |Cite
|
Sign up to set email alerts
|

A coprimality condition on consecutive values of polynomials

Abstract: Abstract. Let f ∈ Z[X] be quadratic or cubic polynomial. We prove that there exists an integer G f ≥ 2 such that for every integer k ≥ G f one can find infinitely many integers n ≥ 0 with the property that none of f (n + 1), f (n + 2), . . . , f (n + k) is coprime to all the others. This extends previous results on linear polynomials and, in particular, on consecutive integers.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…Harrington and Jones [13] calculate g f for various families of quadratic polynomials, and conjecture that g f exists and is smaller than 35 for every quadratic polynomial f (they do not consider G f ). Sanna and Szikszai [19] prove the first part of this conjecture as a corollary of their main result that G f (and hence g f ) exists if f is quadratic or cubic. Moreover, they show that for every n ≥ G f there are infinitely many integers k ≥ 0 such that none of the consecutive terms f (k + 1), f (k + 2), .…”
Section: Introductionmentioning
confidence: 91%
See 1 more Smart Citation
“…Harrington and Jones [13] calculate g f for various families of quadratic polynomials, and conjecture that g f exists and is smaller than 35 for every quadratic polynomial f (they do not consider G f ). Sanna and Szikszai [19] prove the first part of this conjecture as a corollary of their main result that G f (and hence g f ) exists if f is quadratic or cubic. Moreover, they show that for every n ≥ G f there are infinitely many integers k ≥ 0 such that none of the consecutive terms f (k + 1), f (k + 2), .…”
Section: Introductionmentioning
confidence: 91%
“…Remark 2. Although our proof of Theorem 5 involves quadratic polynomials, Sanna and Szikszai's [19] theorem and proof that G f exists for all quadratic polynomials f ∈ Z[x] is not sufficient for our proof. It follows from their work and the ideas above that if L is a primitive Gaussian line, then there is an integer G L such that for all n ≥ G L there are infinitely integers k ≥ 0 with the property that none of the n rational integers N (α k+1 ), N (α k+2 ), .…”
Section: Gaussian Lines Are Pillai Sequencesmentioning
confidence: 99%