document.write( "Question 119198This question is from textbook Pre Alge ra
\n" ); document.write( ": What is the least posititve number of coins that is IMPOSSIBLW to give as change for a dollar?\r
\n" ); document.write( "\n" ); document.write( "I am understanding this to mean what is the smallest number of coins that can't combine to make $1. We charted it out starting at 1 (a dollar coin) 2 (two half dollars) 3 (hald dollar and 2 quarters) etc but are in the late 20s and still going. Is there a formula we could be using? THANKS!! \n" ); document.write( "

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

You can put this solution on YOUR website!
What is the least positive number of coins that is
\n" ); document.write( "IMPOSSIBLE to give as change for a dollar?
\n" ); document.write( "

\r\n" );
document.write( "I'm pretty sure that's a trick question!\r\n" );
document.write( "\r\n" );
document.write( "It's obviously 1.  You can't give 1 coin as change for a dollar.\r\n" );
document.write( "                    J\r\n" );
document.write( "Of course you could argue than swapping a paper dollar bill for one \r\n" );
document.write( "of those gold colored dollar coins the stamp vending machines in \r\n" );
document.write( "post offices give you when you put in a $5 or more - could be called \r\n" );
document.write( "\"changing a dollar using only one coin\".  If you count that as a way \r\n" );
document.write( "to change a dollar, then the smallest number of coins you could not \r\n" );
document.write( "have in change for a dollar would be 77.  But I only found that by \r\n" );
document.write( "writing a computer program, not by a formula.  Your teacher \r\n" );
document.write( "couldn't require you to get that answer unless you were taking a \r\n" );
document.write( "computer programming course.\r\n" );
document.write( "\r\n" );
document.write( "Other than 1, here are the only numbers of coins you could NOT\r\n" );
document.write( "POSSIBLY have if you had change for a dollar, using half dollars.\r\n" );
document.write( "\r\n" );
document.write( "77, 81, 85, 86, 89, 90, 93, 94, 95, 97, 98, 99, 101, and all larger\r\n" );
document.write( "integers. \r\n" );
document.write( "\r\n" );
document.write( "But half dollars are no longer in circulation, so if you\r\n" );
document.write( "count swapping a paper dollar for a metal one as a way to\r\n" );
document.write( "change a dollar, and don't use half dollars, then here are the only \r\n" );
document.write( "numbers of coins you could NOT POSSIBLY have if you had change for \r\n" );
document.write( "a dollar.\r\n" );
document.write( "\r\n" );
document.write( "2, 3, 5, 77, 81, 85, 86, 89, 90, 93, 94, 95, 97, 98, 99, 101 and\r\n" );
document.write( "all larger integers.\r\n" );
document.write( "  \r\n" );
document.write( "So in that case the answer would be 2.  But I'll bet anything it\r\n" );
document.write( "was a trick question and the answer is simply 1.\r\n" );
document.write( "\r\n" );
document.write( "                    J\r\n" );
document.write( "\r\n" );
document.write( "Edwin
 \n" );
document.write( "

\n" );