Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

To determine the number of different passwords required for the computer.

Short Answer

Expert verified

The number of possible different passwords required for the computer is \(9.9 \times {10^{21}}\).

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Given data

The password for computer must have at least 8 , but no more than 12 characters. Each character in the password is a lower case English letter, an uppercase English letter, a digit or one of the six special characters \(*, > , < ,!, + \) and =.

02

Concept used of number of ways to do a task

If a task is complete in\(n1\)ways or\(n2\) ways, then the number of ways to do the task is\(n1 + n2\).

03

Find the number of possible passwords

As per the given data,

Let us consider \({P_8},{P_9},{P_{10}},{P_{11}},{P_{12}}\) are the passwords having lengths \(8,9,10,11,12\)respectively.

Total number of possibilities for each character \(N = 2 \times 26 + 10 + 6 = 68\)

The number of possible passwords

\(\begin{array}{c}P = {P_8} + {P_9} + {P_{10}} + {P_{11}} + {P_{12}}\\ = {68^8} + {68^9} + {68^{10}} + {68^{11}} + {68^{12}}\\ = 9.9 \times {10^{21}}\end{array}\)

Therefore,

The number of possible different passwords required for the computer is \(9.9 \times {10^{21}}\)

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

When the numbers from \({\rm{1}}\) to \({\rm{1000}}\) are written out in decimal notation, how many of each of these digits are used?

a) \({\rm{0}}\)

b) \({\rm{1}}\)

c) \({\rm{2}}\)

d) \({\rm{9}}\)

What is the coefficient ofx9in(2โˆ’x)19?

One hundred tickets, numbered \(1,2,3, \ldots ,100\), are sold to \(100\) different people for a drawing. Four different prizes are awarded, including a grand prize (a trip to Tahiti). How many ways are there to award the prizes if

a) there are no restrictions?

b) the person holding ticket \(47\) wins the grand prize?

c) the person holding ticket \(47\) wins one of the prizes?

d) the person holding ticket \(47\) does not win a prize?

e) the people holding tickets \(19\) and \(47\) both win prizes?

f) the people holding tickets \(19\;,\;47\)and \(73\) all win prizes?

g) the people holding tickets \(19\;,\;47\;,\;73\) and \(97\) all win prizes?

h) none of the people holding tickets \(19\;,\;47\;,\;73\) and \(97\) wins a prize?

i) the grand prize winner is a person holding ticket \(19\;,\;47\;,\;73\) or \(97\)?

j) the people holding tickets 19 and 47 win prizes, but the people holding tickets \(73\) and \(97\) do not win prizes?

A test containstrue/false questions. How many different ways can a student answer the questions on the test, if answers may be left blank?

In this exercise we will count the number of paths in the\(xy\)plane between the origin \((0,0)\) and point\((m,n)\), where\(m\)and\(n\)are nonnegative integers, such that each path is made up of a series of steps, where each step is a move one unit to the right or a move one unit upward. (No moves to the left or downward are allowed.) Two such paths from\((0,0)\)to\((5,3)\)are illustrated here.

a) Show that each path of the type described can be represented by a bit string consisting of\(m\,\,0\)s and\(n\,\,1\)s, where a\(0\)represents a move one unit to the right and a\(1\)represents a move one unit upward.

b) Conclude from part (a) that there are \(\left( {\begin{array}{*{20}{c}}{m + n}\\n\end{array}} \right)\) paths of the desired type.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free