olymmath

ISL 2018 N2

Let n>1n>1 be a positive integer. Each cell of an n×nn \times n table contains an integer. Suppose that the following conditions are satisfied: (i) Each number in the table is congruent to 1 modulo nn; (ii) The sum of numbers in any row, as well as the sum of numbers in any column, is congruent to nn modulo n2n^{2}. Let RiR_{i} be the product of the numbers in the ith i^{\text {th }} row, and CjC_{j} be the product of the numbers in the jth j^{\text {th }} column. Prove that the sums R1+⋯+RnR_{1}+\cdots+R_{n} and C1+⋯+CnC_{1}+\cdots+C_{n} are congruent modulo n4n^{4}. (Indonesia)

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2018 Shortlist booklet, page 9.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2018/n2 · Tag 2PA1E6NNP2 · Edit this page on GitHub · Keys: j next, k previous