In the 2004 movie National Treasure, Ben and Riley are attempting to guess Abagail’s password to enter the room with the Declaration. They are able to determine the passphrase to get into the vault room by doing a scan that detects the buttons pushed (not due to chocolate but just due to the natural oils on fingers). They notice that the buttons pushed include the characters AEFGLORVY.
Assuming these characters are used only once each, how many possible passphrases are possible?
In this case, the order of the characters matters but all of the characters are distinct. Since we have 9 characters provided, the we can consider each character as an event with the first event as a choice from the 9, the second event as a choice from the remaining 8, etc. This gives \(9 \times 8 \times ... \times 1 = 362880\) possible passphrases.
Assuming that some of the characters could be used more than once, how many passphrases need to be considered if the total length of passphrase can be at most 12 characters?
Notice, in this case you don’t know which characters might be reused and so the number of possible outcomes will be much larger. What is the answer?
You can break this problem down into distinct cases:
With this large collection of possible outcomes, how are the movie characters able to determine the correct "VALLEYFORGE" passphrase?