Prove by induction divisibility question

AI Thread Summary
The discussion focuses on proving by induction that (a^n - b^n) is divisible by (a - b) for positive integers n. Participants outline the steps of mathematical induction: verifying a base case, assuming the case for n=k, and proving it for n=k+1. A user expresses confusion about their approach and seeks clarification, while others provide hints on factoring and correcting errors in their expressions. The conversation emphasizes the importance of algebraic manipulation in completing the proof. The thread ultimately aims to assist in understanding the induction process for this divisibility problem.
shaner243
Messages
1
Reaction score
0

Homework Statement


Given that n is a positive integer, prove by induction that (a^n-b^n) is divisible by (a-b)


Homework Equations


n = k
n = k+1

The Attempt at a Solution


a^(k+1) - b(k+1) = (a-b)A, where A is a positive integer. I am lost from here or not sure if this is even the right attempt. Please help!
 
Physics news on Phys.org
Welcome to PhysicsForums!

I've requested that a mod move this thread to the math help section, rather than the Engineering / Comp Sci / Other section (not that we're not capable, but just for sake of completeness--that last phrase you'll probably hear a lot in your proofs class).

In general, proof by induction takes the following steps:
  1. Show that it works for a trivial case, for instance k=0 or k=1
  2. Assume that case n=k works
  3. Based on this assumption, show that n=k+1 follows, usually by algebraically rearranging things to show something involving the n=k case.

I'll start you off on this third step. You'll need to factor the following a little (and yes, it's possible, you just need to add/subtract a little):
(a^{k+1} - b^{k+1})

HINT:
(a^2-b^2)(a+b) = a^3 + a^2b - ab^2 - b^3
\Rightarrow a^3 - b^3 = ?

EDIT: Error in hint fixed, courtesy of Mark44!
 
Last edited:
MATLABdude said:
Welcome to PhysicsForums!

I've requested that a mod move this thread to the math help section, rather than the Engineering / Comp Sci / Other section (not that we're not capable, but just for sake of completeness--that last phrase you'll probably hear a lot in your proofs class).

In general, proof by induction takes the following steps:
  1. Show that it works for a trivial case, for instance k=0 or k=1
  2. Assume that case n=k works
  3. Based on this assumption, show that n=k+1 follows, usually by algebraically rearranging things to show something involving the n=k case.

I'll start you off on this third step. You'll need to factor the following a little (and yes, it's possible, you just need to add/subtract a little):
(a^{k+1} - b^{k+1})

HINT:
(a^2-b^2)(a+b) = (a^3 - a^2b + ab^2 - b^3)
(a^3 - b^3) = ?

I see where you're going, but there's a sign error in the first line above.
(a^2-b^2)(a+b) = a^3 - ab^2 + a^2b - b^3
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...

Similar threads

Back
Top