document.write( "Question 187778: Unisng nonzero whole numbers there is just one combination of two numbers whose sum is 2 (2= 1+1), and one combiantion whose sum is 3 (3= 1+2). For the numbers 4 and 5 there are two diferent ways of writing the sum using two numbers: 4= 1+3 = 2+2; and 5= 1+4 = 3+2. what is the number of different ways of writing 2145 as the sum of two nonzero whole numbers?\r
\n" ); document.write( "\n" ); document.write( "Thanks for your help. \n" ); document.write( "
Algebra.Com's Answer #140793 by Edwin McCravy(20060)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "If you listed them all, the list would start off like this:\r\n" );
document.write( "\r\n" );
document.write( "   1.    1+2144\r\n" );
document.write( "   2.    2+2143\r\n" );
document.write( "   3.    3+2142\r\n" );
document.write( "   4.    4+2141\r\n" );
document.write( "      .\r\n" );
document.write( "      .\r\n" );
document.write( "      .\r\n" );
document.write( "\r\n" );
document.write( "and would end up like this:\r\n" );
document.write( "\r\n" );
document.write( "1069. 1069+1076\r\n" );
document.write( "1070. 1070+1075\r\n" );
document.write( "1071. 1071+1074\r\n" );
document.write( "1072. 1072+1073\r\n" );
document.write( "\r\n" );
document.write( "So there are 1072 ways.\r\n" );
document.write( "\r\n" );
document.write( "Edwin
\n" ); document.write( "
\n" );