前言
某个学MO的朋友给我看的题
这题似乎是1994年国家数学集训队选拔考试D1T1
怪不得我做了好久(
upd.20220513 害,他半途而废退役了
一、题面
求四个所有的由四个自然数 a , b , c , d a,b,c,d a,b,c,d 组成的数组,使数组中任意三个数的乘积除以剩下的一个数余数为 1 1 1
二、题解
(注:我写的可能有点不太正式,毕竟我只是个OIer)
由题意可得
a b c ≡ 1 m o d d abc \equiv 1 \mod d abc≡1modd
a b d ≡ 1 m o d c abd \equiv 1 \mod c abd≡1modc
a c d ≡ 1 m o d b acd \equiv 1 \mod b acd≡1modb
b c d ≡ 1 m o d a bcd \equiv 1 \mod a bcd≡1moda
可化为
d ∣ ( a b c − 1 ) d|(abc-1) d∣(abc−1)
c ∣ ( a b d − 1 ) c|(abd-1) c∣(abd−1)
b ∣ ( a c d − 1 ) b|(acd-1) b∣(acd−1)
a ∣ ( b c d − 1 ) a|(bcd-1) a∣(bcd−1)
∴ a b ∣ ( a c d − 1 ) ( b c d − 1 ) ⇒ a b ∣ ( a b c 2 d 2 − a c d − b c d + 1 ) \therefore ab|(acd-1)(bcd-1) \Rightarrow ab|(abc^2d^2-acd-bcd+1) ∴ab∣(acd−1)(bcd−1)⇒ab∣(abc2d2−acd−bcd+1)
∴ a b ∣ ( a c d + b c d − 1 ) \therefore ab|(acd+bcd-1) ∴ab∣(acd+bcd−1)
同理 c d ∣ ( a b c + a b d − 1 ) cd|(abc+abd-1) cd∣(abc+abd−1)
∴ a b c d ∣ ( a 2 b c 2 d + a b 2 c 2 d + a 2 b c 2 d + a b 2 c d 2 − a b c − a b d − a c d − b c d + 1 ) \therefore abcd|(a^2bc^2d+ab^2c^2d+a^2bc^2d+ab^2cd^2-abc-abd-acd-bcd+1) ∴abcd∣(a2bc2d+ab2c2d+a2bc2d+ab2cd2−abc−abd−acd−bcd+1)
∴ a b c d ∣ ( a b c + a b d + a c d + b c d − 1 ) \therefore abcd|(abc+abd+acd+bcd-1) ∴abcd∣(abc+abd+acd+bcd−1)
设 t = a b c + a b d + a c d + b c d − 1 a b c d t=\dfrac{abc+abd+acd+bcd-1}{abcd} t=abcdabc+abd+acd+bcd−1
∴ t = 1 a + 1 b + 1 c + 1 d − 1 a b c d \therefore t=\dfrac{1}{a}+\dfrac{1}{b}+\dfrac{1}{c}+\dfrac{1}{d}-\dfrac{1}{abcd} ∴t=a1+b1+c1+d1−abcd1
显然 a , b , c , d a,b,c,d a,b,c,d 两两互质,且 a ≥ 2 a \ge 2 a≥2
由于不考虑顺序,则假设 2 ≤ a < b < c < d 2\le a < b < c < d 2≤a<b<c<d
∴ t < 4 a ≤ 2 \therefore t< \dfrac{4}{a} \le 2 ∴t<a4≤2
∵ t ∈ Z + \because t\in \Z^+ ∵t∈Z+
∴ a = 2 , 3 , t = 1 \therefore a=2,3,t=1 ∴a=2,3,t=1
当 a = 3 a=3 a=3 时, t m a x = 1 3 + 1 4 + 1 5 + 1 6 − 1 360 = 341 360 < 1 t_{max} = \dfrac{1}{3}+\dfrac{1}{4}+\dfrac{1}{5}+\dfrac{1}{6}-\dfrac{1}{360} = \dfrac{341}{360}<1 tmax=31+41+51+61−3601=360341<1 ∴ \quad\therefore ∴舍去
当 a = 2 a=2 a=2 时, t m a x = 1 2 + 1 3 + 1 5 + 1 7 − 1 210 = 246 210 > 1 t_{max} = \dfrac{1}{2}+\dfrac{1}{3}+\dfrac{1}{5}+\dfrac{1}{7}-\dfrac{1}{210} = \dfrac{246}{210}>1 tmax=21+31+51+71−2101=210246>1
∴ a = 2 \therefore a =2 ∴a=2
∴ 1 2 < 3 b \therefore \dfrac{1}{2}<\dfrac{3}{b} ∴21<b3
∴ b = 3 , 5 \therefore b=3,5 ∴b=3,5
当 b = 5 b=5 b=5 时, t m a x = 1 2 + 1 5 + 1 7 + 1 9 − 1 630 = 600 630 < 1 t_{max} = \dfrac{1}{2}+\dfrac{1}{5}+\dfrac{1}{7}+\dfrac{1}{9}-\dfrac{1}{630} = \dfrac{600}{630}<1 tmax=21+51+71+91−6301=630600<1 ∴ \quad\therefore ∴舍去
当 b = 3 b=3 b=3 时, t m a x = 1 2 + 1 3 + 1 5 + 1 7 − 1 210 = 246 210 > 1 t_{max} = \dfrac{1}{2}+\dfrac{1}{3}+\dfrac{1}{5}+\dfrac{1}{7}-\dfrac{1}{210} = \dfrac{246}{210}>1 tmax=21+31+51+71−2101=210246>1
∴ b = 3 \therefore b=3 ∴b=3
∴ 1 6 < 2 c \therefore \dfrac{1}{6} < \dfrac{2}{c} ∴61<c2
∴ c = 7 , 11 \therefore c=7,11 ∴c=7,11
当 c = 7 c=7 c=7 时, t m a x = 1 2 + 1 3 + 1 7 + 1 11 − 1 462 = 492 462 > 1 t_{max} = \dfrac{1}{2}+\dfrac{1}{3}+\dfrac{1}{7}+\dfrac{1}{11}-\dfrac{1}{462} = \dfrac{492}{462}>1 tmax=21+31+71+111−4621=462492>1
当 c = 11 c=11 c=11 时, t m a x = 1 2 + 1 3 + 1 11 + 1 13 − 1 858 = 858 858 = 1 t_{max} = \dfrac{1}{2}+\dfrac{1}{3}+\dfrac{1}{11}+\dfrac{1}{13}-\dfrac{1}{858} = \dfrac{858}{858}=1 tmax=21+31+111+131−8581=858858=1
显然当 c = 11 c=11 c=11 时 d = 13 d=13 d=13
则一组解为 2 , 3 , 11 , 13 2,3,11,13 2,3,11,13
当 c = 7 c=7 c=7 时
1 42 < 1 d \dfrac{1}{42}<\dfrac{1}{d} 421<d1
∴ d = 41 \therefore d=41 ∴d=41
则另一组解为 2 , 3 , 7 , 41 2,3,7,41 2,3,7,41
综上所述,答案为 2 , 3 , 11 , 13 2,3,11,13 2,3,11,13 或 2 , 3 , 7 , 41 2,3,7,41 2,3,7,41
总结
简单讲了一道简单数论题
为了验算结果我直接敲了个 O ( n 4 ) O(n^4) O(n4) 的暴力(傻)
转载请说明出处