olymmath

TR-MO 2000 Problem 3

    Let f(x,y)f(x,y) and g(x,y)g(x,y) be real valued functions defined for every x,y∈{1,2,..,2000}x,y \in \{1,2,..,2000\} . If there exist X,Y⊂{1,2,..,2000}X,Y \subset \{1,2,..,2000\} such that s(X)=s(Y)=1000s(X)=s(Y)=1000 and x∉Xx\notin X and y∉Yy\notin Y implies that f(x,y)=g(x,y)f(x,y)=g(x,y) than, what is the maximum number of (x,y)(x,y) couples where f(x,y)≠g(x,y)f(x,y)\neq g(x,y) .

    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 tr-mo/2000/p3 · Tag TEXQX6F6CE · Edit this page on GitHub · Keys: j next, k previous