Derek wants to display 6 of the marbles in his collection in 2 different showcases. If each showcase must have at least 1 marble, how many different ways can he display the marbles?

6

Step-by-step explanation:

This is a case of combination since the order does not matter, it only matters that there must be a marble in each one inside, therefore we must apply its formula.

xCn = n! / x! * (n - x)!

n, in this case it would be 4 because we must subtract 2 from the total 6, since there must already be one inside in each display case.

x = 2, since it is the number of showcases.

Replacing:

 2C4 = 4! / 2! * (4 - 2)! = 6

Which means that you can in six different ways.

d

step-by-step explanation:

i used the pitagoras theoreme