Answer:
Step-by-step explanation:
Given
Solving (a): An equivalent inequality
We have:
Multiply both sides by -1 (this changes the inequality)
Solving (b): Values of u from least to greatest
implies that u ends at -4, starting from negative infinity
So, the list is:
Answer: A committee of 5 students can be chosen from a student council of 30 students in 142506 ways.
No , the order in which the members of the committee are chosen is not important.
Step-by-step explanation:
Given : The total number of students in the council = 30
The number of students needed to be chosen = 5
The order in which the members of the committee are chosen does not matter.
So we Combinations (If order matters then we use permutations.)
The number of combinations of to select r things of n things =
So the number of ways a committee of 5 students can be chosen from a student council of 30 students=
Therefore , a committee of 5 students can be chosen from a student council of 30 students in 142506 ways.