
Algebra PreAlgebra and Basic Algebra Math Forum 
 LinkBack  Thread Tools  Display Modes 
April 8th, 2014, 04:11 AM  #1 
Senior Member Joined: Oct 2013 From: Far far away Posts: 431 Thanks: 18  Induction again
Prove that (4^n)  1 is divisible by 3 My attempt: 1) let n = 1 (4^1)  1 = 4  1 = 3 3 is divisible by 3. So true for n = 1 2) Assume it is true for n = k So (4^k)  1 is divisible by 3 3) let n = k + 1 but and are divisible by 3 so is divisible by 3 Therefore for all n 4^n  1 is divisible by 3 Is this proof acceptable? The third step doesn't look like induction..thanks 
April 8th, 2014, 04:19 AM  #2 
Senior Member Joined: Dec 2013 From: Russia Posts: 327 Thanks: 108  

Tags 
induction 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
induction  shunya  Algebra  2  April 8th, 2014 04:27 AM 
induction  cool012  Algebra  0  December 1st, 2013 06:37 AM 
induction  tejolson  Linear Algebra  2  February 20th, 2013 11:38 AM 
induction  OriaG  Algebra  11  October 27th, 2012 04:55 PM 
induction  gaussrelatz  Algebra  4  September 28th, 2011 09:55 PM 