Tuesday, 31 May 2016

analysis - Finding that a statement is divisible by a greatest n through induction

I have the following statement.





Find the largest natural number m such that n3n is divisible by m for all n in N. Prove your result.




I have deduced that the greatest natural number m would be 6 and I am pretty sure that I have to prove this statement through induction. T he base case is pretty obvious but it is the inductive step that is giving me trouble.



Please help!

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

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