document.write( "Question 1097613: If three numbers are consecutive positive integers
\n" ); document.write( "and five times the square of the largest number is
\n" ); document.write( "greater than two times the sum of the squares of
\n" ); document.write( "the other two numbers by 75, then the sum of the
\n" ); document.write( "smallest and the largest of these numbers is
\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #712054 by KMST(5328)\"\" \"About 
You can put this solution on YOUR website!
I would call the three consecutive positive integers
\n" ); document.write( "\"n-1\" , \"n\" , and \"n%2B1\" .
\n" ); document.write( "
\n" ); document.write( "Five times the square of the largest number is
\n" ); document.write( "\"5%28n%2B1%29%5E2\" .
\n" ); document.write( "
\n" ); document.write( "Two times the sum of the squares
\n" ); document.write( "of the other two numbers is
\n" ); document.write( "\"2%28n%5E2%2B%28n-1%29%5E2%29\" .
\n" ); document.write( "
\n" ); document.write( "The question states that the first expression above
\n" ); document.write( "is greater than the second one by 75.
\n" ); document.write( "That can be expressed as
\n" ); document.write( "\"5%28n%2B1%29%5E2=2%28n%5E2%2B%28n-1%29%5E2%29%2B75\" .
\n" ); document.write( "
\n" ); document.write( "We can simplify that equation and solve for \"n\" .
\n" ); document.write( "If we find one or more solutions that is/are positive and integer,
\n" ); document.write( "we almost have the answer,
\n" ); document.write( "because what we want to find is the sum of the
\n" ); document.write( "smallest and the largest of the three consecutive positive integers,
\n" ); document.write( "and that would be \"%28n-1%29%2B%28n%2B1%29=n-1%2Bn%2B1=2n\" .
\n" ); document.write( "
\n" ); document.write( "Solving \"%28n%2B1%29%5E2=2%28n%5E2%2B%28n-1%29%5E2%29%2B75\" :
\n" ); document.write( "\"5%28n%2B1%29%5E2=2%28n%5E2%2B%28n-1%29%5E2%29%2B75\"
\n" ); document.write( "\"5%28n%5E2%2B2n%2B1%29=2%28n%5E2%2Bn%5E2-2n%2B1%29%2B75\"
\n" ); document.write( "\"5n%5E2%2B10n%2B5=2%282n%5E2-2n%2B1%29%2B75\"
\n" ); document.write( "\"5n%5E2%2B10n%2B5=4n%5E2-4n%2B2%2B75\"
\n" ); document.write( "\"5n%5E2%2B10n%2B5=4n%5E2-4n%2B77\"
\n" ); document.write( "\"5n%5E2%2B10n%2B5-4n%5E2%2B4n-77=0\"
\n" ); document.write( "\"n%5E2%2B14n-72=0\"
\n" ); document.write( "\"%28n%2B18%29%28n-4%29=0\" --> \"system%28n--18%2C%22or%22%2Cn=4%29\"
\n" ); document.write( "The only possible answer comes from the positive integer \"n=4\" ,
\n" ); document.write( "and the answer is \"2n=2%2A4=highlight%288%29\"
\n" ); document.write( "
\n" );