Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

prove using mathematical induction \[x ^{n} - y^{n} = (x-y)(x^{n-1} + x^{n-2}y +.....+ xy^{n-2} + y^{n-1}\] I'm not even able to prove it true for n =1 . How could one reduce the term in the second bracket to 1 ?

Mathematics
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Join Brainly to access

this expert answer

SEE EXPERT ANSWER

To see the expert answer you'll need to create a free account at Brainly

|dw:1343194234112:dw|
fundamental theorem of algebra
n=1 is the base case

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

@experimentX 1 is the base case but it also has to be proved first.
I'm unable to reduce the expression in the second bracket as it involves inverse terms with dont cancel to 1
in your formula n-1 > 0, but n-1 =0 for n=1
well u can do it this way.......... (x-y)(x^n+y^n+.....) (x^(n) - y^(n))(x-y)+ y(x-y)(xn−1+xn−2y+.....+xyn−2
|dw:1343194693791:dw|
@experimentX is that the final step?
no .. not really, currently, i cannot think using induction.
no it's purely based on induction.....
it proves directly using geometric sum
u prove very dumb things using induction/by contradiction...........
so now by induction.....we have xn−yn=(x−y)(xn−1+xn−2y+.....+xyn−2+yn−1 by induction
nd we need to prove xn+1−yn+1=(x−y)(xn+xny+.....+xyn-1+yn......
so try showing that (x−y)(xn+xny+.....+xyn-1+yn...... = xn+1−yn+1
if we follow induction methods then as per @experimentX the formula is valid only for natural indexes . so n =1 gets proved . for n+1 could be proved by solving the RHS instead of adding any term to the value for the equation for n.
|dw:1343195660262:dw| i guess ... certainly, other ways are more intuitive
\[ (x-y)(x^n + x^{n-1}y + x^{n-2}y^2 + ... +y^n) \\ = x^n(x-y) + y (x-y)(x^{n-1}+x^{n-2}y + ...+y^{n-2}) \\ = x^n(x-y)+y (x^n - y^n) = x^{n+1} - y^{n+1}\]
I wanted to have a mathematical Induction proof of the problem . But as it comes out the problem needs to have certain assumptions and can't be explained using mathematical induction in the normal way. Assumptions : 1. n > 1 so as shown by @experimentX we need to work the problem from RHS to LHS to prove the second condition of the induction thoerem.

Not the answer you are looking for?

Search for more explanations.

Ask your own question