返回题库

AIME 2001 I · 第 11 题

AIME 2001 I — Problem 11

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

In a rectangular array of points, with 5 rows and NN columns, the points are numbered consecutively from left to right beginning with the top row. Thus the top row is numbered 1 through N,N, the second row is numbered N+1N + 1 through 2N,2N, and so forth. Five points, P1,P2,P3,P4,P_1, P_2, P_3, P_4, and P5,P_5, are selected so that each PiP_i is in row i.i. Let xix_i be the number associated with Pi.P_i. Now renumber the array consecutively from top to bottom, beginning with the first column. Let yiy_i be the number associated with PiP_i after the renumbering. It is found that x1=y2,x_1 = y_2, x2=y1,x_2 = y_1, x3=y4,x_3 = y_4, x4=y5,x_4 = y_5, and x5=y3.x_5 = y_3. Find the smallest possible value of N.N.

解析

Solution

Let each point PiP_i be in column cic_i. The numberings for PiP_i can now be defined as follows.

xi=(i1)N+ciyi=(ci1)5+i\begin{aligned}x_i &= (i - 1)N + c_i\\ y_i &= (c_i - 1)5 + i \end{aligned} We can now convert the five given equalities.

x1=y2c1=5c23x2=y1N+c2=5c14x3=y42N+c3=5c41x4=y53N+c4=5c5x5=y34N+c5=5c32\begin{aligned}x_1&=y_2 & \Longrightarrow & & c_1 &= 5 c_2-3\\ x_2&=y_1 & \Longrightarrow & & N+c_2 &= 5 c_1-4\\ x_3&=y_4 & \Longrightarrow & & 2 N+c_3 &= 5 c_4-1\\ x_4&=y_5 & \Longrightarrow & & 3 N+c_4 &= 5 c_5\\ x_5&=y_3 & \Longrightarrow & & 4 N+c_5 &= 5 c_3-2 \end{aligned} Equations (1)(1) and (2)(2) combine to form

N=24c219N = 24c_2 - 19 Similarly equations (3)(3), (4)(4), and (5)(5) combine to form

117N+51=124c3117N +51 = 124c_3 Take this equation modulo 31

24N+200(mod31)24N+20\equiv 0 \pmod{31} And substitute for N

2424c22419+200(mod31)24 \cdot 24 c_2 - 24 \cdot 19 +20\equiv 0 \pmod{31} 18c22(mod31)18 c_2 \equiv 2 \pmod{31} Thus the smallest c2c_2 might be is 77 and by substitution N=24719=149N = 24 \cdot 7 - 19 = 149

The column values can also easily be found by substitution

c1=32c2=7c3=141c4=88c5=107\begin{aligned}c_1&=32\\ c_2&=7\\ c_3&=141\\ c_4&=88\\ c_5&=107 \end{aligned} As these are all positive and less than NN, 149\boxed{149} is the solution.

Sidenote

If we express all the cic_i in terms of NN, we have

24c1=5N+2324c_1=5N+23 24c2=N+1924c_2=N+19 124c3=117N+51124c_3=117N+51 124c4=73N+35124c_4=73N+35 124c5=89N+7124c_5=89N+7 It turns out that there exists such an array satisfying the problem conditions if and only if

N149(mod744)N\equiv 149 \pmod{744} In addition, the first two equation can be written n=5mod24n = 5mod24, and chasing variables in the last three equation gives us 89n+7=124e89n + 7 = 124e. With these two equations you may skip a lot of rewriting and testing. 149\boxed{149} still appears as our answer.

-jackshi2006