Maths Olympiad Prep

Library / /19 of 23

, 2016

Combinatorics Difficulty 4.1 AIME Prove it Canada

A BINGO card has twenty-five different integers arranged into five rows and five columns labeled B, I, N, G, and O such that:

The middle integer is always 0.
Integers in column B are between 1 and 15 inclusive.
Integers in column I are between 16 and 30 inclusive.
Integers in column N are between 31 and 45 inclusive (other than the middle integer being 0).
Integers in column G are between 46 and 60 inclusive.
Integers in column O are between 61 and 75 inclusive.

Here is an example of a BINGO card.

B
I
N
G
O

5
24
36
48
61

2
29
31
53
64

11
18
0
60
68

15
20
44
51
69

3
26
42
47
70

What is the smallest possible sum of the numbers in a row on a BINGO card?
Carrie’s BINGO card has a row and a diagonal each with the same sum. What is the smallest possible such sum? Show that there is a BINGO card with this sum and explain why there is no BINGO card with a smaller such sum.
In the BINGO card shown, numbers in a diagonal and in the 3rd^{rd} row are missing. Determine with justification the number of ways to complete this BINGO card so that the sum of the numbers in this diagonal is equal to 177 and the sum of the numbers in the 3rd^{rd} row is also equal to 177.

B
I
N
G
O

23
35
47
65

5

31
52
63

0

11
20
40

69

9
18
38
48

Solution

Because the entries from one column do not affect the possible entries in another column, then the smallest possible sum of the numbers in a row equals the sum of the smallest possible number in each column.

Column
Possible entries
Smallest possible entry

B
1,2,3,,13,14,151,2,3,\ldots,13,14,15
1

I
16,17,18,,28,29,3016,17,18,\ldots,28,29,30
16

N
0,31,32,33,,43,44,450,31,32,33,\ldots,43,44,45
0

G
46,47,48,,58,59,6046,47,48,\ldots,58,59,60
46

O
61,62,63,,73,74,7561,62,63,\ldots,73,74,75
61

Thus, the smallest possible sum of the numbers in a row on a BINGO card is equal to 1+16+0+46+611+16+0+46+61 or 124124. (This sum can only occur in the middle row, since the entry 0 can only occur in the middle of the square.)
Solution 1

From part (a), the smallest possible sum of the numbers in a row is 124.

This minimum row sum occurs in the 3rd^{rd} row so that the number in column N is 0.

(Note that if we do not use the 3rd^{rd} row, then the smallest number that can occur in column N is 31, and thus the minimum possible row sum in any row other than the 3rd^{rd} is 1+16+31+46+61=124+31=1551+16+31+46+61=124+31=155.)

The minimum sum of the numbers in a diagonal is also 124 since the smallest possible number in each column (including the middle entry 0) may be used in a diagonal sum.

The minimum row sum and the minimum diagonal sum each use the numbers 1,16,0,46,1,16,0,46, and 61.

However, the number 1 cannot occur in both the 3rd^{rd} row and in the diagonal since every BINGO card is filled with twenty-five different integers.

The smallest two numbers that can appear in the 3rd^{rd} row and in the diagonal in column B are 1 and 2.

Similarly, the smallest two numbers that can appear in the 3rd^{rd} row and in the diagonal in column I are 16 and 17.

In column N, the 3rd^{rd} row and the diagonal intersect and share the smallest number 0.

In column G, the number 46 cannot appear in both the 3rd^{rd} row and in the diagonal, and so the smallest two numbers that can appear in the 3rd^{rd} row and in the diagonal in column G are 46 and 47.

Similarly, the smallest two numbers that can appear in the 3rd^{rd} row and in the diagonal in column O are 61 and 62.

Therefore, in any BINGO card, the combined list of numbers in a diagonal sum and a row sum must include 10 numbers that are at least as large as 1, 2, 16, 17, 0, 0, 46, 47, 61, 62.

The sum of these numbers is 1+2+16+17+0+0+46+47+61+62=2521+2+16+17+0+0+46+47+61+62 = 252.

Thus, if Carrie’s BINGO card has a row and a diagonal each with the same sum, then this sum must be at least one-half of this total; that is, the minimum such sum is 12(252)=126\frac12(252)=126.

One BINGO card showing this minimum equal row and diagonal sum of 126 is possible, is shown below.

B
I
N
G
O

1

17

2
16
0
47
61

46

62

 

We confirm that the row and diagonal sums are 2+16+0+47+61=1+17+0+46+62=1262+16+0+47+61=1+17+0+46+62=126, as claimed.

