Odd Order Complete Graph is Eulerian/Historical Note

Historical Note on Odd Order Complete Graph is Eulerian
This was noted in $1809$ by, who was unaware of Euler's more general result.

The remarkable point is that he gave an ingenious method for finding such a Eulerian circuit, which is a far from trivial exercise even for modestly sized complete graphs, for example those for $n < 100$.