1 3 5 7 9 1 1 1 3 1 5 1 7 1 9 2 1 2 3 2 5 2 7 2 9 3 1 3 3 3 5 3 7 3 9 4 1 . . .
The above diagram shows the first few rows of the arrangement of odd numbers in ascending order 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 1 .
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.
Yes correct. Your phrasing could be improved on but you got the gist of the problem. Good job! However, there's still a simpler solution, can you find it?
sum of the 5050th first odd integers => S = 5050/2 (1+10099)
sum of the 4950th first odd integers => s = 4950/2(1+9899)
S-s=1000000
not so sure if it is simpler, but a bit different. Sorry for the phrasing :\
Log in to reply
Sounds like you got it first!Congrats Paulo!
By the way if you want I can correct your formatting and write your solution in LaTeX.
@Mayank Raj 's solution is pretty neat and that didn't come to my mind at first , however, I used a different approach which is much more formal and well TBH I like it better:
First off lets see what is the starting number in the 100th row.
Defining r n as the starting number for row n we have:
r 1 = 1 → r 2 = r 1 + 2 → r 3 = r 2 + 4 = r 1 + 2 + 4 → …
→ r n = r 1 + i = 1 ∑ n − 1 2 i
H e n c e r 1 0 0 = 1 + i = 1 ∑ 9 9 2 i = 1 + 2 ( 1 + 2 + 3 + ⋯ + 9 9 ) = 9 9 0 1
Now let's see what's the ending number:
Defining r e ( n ) as the ending number for the row n we have:
r e ( 1 ) = r 1 = 1 → r e ( 2 ) = r 2 + 2 → r e ( 3 ) = r 3 + 2 × 2
→ ⋯ → r e ( n ) = r n + 2 ( n − 1 )
H e n c e r e ( 1 0 0 ) = 9 9 0 1 + 2 ( 9 9 ) = 1 0 0 9 9
It is pretty much obvious the fact that the n th row has n number of elements so now by AM-sequence-summation formula we have:
S 1 0 0 = 2 1 0 0 × ( 9 9 0 1 + 1 0 0 9 9 ) = 1 0 0 0 0 0 0
There's a simpler solution. Hint: Big triangle − Small triangle .
Ah.. got it by the same approach
Hmm I too did it the same way
A closer look will help in this problem FIRST ROW ---
1
=
1
3
SECOND ROW ---
3
+
5
=
8
=
2
3
THIRD ROW---
7
+
9
+
1
1
=
2
7
=
3
3
SIMILARLY 100TH ROW----SUMMATION OF NUMBERS=
1
0
0
3
=
1
0
0
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 3 .
Mayank Raj Sorry if I'm being rude by posting a complementary solution to yours but since it's long past the time the challenge master asked you to prove your guess I thought I could do that for you:
According to my own answer we have:
r n = r 1 + i = 1 ∑ n − 1 2 i
r e ( n ) = r n + 2 ( n − 1 )
S n = 2 n ( r e ( n ) + r n ) = 2 n ( r 1 + i = 1 ∑ n − 1 2 i + r n + 2 ( n − 1 )
= 2 n ( r 1 + i = 1 ∑ n − 1 2 i + r 1 + i = 1 ∑ n − 1 2 i + 2 ( n − 1 )
= 2 n ( 2 + 4 i = 1 ∑ n − 1 i + 2 n − 2 )
= 2 n ( 4 ( 2 ( n ) ( n − 1 ) ) + 2 n ) = 2 n ( 2 ( n ) ( n − 1 ) + 2 n ) = 2 n ( 2 n 2 )
H e n c e S n = n 3
Observant.
good observation man
Yeah, pretty easy.
How so? What reason have you come up to this conclusion?
Its obvious that sum of any row equals to n^3.Lets prove it
since sum to n terms is given by
S=n/2 (2a+(n-1)d)
Where,n is no.of terms,a is the first term d is the common difference.
For nth row,
S=n/2 (2a+(n-1)2)
S=n/2 (2a+2n-2)
Now we will find a for nth row
Since for 1st row,a=1=n
2nd row,a=3=n+1
3rd row,a=7=n+(2)^2
4th row=a=13=n+(3)^2
Hence we can create a general formula for a of nth row
a=n+(n-1)^2
Putting this in thr eq of S
Hence,S=n/2 (2 (n+(n-1)^2+2n-2)
S=n/2 (-2n+2n^2 + 2 +2n-2)
S=n^3
which is the general formula for sum of any row
For n=100
S=100^3
s=1000000
Your proof of general formula for a of nth row is not rigorous enough. You have only observed a small number of rows to make your claim. However, you solution is intriguing nonetheless.
Problem Loading...
Note Loading...
Set Loading...
Note that the total number of elements in the triangle is the sum of the first 100 integers. Because line 1 has 1 element, line 2 has two, up to 100 on the last line.
Then, using the formula for the sum of the first 100 integers, S=100/2 * (100+1) we get 5050. So the last integer in the last line will be the 5050th odd integer,and the first one in this line will be the 4951th odd integer. Those are, respectively, 10099 and 9901. (you can get them both by using An=1+(n-1)*2, which gives you the n-th odd number)
Now we just have to sum all the odd integers from 9901 to 10099, which we can do by using the same formula used to sum the first 100 integers. S=100/2 * (9901+10099) = 1000000, and we get our result.