Sum of digits of $11\dots 11^2$ where $11\dots 11$ is a 1992 digit number with all digits $1$ I read this on a non-math forum where the OP says this is a question for Grade 6 elementary school students. Grade 6 elementary school level is somehow ambiguous but clearly this means no advanced math tool can be used. (Maybe some elementary modulo arithmetic is allowed?)
I tried in the most dumb way:
Since we know that $11\dots 1^2$ of $n\leq 9$ digits of $1$'s is $123\dots n \dots 321$ because $11\dots 1^2 = 11\dots 1 \times \sum^{n-1}_{m=0}10^m$ (which explains why the answer is $1$ goes to $n$ then goes back to $1$). So we can say $11\dots 11^2$ is to add up (digit number) of $1$, put it on that digit, and sum them up. Then we apply on $n>9$ and observe the process.
This seems promising or at least manageable. You count the number of $1$'s that are involved in computing number on the digit, and add carries from lower digits. For example, on the 102nd digits this will be $102+11+1=114$, so the carry is $11$, number of 102nd digit is $4$. Finally sum all digits up.
The work involved seems way too immense and is not beautiful. Anyone has some clever ideas about this question?
(The result is $17910$ and the original post is in Chinese, so I don't want to put the link here)
 A: This is not particularly pretty but I figured I'd share the complications which arise in using this method. If you multiply this out the way that most elementary students are taught to multiply numbers (at least in the US), you'll have a sum of the form $(11\ldots11)\sum_{i=1}^{1992}10^i$, lined up into $1991*2+1=3983$ columns. In the first column, there will be a single 1. In the second, there will be two, etc. Therefore the first nine digits will be $\ldots987654321$. The tenth digit will be a 0 and will be followed by a 2, instead of 1, owing to the 'carried' digit from when we reached the column which had 10 ones in it. More succinctly, the half of this expansion where the number of 1s in each column is increasing, will contribute $(11\ldots11)^2=\sum_{i=1}^{N} i(10)^{i-1}$ (where $N$ is the number of digits of the square) to the entire product. This pattern will continue until we get halfway through the total number of digits of the product. That is to say that every nine digits will cycle through $\ldots098765432\ldots$ It will only be nine because we 'skip' the ones, owing to the carried digits. Once we are precisely half way through the columns, the number of ones in each column will begin decreasing with every additional column. However, when we reach a column with $10^n+1$ 1s in it, there will no longer be any reason to skip it. However, when we get to a column which contains $10^n$ 1s in it, we will add $n$ to the next column, but only $n-1$ to the column after that. Hence, we will be skipping $8$s now. That is, after the halfway mark, we will see $12320$ (since $1992 \mod 9=3$) and then the digits will cycle through $\ldots123456790\ldots$. We are now ready to compute our grand total. The first 9 digits will contribute $1+2+3+4+5+6+7+8+9=45$. Since $1989/9= 221$, we will then have 220 cycles of $098765432$, each of which will contribute 44. We will also have $\ldots12320\ldots$ in the center which will contribute $8$ and then 221 cycles of$\ldots123456790\ldots$, each of which will contribute 37. $45+(220*44)+8+(221*37)=17910$. I have a hard time believing that there are more than a handful of sixth graders in the world capable of this sort of math. 
A: Sum $=9n+((n \bmod 9)-9) (n \bmod 9)$ where $n=$ number of digits.
Check:
n = 1992;
9 n + (Mod[n, 9] -9) Mod[n, 9]
Total@IntegerDigits[FromDigits[ConstantArray[1, n]]^2]

