Could someone help me with this?
I think I need to use inclusion/exclusion... so something like:How many 6 character lists can you make, where A-Z can be used for the first 3 positions and the digits 0-9 can be used for the last 3 positions. Important: The letter O and the digit 0 cannot be used in the same list.
number of all possible permutations (26^3 * 10^3) minus number of bad lists (lists with both O and 0).
I'm not sure how to calculate the number of bad lists, tho.
Thanks for your help!