This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let n be an integer. If n = ∑ i = 0 N a i 1 0 i where a i ∈ { 0 , … , 9 } , then we know that n ≡ i = 0 ∑ N a i 1 0 i ≡ i = 0 ∑ N a i 1 i ≡ i = 0 ∑ N a i ( m o d 3 ) . This means that the remainder of n when divided by 3 is the same as the remainder of the sum of the digits of n when divided by 3 . The numbers 1 2 3 , 4 5 6 , 7 8 9 , 1 0 1 1 1 2 , … , 9 7 9 8 9 9 are all divisible by 3 since the remainder of the sum of the digits of each of these numbers when divided by 3 is the sum of the remainder of the digits of a number which is congruent to 1 ( m o d 3 ) another which is congruent to 2 ( m o d 3 ) and a third which is divisible by 3 : 1 2 3 ≡ 1 + 2 + 3 ≡ 1 + 2 + 0 ≡ 0 ( m o d 3 ) 4 5 6 ≡ 4 + 5 + 6 ≡ 1 + 2 + 0 ≡ 0 ( m o d 3 ) 7 8 9 ≡ 7 + 8 + 9 ≡ 1 + 2 + 0 ≡ 0 ( m o d 3 ) … 9 7 9 8 9 9 ≡ 9 7 + 9 8 + 9 9 ≡ 1 + 2 + 0 ≡ 0 ( m o d 3 ) . By juxtaposing all these numbers together, the number 1 2 3 4 5 6 7 8 9 … 9 7 9 8 9 9 is also divisible by 3 since the sum of the digits of this number is the sum of the digits of all the numbers above 1 2 3 4 5 6 7 8 9 … 9 7 9 8 9 9 ≡ 1 2 3 + 4 5 6 + 7 8 9 + ⋯ + 9 7 9 8 9 9 ≡ 0 + 0 + 0 + ⋯ + 0 ≡ 0 ( m o d 3 ) . By finally juxtaposing 1 0 0 , the number 1 2 3 4 5 6 7 8 9 … 9 8 9 9 1 0 0 is congruent to 1 ( m o d 3 ) because 1 2 3 4 5 6 7 8 9 … 9 8 9 9 1 0 0 ≡ 1 2 3 4 5 6 7 8 9 … 9 8 9 9 + 1 + 0 + 0 ≡ 0 + 1 + 0 + 0 ≡ 1 ( m o d 3 ) . Finally, this number is even and of the form 3 n + 1 so by the chinese remainder theorem, this number is congruent to 4 ( m o d 6 ) .