Long strings of composite values of polynomials and a basis of order 2

Abstract

We show that for any polynomial f: Z Z with positive leading coefficient and irreducible over Q, if N is large enough then there are two strings of consecutive positive integers I1=\n1-m,…, n1+m\ and I2=\n2-m, …, n2+m\, such that m = [( N) ( N)1/325525], I1 I2 ⊂ [1, N], N = n1 + n2, and f(n) is composite for any n∈ I1 I2. This extends the result in [5] which showed the same result but with f(n)=n.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…