← All problems

Generalized Schur-number conjecture for x+(k−1)y=z

For every integer k≥3k\ge 3, let Tk(3)T_k(3) be the least positive integer NN such that every coloring c:[1,N]→{1,2,3}c:[1,N]\to\{1,2,3\} admits x,y,z∈[1,N]x,y,z\in[1,N] with c(x)=c(y)=c(z)c(x)=c(y)=c(z) and x+(k−1)y=zx+(k-1)y=z. The conjecture asserts that Tk(3)=k3+2k2−2T_k(3)=k^3+2k^2-2 for all k≥3k\ge 3.

Equivalent formulations
  1. For every integer a≥2a\ge 2, let sa(3)s_a(3) be the least positive integer NN such that every coloring of [1,N][1,N] with three colors admits a monochromatic solution to x+ay=zx+ay=z. Equivalently, the conjecture asserts that sa(3)=a3+5a2+7a+1s_a(3)=a^3+5a^2+7a+1 for all a≥2a\ge 2.

    source: The Three-Color Generalized Schur Number of $x+(k-1)y=z$: A Proof for All $k$ from a Critical Set of 33 Polynomials

References

Progress summary

Refreshed
Open · solution reported

An unrefereed preprint claims to determine the entire three-color family, but its proof has not been independently checked.

The conjecture predicts exact three-color generalized Schur-number values for the equation x+(k−1)y=zx+(k-1)y=z across all parameters. No original proposer or date is identified in the retrieved sources.

November 2026 preprint claim

Amir Khamseh and Mohammad Hassan Safareh claim a complete result using a uniform critical-set argument for the upper bound and an explicit recursive coloring for the lower bound. If correct, this settles an infinite family of three-color Ramsey-type values. The manuscript is unrefereed, and its computer-assisted case analysis has not been independently assessed.

Current status (as of November 2026): The general conjecture is claimed solved by an unrefereed preprint, but the result remains unverified.

Sources

Solutions 0

No solutions have been posted yet.