ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a non-negative integer nn, let g(n)g(n) be the smallest integer s≥ns\geq n for which there are distinct integers a1,…,at∈[n,s]a_1,\ldots,a_t\in[n,s], with a1=na_1=n, such that ∏i=1tai\prod_{i=1}^t a_i is a square. Kagey–Rajesh's conjecture. For all n∈Nn\in\mathbb{N}, g(n)=2ng(n)=2n if and only if n>3n>3 is prime, n=0n=0, or n=6n=6. The authors proved the “if” direction; this paper proves the “only if” direction, so the conjecture is solved.

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.