\[\begin{array} {} \text{Row 1:} & \Huge \Box \Box \Box \Box \\ \text{Row 2:} & \Huge \Box \Box \\ \text{Row 3:} & \Huge \Box \Box \end{array} \]

Let \(K\) be the number of different ways the letters of the word "JUMPED" can be placed in the boxes shown above so that no row is empty.

Find the value of \(\dfrac{K}{260}\).

×

Problem Loading...

Note Loading...

Set Loading...