Infinitude conjecture for the first binomial gcd condition

For a positive integer nn, define

G1(n)=gcd(12n+1(2n+1n),(2n+1)(2n+3)).G_1(n)=\gcd\left(\frac{1}{2n+1}{2n+1\choose n},(2n+1)(2n+3)\right).

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

G1(n)=1.G_1(n)=1.

The source notes that this condition follows whenever 2n+12n+1 and 2n+32n+3 are both prime powers; consequently, the twin prime conjecture would imply this conjecture, but the source leaves the claim itself open.

Sources & referencesView supporting material

Primary source

Victor J. W. Guo and Jiang Zeng, “Factors of sums and alternating sums involving binomial coefficients and powers of integers”, arXiv:1008.3316 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.