this formula, doesn't rely on a product, relies on a "sum", or is namely an arithmetic sequence, aₙ₋₁ -3 is another way of saying, the value of the previous term minus 3, so it relies on the ordinal value of a term, so is an recursive formula, well, let's get it when n = 4.

Answer:
There are 75 ways to form the committee.
Step-by-step explanation:
The order in which the people are chosen is not important, which means that the combinations formula is used to solve this question.
Combinations formula:
is the number of different combinations of x objects from a set of n elements, given by the following formula.
In this question:
Considering the eldest has to be there, 2 men from a set of 6 and 4 boys from a set of 5(excluding the youngest), so:

There are 75 ways to form the committee.
Answer:
Identity of Division Multiplication
Step-by-step explanation:
I know the properties.
Answer:
If it is at -8, -8 then p is at 0,0
Step-by-step explanation:
Sorry, there is not much information given to answer.