Skip to content
HyperRoulettePoint

Did You Figure Out It? The Problems All About the Digit 11

Previously, you were given three brainteasers focused on the digit 11. Below, revisited along with their answers.

1. The Team Formation

You are the manager of a football team. Your squad wear shirt numbers from 1 to 11, with the goalkeeper using number 1. The challenge is to divide the remaining outfield players into three units: defenders, midfielders, and forwards.

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

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

Answer

This arrangement is impossible.

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

If the sums for the defenders, midfielders, and forwards were all divisible by 11, then their combined sum would also be divisible by 11. But, we know this is false, since 65 is not divisible by 11.

2. Pals or Not

As we learn 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 palindromic numbers (digits that are identical backwards and forwards).

If we continue up to 11 × 99, how many additional answers are palindromes?

Answer

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—as long as no carrying is needed.

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

i) Identical Digits (four cases)

When the digits are identical, 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 middle digit stays below 10, which limits us to these four cases.

ii) “Staircase” Numbers (four solutions)

Now consider numbers where the second digit is one larger than the first. In these cases, the outer digits of the product are the same, again giving palindromes.

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

iii) The Last Example (single case)

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

3. The Divisibility Challenge

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

Consider the digits of a number and sum them in turn with plus and minus signs (starting with a plus). If the result is a divisible by 11 (including 0), then the original number is divisible by 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 largest 10-digit number using 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 positions. For this number:

  • Digits in odd places: 9, 7, 5, 3, 1 total 25.
  • Even positions: 8, 6, 4, 2, 0 total 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 can never be 0. The nearest multiple of 11 we can target is therefore 11.

To maintain the number as large as possible, we try to keep the descending prefix. If 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 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.

Next, attempt keeping the prefix 98765…

This start contribute a difference of (9+7+5) - (8+6) = 7. The remaining digits 4,3,2,1,0 must provide precisely 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 great 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 truly divisible by 11.

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

KM
About the author

Kim Myers

A seasoned casino strategist with over a decade of experience in online gaming, specializing in roulette tactics and probability analysis.

HyperRoulettePoint

Type to search articles.