document.write( "Question 694702: This one is kinda urgent..please i will appreciate ANY kind of help-
\n" );
document.write( "\"Imagine that you are on a street
\n" );
document.write( "with houses marked 1 through n. There is a
\n" );
document.write( "house in between (x) such that the sum of
\n" );
document.write( "the house numbers to left of it equals the
\n" );
document.write( "sum of the house numbers to its right. If n is
\n" );
document.write( "between 50 and 500, what are n and x?\" \n" );
document.write( "
Algebra.Com's Answer #428483 by KMST(5328)![]() ![]() You can put this solution on YOUR website! I do not see the whole elegant solution, but maybe this helps. \n" ); document.write( "A sum of consecutive house numbers is the sum of an arithmetic sequence/progression, which can be calculated as the average of the first and last terms, times the number of terms. \n" ); document.write( "The sum of the numbers of the houses to one side is \n" ); document.write( "1+2+3+ ... +(x-2)+(x-1)= \n" ); document.write( "The sum of the numbers of the houses to the other side is \n" ); document.write( "(x+1)+(x+2)+ ... +(n-1)+n= \n" ); document.write( " \n" ); document.write( "So \n" ); document.write( "Since they are consecutive integers, \n" ); document.write( " \n" ); document.write( "For their product to be twice a perfect square, we need two perfect squares with no common factors: \n" ); document.write( "one perfect square will be a factor of \n" ); document.write( "and another perfect square will be a factor of \n" ); document.write( "Calling the larger one \n" ); document.write( "either \n" ); document.write( "or \n" ); document.write( "for some mutually prime positive integers \n" ); document.write( "whose squares must be between \n" ); document.write( "Since \n" ); document.write( "As the larger square \n" ); document.write( "We are looking for a pair such that the square of the larger number is one more or one less than double the square of the smaller number. \n" ); document.write( "We try numbers from 5 on as the smaller number \n" ); document.write( "I tried them making a table, which is hard for me to render here, so I will just show the calculations. \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "The pair \n" ); document.write( "so \n" ); document.write( "and \n" ); document.write( " \n" ); document.write( "Since we expect only one solution, we could stop here. \n" ); document.write( "Otherwise we would try further to see that nothing else works. \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " |