ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f2(k)f_2(k) be the smallest positive integer nn such that every 2-coloring of {1,2,…,n}\{1,2,\ldots,n\} has a monochromatic solution, with the variables not necessarily distinct, to

1x1+1x2+⋯+1xk=1xk+1.\frac{1}{x_1}+\frac{1}{x_2}+\cdots+\frac{1}{x_k}=\frac{1}{x_{k+1}}.

Call kk an odd prime power if k=pmk=p^m for some odd prime number pp and positive integer mm. Equality conjecture. If k≥4k\geq4 is not an odd prime power, then

f2(k)=3k2.f_2(k)=3k^2.

The conjecture is motivated by computational results showing that f2(k)=3k2f_2(k)=3k^2 exactly when kk is an odd prime power for k∈{3,4,…,25}k\in\{3,4,\ldots,25\}, together with the proved result that f2(k)=3k2f_2(k)=3k^2 when k=3⋅2mk=3\cdot2^m for a positive integer mm and that f2(k)≥3k2+1f_2(k)\geq3k^2+1 for odd prime powers.

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.