The mod-p^3 refinement for alternating fourth powers of Delannoy polynomials
Statement
Let be the Delannoy polynomial, defined by
Let be an integer and let be an odd prime. The mod- refinement.
The paper proves the corresponding congruence modulo and presents this stronger modulus- version as a numerical conjecture.
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.