MathDB
Differences of divisors form geometric progression

Source: Serbia 2024 MO Problem 1

April 4, 2024
geometric sequencenumber theory

Problem Statement

Find all positive integers nn, such that if their divisors are 1=d1<d2<<dk=n1=d_1<d_2<\ldots<d_k=n for k4k \geq 4, then the numbers d2d1,d3d2,,dkdk1d_2-d_1, d_3-d_2, \ldots, d_k-d_{k-1} form a geometric progression in some order.