Question

There are n dice with f faces. The faces are numbered from 1 to f. What is the minimum possible sum that can be obtained when the n dice are rolled together?

(a) 1

(b) f

(c) n

(d) n*f

I got this question in a national level competition.

My enquiry is from Dice Throw Problem in division Dynamic Programming of Data Structures & Algorithms II

Answer 1

The correct option is (c) n

Easiest explanation - The sum will be minimum when all the faces show a value 1. The sum in this case will be n.