How many different ways can the number 131,072 be expressed as a sum of 2 or more positive consecutive integers?
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.
Note that , 1 3 1 0 7 2 We can restate the question as i = 1 ∑ n i − j = 1 ∑ m j ⟹ 2 n × ( n + 1 ) − 2 m × ( m + 1 ) n × ( n + 1 ) − m × ( m + 1 ) ( n 2 − m 2 ) + ( n − m ) ( n − m ) ( n + m + 1 ) Note that, n − m ( m o d 2 ) ⟹ n − m ( m o d 2 ) ⟹ one of ( n − m ) , ( n + m + 1 ) ⟹ ( n − m ) ( n + m + 1 ) ⟹ ( n − m ) ( n + m + 1 ) ⟹ 2 1 7 cannot be expressed = 2 1 7 = 2 1 7 ( n − m ) ≥ 2 = 2 1 7 = 2 1 8 = 2 1 8 = 2 1 8 ≡ n − m + 2 m ( m o d 2 ) ≡ n + m ( m o d 2 ) is odd = 2 n × p , where p is odd = 2 1 8 as the sum of consecutive positive integers for any string length ≥ 2