# euclid division lemma

The method or solution starts with the assumption of integer in a form that yield “9”. So, we have chosen like this:

1) numbers that are divisible by 3 can be represented as “3m”.

2) For numbers that are not divisible by 3, two possibilities…

numbers which give 1 as remainder : “3m + 1”

numbers which give 2 as remainder : “3m + 2”

It is 3, so remainder can not exceed 2.

Further you can refer here :