document.write( "Question 1207844: Let A = {n ∈ Z | |n| ≤ 24}. In how many ways can two distinct numbers be chosen (simultaneously) from A such that their product is less than their sum? \n" ); document.write( "

Algebra.Com's Answer #845983 by Edwin McCravy(20055) $\"\"$ $\"About$

You can put this solution on YOUR website!

\r\n" );
document.write( "\r\n" );
document.write( "Ikleyn has done an excellent job here.  The smartest part was rewriting\r\n" );
document.write( "\r\n" );
document.write( "xy < x + y\r\n" );
document.write( "as\r\n" );
document.write( "(1-x)(1-y) < 1\r\n" );
document.write( "\r\n" );
document.write( "One slight error is the fact that 'two distinct integers' means the number of\r\n" );
document.write( "sets {x,y}, , not the number of ordered pairs (x,y).  So her answer\r\n" );
document.write( " should be divided by 2. 1246/2 = 623.\r\n" );
document.write( "\r\n" );
document.write( "Edwin

\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "

\n" );