Each of the empty spaces in the card may be filled with any of the appropriate numbers not yet used.

Solution 2

From part (a), the smallest possible sum of the numbers in a row is 124.

This minimum row sum occurs in the 3rd^{rd} row so that the number in column N is 0.

(Note that if we do not use the 3rd^{rd} row, then the smallest number that can occur in column N is 31, and thus the minimum possible row sum in any row other than the 3rd^{rd} is 1+16+31+46+61=124+31=1551+16+31+46+61=124+31=155.)

The minimum sum of the numbers in a diagonal is also 124 since the smallest possible number in each column (including the middle entry 0) could be used in a diagonal sum.

The minimum row sum and the minimum diagonal sum each must use the numbers 1,16,0,46,611,16,0,46,61.

However, the number 1 cannot occur in both the 3rd^{rd} row and in a diagonal, since 1 cannot occur twice in the B column.

Similarly, 16 cannot occur in both the 3rd^{rd} row and in the diagonal, since 16 cannot occur twice in the I column. As well, 46 and 61 cannot occur in both the 3rd^{rd} row and in a diagonal. Therefore, it is not possible for a BINGO card to have both the 3rd^{rd} row and a diagonal sum to 124.

A row sum of 126 and a diagonal sum of 126 is possible, as the following BINGO card shows:

B
I
N
G
O

1

16

2
17
0
46
61

47

62

We confirm that the row and diagonal sums are 2+17+0+46+61=1262+17+0+46+61=126 and 1+16+0+47+62=1261+16+0+47+62=126, as claimed. Each of the empty spaces in the card may be filled with any of the appropriate numbers not yet used to create a full BINGO card.

Is it possible to have a BINGO card with a row sum of 125 and a diagonal sum of 125?

If not, then the smallest possible number that can be both a row sum and a diagonal sum will be 126.

Consider the smallest possible diagonal sum 1+16+0+46+61=1241+16+0+46+61=124.

Since 1, 16, 0, 46, 61 are the smallest possible entries in each column, then a diagonal sum of 125 can only be created by replacing exactly one of the four integers 1, 16, 46, 61 by the integer that is one larger.

In particular, the possible diagonals with a sum of 125 are 2+16+0+46+61=1251+17+0+46+61=1252+16+0+46+61=125 \qquad 1+17+0+46+61=125 1+16+0+47+61=1251+16+0+46+62=1251+16+0+47+61=125 \qquad 1+16+0+46+62=125 For the same reason, these are also the possible 3rd^{rd} rows with a sum of 125.

It is not possible for a BINGO card to have one of these sums as a diagonal sum and a different one of these sums as a 3rd^{rd} row sum, since each pair of these sums has more numbers than just the 0 in common. (For example, 2+16+0+46+612+16+0+46+61 and 1+16+0+47+611+16+0+47+61 share 16, 0 and 61, and the number 16 cannot appear in the I column in both a diagonal and the 3rd^{rd} row.)

Therefore, the smallest possible number that can be both a diagonal sum and a row sum is 126.
Solution 1

The maximum possible sum of the numbers in the 3rd^{rd} row and in the diagonal is 15+30+0+60+75=18015+30+0+60+75=180.

We need the sum of the numbers in the 3rd^{rd} row and the sum of the numbers in the diagonal to both be 177.

We determine the number of ways in which this can be done by starting with the largest possible numbers and reducing these numbers to reduce the sums to 177.

Thus, we call the missing numbers in the 3rd^{rd} row 15W,30X,60Y,75Z15-W,30-X,60-Y,75-Z for some integers W,X,Y,ZW,X,Y,Z and the missing numbers in the diagonal 15w,30x,60y,75z15-w,30-x,60-y,75-z for some integers w,x,y,zw, x, y, z, as shown:

B
I
N
G
O

15w15-w
23
35
47
65

5
30x30-x
31
52
63

15W15-W
30X30-X
0
60Y60-Y
75Z75-Z

11
20
40
60y60-y
69

9
18
38
48
75z75-z

Since the numbers in the first column are between 1 and 15, inclusive, then w0w \geq 0 and W0W \geq 0. Similarly, each of x,X,y,Y,z,Zx,X,y,Y,z,Z are greater than or equal to 0.

Since the numbers in the 3rd^{rd} row have a sum of 177, then

(15W)+(30X)+0+(60Y)+(75Z)=177(15-W)+(30-X)+0+(60-Y)+(75-Z)=177

