Skip to content
Tech Insights Blog

Can You Crack It? These Problems Revolving Around the Number 11

Earlier today, you were given three brainteasers centered on the number 11. Here they are, presented once more along with their solutions.

1. The Team Formation

You are the coach of a football team. Your squad have shirt jersey numbers from 1 to 11, with the goalkeeper wearing number 1. Your task is to organize the other ten field players into three units: defenders, midfielders, and forwards.

The puzzle is: Can you arrange the team so that the total of the shirt numbers in every unit is divisible by 11?

Give one arrangement, or prove it cannot be done.

Solution

This arrangement is impossible.

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

Should the totals for the defenders, midfielders, and forwards were all divisible by 11, then their total together would also be divisible by 11. However, we know this is false, because 65 cannot be divided evenly by 11.

2. Pals or Not

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

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

All these results are palindromes (digits that read the same backwards and forwards).

If we continue up to 11 × 99, how many more products are palindromes?

Answer

There are an additional nine.

Consider how multiplying by 11 works. For a two-digit figure has digits a and b, the result with 11 is created by writing the first digit, then their sum, then the second digit—provided no regrouping is needed.

As an illustration, 11 × 52 = 572, since the central digit is simply 5 + 2 = 7.

i) Identical Digits (four cases)

If the two digits are the same, as in 11, 22, 33, or 44, then multiplying by 11 produces 121, 242, 363, and 484—all palindromes.

This works only as long as the sum in the middle stays below 10, which limits us to these four cases.

ii) “Staircase” Numbers (four cases)

Now consider numbers where the last digit is the successor of the first. In these cases, the outer digits of the product are the same, producing palindromes.

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

iii) The Final Case (single case)

Go a little higher, the product becomes four digits. The leading digit will be a 1, so the only hope for a palindrome is when the final digit is also 1. Testing 91 shows it works! 11 × 91 = 1001.

3. The Divisibility Challenge

Less well known as other divisibility rules, there is a straightforward test to determine divisibility by 11.

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

As an example, for 132 we calculate +1 - 3 + 2 = 0, so 132 is evenly divided by 11.

Using each of the digits 0–9 only once, create the greatest 10-digit number that is a multiple of 11.

Solution

The answer is 9876524130.

The greatest 10-digit number with the digits 0–9 once each 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:

  • Digits in odd places: 9, 7, 5, 3, 1 sum to 25.
  • Digits in even places: 8, 6, 4, 2, 0 sum to 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 invariably total 45, so their difference can never be 0. The closest multiple of 11 we can target is therefore 11.

To keep the number as high as possible, we try to keep the largest starting digits. 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… will succeed.

Now try keeping the prefix 98765…

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

To make as large as possible the difference, put the largest remaining digits, 4 and 3, into odd positions, and 2,1,0 into even positions. This yields (4+3) - (2+1+0) = 4, precisely the required amount.

Arranged to keep the number as large as possible, this gives us 9876524130.

Verifying confirms: the odd-position sum is 28, the sum in even places is 17, and 28 - 17 = 11, so the number is truly divisible by 11.

I hope you had fun with these challenges. Further problems will be coming in the future.

By

Joseph Wilcox

A software engineer and tech writer passionate about AI ethics and open-source projects, with over a decade of industry experience.

Tech Insights Blog

Type to search articles.