8/(n

^{2}-1)∀n∈odd integers8/(n^{2}-1)∀n∈odd integers

Tutors, please sign in to answer this question.

Bridgewater, NJ

Was the question asking to prove by induction that n^{2}-1 is divisible by 8 for odd positive n?

To use induction, we first shall prove the base case: n=1.

n=1 satisfies the desired result since (1)^{2}-1=0, which is divisible by 8.

Second, we appeal to the inductive hypothesis: Assume that for n odd, n^{2}-1 is divisible by 8. Then, we wish to show that (n+2)^{2}-1 is also divisible by 8 (where n+2 is the odd number immediately after n).

We can show the above as follows: (n+2)^{2}-1=n^{2}+4n+4-1=n^{2}-1+4(n+1). Now, n^{2}-1 is divisible by 8 by the inductive hypothesis. Moreover, n+1 is even (since n is odd by assumption) and since any even multiple of 4 is divisible by 8, 4(n+1) must be divisible by 8.

The above statement is obvious when you re-express n+1 as 2N for some other integer N (since any even number can be expressed thus). Then 4(n+1)=4*2N=8N, which is clearly divisible by 8 (8N/8=N).

Finally, the sum of two individual numbers divisible by 8 makes the sum divisible by 8, making (n+2)^{2}-1 divisible by 8.

Having shown the base case, and having shown that given an odd number satisfying the property, the odd number immediately following it will also satisfy it, we have proven the desired result.

Q.E.D.

Regina D.

Gina, Orton-Gillingham Reading Tutor

Bayside, NY

5.0
(59 ratings)

Cheryl F.

Reading, Writing, and ESOL Tutor

New York, NY

4.9
(183 ratings)

Andrea R.

Ph.D. Tutor: K-9 Reading, Math, Writing, Test Prep, Special Needs

Wyckoff, NJ

5.0
(408 ratings)

- Math 8576
- Math Help 4841
- Word Problem 4717
- Algebra 4546
- Math Word Problem 3839
- Algebra 1 3734
- Algebra 2 3148
- Algebra Word Problem 2299
- Calculus 2016
- Physics 1992

## Comments