Prove ๐’^๐Ÿ+๐Ÿ‘๐’+๐Ÿ“ is never divisible by 121. A method you may have never seen | USSR Olympiad Problem

preview_player
ะŸะพะบะฐะทะฐั‚ัŒ ะพะฟะธัะฐะฝะธะต
Prove ๐’^๐Ÿ+๐Ÿ‘๐’+๐Ÿ“ is never divisible by 121, for any ๐’โˆˆโ„•. We introduce an amazing idea to prove this question.

ะ ะตะบะพะผะตะฝะดะฐั†ะธะธ ะฟะพ ั‚ะตะผะต
ะšะพะผะผะตะฝั‚ะฐั€ะธะธ
ะะฒั‚ะพั€

A number is a multiple of 121 if the difference between 12 times the last digit is 0 or a multiple of 121. Also a number is a multiple of 121 if it can be divided by 11 twice

matiaspereira
ะะฒั‚ะพั€

Please explain this step : ( n + 7 ) - ( n - 4 ) = 11 Thanks

backgammonmaster
ะะฒั‚ะพั€

( n + 7 ) - ( n - 4 ) = 11 if n is a natural number is a result of bezout's identity.

michaelempeigne
ะะฒั‚ะพั€

i might be a good idea to prove bezout's identity ahead of time.

michaelempeigne