MDM4U Fundamental Counting Principle – 2015-09-10


Today we learned about the Fundamental Counting Principle (see p227) and I left you with one question to complete for homework:

“You have to choose a password for a web service. It must be exactly 8 characters long. The characters may be digits (0-9), uppercase letters, or lowercase letters. You may repeat characters. How many unique passwords are possible?”

Examples of unique passwords:

a7Qrs91j

elephant

Elephant

See how the last two are different? Passwords are case-sensitive, meaning that upper- and lowercase letters are distinct.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s