Number theoryDifficulty 5.8AIME, harderFind the answer
4. How many pairs of letters remain unchanged when encryption is performed using the following digraphic ciphers a) C1≡4P1+5P2(mod26)C2≡3P1+P2(mod26) b) C1≡7P1+17P2(mod26)C2≡P1+6P2(mod26) c) C1≡3P1+5P2(mod26)C2≡6P1+3P2(mod26)?
A number or a short expression. Spacing and $ signs are ignored.
Solution
4. a) 1 b) 13 c) 26
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.