Description : Can you solve this diabolical combination lock problem?
Last Answer : answer:Let's say the sequence is abcdef, where each letter a-f represents one the digits 1-4. Below I use the ascii codes element of and not equal to - I hope they render right. a=1 b ∈ {2,3,4} c ... final answer I get is (9*3 + 18*2) = 27+36 = 61 different combos, which is notably less than 81.