Prove that 5k-5 is divisible by 4 by principle of mathematical induction

Let P(n): 5n-5 
For n=1,
p(1): 5-5 = 0 which is divisible by 4.
therefore p(1) is divisible by 4.
now, suppose p(k) is divisible by 4; k belongs to N.
    P(k): 5k-5 = 4*m ; m belongs to N.  _________ [1]
now, we have to prove p(k+1) is divisible by 4.
    P(k+1): 5k+1-5
= 5k*5 - 5
= (4*m+5)5 - 5           <from [1]>
= 5{(4*m+5)-1}
= 5{4*m+5-1}
= 5{4*m+4}
= 5{4(m+1)}
= 4(5*m+5) which is divisible by 4.
p(k) is divisible by 4 which implies p(k+1) is divisible by 4.
hence, p(n) is divisible by 4, by PMI.
  • 21
Chinmay
  • -2
Use the principle of induction prove that for the power n -3n-1 divisible by 4
  • 2
Arpita laus chinmay?
 
  • 1
Aaah harder harder harder chinmay aaaaaaaaaaaaaaanh.... oh god... oh my god... im comming im comming.....
  • 1
What are you looking for?