ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer nn, define

G2(n)=gcd⁡(14n+1(4n+1n),(2n+1)(4n+1)).G_2(n)=\gcd\left(\frac{1}{4n+1}{4n+1\choose n},(2n+1)(4n+1)\right).

Second binomial gcd infinitude conjecture. There are infinitely many positive integers nn such that

G2(n)=1.G_2(n)=1.

The paper presents this as the analogue of the first gcd infinitude conjecture and reports computational evidence, while no proof is supplied.

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.