document.write( "Question 254093: Find the smallest possible integer value of n for which 8008n is a perfect square \n" ); document.write( "
Algebra.Com's Answer #186489 by Edwin McCravy(20065)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "We break \"8008\" down into a product of prime factors\r\n" );
document.write( "\r\n" );
document.write( "\"8008+=+2%2A2%2A2%2A7%2A11%2A13\"\r\n" );
document.write( "\r\n" );
document.write( "Every perfect square contains exactly an even number of each\r\n" );
document.write( "of its prime factors. The product above needs a minimum of one \r\n" );
document.write( "more \"2\", one more \"7\", one more \"11\", and one more \"13\" to have an \r\n" );
document.write( "even number of each of the prime factors 2,7,11,and 13.\r\n" );
document.write( "That is, it needs to be multiplied by \"2%2A7%2A11%2A13\" or \"2002\"\r\n" );
document.write( "\r\n" );
document.write( "Thus if n = \"2002\", we have\r\n" );
document.write( "\r\n" );
document.write( "\"8008n+=+8008%282002%29+=++16032016+=+4004%5E2\"\r\n" );
document.write( "\r\n" );
document.write( "Edwin

\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" );