or 180(W+X+Y+Z)=177180-(W+X+Y+Z)=177 and so W+X+Y+Z=3W+X+Y+Z=3.

Similarly, we have w+x+y+z=3w+x+y+z=3.

Since the B column cannot contain repeated numbers, then 15w15-w and 15W15-W cannot be equal, which means that we cannot have w=Ww=W. Also, xXx \neq X and yYy \neq Y and zZz \neq Z.

The number of BINGO cards with the desired property is equal to the number of ways that we can choose non-negative integers w,x,y,z,W,X,Y,Zw,x,y,z,W,X,Y,Z with the correct sums and so that no two numbers in the same column are equal.

Since W,X,Y,ZW,X,Y,Z are integers that are at least 0, then they must be 3,0,0,03,0,0,0 in some order or 2,1,0,02,1,0,0 in some order or 1,1,1,01,1,1,0 in some order:

For the sum of non-negative integers to be 3, no single integer can be larger than 3. If one integer is 3, the rest are 0. If one integer is 2, then we must have one 1 and the rest equal to 0. If no integers equal 3 or 2, then we must have three 1s.

Similarly, w,x,y,zw,x,y,z must be 3,0,0,03,0,0,0 in some order or 2,1,0,02,1,0,0 in some order or 1,1,1,01,1,1,0 in some order.

Note that since none of the values can be larger than 3, then the missing entries in the B, I, G, and O columns are at least 12, 27, 57, and 72, respectively, so cannot duplicate existing entries.

To count the BINGO cards, we now count the possible combinations of values for W,X,Y,ZW,X,Y,Z and w,x,y,zw,x,y,z.

In this discussion, we call ww and WW corresponding positions. Similarly, xx and XX, yy and YY, and zz and ZZ will be called corresponding positions.

Case 1: W, X, Y, Z are 3, 0, 0, 0 in some order

w,x,y,zw,x,y,z cannot be 3,0,0,03,0,0,0. If it were, then at least two pairs of corresponding positions will equal 0, which would mean that at least two columns of the card would contain the same number twice. (For example, if W=3W=3, X=0X=0, Y=0Y=0, Z=0Z=0 and w=0w=0, x=0x=0, y=3y=3, z=0z=0, then X=x=0X=x=0 and Z=z=0Z=z=0 which means that the I column will include 30 twice and the O column will include 75 twice.)
w,x,y,zw,x,y,z cannot be 2,1,0,02,1,0,0 because at least one pair of corresponding positions will equal 0, which means that at least one column of the BINGO card will contain the same number twice.
w,x,y,zw,x,y,z could be 1,1,1,01,1,1,0 in some order. In how many ways can this happen?

Since W,X,Y,ZW,X,Y,Z are 3,0,0,03,0,0,0 in some order, then there are 4 possible positions in which the 3 can go. The remaining three positions must be 0.

Looking at w,x,y,zw,x,y,z, the 0 must go in the position corresponding to the 3 (since there cannot be two 0s in corresponding positions) and so the 1s go in the remaining positions.

In total, this means that there are 4 possible ways in which this can happen.

Case 2: W, X, Y, Z are 2, 1, 0, 0 in some order

w,x,y,zw,x,y,z cannot be 3,0,0,03,0,0,0 as we saw in Case 1(ii).
w,x,y,zw,x,y,z could be 2,1,0,02,1,0,0 in some order.

Looking at W,X,Y,ZW,X,Y,Z, there are 4 possible positions for the 2. For each of these positions, there are 3 possible positions for the 1. The 0s go in the remaining two positions.

Looking at w,x,y,zw,x,y,z, the 0s must go in the positions that correspond to the 2 and 1 among W,X,Y,ZW,X,Y,Z. This means that there are 2 possible positions for the 2 and then the 1 is placed in the last position.

Overall, there are 432=244 \cdot 3 \cdot 2 = 24 ways in which this can be done.
w,x,y,zw,x,y,z could be 1,1,1,01,1,1,0 in some order.

In how many ways can this happen?

Looking at W,X,Y,ZW,X,Y,Z, there are 4 possible positions for the 2. For each of these positions, there are 3 possible positions for the 1. The 0s go in the remaining two positions.

Looking at w,x,y,zw,x,y,z, the 0 must go in the corresponding position to the 1 among W,X,Y,ZW,X,Y,Z, since there cannot be two 1s in this position. The positions of the 1s are then completely determined.

Overall, there are 43=124 \cdot 3 = 12 ways in which this can be done.

