Friday, 28 March 2014

elementary number theory - Show that 30mid(n9n)




I am trying to show that 30(n9n). I thought about using induction but I'm stuck at the induction step.



Base Case: n=1191=0 and 300.



Induction Step: Assuming 30k9k for some kN, we have (k+1)9(k+1)=[9k8+36k7+84k6+126k5+126k4+84k3+36k2+9k](k+1).



However I'm not sure where to go from here.


Answer



And here are the congruences requested to complement the answer by Simon S




nn1n+1n2+1n4+10411110222213043240243022




And one can see that one of these factors is always 0(mod5)


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}...