Answer:
we need to prove : for every integer n>1, the number
is a multiple of 5.
1) check divisibility for n=1,
(divisible)
2) Assume that
is divisible by 5, 
3) Induction,



Now, 



Take out the common factor,
(divisible by 5)
add both the sides by f(k)

We have proved that difference between
and
is divisible by 5.
so, our assumption in step 2 is correct.
Since
is divisible by 5, then
must be divisible by 5 since we are taking the sum of 2 terms that are divisible by 5.
Therefore, for every integer n>1, the number
is a multiple of 5.
The correct answer is 1.25 dollars per pound. You can check it by multiplying it with 4.16
Answer:
x =14
Step-by-step explanation:
14x+24=18x-32
Subtract 14x from each side
14x-14x+24=18x-14x-32
24 = 4x -32
Add 32 from each side
24+32=4x-32+32
56 = 4x
Divide each side by 4
56/4 = 4x/4
14=x
The minimal completion time for the activities is the shortest possible time for all the activities to be finished. In doing this, we look at the path that would require the greatest amount of time. At the START node, we choose the path that would take the longest which is 7 days leading to ACTIVITY D. Next, we choose the path leading to ACTIVITY B which takes 5 days. Then, we move to ACTIVITY C taking 5 days and finally, reach the END which would take 6 days. So, the minimal completion time is:
7 + 5 + 5 + 6 = 23 days