document.write( "Question 1105540: A series of 567 consecutive integers has a sum that is a perfect cube. Find the smallest possible positive sum for this series. \n" ); document.write( "
Algebra.Com's Answer #720383 by Alan3354(69443)\"\" \"About 
You can put this solution on YOUR website!
A series of 567 consecutive integers has a sum that is a perfect cube. Find the smallest possible positive sum for this series.
\n" ); document.write( "---------
\n" ); document.write( "If zero is considered to be positive, the answer is zero (0).
\n" ); document.write( "---------
\n" ); document.write( "If not:
\n" ); document.write( "283 negative consecutive integers, then 0, then 283 positive consecutive integers has a sum of zero (0).
\n" ); document.write( "Moving the start, the smallest integer up 1 adds 567 to the sum.
\n" ); document.write( "567 = 21*27 = 21*3^3
\n" ); document.write( "--> \"21%5E3%2A3%5E3\" is the smallest sum.
\n" ); document.write( "= 63^3
\n" ); document.write( "= 250047
\n" ); document.write( "
\n" ); document.write( "
\n" );