olymmath

APMO 2007 Problem 1

  • Paper

Let SS be a set of 9 distinct integers all of whose prime factors are at most 3. Prove that SS contains 3 distinct integers such that their product is a perfect cube.

Dataset text NuminaMath olympiads. 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 apmo/2007/p1 · Tag GRFJANQYQJ · Edit this page on GitHub · Keys: j next, k previous