Skip to content
Thursday, November 12, 2026
CoreNotes

Did You Solve Them? The Problems All About the Digit 11

This morning, you were given three puzzles focused on the number 11. Here they are, revisited complete with their solutions.

1. Funny Formation

Imagine you are the coach of a soccer team. Your squad wear shirt jersey numbers from 1 to 11, with the goalkeeper wearing number 1. Your task is to divide the remaining field players into three units: defenders, midfielders, and forwards.

The puzzle is: Is it possible to set up the team so that the sum of the shirt numbers in each group is evenly divided by 11?

Give one arrangement, or demonstrate it isn’t possible.

Solution

No, it cannot be done.

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

If the sums for the defenders, midfielders, and forwards were each divisible by 11, then their combined sum must also be divisible by 11. However, we know this is false, because 65 is not divisible by 11.

2. Palindromic Products

When learning our times tables, the 11-times table seems delightfully simple.

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

Every answer are palindromes (digits that are identical backwards and forwards).

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

Solution

We find nine more.

Think about the method of multiplying by 11. For a two-digit figure 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 middle digit is simply 5 + 2 = 7.

i) Matching Digits (four solutions)

When the digits are identical, as in 11, 22, 33, or 44, then the product with 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 solutions)

Now consider numbers where the last digit is one larger than the first. Here, the first and last 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 last digit is also 1. Let's test 91 reveals it succeeds! 11 × 91 = 1001.

3. The Divisibility Challenge

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

Consider the digits of a number and add them in turn with plus and minus signs (starting with a plus). If the result is a divisible by 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 divisible by 11.

Using 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 once each is 9876543210.

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

  • Odd positions: 9, 7, 5, 3, 1 total 25.
  • Digits in even places: 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 aim for is therefore 11.

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

These initial digits give a difference of (9+7+5) - (8+6+4) = 3. The remaining digits 3,2,1,0 would need to contribute 8, but in the best arrangement they can only contribute (3+1) - (2+0) = 2. So no number starting 987654… will succeed.

Now try keeping the prefix 98765…

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

To maximize the difference, put 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, exactly what we need.

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

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

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

Written by

Whitney Espinoza

A software engineer with over a decade of experience in full-stack development, passionate about open-source projects and mentoring new coders.

CoreNotes

Type to search articles.