Consider a flagpole with 10 spaces. there are 3 types of flags: red flags occupy 1 space, blue and green flags occupy 2 spaces each. in how many ways can the 10 spaces of the flagpole can be covered with flags such that no spaces is empty.

There are 720 ways to do so.

Step-by-step explanation:

Since we have given that

Number of spaces in a flagpole = 10

Number of types of flag = 3

Number of spaces for red flag = 1

Number of spaces for green flag = 1

Number of spaces for blue flag = 1

We will use "Fundamental theorem of counting":

So, Number of ways that the 10 spaces of the flagpole can be covered with flags such that no spaces is empty is given by

Hence, there are 720 ways to do so.

it will become (+2)

Step-by-step explanation:

cause when you substracting a negative number you must change it to postive number