How long is this street?

Let the houses on a street from left to right are numbered 1 through n n in that order. There is a house on the street situated in such a way that the sum of cubes of house numbers to its left is equal to the sum of cubes of house numbers to its right. If 1 n 1 0 7 1\le n\le 10^7 , give the sum of all possible values of n n ?

Assume that if there is no house at any side (left or right), the sum of that side is taken to be 0.

Bonus : What are the solutions for n > 1 0 7 n>10^7 ?


The answer is 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.

1 solution

Mark Hennings
Aug 26, 2016

If we choose house number a a , then we require 1 4 a 2 ( a 1 ) 2 = 1 4 n 2 ( n + 1 ) 2 1 4 a 2 ( a + 1 ) 2 2 a 2 ( a 2 + 1 ) = n 2 ( n + 1 ) 2 = [ n ( n + 1 ) ] 2 \begin{array}{rcl} \tfrac14a^2(a-1)^2 & = & \tfrac14n^2(n+1)^2 - \tfrac14a^2(a+1)^2 \\ 2a^2(a^2+1) & = & n^2(n+1)^2 \; = \; \big[n(n+1)\big]^2 \end{array} Thus we deduce that 2 ( a 2 + 1 ) 2(a^2+1) must be a perfect square. Since 2 ( a 2 + 1 ) 2(a^2+1) is even, we deduce that it must be equal to the square ( 2 b ) 2 (2b)^2 of an even number, and hence a 2 + 1 = 2 b 2 a^2 + 1 = 2b^2 , with n ( n + 1 ) = 2 a b n(n+1) = 2ab .

Thus we are looking for positive integer solutions of the equations a 2 2 b 2 = 1 n ( n + 1 ) = 2 a b a^2 - 2b^2 \; = \; -1 \qquad n(n+1) \; = \; 2ab for n < 1 0 7 n < 10^7 . The positive integer solutions of a 2 2 b 2 = 1 a^2 - 2b^2 = -1 are given by the formula a k + b k 2 = ( 2 + 1 ) 2 k + 1 k N { 0 } . a_k + b_k\sqrt{2} \; = \; \big(\sqrt{2}+1\big)^{2k+1} \qquad k \in \mathbb{N} \cup \{0\} \;. and the matching value of n n is the positive solution n k n_k of the equation n ( n + 1 ) = 2 a k b k n(n+1) = 2a_kb_k .

The resulting value of n k n_k is less than 1 0 7 10^7 just when 0 k 8 0 \le k \le 8 , and of these 9 9 cases n k n_k is an integer only when k = 0 k=0 , in which case n 0 = 1 n_0=1 .

The only value of n n that works is n = 1 n=\boxed{1} .

This is exactly the way I did it. I actually guess that the only solution to the last equation involving a k , b k a_k, b_k should be 1 , 1 1,1 , for any range of n n , but couldn't show that.

Samrat Mukhopadhyay - 4 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...