olymmath

OMCC 2007 Problem 3

  • Day 1

Let SS be a finite set of integers. Suppose that for every two different elements of SS , pp and qq , there exist not necessarily distinct integers a≠0a \neq 0 , bb , cc belonging to SS , such that pp and qq are the roots of the polynomial ax2+bx+cax^{2}+bx+c . Determine the maximum number of elements that SS can have.

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 centro/2007/p3 · Tag RKKWNCY4RG · Edit this page on GitHub · Keys: j next, k previous