If 1 + 3 + 5 + 7 + ⋯ + 2 0 1 5 + 2 0 1 7 = n 2 , then what is n ?
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.
If you add one to the last number and divide by two, you will get n since all the numbers will be equal to 1009*1009 so the answer is 1009. If you want proof, ( 2 0 1 7 + 1 ) ∗ ( 2 0 1 8 / 4 ) = ± 1 0 0 9 .
Let S be the sum of all positive odd integers up to m . For instance, all positive odd integers up to 9. S = 1 + 3 + 5 + 7 + 9 = 2 5 Let k be the number of odd integers, then S = k 2 (I will not feature the proof in this solution). For example, if I want to find the sum of all odd positive integers up to m , then S = ( 2 m + 1 ) 2 . Here, m = 2 0 1 7 , hence S = ( 2 2 0 1 7 + 1 ) 2 = 1 0 1 8 0 8 1 = n 2
n = 1 0 1 8 0 8 1 = 1 0 0 9
Let
a
k
be an arithmetic sequence with common difference
d
=
2
and first term
a
1
=
1
. Then:
a
k
=
a
1
+
d
(
k
−
1
)
⇒
a
k
=
2
k
−
1
Let i be the natural number for which:
a
i
=
2
0
1
7
⇒
2
i
−
1
=
2
0
1
7
⇒
i
=
1
0
0
9
.
The wanted sum is the sum of the first
i
terms of
a
k
which is:
S
i
=
2
i
(
a
1
+
a
i
)
⇒
S
1
0
0
9
=
2
1
0
0
9
2
0
1
8
⇒
n
2
=
1
0
0
9
2
⇒
n
=
±
1
0
0
9
Problem Loading...
Note Loading...
Set Loading...
S n = 1 + 3 + 5 + 7 + ⋯ + ( 2 n − 1 ) = k = 1 ∑ n ( 2 k − 1 ) = 2 2 n ( n + 1 ) − n = n 2
For 2 n − 1 = 2 0 1 7 , ⟹ n = 1 0 0 9 , ⟹ S 1 0 0 9 = 1 0 0 9 2 , ⟹ n = ± 1 0 0 9