Maths Olympiad Prep

Library / HMMT February /1261 of 1302

HMMT February, 2022

Number theory Difficulty 6.2 National Olympiad Prove it United States

Problem:

Positive integers a1,a2,…,a7,b1,b2,…,b7a_{1}, a_{2}, \ldots, a_{7}, b_{1}, b_{2}, \ldots, b_{7} satisfy 2≤ai≤1662 \leq a_{i} \leq 166 and aibi≡ai+12( mod 167)a_{i}^{b_{i}} \equiv a_{i+1}^{2} (\bmod 167) for each 1≤i≤71 \leq i \leq 7 (where a8=a1a_{8}=a_{1}). Compute the minimum possible value of b1b2⋯b7(b1+b2+⋯+b7)b_{1} b_{2} \cdots b_{7}\left(b_{1}+b_{2}+\cdots+b_{7}\right).

Proposed by: Gregory Pylypovych

Solution

Solution:

Let B=b1b2⋯b7−128B = b_{1} b_{2} \cdots b_{7} - 128. Since
a1b1b2⋯b7≡a22b2b3⋯b7≡a34b3b4⋯b7≡⋯≡a1128( mod 167) a_{1}^{b_{1} b_{2} \cdots b_{7}} \equiv a_{2}^{2 b_{2} b_{3} \cdots b_{7}} \equiv a_{3}^{4 b_{3} b_{4} \cdots b_{7}} \equiv \cdots \equiv a_{1}^{128} \quad(\bmod 167)
we find that a1B≡1( mod 167)a_{1}^{B} \equiv 1 (\bmod 167). Similarly, aiB≡1( mod 167)a_{i}^{B} \equiv 1 (\bmod 167) for all ii. Since 167 is a prime and 167−1=2⋅83167-1=2 \cdot 83, we know that the order of each individual aia_{i} (since ai≠1a_{i} \neq 1) must be either 2 or a multiple of 83. If BB is not a multiple of 83, then it follows that all the aia_{i} must be −1-1, which implies that all the bib_{i} must be even, meaning that the minimum possible value of b1b2⋯b7(b1+b2+⋯+b7)b_{1} b_{2} \cdots b_{7}\left(b_{1}+b_{2}+\cdots+b_{7}\right) is 27⋅14>10002^{7} \cdot 14 > 1000.

On the other hand, if BB is a multiple of 83, then the smallest possible values for b1b2⋯b7b_{1} b_{2} \cdots b_{7} are 45 and 128. If b1b2⋯b7=45b_{1} b_{2} \cdots b_{7}=45, then the smallest possible value for b1+b2+⋯+b7b_{1}+b_{2}+\cdots+b_{7} is 5+3+3+1+1+1+1=155+3+3+1+1+1+1=15, so the minimum possible value for b1b2⋯b7(b1+b2+⋯+b7)b_{1} b_{2} \cdots b_{7}\left(b_{1}+b_{2}+\cdots+b_{7}\right) is 45⋅15=67545 \cdot 15=675. This can be achieved by letting gg be an element of order 83 and setting a1=ga_{1}=g, a2=g1/2a_{2}=g^{1 / 2}, a3=g1/4a_{3}=g^{1 / 4}, a4=g1/8a_{4}=g^{1 / 8}, a5=g1/16a_{5}=g^{1 / 16}, a6=g3/32a_{6}=g^{3 / 32}, a7=g9/64a_{7}=g^{9 / 64} (all exponents are taken mod 83).

If b1b2⋯b7≥128b_{1} b_{2} \cdots b_{7} \geq 128, then by the AM-GM inequality we have
b1b2⋯b7(b1+b2+⋯+b7)≥7(b1b2⋯b7)8/7≥7⋅28>1000 b_{1} b_{2} \cdots b_{7}\left(b_{1}+b_{2}+\cdots+b_{7}\right) \geq 7\left(b_{1} b_{2} \cdots b_{7}\right)^{8 / 7} \geq 7 \cdot 2^{8} > 1000
Therefore 675 is optimal.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.