Question

Let `n` be a natural number. Prove that if the sum of the digits of `5n` is equal to the sum of the digits of `n`, then `n` is divisible by `9`.

Difficulty level (1 very easy - 10 very hard): 3

Topics:
Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules -> Divisibility Rules by 3 and 9
There are no comments yet.
Authentication required

You must log in to post a comment.

Log in