A study of a dice problem (Q1908249)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1908249 |
scientific article; zbMATH DE number 847557
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A study of a dice problem |
scientific article; zbMATH DE number 847557 |
Statements
A study of a dice problem (English)
0 references
18 June 1996
0 references
The authors give an analysis of the following problem: given \(m\) dice, each of which has \(n\) faces, how many arrangements of those dice are there such that the sum of their outcomes equals \(p\)? The number of arrangements, \(N(m, n, p)\), is studied in connection with the multinomial coefficients and generating functions. An effective calculation procedure is proposed using Prolog, and some numerical results are demonstrated.
0 references
dice problem
0 references
number of arrangements
0 references
multinomial coefficients
0 references
generating functions
0 references
0.7805050015449524
0 references
0.7526140213012695
0 references
0.734038770198822
0 references
