Lyndon chose this as one of his favourite problems. It is
accessible but needs some careful analysis of what is included and
what is not. A systematic approach is really helpful.
This problem is based on a code using two different prime numbers
less than 10. You'll need to multiply them together and shift the
alphabet forwards by the result. Can you decipher the code?