License plates in the tiny country of Venn follow a unique pattern. The first character is one of 47 Egyptian hieroglyphs, the second is one of 30 emojis, and the third character is one of 5 polygons. How many 3 character license plates are available to the people of Venn?

We know that the first character of the pattern is one of 47 Egyptian hieroglyphs, the second is one of 30 emojis, and the third character is one of 5 polygons.

Let's suppose that we have the first part of an experiment that can occur in [tex]n_{1}[/tex] ways. Now, the second part of the experiment can occur in [tex]n_{2}[/tex] ways. Following the idea, the nth part of the experiment can occur in [tex]n_{s}[/tex] ways.

The total ways in which the whole experiment can occur can be calculated as : [tex]n_{1}[/tex] x [tex]n_{2}[/tex] x . . . x [tex]n_{s}[/tex]

This is the idea of the multiplication principle.

Now in the exercise we have 47 Egyptian hieroglyphs for the first character, 30 emojis for the second character and finally 5 different polygons for the last character.

The total number of 3 character license plates available to the people of Venn can be calculated as :

[tex](47).(30).(5)=7050[/tex]

There are [tex]7050[/tex] license plates.