Skip to content
BrightLogic Blog

Can You Figure Out It? These Puzzles Revolving Around the Digit 11

Earlier today, you were given three brainteasers focused on the digit 11. Below, revisited complete with their explanations.

1. The Team Formation

Picture yourself as the manager of a soccer team. The players have shirt numbers from 1 to 11, and the goalkeeper wearing number 1. Your task is to divide the other ten outfield players into three units: defenders, midfielders, and forwards.

The puzzle is: Is it possible to arrange the team so that the sum of the shirt numbers in each group is divisible by 11?

Give one arrangement, or demonstrate it cannot be done.

Answer

This arrangement is impossible.

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

Should the totals for the defenders, midfielders, and forwards were each multiples of 11, then their combined sum must also be a multiple of 11. But, we see this is not true, since 65 is not divisible by 11.

2. Palindromic Products

When learning our multiplication tables, the 11-times table seems wonderfully easy.

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

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

Carrying on up to 11 × 99, how many additional products are palindromic?

Answer

There are nine more.

Consider how multiplying by 11 works. When a two-digit number has digits a and b, the product with 11 is created by writing the first digit, then their sum, then the second digit—as long as no regrouping is needed.

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

i) Matching Digits (four cases)

If the two digits are the same, as in 11, 22, 33, or 44, then the product with 11 yields 121, 242, 363, and 484—each one palindromic.

This holds true only while the middle digit stays below 10, which limits us to these four instances.

ii) “Staircase” Numbers (four cases)

Look at numbers where the second digit is the successor of the first. In these cases, 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 (single case)

At higher values, the product is a four-digit number. The first digit will be a 1, so the only hope for a palindrome is when the last digit is also 1. Testing 91 shows it succeeds! 11 × 91 = 1001.

3. The Divisibility Challenge

Not as famous 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 original number is a multiple of 11.

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

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

Answer

The answer is 9876524130.

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

Applying the divisibility test for 11, we compare 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.

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

To maintain the number as large as possible, we try to keep the largest starting digits. Suppose the number began 987654…

These initial digits give a difference of (9+7+5) - (8+6+4) = 3. The other digits 3,2,1,0 would need to 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…

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

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

Ordered to maintain 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 indeed divisible by 11.

I hope you enjoyed these puzzles. Further problems will be coming soon.

About the author

Angela Kennedy

Cybersecurity specialist with 10+ years in IT infrastructure and cloud solutions, passionate about tech innovation.

BrightLogic Blog

Type to search articles.