pith. sign in

arxiv: 0712.0120 · v1 · submitted 2007-12-02 · 🧮 math.HO · math.CO

On the partition of numbers into parts of a given type and number

classification 🧮 math.HO math.CO
keywords eulernumbermakenumbersnumerorumpartitionepartitionsparts
0
0 comments X
read the original abstract

E394 in the Enestrom index. Translated from the Latin original, "De partitione numerorum in partes tam numero quam specie datas" (1768). Euler finds a lot of recurrence formulas for the number of partitions of $N$ into $n$ parts from some set like 1 to 6 (numbers on the sides of a die). He starts the paper talking about how many ways a number $N$ can be formed by throwing $n$ dice. There do not seem to be any new results or ideas here that weren't in "Observationes analyticae variae de combinationibus", E158 and "De partitione numerorum", E191. In this paper Euler just does a lot of special cases. My impression is that Euler is trying to make his theory of partitions more approachable,. Also, maybe for his own benefit he wants to say it all again in different words, to make it clear.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.