Sherlock is learning modular arithmetic. He divides
4
9
9
by
1
7
and finds the residue. What is the integer that he finds?
This problem is a part of the set Along Came A Spider.
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.
how did -1 come to be??
Why is this question Flagged?
Log in to reply
The problem was previously flagged because it was initially unclear. It has since been cleared up by the creator, and I have unflagged it.
The problem previously stated:
It took Sherlock 99 days to solve a case. Everyday, he used only one vehicle, the options being : bicycle, motorbike, gyro-copter and a Lamborghini. Now, the criminal, who now lives in the jail, jots down every possible combinations of vehicles Sherlock could use (that is an arduous task). After that, he starts to send 17 of the combinations each to his friends via some arcane medium. Obviously, he finds out that the last voucher did not contain 17 combinations at all. But Sherlock knows the trick, and so, just monitoring the activities of the jailed criminal a while, he tells us the number of combinations contained in the last voucher. What is the number, however?
Log in to reply
4 5 ≡ 4
4 6 ≡ 1 6
4 7 ≡ 1 3
4 8 ≡ 1
9 9 ≡ 3 ≡ 7 m o d ( 4 )
∴ 4 9 9 ≡ 1 3 m o d ( 1 7 )
Problem Loading...
Note Loading...
Set Loading...
4 9 9 ≡ ( 4 2 ) 4 9 . 4 ≡ ( − 1 ) 4 9 . 4 ≡ ( − 4 ) ≡ 1 3 ( m o d 1 7 )
Thus, the answer is 1 3