A combinatorial proof of Cramer's Rule
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914921248194560 |
|---|---|
| author | Zeilberger, Doron |
| author_facet | Zeilberger, Doron |
| contents | In 1750, Gabriel Cramer famously stated, without proof, his eponymous rule for solving a system of linear equations with as many equations as unknowns. We give a purely combinatorial, and purely self-contained, proof of this old chestnut, still useful after all these years. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_10282 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A combinatorial proof of Cramer's Rule Zeilberger, Doron Combinatorics In 1750, Gabriel Cramer famously stated, without proof, his eponymous rule for solving a system of linear equations with as many equations as unknowns. We give a purely combinatorial, and purely self-contained, proof of this old chestnut, still useful after all these years. |
| title | A combinatorial proof of Cramer's Rule |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2408.10282 |