document.write( "Question 500690: One of the most famous unsolved problems in mathematics is a conjecture
\n" );
document.write( "made by Christian Goldbach in a letter to Leonhard Euler in 1742. The
\n" );
document.write( "conjecture made in this letter is now known as Goldbach’s Conjecture. The
\n" );
document.write( "conjecture is as follows:\r
\n" );
document.write( "\n" );
document.write( "Every even integer greater than 2 can be expressed as the sum of two
\n" );
document.write( "(not necessarily distinct) prime numbers.\r
\n" );
document.write( "\n" );
document.write( "Currently, it is not known if this conjecture is true or false, although most
\n" );
document.write( "mathematicians believe it to be true.
\n" );
document.write( "(a) Describe one way to prove that Goldbach’s Conjecture is false.
\n" );
document.write( "(b) Prove the following:
\n" );
document.write( "If there exists an odd integer greater than 5 that is not the sum of
\n" );
document.write( "three prime numbers, then Goldbach’s Conjecture is false. \n" );
document.write( "
Algebra.Com's Answer #338234 by solver91311(24713)![]() ![]() You can put this solution on YOUR website! \r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "1. Find an even integer greater than 2 that cannot be expressed as the sum of two prime numbers.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "2. Let \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "John \n" ); document.write( " \n" ); document.write( "My calculator said it, I believe it, that settles it \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " |