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.
Lets first try to develop a pattern:
1 2 = 1 | 1 = 1 2
1 1 2 = 1 2 1 | 1 + 2 + 1 = 2 2
1 1 1 2 = 1 2 3 2 1 | 1 + 2 + 3 + 2 + 1 = 3 2
1 1 1 1 2 = 1 2 3 4 3 2 1 | 1 + 2 + 3 + 4 + 3 + 2 + 1 = 4 2
.
.
.
1 1 1 1 1 1 1 1 1 1 2 = 1 2 3 4 5 6 7 8 9 8 7 6 5 4 3 2 1 | 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1 = 9 2
1 1 1 1 1 1 1 1 1 1 1 2 = 1 2 3 4 5 6 7 8 9 0 0 9 8 7 6 5 4 3 2 1 | 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 0 + 0 + 9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1 = 1 2 + 9 2
The pattern that appears is every time 9 ones are added, the sum of its digits increase by 9 2 (after the number is squared). While every individual 1 added, increases the value being squared by 1 (after the number is squared). Using this, we can divide the number of ones N has, by 9 . This leaves us with: 2 0 1 8 = ( 2 2 4 x 9 ) + 2 . So the final equation will have to include the 2 2 4 sets of 9 2 and also 2 2 for the remainder of 2 .