1 1 3 1 3 5 1 3 5 7 1 3 5 7 9 1 3 5 7 9 1 1 . . .
The above diagram shows the first few rows of the arrangement of odd numbers in ascending order (from left to right) with each row having one more number than its previous row.
What is the sum of all the numbers in the 100th row?
See Part 2 .
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.
Look who's the young Gauss! Well done. Keep up the good work!
That's what I did!
Log in to reply
Well then you deserve the challenge master's note too!
Well done.
r = 1 ∑ n 2 r − 1 = 2 r = 1 ∑ n r − r = 1 ∑ n 1 = n ( n + 1 ) − n = n 2 ∴ r = 1 ∑ 1 0 0 2 r − 1 = 1 0 0 2 = 1 0 0 0 0
That's the intended solution. Great!
Since sum to n terms is given by
S=n/2 (2a+(n-1)d)
Where,n is the number of terms,a is the first term and d is the common difference
Since for first row,n=1 and for 2nd row n=2
Therefore for 100th row,n=100,a=1,d=2
S=100/2 (2 (1)+(100-1)2)
S=10000
Yes, it's an arithmetic progression sum in disguise. Good work! A slightly simpler approach is to know the last term is 1 9 9 , then apply this formula instead 2 n ( first term + last term ) .
That's my initial plan. We think alike!
i had also used this method
We note that:
1 1 + 3 1 + 3 + 5 1 + 3 + 5 + 7 1 + 3 + 5 + 7 + 9 1 + 3 + 5 + 7 + 9 + 1 1 . . . ⇒ 1 + 3 + 5 + 7 + 9 + . . . + ( 2 n − 1 ) ⇒ 1 + 3 + 5 + 7 + 9 + . . . + 1 9 9 = 1 = 4 = 9 = 1 6 = 2 5 = 3 6 . . . = 1 0 0 2 = 1 2 = 2 2 = 3 2 = 4 2 = 5 2 = 6 2 . . . = n 2 = 1 0 0 0 0
Your solution is not rigorous enough. You didn't show that the sum of numbers of any n -th row equals to n 2 .
Just use the method gauss used to find sum for consecutive and apply it here
My exact same solution.
The first row contains one odd number, the second row contains two odd numbers, the third row contains three odd numbers..........
Similarly the hundredth row will contain 100 odd numbers.
Since the difference between every odd number is 2, we can see that the sequence of odd numbers is an AP, and can figure out the sum of n odd numbers, which is n 2 which here gives us 1 0 0 0 0
Nicely done. For clarity, you should justify your claim that "The sum of n odd numbers is n 2 ".
Good solution @Vaibhav Prasad
second row's last digit=2+(2-1)=3; third row's last digit=3+(3-1); hundredth row's last digit=100+(100-1)=100+99=199 ;; 1+3+5+7+.............+199=(1+2+3+4+.......+200)-(2+4+6+8+....+200) =20100-10100=10000
Think simple... We know that the sum of n odd numbers results in its square. So the sum of 100 odd numbers is equal to 100^2 = 10000
1st row = 1^2 2nd row = 2^2
So on...
so 100th row = 100^2 =10000
1 = 1 = 1 2
1 + 3 = 4 = 2 2
Using mathematical induction, let ∑ i = 1 k ( 2 i − 1 ) = k 2 be the induction hypothesis.
And then, we solve for n = k + 1 :
∑ i = 1 k + 1 ( 2 i − 1 ) =
∑ i = 1 k ( 2 i − 1 ) + ( 2 × ( k + 1 ) − 1 ) =
∑ i = 1 k ( 2 i − 1 ) + ( 2 k + 1 ) = (here we use the induction hypothesis)
k 2 + 2 k + 1 =
( k + 1 ) 2
Therefore, the summation of the first n odd integers can be represented as n 2 . So, the sum of all numbers in the 100th row is 1 0 0 2 = 1 0 0 0 0 .
That's right. Induction is also a simple approach.
Since the difference of the sums of the rows is a linear pattern (1,3,5,7...), we know that this is a quadratic equation. Since the equation of the difference is d=2x-1 (where x is the row number), we know that a in ax^2+bx+c must be 2/2 (because in the format mx+b, m is 2), or 1. If we go back and deduce the fact that the sum of the 0th row is 0 (because there are no numbers there!), we know that c must be 0. Plugging in the point (1,1), and solving for b will yield b=0. So the final equation is x^2. Now since we're asked to find the sum of all the numbers in the 100th row, we can simply perform 100^2, and get 10000.
Good observation that if the difference is linear, then the function is quadratic.
sum of first n odd numbers = n^2 and now , sum of first 100 odd numbers = 100^2 = 10000
in class 8th in our school we learned a method of finding squares by using odd numbers.
the method is:
for finding n ^{2} we just need to find the (sum of first n odd numbers). we can find a similar question here ;
so we just need to find n ^{2} to get the sum of n odd numbers
i.e.,100 ^{2}=10000 which is our answer. you can try this method for other numbers also for verification . Chung Kevin, a very good question.
Thanks! Glad that you enjoyed it.
On the 100th row there will be all odd numbers under 200, Each odd number has a corresponding number which when added together = 200 For example 1+199 or 3+197 Because there are 50 such pairs. The answer = 200 * 50 = 10000
Nice, pairing up the numbers make the sum obvious.
Log in to reply
actually it is Gauss's method of adding many consecutive numbers
See the pattern
n= 1 -----> 1 =1^2; n= 2 -----> 4 =2^2; n= 3. -----> 9 =3^2; n= 4. -----> 16 =4^2; . . . n = =======> n = n^2; so, <== > n=100 ------> 100^2 =10.000
The sum of an arithmetic series is:
S= (n/2)(a1-an)
Where n represents the number of terms.
The 100th odd number is 199.
Therefore, we have:
S = (100/2)(1+199)=(50)(200)=10000
we need to compute sum (2n-1) ; n=1 to 100 --- Odd numbers
= {sum (n); n=1 to 199 } - {sum(2n); n=1 to 99} --- sum of series minus sum of even numbers
= 199 200/2 - 2 99 100/2 = (199-99) 100 = 10000
The sum of the numbers in n th row = n^2
So the answer = 100^2 = 10000
I noticed that the sum of each row n corresponds to the square of n . Therefore the sum of the numbers in the 100th row would be the square of 100 which is 10000.
Problem Loading...
Note Loading...
Set Loading...
We are trying to find the sum of first 100 odd integers i.e, 1,3,5,.....199.
Split the sum into the following pairs,
1 + 1 9 9 = 2 0 0
3 + 1 9 7 = 2 0 0
5 + 1 9 5 = 2 0 0 . . . .
. . . . . 9 9 + 1 0 1 = 2 0 0
We find that each of these have sum equal to 2 0 0 .
And there are 5 0 pairs of numbers. So the sum is 5 0 × 2 0 0 = 1 0 , 0 0 0