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.
This dosent make sense and where are the sentences ;-;
Find out what the lowest number is that each of the numbers on the bottom of the fractions can divide into evenly.
Answer:
Step-by-step explanation:
We can use the point-slope form given by:
Where <em>m</em> is the slope and (x₁, y₁) is a point.
So, we will substitute -2 for <em>m</em> and (5, 2) for (x₁, y₁). This gives us:
Simplify:
Distribute:
Add 2 to both sides. Hence, our equation is:
