Skip to content
Power Core Exchange

Did You Figure Out It? The Puzzles Revolving Around the Number 11

This morning, we shared three puzzles involving the number 11. Here they are, revisited along with their solutions.

1. The Team Formation

Imagine you are the manager of a football team. Your squad have shirt jersey numbers from 1 to 11, and the goalkeeper using number 1. The challenge is to divide the remaining outfield players into three groups: defenders, midfielders, and forwards.

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

Provide an example, or demonstrate it cannot be done.

Answer

It is not possible.

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

If the sums for the defenders, midfielders, and forwards were all multiples of 11, then their total together would also be divisible by 11. But, we see this is not true, since 65 cannot be divided evenly by 11.

2. Palindromic Products

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

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

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

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

Solution

There are an additional nine.

Consider the method of multiplying by 11. 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—as long as no regrouping is needed.

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

i) Matching Digits (four solutions)

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

This holds true only while the sum in the middle stays below 10, which limits us to these four cases.

ii) “Consecutive” Numbers (four solutions)

Now consider numbers where the second digit is the successor of the first. Here, the first and last digits of the product match, producing palindromes.

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

iii) The Final Case (one solution)

Go a little higher, the product is a four-digit number. The leading digit will be a 1, so the only hope for a palindrome is when the last digit is also 1. Let's test 91 reveals it succeeds! 11 × 91 = 1001.

3. Big Divide

Less well known than other divisibility rules, there is a simple method to check for divisibility by 11.

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

As an example, 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 largest possible 10-digit number that is a multiple of 11.

Solution

The answer is 9876524130.

The greatest 10-digit number using the digits 0–9 exactly once is 9876543210.

Applying the divisibility test for 11, we compare the sum of digits in odd places 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 a multiple of 11.

Since the total sum 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 aim for is therefore 11.

To maintain the number as high as possible, we try to preserve the descending prefix. 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 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 remaining digits 4,3,2,1,0 must contribute exactly 4.

To make as large as possible the difference, put the biggest digits left, 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.

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

A quick check confirms: the sum in odd places 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. More puzzles will be coming soon.

MF
By

Michael Foley

Marcus is an industrial energy specialist with over 15 years of experience in battery technology and sustainable power solutions.

Power Core Exchange

Type to search articles.