ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n and Fn\mathbb{F}_n denote the Kurepa factorial sequences, and let aa be a constant. Define

gcd⁡(Kn+a,Kn+1+a)=gcd⁡(Fn+a,Fn+1+a)=Fn(a).\gcd(K_n+a,K_{n+1}+a)=\gcd(\mathbb{F}_n+a,\mathbb{F}_{n+1}+a)=\mathcal{F}_n(a).

Bounded-gcd conjecture. For every Kurepa factorial sequence, Fn(a)\mathcal{F}_n(a) is bounded above by 22, with

Fn(a)={Fn(0),n>1,Fn(4),n≥1,\mathcal{F}_n(a)= \begin{cases} \mathcal{F}_n(0), & n>1,\\ \mathcal{F}_n(4), & n\geq 1, \end{cases}

where the values Fn(0)\mathcal{F}_n(0) and Fn(4)\mathcal{F}_n(4) are bounded above by 22; the question is to determine all values of aa for which this bound holds. The supplied source does not establish the conjecture or resolve the accompanying classification question.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.