Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Claim. M. Ziller, On differences between consecutive numbers coprime to primorials, arXiv:2007.01808 (v1, 3 July 2020; no journal record). Write F(k)F(k) for the least even integer that is not a difference ai+1−aia_{i+1}-a_i of consecutive integers coprime to the kkth primorial, as in Problem 854. Proposition 2.6 shows that 2k2k is such a difference for every kk, by an explicit restricted covering of 1,…,2k−11,\ldots,2k-1 with one residue class modulo each of the first kk primes, and Proposition 2.7 shows that a difference for the kkth primorial remains one for the (k+1)(k+1)th. Together they give Corollary 2.8: each of 2,4,…,2k2,4,\ldots,2k occurs as a difference, so F(k)≥2k+2F(k)\ge2k+2. Ziller works with the periodic set of differences, which agrees with the site's finite one for k≥3k\ge3, since the boundary gap 22 then also occurs inside [1,nk−1][1,n_k-1].

Section 4 reports an exhaustive computation, for every k≤44k\le44, of the least missing difference and of all missing differences below Jacobsthal's value h(k)h(k), the largest gap. From these data it states Conjecture 4.1: for k>1k>1 every even number up to h(k−1)h(k-1) occurs as a difference for the kkth primorial.

Covers. F(k)≥2k+2F(k)\ge2k+2 for every kk (for k≥3k\ge3 in the site's convention). Not covered: any bound of larger order, and the displayed question whether ≫max⁡i(ai+1−ai)\gg\max_i(a_{i+1}-a_i) even integers occur as gaps.

Standing. Claimed: an arXiv preprint with no journal record and no recorded reviewer. The site's label for the problem is OPEN, and the site does not mention the preprint.

Depends on. No page of this wiki.