Answer:
There are 3,628,800 different ways for the runners to finish.
Step-by-step explanation:
Arrangments of x elements:
The number of possible arrangments of x elements is given by the following formula:

In this question:
10 different runners, which means that the number of different ways that there are for the runners to finish is an arrangment of 10 elements. So

There are 3,628,800 different ways for the runners to finish.
5 packs of stamps and 7 packs of envelopes. There will be a total of 70 envelopes and stamps.
<h2>
Answer with explanation:</h2>
We are asked to prove by the method of mathematical induction that:

where n is a positive integer.
then we have:

Hence, the result is true for n=1.
- Let us assume that the result is true for n=k
i.e.

- Now, we have to prove the result for n=k+1
i.e.
<u>To prove:</u> 
Let us take n=k+1
Hence, we have:

( Since, the result was true for n=k )
Hence, we have:

Also, we know that:

(
Since, for n=k+1 being a positive integer we have:
)
Hence, we have finally,

Hence, the result holds true for n=k+1
Hence, we may infer that the result is true for all n belonging to positive integer.
i.e.
where n is a positive integer.
Answer:
m=112
Step-by-step explanation:
16-2=4
m/8=14
14x8=112
20x - 15 - 3x - 1 = 15x + 27 + 2x
17x - 16 = 17x + 27
17x - 17x = 27 + 16
0 = 43
Since zero is not equal to 43, this equation has no solution.