cho.sh

researchmini

3,249 notes

260722260722 I prefer TUIBB9A08 MarkRight8B0501 에이전트 런타임 서버 셋업1983DC Bun을 Rust로 재작성하다2BDED3 260721260721 Agent Runtime Server SetupC38C2C 260719260719 AutoBuilder63849A 260718260718 Slack Bots are the new CLIs3E662F 260717260717 WristcomputerD98BDF 260716260716 SalpakanA2940F AGENTS.mdDFE522 260714260714 260713260713 260712260712 260711260711 인간의 보완재와 AX41F1E5 260710260710 tokenmaxxing cli635294 260709260709

Pascal Triangle · cho.sh

Pascal Triangle

Pascal Triangle

Warning

This post is more than a year old. Information may be outdated.

In Probability,

{n \choose k} = {n-1 \choose k-1} + {n-1 \choose k}

Backlinks1

Comments

1

n−1

)

+

(kn−1)

Proof

{n-1 \choose k-1} + {n-1 \choose k}

= {(n-1)! \over {(k-1)!~(n-k)!}} + {(n-1)! \over {(n-1-k)!~k!}}

= ({k \over k} {(n-1)! \over {(k-1)!~(n-k)!}}) + ({(n-1)! \over {(n-1-k)!~k!}} {(n-k) \over (n-k)})

= {{{(n-1)!} (k + n - k)} \over {k!~(n-k)!}} = {n! \over {k!~(n-k)!}}

= {n \choose k} ~~~~~~~~~~ \blacksquare

k

)

)

Comments0

No comments yet. Be the first to share your thoughts.