ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let aa and bb be positive integers with a>ba>b, let lpha]lpha] and eta]eta] be integers, and let pp be a prime with gcd⁡(p,a)=1\gcd(p,a)=1.

Residue conjecture. For every r∈{0,1,…,p−1}r\in\{0,1,\ldots,p-1\}, there are infinitely many positive integers nn such that

(an+αbn+β)≡r(modp).\binom{an+\alpha}{bn+\beta}\equiv r\pmod p.

This proposed generalization concerns the distribution of affine-index binomial coefficients modulo a prime. No resolution is supplied in the source.

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.