Sunday, 31 May 2015

Proof by induction: Show that 9n2n for any n natural number is divisible by 7.




Can someone please solve following problem.



Show that 9n2n for any n natural number is divisible by 7. (9n = 9 to the power of n).



I know the principle of induction but am stuck with setting up a formula for this.


Answer



Hint:



Assume that 7(9n2n),




For n+1:



9n+12n+1=9n92n2=9n(7+2)2n2=9n7+9n22n2=9n7+2(9n2n)


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...