document.write( "Question 865065: A typical Social Security number is 555-47-5593. How many Social Security numbers are possible if the first two digits cannot be 0?
\n" );
document.write( "
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #521481 by jim_thompson5910(35256)![]() ![]() ![]() You can put this solution on YOUR website! \"the first two digits cannot be 0\", but they can be any number in the set {1,2,3,4,5,6,7,8,9}\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "So you have 9 choices for the first two slots. The remaining 7 slots have 10 choices (0 through 9) since 0 is allowed\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "So you just multiply all the choices for each slot (this is the counting principle in action)\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "9*9*10*10*10*10*10*10*10 = 810,000,000\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "as a shortcut you can compute \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "-------------------------------------------------------\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Final Answer: 810,000,000\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Note: this is the number 810 million\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Another Note: In scientific notation, the answer is \n" ); document.write( " \n" ); document.write( " |