Euclid's division lemma states that for given positive integers a and b, there exists unique integers q and r satisfying
Applying Euclid's division lemma om n and 6, we have
Therefore, n can have six values, i.e.
Case I: When
Hence, is divisible by 6
Case II:
When
Case III: When
Case IV: When
Hence, is divisible by 6.
Case V: When
Hence, is divisible by 6.
Case VI: When
Hence, is divisible by 6.