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.
PFA FOR THE ANSWER. YOU CAN USE THE PYTHAGOREAN EQUATION (I.E a2 + b2 =
Answer: 
Step-by-step explanation:
A line that cuts a circle at two points is called "secant".
There is a theorem known as "Intersecting Secant Theorem". This is the theorem you need to use to find the value of "d".
According the Intersecting Secant Theorem:

Having this expression, the next step is to solve for "d":
Use Distributive property:

Subtract 256 from both sides:


Divide both sides by 16:

The value of "d" rounded to the nearest tenth is:

Answer:
-5 and -5.
Step-by-step explanation:
Two negative numbers multiply to make a positive and add to make a negative.