document.write( "Question 1156994: In a small city there are different exchanges possible for each 7-digit telephone number. The exchange is the first 3 digits of the telephone number. Each of the last 4 digits can be any integer from 0 to 9. How many telephone numbers are possible in the town? \n" ); document.write( "
Algebra.Com's Answer #779776 by josmiceli(19441)\"\" \"About 
You can put this solution on YOUR website!
\"+10%5E4+=+10000+\"
\n" ); document.write( "The 1st number would be
\n" ); document.write( "( exchange ) - 0 0 0 0
\n" ); document.write( "The last number would be
\n" ); document.write( "( exchange ) - 9 9 9 9\r
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );