document.write( "Question 471737: Permutation and combination.
\n" );
document.write( "============================
\n" );
document.write( "In how many ways can $16 be divided among 4 beggars so the no beggar shall receive less than $3.\r
\n" );
document.write( "\n" );
document.write( "Please Solve.
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #323513 by sudhanshu_kmr(1152)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "Firstly give $3 to each beggars, then $4 are remaining.. \n" ); document.write( "(note: it is assumed that there are 16 coin of $1 )\r \n" ); document.write( "\n" ); document.write( "number of ways to divide $4 among 4 = 7C3 = 35\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "= 35 ways. \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " |