olymmath

OPM 2025 Problem 5

  • Final day 2

An integer number n≥2n \geq 2 is called feirense if it is possible to write on a sheet of paper some integers such that every positive divisor of nn less than nn is the difference between two numbers on the sheet, and no other positive number is. Find all the feirense numbers.

Dataset text AI-MO AoPS. Quoted with source.

Official text: Portuguese Mathematical Olympiad 2025 official paper, page 1.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator pt-opm/2025/p5 · Tag HK8T70AADT · Edit this page on GitHub · Keys: j next, k previous