olymmath

IMC 2016 Problem 2

    Let kk and nn be positive integers. A sequence (A1,…,Ak)\left( A_1, \dots , A_k \right) of n×nn\times n real matrices is preferred by Ivan the Confessor if Ai2≠0A_i^2\neq 0 for 1≤i≤k1\le i\le k , but AiAj=0A_iA_j=0 for 1≤i1\le i , j≤kj\le k with i≠ji\neq j . Show that k≤nk\le n in all preferred sequences, and give an example of a preferred sequence with k=nk=n for each nn .

    (Proposed by Fedor Petrov, St. Petersburg State University)

    Dataset text AI-MO AoPS. Quoted with source.

    Official text: International Mathematics Competition for University Students 2016 official paper, page 1.

    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 imc/2016/p2 · Tag Q9G2KFEVKH · Edit this page on GitHub · Keys: j next, k previous