Maths Olympiad Prep

Library / /318 of 860

Algebra Difficulty 5.1 AIME, harder Find the answer

MM is an 8×88 \times 8 matrix. For 1i81 \leq i \leq 8, all entries in row ii are at least ii, and all entries on column ii are at least ii. What is the minimum possible sum of the entries of MM ?

A number or a short expression. Spacing and $ signs are ignored.

Solution

Let sns_{n} be the minimum possible sum for an nn by nn matrix. Then, we note that increasing it by adding row n+1n+1 and column n+1n+1 gives 2n+12 n+1 additional entries, each of which has minimal size at least n+1n+1. Consequently, we obtain sn+1=sn+(2n+1)(n+1)=sn+2n2+3n+1s_{n+1}=s_{n}+(2 n+1)(n+1)=s_{n}+2 n^{2}+3 n+1. Since s0=0s_{0}=0, we get that s8=2(72++02)+3(7++0)+8=372s_{8}=2\left(7^{2}+\ldots+0^{2}\right)+3(7+\ldots+0)+8=372.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.