2007/12/02 by Leonhard Euler, Euler, Leonhard
Mathematics · #01A50 #05A17 #Combinatorics (math.CO) #FOS: Mathematics #History and Overview (math.HO) #math.CO #math.HO #msc:01A50 #msc:05A17
paper · pdf · doi:10.48550/arxiv.0712.0120
14 pages
arxiv created 2007/12/02 · arxiv updated 2009/12/01
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.