1 + 2 1 + 2 + 3 + ⋯ + 1 4 1 + 2 + 3 + ⋯ + 8 4 = = = 3 1 5 + 1 6 + ⋯ + 2 0 8 5 + 8 6 + ⋯ + 1 1 9
The above 3 equations show that the sum of the first few consecutive positive integers can also be expressed as the sum of the subsequent (but fewer) consecutive integers.
What is the smallest integer n > 8 4 such that 1 + 2 + 3 + ⋯ + n can be expressed as ( n + 1 ) + ( n + 2 ) + ⋯ + ( n + m ) for some positive integer m ?
Bonus: Generalize this.
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.
Very nicely done!
Just a typo k instead of 2 in t k + 8 m k = ( 3 − 8 ) 2
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Pell's Equation
Recall the the algebraic identity , 1 + 2 + 3 + ⋯ + N = 2 1 N ( N + 1 ) .
⇔ ⇔ ⇔ 1 + 2 + ⋯ + n = ( n + 1 ) + ( n + 2 ) + ⋯ + ( n + m ) 2 [ 1 + 2 + ⋯ + n ] = 1 + 2 + ⋯ + ( n + 1 ) + ( n + 2 ) + ⋯ + ( n + m ) n ( n + 1 ) = 2 ( n + m ) ( n + m + 1 ) n 2 − ( 2 m − 1 ) n − m ( m − 1 ) = 0
with the quadratic formula we get n = 2 2 m − 1 + 8 m 2 + 1 we know that n is a positive integer so we must have 8 m 2 + 1 = t 2 for some positive integer t .
Consider a Pell's equation , t k 2 − 8 m k 2 = 1 with a fundamental solution ( t 1 , m 1 ) = ( 3 , 1 ) we can construct a family of solution with t k + 8 m k = ( 3 + 8 ) 2 . Put k = 1 , 2 , 3 , 4 , … and we notice that the next solution of n > 8 4 occurs when k = 4 which gives us m = 2 0 4 , t = 5 7 7 .
n = 2 2 ⋅ 2 0 4 − 1 + 5 7 7 = 4 9 2 .