document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=8893>Question 8893</A>: <I><SPAN STYLE=\"word-break: break-all;\"> the gcf of two numbers is 850 neither number is divisible by the other.what is the smallest that theese numbers could be </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #4850 by </B><A HREF=/tutors/aboutme.mpl?userid=khwang><B>khwang(438)</B></A><img src=\"/images/stars/stars-10.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=khwang><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=4850\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\">  If d is the gdf of A & B , then<BR>\n" );
document.write( " A = d r and B = d s for some integers & s.<BR>\n" );
document.write( " Also, if r & s (>1) are relatively prime then neither A nor B <BR>\n" );
document.write( " is divisible by another.\r<BR>\n" );
document.write( "\n" );
document.write( " Here,the gcf d= 850, choose the smallest relative prime pairs( >1) to<BR>\n" );
document.write( " be 2 & 3. \r<BR>\n" );
document.write( "\n" );
document.write( " That is,set A = 2*850 = 1700 and B = 3*850 = 2550<BR>\n" );
document.write( " as the answer.\r<BR>\n" );
document.write( "\n" );
document.write( " This question is not too hard, try to think about it.\r<BR>\n" );
document.write( "\n" );
document.write( " Kenny\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "  </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );