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?
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.
The number can be written as
x 1 ⋅ 9 9 9 9 9 + x 2 ⋅ 9 9 9 9 8 + ⋯ + x 9 9 5 ⋅ 9 9 6 + 1 ⋅ 9 9 5 + 2 ⋅ 9 9 4 + 3 ⋅ 9 9 3 + 5 ⋅ 9 9 2 + 6 ⋅ 9 9 + 9 ⋅ 9 9 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 9 9 = 3 ⋅ 3 3 .
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: 3 3 n + 9 , for some integer n . Since we just want the remainder, it is 9.