Difference between revisions of "2016 JBMO Problems/Problem 4"
(Created page with "== Problem == == Solution == == See also == {{JBMO box|year=2016|num-b=3|after=Last Problem|five=}}") |
(→Problem) |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | A <math>5 \times 5</math> table is called regular f each of its cells contains one of four pairwise distinct real numbers,such that each of them occurs exactly one in every <math>2 \times 2</math> subtable.The sum of all numbers of a regular table is called the total sum of the table.With any four numbers,one constructs all possible regular tables,computes their total sums and counts the distinct outcomes.Determine the maximum possible count. | ||
== Solution == | == Solution == | ||
Revision as of 01:45, 23 April 2018
Problem
A 
table is called regular f each of its cells contains one of four pairwise distinct real numbers,such that each of them occurs exactly one in every 
subtable.The sum of all numbers of a regular table is called the total sum of the table.With any four numbers,one constructs all possible regular tables,computes their total sums and counts the distinct outcomes.Determine the maximum possible count.
Solution
See also
| 2016 JBMO (Problems • Resources) | ||
| Preceded by Problem 3 |
Followed by Last Problem | |
| 1 • 2 • 3 • 4 | ||
| All JBMO Problems and Solutions | ||
