0

Let, $S= 2^{1} + 22^{11} + 222^{111} \cdots +22222222222^{11111111111}$.

  1. What will be the remainder if $S$ is divided by $7$?

  2. Prove that $S$ is not divisible by $5.$

Attempt:

  • Can the first part be solved by using the Chinese Remainder Theorem and modular arithmetic?
  • Does anyone have any other clue or hint to solve the problem?
Anne Bauval
  • 34,650
trombho
  • 1,591
  • The comment about the number of $2's$ and the number of $1's$ is hard to follow. In that last summand there are eleven $2's$ and eleven $1's$. So...what did you mean? – lulu Dec 01 '19 at 12:07
  • @lulu I left the topic of the things I thought of doing. But I couldn't effect – trombho Dec 01 '19 at 12:09
  • Anyway, it isn't difficult to compute each term $\pmod 5$. No matter how many $2's$ you have, $222\dots 2\equiv 2 \pmod 5$. And $111\dots 1\equiv 3\pmod 4$ except in the case where you only have one $1$. – lulu Dec 01 '19 at 12:12
  • I'm sorry, it was just a mistake. – trombho Dec 01 '19 at 12:12
  • Check my answer in https://math.stackexchange.com/questions/279333/what-will-be-the-ones-digit-of-the-remainder-in-left55552222-2222555 – lab bhattacharjee Dec 01 '19 at 12:15

1 Answers1

2

For the last part: taking everything modulo $5$ and noting that bases are $\equiv 2$ modulo $5$ while we only have to consider the exponents modulo $4$ because of Fermat's little theorem, so we get remainders mod 5 of $2^1 = 2$, and $2^{3} \equiv 3$ for the other ones (as all exponents are 11 mod 100, so 3 mod 4), so $10 \times 3$ for the last terms and so 32 in total which is still $2$ modulo $5$ and not $0$ so the sum is not divisible by $5$.

For the first part look at modulo $7$ values. The bases are (mod 7):

$$2,1,5,3,4,0,2,1,5,3,4$$

while the exponents (mod 6, because of little Fermat) are:

$$1,5,3,1,5,3,1,5,3,1,5$$

so consider $$2^1+ 1^5 + 5^3 + 3^1+4^5+ 0^1+2^5+1^3+5^1+4^5 \pmod{7}$$

which equals $0$. So the number is divisible by $7$.

Henno Brandsma
  • 242,131