Answer: The number of different passwords can be formed = 1,000,000
Step-by-step explanation:
In general total digits = 10 [ from 0 to 9]
If a password contains 6 digits, then by fundamental principal of counting, the total number of different passwords =
Hence, the number of different passwords can be formed = 1,000,000
Answer:
Step-by-step explanation:
Given that Six cards numbered from 1 to 6 are placed in an empty bowl. First one card is drawn and then put back into the bowl; then a second card is drawn. If the cards are drawn at random
Since with replacement, repitition of numbers is possible
Possible drawings to give sum of 8 is
(2,6) (6,2) (3,5)(5,3)(4,4)
Out of this favourable events with 5 = (3,5) (5,3)
Hence required probability =