Induction

Qwane · May 16th, 2017, 05:41 PM

Prove that, for all positive integers n,3^2n - 1 is divisible by 8

Maschke · May 16th, 2017, 06:08 PM

Quote:

Originally Posted by Qwane $View Post$

Prove that, for all positive integers n,3^2n - 1 is divisible by 8

Easier by modular arithmetic. $3^{2n} = (3^2)^n \equiv 1^n \equiv 1 \pmod 8$. Did you make any progress on your induction?

JeffM1 · May 17th, 2017, 02:10 AM

Quote:

Originally Posted by Qwane $View Post$

Prove that, for all positive integers n,3^2n - 1 is divisible by 8

I take it you mean that, for any positive integer n, 3^(2n) - 1 is divisible by eight, not that 3^2n - 1 is divisible by eight. The latter statement is generally false.

$3^2 * 2 - 1 = 9 * 2 - 1 = 17.$ Not divisible by 8.

$ 3^2 * 3 - 1 = 9 * 3 - 1 = 26.$ Not divisible by 8.

There are two overall steps in a proof by induction.

What is the first one?

What did you get in that step?

What is the second step?

The second step is always where the difficulty lies. How do you initiate that step?

May 16th, 2017, 05:41 PM	#1
Qwane Newbie Joined: May 2017 From: Trinidad Posts: 1 Thanks: 0	Induction Prove that, for all positive integers n,3^2n - 1 is divisible by 8
$Qwane is offline$

Thread Tools
$Show Printable Version$ Show Printable Version $Email this Page$ Email this Page
Display Modes
$Linear Mode$ Linear Mode $Hybrid Mode$ Switch to Hybrid Mode $Threaded Mode$ Switch to Threaded Mode

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
induction	markosheehan	Algebra	2	September 19th, 2016 10:51 AM
Induction	med1student	Algebra	5	August 19th, 2015 07:11 AM
induction	Kinroh	Calculus	1	April 9th, 2015 10:09 AM
induction	cool012	Algebra	0	December 1st, 2013 05:37 AM
Induction	Tommy_Gun	Algebra	14	June 1st, 2012 11:52 PM