Cronopio

IMO 2023 Problem 1

最近三到五年以来,我一直沉浸在一种长期的,低烈度的倦怠之中。就像一种缓慢而持久的发炎一样,始终没有糟糕到需要解决一下的程度,但就是...很痛苦。

做了很多自救的尝试,最新的一个是打算做点数学竞赛的题目。一方面算是一种brain teasing,让自己变得兴奋起来,或者起码对事情感到一些兴趣,另一方面也是,回到人生比较高光的时刻的状态。

今天的题目是2023年IMO的第一题数论:


Problem 1, 2023 IMO

Determine all composite integers n>1 that satisfy the following property: if d1,d2,...,dk are all the positive divisors of n with 1=d1<d2<···<dk=n, then di divides di+1+di+2 for every 1ik2.

Conclusion

The eligible positive integer n must contain exactly one prime factor, i.e. n=ps, p is prime number.

Proof

Neccessity

It's trivial to prove that condition in the problem holds for all n=ps.

Sufficiency

dk2|dk1+dkdk2|dk1

Since all factors are ordered in ascending order, d2=dkdk1,d3=dkdk2,d3d2=dk1dk2d2|d3

d2|d3+d4d2|d4

By induction, i{3,4,,k}:d2|di

If n has more than one prime factor (assume ordered ascendingly p1<p2< ), d2=p1,i{3,4,,k}:di=p2. This is contradictory to the assumption that d2|di

Therefore, n has exactly 1 prime factor.

#math-competition