Case 3: W, X, Y, Z are 1, 1, 1, 0 in some order

w,x,y,zw,x,y,z could be 3,0,0,03,0,0,0 in some order. As we saw in Case 1(iii), there are 4 ways in which this can happen.
w,x,y,zw,x,y,z could be 2,1,0,02,1,0,0 in some order. As we saw in Case 2(iii), there are 12 ways in which this can happen.
w,x,y,zw,x,y,z cannot be 1,1,1,01,1,1,0 in some order because at least two pairs of corresponding variables will equal 1.

In total, there are thus 4+24+12+4+12=564+24+12+4+12=56 ways in which W,X,Y,Z,w,x,y,zW,X,Y,Z,w,x,y,z can be determined.

Each set of values of these variables gives a BINGO card with the desired property, and so there are 5656 ways of completing the BINGO card so that the sum of the numbers in the diagonal and in the 3rd^{rd} row are each 177.

Solution 2

The maximum possible sum of the numbers in the 3rd^{rd} row and in the diagonal is 15+30+0+60+75=18015+30+0+60+75=180.

We require both the sum of the numbers in the 3rd^{rd} row and the sum of the numbers in the diagonal to be 177.

Since 177 is 3 less than the maximum possible sum of 180, then any of the missing numbers in the given BINGO card can be at most 3 less than the largest number that can appear in columns B, I, G, and O (column N is fixed at 0).

That is, the smallest number that can appear in the 3rd^{rd} row and in the diagonal of column B is 153=1215-3=12.

Similarly, the smallest numbers that can appear in the 3rd^{rd} row and in the diagonal of columns I, G and O are 27, 57 and 72, respectively.

Thus, the missing numbers in the given BINGO card must be chosen from:
12,13,14,15 in column B,27,28,29,30 in column I,57,58,59,60 in column G, and72,73,74,75 in column O.\begin{aligned} & 12, 13, 14, 15 \text{ in column B,}\\ & 27, 28, 29, 30 \text{ in column I,}\\ & 57, 58, 59, 60 \text{ in column G, and}\\ & 72, 73, 74, 75 \text{ in column O.}\\ \end{aligned}
(Note that these numbers do not already appear in the given BINGO card and so they each may be chosen to fill blank spaces.)

There are three different methods in which the maximum sum, 180, can be decreased by exactly 3 to give a row or diagonal sum of 177.

From the lists above, we may choose:

the smallest number from one of the four columns (this number is 3 less than the largest), and choose the largest number from each of the remaining three columns. For example we could choose the smallest number from column B, 12, and the largest numbers from the remaining columns, 30,60,7530,60,75, since 12+30+60+75=17712+30+60+75=177, or
the largest number from one of the four columns, and choose the second largest number from each of the remaining three columns. For example we could choose the largest number from column B, 15, and the second largest numbers from the remaining columns, 29,59,7429,59,74, since 15+29+59+74=17715+29+59+74=177, or
the largest numbers from two of the four columns, and choose the second largest number from one of the remaining two columns and the third largest number from the final column. For example we could choose the largest numbers from columns B and I, 15 and 30, and the second largest number from column G, 59, and the third largest number from column O, 73, since 15+30+59+73=17715+30+59+73=177.

These are the only three methods in which we can decrease the maximum row and diagonal sum of 180 by exactly 3 to give a row or diagonal sum of 177.

We restate these three methods by considering the following table:

B
I
G
O

P
15
30
60
75

Q
14
29
59
74

R
13
28
28
73

S
12
27
57
72

The three methods for achieving a row or diagonal sum of 177 are:

choose 1 number from group SS (the numbers 12,27,57,7212,27,57,72), and 3 numbers from group PP, or
choose 1 number from group PP, and 3 numbers from group QQ, or
choose 2 numbers from group PP, 1 number from group QQ, and 1 number from group RR.

We require both the 3rd^{rd} row sum and the diagonal sum to be 177.

Thus, we must use two of the above methods simultaneously and we must ensure that no number appears twice in any given column.

Which pairs of combinations may be chosen from the three methods listed?

If we fill the blanks in the 3rd^{rd} row of the BINGO card using method 1, then we cannot fill the blanks of the diagonal using method 1 since each application of method 1 requires that we use 3 different numbers from group PP, and there are only 4 numbers to choose from in any of the groups.

Further, if we fill the blanks in the 3rd^{rd} row of the BINGO card using method 1, then we cannot fill the blanks of the diagonal using method 3 since this would require 5 numbers from group PP.

Therefore, if the 3rd^{rd} row is filled using method 1, then the diagonal must be filled using method 2.

Similarly, we cannot fill the blanks in the 3rd^{rd} row of the BINGO card using method 2 and at the same time use method 2 to fill the blanks in the diagonal.

We also cannot fill the blanks in the 3rd^{rd} row of the BINGO card using method 3 and at the same time use method 1 to fill the blanks in the diagonal.

All other combinations of methods are possible and they are summarized in the table:

Method used to fill the 3rd^{rd} row
Method used to fill the diagonal

1: SPPPSPPP
2: PQQQPQQQ

2: PQQQPQQQ
1: SPPPSPPP

2: PQQQPQQQ
3: PPQRPPQR

3: PPQRPPQR
2: PQQQPQQQ

3: PPQRPPQR
3: PPQRPPQR

Finally, to count the number of ways to complete the BINGO card, we must count the number of ways to choose numbers that satisfy each of the five combinations listed above.

First Combination: SPPP in the 3rd row and PQQQ in the diagonal

SPPPSPPP can occur in 4 ways in the 3rd^{rd} row:

Select one of the 4 columns (B, I, G, O) in which to choose the group SS number, and the remaining 3 columns are each filled with their group PP number.

To complete the diagonal in this same BINGO card using PQQQPQQQ, we recognize that the group PP number must occur in the same column in which the group SS number occured in the 3rd^{rd} row, because each of the other 3 group PP numbers are already in the 3rd^{rd} row.

That is, there is only 1 choice for the placement of the group PP number, and each of the remaining 3 columns in the diagonal will be filled with their group QQ number.

So there are 4 ways to select the numbers for the 3rd^{rd} row and then only 1 way to select the numbers for the diagonal, and thus there are 4×1=44\times1=4 ways to complete the BINGO card using this first combination.

Second Combination: PQQQ in the 3rd row and SPPP in the diagonal

The counting here is identical to that of the first combination above, with the roles of the 3rd3^{rd} row and diagonal reversed.

Thus, there are 4 ways in which the BINGO card can be completed using this second combination.

Third Combination: PQQQ in the 3rd row and PPQR in the diagonal

PQQQPQQQ can occur in 4 ways in the 3rd^{rd} row:

Select one of the 4 columns (B, I, G, O) in which to choose the group PP number, and the remaining 3 columns are each filled with their group QQ number.

To complete the diagonal in this same BINGO card using PPQRPPQR, we recognize that the group QQ number must occur in the same column in which the group PP number occured in the 3rd^{rd} row, because each of the other 3 group QQ numbers are already in the 3rd^{rd} row.

Next we must fill the remaining 3 columns with their respective PPRPPR numbers.

These can be ordered in 3 different ways (PPRPPR, PRPPRP, and RPPRPP) and so there are 3 ways to fill the remaining 3 columns in the diagonal.

So there are 4 ways to select the numbers for the 3rd^{rd} row and then 1×31\times3 ways to select the numbers for the diagonal, and thus there are 4×3=124\times3=12 ways to complete the BINGO card using this third combination.

Fourth Combination: PPQR in the 3rd row and PQQQ in the diagonal

The counting here is identical to that of the third combination above, with the roles of the 3rd3^{rd} row and diagonal reversed.

Thus there are 12 ways in which the BINGO card can be completed using this fourth combination.

Fifth Combination: PPQR in the 3rd row and PPQR in the diagonal

PPQRPPQR can occur in 12 ways in the 3rd^{rd} row:

Select one of the four columns in which to place the group QQ number. There are 4 choices for this column, and for each of these choices, there are 3 choices of column in which to place the group RR number. The group PP numbers are then placed in the empty columns.

We then need to place the numbers on the diagonal. There are 2 ways to do this:

The group PP numbers on the diagonal must go in the columns corresponding to the locations of the group QQ and RR numbers in the 3rd^{rd} row.

The group QQ and RR numbers on the diagonal can be placed in the two remaining columns in 2 ways – either QRQR or RQRQ when reading from left to right.

Therefore, there are 12×2=2412 \times 2 = 24 ways in which the BINGO card can be completed using this fifth combination.

In total, the number of ways to complete the BINGO card so that the sum of the numbers in the diagonal is 177, and the sum of the numbers in the 3rd^{rd} row is 177 is 4+4+12+12+244+4+12+12+24, which equals 5656.

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

Source: CEMC, University of Waterloo, licensed CC-BY-NC-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.