document.write( "Question 156186: Mathematical induction is a two-step process that tests the truthfulness of
\n" );
document.write( "mathematical formulas. How many “falsehoods” have to be found to prove a theorem to
\n" );
document.write( "be false?
\n" );
document.write( "a. 3, to break the tie
\n" );
document.write( "b. 2, just to be sure
\n" );
document.write( "c. It only takes one
\n" );
document.write( "d. You can never prove a theory to be false, only true \n" );
document.write( "
Algebra.Com's Answer #117361 by Alan3354(69443) You can put this solution on YOUR website! Mathematical induction is a two-step process that tests the truthfulness of \n" ); document.write( "mathematical formulas. How many “falsehoods” have to be found to prove a theorem to \n" ); document.write( "be false? \n" ); document.write( "a. 3, to break the tie \n" ); document.write( "b. 2, just to be sure \n" ); document.write( "c. It only takes one \n" ); document.write( "d. You can never prove a theory to be false, only true \n" ); document.write( "------------------ \n" ); document.write( "c, just 1. If a formula or theory isn't applicable all the time, it's discarded. \n" ); document.write( " |