ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P\mathbb{P} denote the set of all prime numbers. For n≥2n\geq 2, let {pi}i=1n\{p_i\}_{i=1}^n be an originator consisting of prime numbers, and let {djk}j≥1\{d_j^k\}_{j\geq 1}, for 1≤k≤n−11\leq k\leq n-1, be the circuit induced by this originator. Here djkd_j^k denotes the entries obtained by iterated absolute forward differences, and τn,1\tau_{n,1} denotes the trace statistic of the circuit.

Finite Gilbreath conjecture. For every such prime originator,

d1k>0for all 1≤k≤n−1,d_1^k>0\qquad\text{for all }1\leq k\leq n-1,

and

τn,1=n−1for all n≥2.\tau_{n,1}=n-1\qquad\text{for all }n\geq 2.

This is presented as a finite formulation whose establishment would immediately imply the original Gilbreath conjecture. The source introduces it in terms of paths, circuits, traces, and lengths; the supplied context does not provide their full formal definitions, so the precise relationship between the trace condition and the original conjecture should be checked.

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.