PROVE:
1)
when n is odd.
BEST ANSWER WILL BE MARKED BRAINLIEST.
100 POINTS AWARDED FOR THE QUESTION.
Answers
Sorry dude I cannot do this by mathematical induction.
I have still so much to learn about mathematical induction.
Okay so:
Let f(x) be a function such that:
If we put x as (-y) in the equation we will get:-
We know that if f(x) is divisible by x-(-y) then f(-y)=0
So:
f(x) must be divisible by x+y
But we defined f(x) as
So:
This proves that is divisible by x+y.
Another approach can be:
Putting n as 1 and 3 we get:
When n=1.
Since 1 is an integer it is divisible
Then if n=3
Since is an integer then it must be divisible.
So:
this proves your question.
Infact there is a formula if n is odd,
then:
Remember that all xy multiples will be negative if x+y is the factor and in for every value of n as odd it will start by (x+y) multiplied by that formula.
For example:
Hope it helps:-)
Have a nice day and:
Buum kaali Happy Diwali:)