olymmath

VN-TST 2002 Problem 3

  • Day 1

Let mm be a given positive integer which has a prime divisor greater than 2m+1\sqrt {2m} +1 . Find the minimal positive integer nn such that there exists a finite set SS of distinct positive integers satisfying the following two conditions:

I. m≤x≤nm\leq x\leq n for all x∈Sx\in S ;

II. the product of all elements in SS is the square of an integer.

Dataset text AI-MO AoPS. Quoted with source.

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 vn-tst/2002/p3 · Tag CHAJ6DQYCK · Edit this page on GitHub · Keys: j next, k previous