Skip to content
Urban Poker Space

Did You Crack Them? The Problems All About the Number 11

Earlier today, you were given three puzzles centered on the number 11. Below, presented once more complete with their solutions.

1. The Team Formation

Imagine you are the coach of a soccer team. The players have shirt numbers from 1 to 11, and the goalkeeper wearing number 1. The challenge is to divide the other ten outfield players into three groups: defenders, midfielders, and forwards.

The puzzle is: Is it possible to set up the team so that the total of the shirt numbers in every unit is divisible by 11?

Provide an example, or demonstrate it isn’t possible.

Answer

It is not possible.

The sum total of the numbers from 1 to 11 is 66. Therefore, the sum for the ten field players is 66 - 1 = 65.

If the sums for the defenders, midfielders, and forwards were all divisible by 11, then their combined sum must also be divisible by 11. But, we know this is false, because 65 cannot be divided evenly by 11.

2. Palindromic Products

As we learn our times tables, the 11-times table feels wonderfully easy.

11 × 1 = 11
11 × 2 = 22
11 × 3 = 33
…
11 × 9 = 99

Every answer are palindromes (numbers that read the same backwards and forwards).

Carrying on up to 11 × 99, how many additional answers are palindromes?

Solution

We find an additional nine.

Consider how multiplying by 11 works. When a two-digit number has digits a and b, the result with 11 is formed by writing the first digit, then their sum, then the second digit—provided no carrying is needed.

For example, 11 × 52 = 572, since the central digit is simply 5 + 2 = 7.

i) Matching Digits (four solutions)

When the digits are identical, as in 11, 22, 33, or 44, then multiplying by 11 yields 121, 242, 363, and 484—each one palindromic.

This works only while the middle digit remains under 10, which limits us to these four instances.

ii) “Staircase” Numbers (four solutions)

Now consider numbers where the last digit is one larger than the first. Here, the outer digits of the product match, again giving palindromes.

  • 11 × 56 = 616
  • 11 × 67 = 737
  • 11 × 78 = 858
  • 11 × 89 = 979

iii) The Last Example (one solution)

At higher values, the product becomes four digits. The leading digit will be a 1, so the sole chance for a palindrome is when the final digit is also 1. Let's test 91 shows it succeeds! 11 × 91 = 1001.

3. The Divisibility Challenge

Not as famous as other divisibility rules, there is a simple method to check for divisibility by 11.

Consider the digits of a number and add them alternately with plus and minus signs (starting with a plus). Should the total is a multiple of 11 (including 0), then the starting number is a multiple of 11.

For instance, for 132 we calculate +1 - 3 + 2 = 0, so 132 is evenly divided by 11.

Employing each of the digits 0–9 only once, construct the greatest 10-digit number that is divisible by 11.

Solution

The answer is 9876524130.

The largest 10-digit number with the digits 0–9 exactly once is 9876543210.

Using the divisibility test for 11, we contrast the sum of digits in odd positions with the sum in even places. For this number:

  • Odd positions: 9, 7, 5, 3, 1 sum to 25.
  • Even positions: 8, 6, 4, 2, 0 total 20.

The difference is 5, which is not divisible by 11.

Because the sum of all digits 0–9 is 45, the two sums must always add to 45, so their difference cannot be 0. The nearest multiple of 11 we can target is therefore 11.

To maintain the number as large as possible, we try to preserve the descending prefix. Suppose the number began 987654…

The digits fixed so far contribute a difference of (9+7+5) - (8+6+4) = 3. The remaining digits 3,2,1,0 must contribute 8, but even arranged optimally they can only contribute (3+1) - (2+0) = 2. So no number starting 987654… can work.

Next, attempt keeping the prefix 98765…

These digits give a difference of (9+7+5) - (8+6) = 7. The remaining digits 4,3,2,1,0 must contribute exactly 4.

To maximize the difference, place the biggest digits left, 4 and 3, into odd places, and 2,1,0 into even places. This yields (4+3) - (2+1+0) = 4, precisely the required amount.

Ordered to keep the number as great as possible, this gives us 9876524130.

A quick check confirms: the odd-position sum is 28, the even-position sum is 17, and 28 - 17 = 11, so the number is indeed a multiple of 11.

I hope you enjoyed these challenges. Further problems are on the way in the future.

SR
Written by

Stephanie Riggs

A professional poker player and writer based in New York, specializing in urban poker dynamics and tournament strategies.

Urban Poker Space

Type to search articles.