The binomial alternating-sum gcd conjecture
For positive integers and , define the sequence of integers
The alternating-sum gcd conjecture. For all positive and ,
Here the greatest common divisor is taken over all exponents . This is presented as one of the paper’s open problems, and no general proof or disproof is supplied.
References
- Victor J. W. Guo, Frederic Jouhet and Jiang Zeng, “Factors of Alternating Sums of Products of Binomial and q-Binomial Coefficients”, arXiv:math/0511635 (2007).
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.