What is the remainder when $213987654213473846989272654857367287454572836418486364$ is divided by $48$?

Question

Can it be done by hand i.e. to find the remainder when $213987654213473846989272654857367287454572836418486364$ is divided by $48$?

Answer 1

Let the large integer $N$. Since $48 = 2^4 \cdot 3$, by the Chinese Remainder Theorem, it suffices to find the remainder $N$ when is divided by $16$ and $3$.

Since $10^4$ is divisible by $16 = 2^4$, we only need to look at the last four digits to determine the remainder when $N$ is divided by $16$.

We can look at the sum of the digits of $N$ mod $3$ to get the remainder when $N$ is divided by $3$.

Both of these are easy to do by hand.

Answer 2

One way would be to perform a long division by $48$, which is not even that hard to do.

Another way is to compute the remainder modulo $3$, which can be obtained from the digit sum, and the remainder modulo $16$, which is determined only by the last four digits.

Answer 3

Hint $\ \begin{align} n\equiv a&\!\!\!\pmod 3\\ n\equiv b&\!\!\!\pmod {\color{#c00}{16}}\end{align}\!\!\!\!\overset{\ \ \rm CRT}\iff n\equiv b+16(a\!-\!b)\pmod{48},\ $ and $\ 2\mid 10\,\Rightarrow\,\color{#c00}{2^4}\!\mid 10^4,\,$

and, $\ {\rm mod}\ 3\!:\ 10\equiv 1\,\Rightarrow\, n = f(10)\equiv f(1)\equiv $ digit sum (casting out threes, like nines).

Answer 4

Let the giant number be $N$, thus sum of the digits is $276$ (yes, I calculated that by hand) and $48 = 2^4 \times 3$.

Now sum of digits is $276$, which tells us that it gives $0$ as remainder when divided by $3$ as $3$ divides $276$, so $N \bmod 3 = 0$.

Last four digits are $6364 = 16 \times 397 + 12$ (hardly five minutes, without calculator, I took around two).

Now $(16, 3) = 1$. Therefore Chinese remainder theorem tells us we need to find the number between $0$ and $48$ such that it is divisible by $3$ and leaves remainder $12$ when divided by $16$.

Only $12$ and $44$ leaves remainder $12$ when divided by $16$, but $44$ is not divisible by $3$.

Hence, the remainder is $12$.

Answer 5

That certainly looks like a daunting number, but you can cut it down to a more manageable size, since what you're interested in is where it falls in relation to multiples of 48. Starting with the most significant digit (the leftmost) and moving to the right, add up the digits and delete them each time you accumulate to a multiple of 3, until you're left with five or four digits:

$54213473846989272654857367287454572836418486364$

$213473846989272654857367287454572836418486364$

$3473846989272654857367287454572836418486364$

$\ldots$

$86364$

This tells us that 2139876542134738469892726548573672874545728364184 is divisible by 3, and since 86364 is also divisible by 3, then so is 213987654213473846989272654857367287454572836418486364. It follows that 213987654213473846989272654857367287454572836418400000 is divisible by 16, a conclusion easily arrived at knowing that $10^4 = 2^4 \times 5^4$. Therefore we can focus our attention on 86364, a far more manageable number.

Is 86364 divisible by 16? It is not, it leaves a remained of 12. But $86364 - 12 = 86352$, which is divisible by 3 and by 16, and is therefore a multiple of 48. Thus the answer is 12.

What I have described here is neither the most elegant nor the most efficient way to get the answer. But it is the most basic (you don't need to know the Chinese remainder theorem, though it comes in handy for many different problems), second only to actually doing the long division.