document.write( "Question 1114708: Sean wants to change &1.50 into dimes and nickels, and he must have at least one of each coin. The number of ways that Sean can do this is
\n" ); document.write( "a)14 b)5 c)16 d)29 e)30 \n" ); document.write( "
Algebra.Com's Answer #729629 by ikleyn(52873)\"\" \"About 
You can put this solution on YOUR website!
.
\n" ); document.write( "
\r\n" );
document.write( "Sean may have 1, 2, 3, 4, . . . , 12, 13 or 14 dimes, and then to complement the sum by nickels.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "In all, Sean has 14 ways to satisfy his request.\r\n" );
document.write( "
\r
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "
\n" );