Sunday, 17 March 2013

exponential function - Use theory of congruence to establish divisibility



I had this problem. I solved it. tell me if it is correct
I have to prove 6n+1+72n+1 is divisible by 43 when n1
My solution
6n+1+72n+1=216.6n1+343.49n1



1.6n1+(1).6n1 since3431,2161,496(mod43)




6n16n1
0 since n1,6n16n1 is an integer



Since 6n+1+72n+10(mod43) so it is divisible by 43


Answer



I think your statement is wrong.



For n=1 we obtain 379 is divisible by 43, which is wrong.




By the way, for all natural n we obtain:
6n+1+72n1=366n1+749n1=7(49n16n1)+436n1 is divisible by 43.


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