## You are here

HomePascal's rule

## Primary tabs

# Pascal’s rule

Pascal’s rule is the binomial identity

$\binom{n}{k}+\binom{n}{k-1}=\binom{n+1}{k}$ |

where $1\leq k\leq n$ and $\binom{n}{k}$ is the binomial coefficient.

Keywords:

number theory combinatorics

Related:

BinomialCoefficient, VandermondeIdentity, PascalsTriangle, TheoremOfThePrimalRay, Mm2, Mm, LeTheoremeDuRayonPrimal, LeDeuxiemeTheoremeDuRayonPrimal, AProofOfGoldbachConjecture, AProofOfDePolignacConjectures, FermatGhanouchiSeriesAmazingFermatGhanouchiSequ

Type of Math Object:

Theorem

Major Section:

Reference

## Mathematics Subject Classification

05A19*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella