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.
Answer:
8
Step-by-step explanation:
3 times 4 is 12 and 2 times 4 is 8
Answer:
a. -x, y b. x, y c. x, -y
Step-by-step explanation:
hope this helps:)
Answer:
(a) , , , , , , .
(b) , , , , , , , .
Step-by-step explanation:
In this exercise we only need to recall the formula for C(n,k):
where the symbol is the factorial and means
.
By convention 0!=1. The most important property of the factorial is , for example 3!=1*2*3=6.
(a) The explanations to the solutions is just the calculations.
- .
(b) The explanations to the solutions is just the calculations.
For all the calculations just recall that 4! =24 and 5!=120.
_________________________________
Step(1)
To find q(a) we just need to put a instead of x in q(x) function.
Let's do it...
Multiply sides by -2 :
_________________________________
Step (2)
To find q(a+1) we just need to put a+1 instead of x in q(x) function.
Let's do it...
_________________________________
Step (3)
And we're done.
Thanks for watching buddy good luck.
♥️♥️♥️♥️♥️