Prove that there exist two powers of 3 whose difference is divisible by 1997.

Solution


|Contact| |Front page| |Contents| |Up|

Copyright © 1996-2018 Alexander Bogomolny

Prove that there exist two powers of 3 whose difference is divisible by 1997.

There are 1997 remainders of division by 1997. Consider a sequence of powers 1, 3, 32,... 31997. It contains 1998 members. Therefore, by the Pigeonhole principle, some two of them, say 3n and 3m, n > m, have equal remainders when divided by 1997. Then their difference (3n - 3m) is divisible by 1997.


[an error occurred while processing this directive]

|Contact| |Front page| |Contents| |Up|

Copyright © 1996-2018 Alexander Bogomolny
[an error occurred while processing this directive]
[an error occurred while processing this directive]