Question

You have n dice each having f faces. What is the number of permutations that can be obtained when you roll the n dice together?

(a) n*n*n…f times

(b) f*f*f…n times

(c) n*n*n…n times

(d) f*f*f…f times

The question was posed to me in my homework.

The query is from Dice Throw Problem in chapter Dynamic Programming of Data Structures & Algorithms II

Answer 1

Correct answer is (b) f*f*f…n times

The explanation is: Each die can take f values and there are n dice. So, the total number of permutations is f*f*f…n times.