# Show that the five digit number abcde is congruent (mod11) to $(a + c + e) - (b + d)$ [closed]

Show that the five digit number $$abcde$$ is congruent (mod $$11$$) to $$(a + c + e) - (b + d)$$

## closed as off-topic by Martin R, N. F. Taussig, Javi, José Carlos Santos, LeucippusApr 22 at 15:04

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Martin R, N. F. Taussig, Javi, José Carlos Santos, Leucippus
If this question can be reworded to fit the rules in the help center, please edit the question.

• Observe that $$abcde = 10000 \times a + 1000 \times b + 100 \times c + 10 \times d + e.$$ – Dbchatto67 Apr 22 at 7:47

## 2 Answers

Hint: Write your number in the form $$e+10d+10^2c+10^3b+a10^4$$ and note that $$10\equiv -1\mod 11$$ $$10^2\equiv 1 \mod 11$$ $$10^3\equiv -1\mod 11$$ $$10^4\equiv 1 \mod 11$$

Observe that $$abcde = 10000 \times a + 1000 \times b + 100 \times c + 10 \times d + e.$$

So \begin{align*} abcde - (a+c+e) + (b+d) & \equiv 9999 \times a + 1001 \times b + 99 \times c + 11 \times d\ (\text {mod}\ 11) \\ & \equiv 0\ (\text {mod}\ 11) \end{align*}