ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m,n,km,n,k be integers, and let \left\langle\begin{matrix}n\\#2\end{matrix}\right\rangle_m denote the (n,k)(n,k)-th entry of the generalized Pascal triangle of parameter mm. For k≥0k\geq 0, consider entries satisfying

n≥(m−1)k+1.n\geq (m-1)k+1.

Pascal recurrence conjecture. For n≥(m−1)k+1n\geq (m-1)k+1 when k≥0k\geq 0,

\left\langle\begin{matrix}n\\#2\end{matrix}\right\rangle_m=\left\langle\begin{matrix}n-1\\#2\end{matrix}\right\rangle_m+\left\langle\begin{matrix}n-1\\#2\end{matrix}\right\rangle_m.

This generalizes the Pascal recurrence, and the source states that it has been verified for m=1,2,3m=1,2,3; its validity for general mm remains open.

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.