灯下 登录
番外 · 闲灯 / IMO Shortlist / N4 · number-theory

2020 IMO Shortlist N4

题面据 IMO Shortlist 可核档案整理;中文题意为本站自译,公式请以原始来源为准。

IMO Shortlist 2020 N4 number-theory

For any odd prime pp and any integer nn, let dp(n){0,1,,p1}d_{p}(n) \in\{0,1, \ldots, p-1\} denote the remainder when nn is divided by pp. We say that (a0,a1,a2,)\left(a_{0}, a_{1}, a_{2}, \ldots\right) is a pp-sequence, if a0a_{0} is a positive integer coprime to pp, and an+1=an+dp(an)a_{n+1}=a_{n}+d_{p}\left(a_{n}\right) for n0n \geq 0. (a) Do there exist infinitely many primes pp for which there exist pp-sequences (a0,a1,a2,)\left(a_{0}, a_{1}, a_{2}, \ldots\right) and (b0,b1,b2,)\left(b_{0}, b_{1}, b_{2}, \ldots\right) such that an>bna_{n}>b_{n} for infinitely many nn, and bn>anb_{n}>a_{n} for infinitely many nn ? (b) Do there exist infinitely many primes pp for which there exist pp-sequences (a0,a1,a2,)\left(a_{0}, a_{1}, a_{2}, \ldots\right) and (b0,b1,b2,)\left(b_{0}, b_{1}, b_{2}, \ldots\right) such that a0<b0a_{0}<b_{0}, but an>bna_{n}>b_{n} for all n1n \geq 1 ? (United Kingdom)

对于任意奇素数pp和任意整数nn,令dp(n){0,1,,p1}d_{p}(n) \in\{0,1, \ldots, p-1\}表示nn除以pp时的余数。如果a0a_{0}是与pp互质的正整数,且n0n \geq 0an+1=an+dp(an)a_{n+1}=a_{n}+d_{p}\left(a_{n}\right),我们称(a0,a1,a2,)\left(a_{0}, a_{1}, a_{2}, \ldots\right)pp序列。 (a) 是否存在无穷多个素数 pp,其中存在 pp 序列 (a0,a1,a2,)\left(a_{0}, a_{1}, a_{2}, \ldots\right)(b0,b1,b2,)\left(b_{0}, b_{1}, b_{2}, \ldots\right),使得 an>bna_{n}>b_{n} 对于无穷多个 nn,以及bn>anb_{n}>a_{n} 表示无限多个 nn ? (b) 是否存在无限多个素数pp,其中存在pp序列(a0,a1,a2,)\left(a_{0}, a_{1}, a_{2}, \ldots\right)(b0,b1,b2,)\left(b_{0}, b_{1}, b_{2}, \ldots\right),使得a0<b0a_{0}<b_{0},但an>bna_{n}>b_{n}所有 n1n \geq 1 ? (英国)

提示 1

先看同余、整除、最大公因数和 p 进赋值。

提示 2

把整数条件转成同余方程、指数比较或下降过程。

提示 3

若要存在性,用构造;若要唯一性,用最小反例、无限下降或模限制。

完整解答

这页先给题面、题型和提示阶梯,完整证明留给读者逐步展开。2020 年 IMO Shortlist N4 可先归入数论:第一步把题设翻成对象、条件、目标三行;第二步沿提示寻找不变量、标准构型或关键变形;第三步补齐边界情形,并回到题目原要求核对。

这题适合先独立想一轮再打开提示。不要急着搜索完整解答,先问自己:题面里最硬的限制是哪一句?