sagarag
Can someone help me out with this question..
Hi
sagarag,
The question here is asking us to fill four places with given set of letters and digits. We are given a constraint that first two places can only be filled with digits and the last two places can only be filled with letters. We are also told that the characters can be repeated. Let's see the number of ways in which each place can be filled.
1st Place: The 1st place of the code needs to be filled with digits only. The total number of digits which we have is 10 ( from 0 to 9 both inclusive). So, there are 10 ways in which we can fill the first place.
2nd Place: The 2nd place also needs to be filled with digits only. Since we are given that digits can be repeated, we have again 10 ways (from 0 to 9 both inclusive) to fill the 2nd place. Had the question constrained us that digits can't be repeated, we would have had 9 ways to fill the 2nd place( as one of the digits would have been used to fill the 1st place)
3rd place: The 3rd place can be filled with letters only. The total number of letters which we have is 26 (from A to Z both inclusive). So there are 26 ways in which we can fill the 3rd place.
4th place: The 4th place also needs to be filled with letters. Since the letters can be repeated, we have again 26 ways (from A to Z both inclusive) to fill the 4th place. Had the question constrained us that letters can't be repeated, we would have had 25 ways to fill the 4th place( as one of the letters would have been used to fill the 3rd place).
As the code constitutes of four characters, the number of ways of filling the four places can be written as = 10 * 10 * 26 * 26 = 67,600 ways.
Hope it's clear. Let me know if you have trouble at any point of this solution
Regards
Harsh
Do we need to worry about numbers repeating and coming up with duplicate combination?