ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let 0<pq≤10<\frac pq\leq 1 be an irreducible fraction whose best mm-term Egyptian underapproximation is unique for every positive integer mm. Let {un}n=1∞\{u_n\}_{n=1}^{\infty} denote the best Egyptian underapproximation of pq\frac pq, and let a1<a2<⋯a_1<a_2<\cdots be any other sequence of positive integers satisfying

∑i=1∞1ai=pq.\sum_{i=1}^{\infty}\frac{1}{a_i}=\frac pq.

Rational Erdős–Graham conjecture. Then

lim inf⁡n→∞an12n<lim⁡n→∞un12n.\liminf_{n\to\infty}a_n^{\frac{1}{2^n}}<\lim_{n\to\infty}u_n^{\frac{1}{2^n}}.

This is presented as a natural generalization of the Sylvester-sequence conjecture. The source states that proving it without assuming the earlier conjecture remains out of reach.

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.