olymmath

VN-TST 2007 Problem 1

    Given two sets A,BA, B of positive real numbers such that: ∣A∣=∣B∣=n|A| = |B| =n ; A≠BA \neq B and S(A)=S(B)S(A)=S(B) , where ∣X∣|X| is the number of elements and S(X)S(X) is the sum of all elements in set XX . Prove that we can fill in each unit square of a n×nn\times n square with positive numbers and some zeros such that:

    a) the set of the sum of all numbers in each row equals AA ;

    b) the set of the sum of all numbers in each column equals AA .

    c) there are at least (n−1)2+k(n-1)^{2}+k zero numbers in the n×nn\times n array with k=∣A∩B∣k=|A \cap B| .

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