document.write( "Question 141833: Find a counterexample to show that the following statement is incorrect:
\n" );
document.write( "\"The sum of any two odd numbers is divisible by 4\"
\n" );
document.write( "If I try 1 + 5 = 6, 6/4 = 3/2, does this disprove the above statement? \n" );
document.write( "
Algebra.Com's Answer #103317 by jojo14344(1513)![]() ![]() ![]() You can put this solution on YOUR website! If you start with #1 then add the next higher odd #, the chance of being divisible by 4 is 50%. Meaning the 1st sequence of odd #'s will be, then the next won't, next will be, next won't, next will be...next won't. To show, \n" ); document.write( "Starting at 1, \n" ); document.write( "1+3=4, yes \n" ); document.write( "1+5=6, no \n" ); document.write( "1+7=8, yes \n" ); document.write( "1+9=10, no \n" ); document.write( "1+11=12, yes \n" ); document.write( "1+13=14, no \n" ); document.write( "1+15=16, yes \n" ); document.write( "1+17=18, no \n" ); document.write( "1+19=20, yes... \n" ); document.write( "So you see the sequence, it is every other pair it is divisible by 4. \n" ); document.write( "Hope this help. \n" ); document.write( "Thank You, \n" ); document.write( "Jojo \n" ); document.write( " |