From charlesreid1

Revision as of 21:19, 17 June 2026 by Admin (talk | contribs) (Create Project Euler/240 - Top Dice (via create-page on MediaWiki MCP Server))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem Statement

Top Dice

There are 1111 ways in which five 6-sided dice (sides numbered 1 to 6) can be rolled so that the top three sum to 15. Some examples are:

D1,D2,D3,D4,D5 = 4,3,3,3,3 D1,D2,D3,D4,D5 = 4,3,3,3,6 D1,D2,D3,D4,D5 = 5,2,4,4,6 D1,D2,D3,D4,D5 = 6,2,2,4,5 D1,D2,D3,D4,D5 = 6,1,2,1,6

In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be rolled so that the top ten sum to 70?

Flags