Columns of Pascal's Triangle contain Simplicial Polytopic Numbers
Jump to navigation
Jump to search
This theorem requires a proof.
Need to define the simplicial polytopic numbers and demonstrate that the $n$th simplicial polytopic number of dimension $m$ is $\dbinom m n$ or whatever the formula is.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
Theorem
The columns of Pascal's triangle contain the simplicial polytopic numbers:
- Column $0$: repeated instances of number $1$
and so on.
Proof
Need to define the simplicial polytopic numbers and demonstrate that the $n$th simplicial polytopic number of dimension $m$ is $\dbinom m n$ or whatever the formula is.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
When this page/section has been completed, {{ProofWanted}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Sources
- 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $35$
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $35$