![]() |
May 16th, 2017, 05:41 PM | #1 |
Newbie Joined: May 2017 From: Trinidad Posts: 1 Thanks: 0 | ![]()
Prove that, for all positive integers n,3^2n - 1 is divisible by 8
|
![]() |
May 16th, 2017, 06:08 PM | #2 |
Senior Member Joined: Aug 2012 Posts: 1,851 Thanks: 509 | Easier by modular arithmetic. $3^{2n} = (3^2)^n \equiv 1^n \equiv 1 \pmod 8$. Did you make any progress on your induction?
Last edited by Maschke; May 16th, 2017 at 06:13 PM. |
![]() |
May 17th, 2017, 02:10 AM | #3 | |
Senior Member Joined: May 2016 From: USA Posts: 997 Thanks: 410 | Quote:
$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? Last edited by JeffM1; May 17th, 2017 at 02:14 AM. | |
![]() |
![]() |
|
Tags |
induction |
Thread Tools | |
Display Modes | |
|
![]() | ||||
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 |