Prove by induction divisibility question

Click For Summary
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: establishing a base case, assuming the statement holds for \( n = k \), and proving it for \( n = k + 1 \). Key hints include factoring \( (a^{k+1} - b^{k+1}) \) and recognizing the relationship between \( (a^2 - b^2)(a + b) \) and \( (a^3 - b^3) \). The discussion emphasizes the importance of algebraic manipulation in completing the proof.

PREREQUISITES
  • Understanding of mathematical induction
  • Familiarity with polynomial factoring
  • Basic algebraic manipulation skills
  • Knowledge of properties of exponents
NEXT STEPS
  • Study the principles of mathematical induction in detail
  • Practice factoring polynomials, especially differences of powers
  • Explore examples of divisibility proofs in number theory
  • Learn about the Fundamental Theorem of Algebra
USEFUL FOR

Students in mathematics, particularly those studying proofs, algebra, and number theory, as well as educators looking for examples of induction techniques.

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
 

Similar threads

  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 11 ·
Replies
11
Views
4K
Replies
6
Views
3K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 19 ·
Replies
19
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K