← Complete problem index

PROJECT EULER · #0997

Dice Box

Statement only · SolvedOriginal problem ↗

There are xyz dice arranged in an x×y×z box such that touching faces have the same value.
All dice are indistinguishable up to rotations.

Let f(x,y,z) be the number of possible arrangements.

You are given f(1,1,1)=24 and f(2,3,4)=18432.

Find f(9,10,11).

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.