Maths Olympiad Prep

Library / /146 of 520

Number theory Difficulty 5.8 AIME, harder Find the answer

4. How many pairs of letters remain unchanged when encryption is performed using the following digraphic ciphers
a)
C14P1+5P2(mod26)C23P1+P2(mod26)\begin{array}{l} C_{1} \equiv 4 P_{1}+5 P_{2}(\bmod 26) \\ C_{2} \equiv 3 P_{1}+P_{2}(\bmod 26) \end{array}
b)
C17P1+17P2(mod26)C2P1+6P2(mod26)\begin{array}{l} C_{1} \equiv 7 P_{1}+17 P_{2}(\bmod 26) \\ C_{2} \equiv P_{1}+6 P_{2} \quad(\bmod 26) \end{array}
c)
C13P1+5P2(mod26)C26P1+3P2(mod26)?\begin{array}{l} C_{1} \equiv 3 P_{1}+5 P_{2}(\bmod 26) \\ C_{2} \equiv 6 P_{1}+3 P_{2}(\bmod 26) ? \end{array}

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.