document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1042856>Question 1042856</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Let a, b, n &#8712; Z with n > 1. Prove that if a &#8801; b (mod n) then 2a &#8801; 2b (mod n)<BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #658003 by </B><A HREF=/tutors/aboutme.mpl?userid=jim_thompson5910><B>jim_thompson5910(35256)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=jim_thompson5910><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/images/nopicture.jpg><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=658003\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> a = b (mod n) is the same as saying a-b = k*n where k is some integer.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Multiply both sides of a-b = k*n by 2 to get 2a-2b = 2kn\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "2a-2b = 2kn can be then written in the form 2a = 2b (mod n). So that wraps up the proof.  </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );