We want to determine the number of zip code combinations possible for the state.
[tex]\begin{gathered} N=N_1\times N_2\times N_3\times N_4\times N_5 \\ \\ \text{Where;} \\ N\text{ is the total number of zip code combination possible for the state.} \\ N_1\ldots N_{5\text{ }}are\text{ the possible numbers that can fill into each digit of the code from the first to the last.} \end{gathered}[/tex]Given that;
- all zip codes begin with the number 3
- the second digit is restricted to numbers from 3 to 7
- the remaining digits have no restriction.
With the above conditions;
the first digit can only be one number which is 3, so;
[tex]N_1=1[/tex]the second digit can be just 2 numbers either 3 or 7, so;
[tex]N_2=2[/tex]The remaining digits have 10 possible numbers each from 0 to 9, so;
[tex]N_3=N_4=N_5=10[/tex]substituting this values into the formula given, we have;
[tex]\begin{gathered} N=N_1\times N_2\times N_3\times N_4\times N_5 \\ N=1\times2\times10\times10\times10 \\ N=2000 \end{gathered}[/tex]Therefore, the state have 2000 possible zip code combinations.