A very short proof of Dixon's theorem (Q918983): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0097-3165(90)90014-n / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2036312986 / rank | |||
Normal rank |
Latest revision as of 10:46, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A very short proof of Dixon's theorem |
scientific article |
Statements
A very short proof of Dixon's theorem (English)
0 references
1990
0 references
A short proof of Dixon's theorem is given. It uses only highschool algebra.
0 references
combinatorial identity
0 references
Dixon's theorem
0 references