Answer: 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.
Step-by-step explanation:
so easy lol u didn't know so lame lol I'm just messing with ya
Answer:
There are 80 questions on the test
Step-by-step explanation:
I think this is right, but don't quote me on this.
Answer:
Equivalent: 6(y - 3) AND 2(3y - 9)
Not Equivalent: 3(y - 6) AND 2(y - 9)
Step-by-step explanation:
4y - 2(5 - y + 4)
4y - 2(9 - y)
4y - 18 + 2y
6y - 18 (Everything must be equivalent to this)
3(y - 6) NOT EQUIVALENT
3y - 18
6(y - 3) EQUIVALENT
6y - 18
2(y - 9) NOT EQUIVALENT
2y - 18
2(3y - 9) EQUIVALENT
6y - 18