Answer:
1. 204 squares
2.
![\displaystyle S_n=\sum_(i=1)^(i=n)i^2=(n(n+1)(2n+1))/(6)](https://img.qammunity.org/2020/formulas/mathematics/middle-school/7dc6511qv4bng8o7gbec60hnth8fzl89xl.png)
3.
![\displaystyle S_(10)=385](https://img.qammunity.org/2020/formulas/mathematics/middle-school/hb40h11i0sd1737fx8m1lc313pnzds805j.png)
![\displaystyle S_(100)=338,350](https://img.qammunity.org/2020/formulas/mathematics/middle-school/w1jbapveasv569pzbmjpknqcor0dyiqhzj.png)
![\displaystyle S_(N)=(N(N+1)(2N+1))/(6)](https://img.qammunity.org/2020/formulas/mathematics/middle-school/ebvrs4ytua5sx2q8qw37caost70sqoi037.png)
Explanation:
Counting And Adding
Counting is a normal activity done by humans and (supposedly) even by animals. But when the count tends to be a repetitive and long proccess, we try to look for formulas to shorten our work. That is where summation comes in handy.
1. Mr. Reihl's floor looks like a 8x8 chess board, half of the tiles are black and half are white. We need to count how many squares are in that floor, including overlapping and bigger squares.
The first and most obvious count comes when each square is of 1x1 size. There are 8 rows and 8 columns of each, so there are 8^2 1x1 squares
When we count all the 2x2 squares, we find a total of 7 different (overlapping) squares in the first row (2 rows high). If we move one square down, we find another row of 7 different overlapping squares. We can move down until we find the 7th row. We have counted 7^2 2x2 different squares.
Let's take 3x3 squares. Following a similar procedure as before, we can find 6x6 of them, and so on until we find our giant 8x8 single square.
How many squares have we count? It's represented by the sum of squares from 1 to 8:
![S=1^2+2^2+3^2+4^2+5^2+6^2+7^2+8^2](https://img.qammunity.org/2020/formulas/mathematics/middle-school/hq5nhyglxkpf017msdgsrh9h83hair6kgk.png)
By manually adding all of them, we find S=204 different squares
2. We have already shown a pattern for the sum. We asked ourselves: will there be a formula to find that sum automatically (go figure if there is a 100x100 tile floor!)? The answer is yes, we can compute the sum of n squares with the formula .
![\displaystyle S_n=\sum_(i=1)^(i=n)i^2=(n(n+1)(2n+1))/(6)](https://img.qammunity.org/2020/formulas/mathematics/middle-school/7dc6511qv4bng8o7gbec60hnth8fzl89xl.png)
If we apply the formula for n=8, we get
![\displaystyle S_8=\sum_(i=1)^(i=8)i^2=(8(8+1)(2(8)+1))/(6)=(1224)/(6)=204](https://img.qammunity.org/2020/formulas/mathematics/middle-school/7dslokdiavnuz5oopxcot1jl0xuak2a99m.png)
The sum was found to be 204, as it did before. It allows us to generalize our results .
3. If n=10
![\displaystyle S_(10)=(10(11)(21))/(6)=(2310)/(6)=385](https://img.qammunity.org/2020/formulas/mathematics/middle-school/7cnma9o6bbum9v0ue53hbl9g0l9y97tyjc.png)
If n=100
![\displaystyle S_(100)=(100(101)(201))/(6)=(2,030,100)/(6)=338,350](https://img.qammunity.org/2020/formulas/mathematics/middle-school/gmwdyyj7un468n177ewm4ctd0ev9pg7ldz.png)
Finally, if n=N (any integer positive number)
![\displaystyle S_(N)=(N(N+1)(2N+1))/(6)](https://img.qammunity.org/2020/formulas/mathematics/middle-school/ebvrs4ytua5sx2q8qw37caost70sqoi037.png)