document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=556480>Question 556480</A>: <I><SPAN STYLE=\"word-break: break-all;\"> How do you set up an indirect proof & solve it? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #362222 by </B><A HREF=/tutors/aboutme.mpl?userid=richard1234><B>richard1234(7193)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=richard1234><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=richard1234><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=362222\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> Assume the opposite of what you are trying to prove is true, find a contradiction. \r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "For example, if you wanted to prove that there are infinitely many prime numbers, first assume that there are a finite number of primes. If you let N = 2*3*5*7*...*p where p is the \"largest\" prime, then N+1 must either be prime or be the product of two primes. However, N+1 cannot be divisible by any prime less than or equal to p, so if N+1 is composite, a larger prime divides it --> contradiction. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );