Crack The Number Code

Sherlock Holmes is solving a mystery and he wants to crack a computer's code.

The code is a 1000 digit long positive integer written in base-99 and the last few digits of this number are 123569.

If he can find the remainder when the large number is divided by 33, he can crack the code. Can you help him by determining the remainder?


The answer is 9.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Arulx Z
Jan 22, 2016

The number can be written as

x 1 99 999 + x 2 99 998 + + x 995 99 6 + 1 99 5 + 2 99 4 + 3 99 3 + 5 99 2 + 6 99 + 9 99 0 { x }_{ 1 }\cdot { 99 }^{ 999 }+{ x }_{ 2 }\cdot { 99 }^{ 998 }+\dots +{ x }_{ 995 }\cdot { 99 }^{ 6 }+1\cdot { 99 }^{ 5 }+2\cdot { 99 }^{ 4 }+3\cdot { 99 }^{ 3 }+5\cdot { 99 }^{ 2 }+6\cdot 99+9\cdot { 99 }^{ 0 }

The thing to realize here is that simple division is just repeated subtraction . It can be easily found out that every term other than the last one is divisible by 33 because 99 = 3 33 99 = 3 \cdot 33 .

So to find the remainder, we just need to remove all the multiples of 33 from the number. We can write the number again but this time in a simplified way: 33 n + 9 33n+9 , for some integer n n . Since we just want the remainder, it is 9.

Moderator note:

Simple standard approach.

99 is divisible by 33. A number in base 99 with the last digit as 0 should be divisible by 33. Since the last number is 9, the closest number divisible by 33 in base 99 is the code with the last digit as 0 instead of 9. Thus the remainder is 9.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...