The 6n alternating binomial-sum divisibility conjecture
Statement
For positive integers , , , and , define
The 6n divisibility conjecture. For all positive , , , and , is divisible by both
This conjecture refines the preceding divisibility result, which gives divisibility by and . The paper reports computational verification for and , but no general proof is given.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.