In Maths-o-Fun Quiz, the team of Swapnil and Manish needed to answer the last question to win the quiz. As soon as the last question appeared on the screen, both of them worked on the question and got the answer. They pressed the buzzer immediately and hence they won the quiz. Can you guess what was their answer?
The question was: Find the sum of the remainders when 3 1 5 is divided by 2 and when 3 1 5 is divided by 4.
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.
@Swapnil Das , Cheers!
3 ≡ 1 ( m o d 2 ) ⇒ 3 1 5 ≡ 1 1 5 ≡ 1 ( m o d 2 ) 3 ≡ − 1 ( m o d 4 ) ⇒ 3 1 5 ≡ ( − 1 ) 1 5 ≡ − 1 ≡ 3 ( m o d 4 )
Hence , sum of remainders = 1 + 3 = 4
Well, I did it the same way!
hey! our methods of solving are very very similar bro...
Log in to reply
Thanks!Upvote it then :) :) :) :P
Log in to reply
done..... in which class are u? 10?
Log in to reply
@Sarthak Rath – 10th yeah..
Log in to reply
@Nihar Mahajan – So you are looking at my status..... ?????
Log in to reply
@Sarthak Rath – yeah!!!! :P
Let's first of all we find the remainder when 3 1 5 is divided by 2.
We know that 3 1 5 is an odd number. So the remainder is 1 .
Now we have to find the remainder when 3 1 5 is divided by 3.
Let's observe a pattern:- 3 = 0 × 4 + 3 3 2 = 2 × 4 + 1 3 3 = 6 × 4 + 3 3 4 = 2 0 × 4 + 1 On observing this we can conclude that:-
3 n = p × 4 + 1 , if n is even.
3 n = q × 4 + 3 , if n is odd.( Here, p and q , are integers).
But here n = 1 5 so remainder is 3.
So, sum of remainders is, 1 + 3 = 4 .
Now I'm going to post the proof of conclusion made on observation.
Claim:- 3 n leaves remainder 3 when divided by 4 when n is odd.
Proof:- Every odd number can be written as 2 m + 1 .
Hence, n = 2 m + 1 , where m is an integer. Now:- 3 n = 3 2 m + 1 = 3 . 3 2 m = 3 . 9 m = 3 . ( 1 + 8 ) m 3 ( 1 + ( 1 m ) 8 + ( 2 m ) 8 2 + … ) 3 + 3 . 4 ( ( 1 m ) 2 + ( 2 m ) 1 6 + … ) Now this can be written as 3 n = 4 p + 3 Similarly, we can prove that 3 n leaves remainder 1 when divided by 4 if n is even.
Problem Loading...
Note Loading...
Set Loading...
Let 3 = x
Part 1 When 3 1 5 is divided by 2
2 = (x-1)
∴ W h e n 3 1 5 i s d i v i d e d b y 2 , w e g e t x 1 5 ÷ ( x − 1 )
By using remainder theorem, we get the answer as 1.
Part 2 When 3 1 5 is divided by 4
4 = (x+1)
∴ W h e n 3 1 5 i s d i v i d e d b y 4 , w e g e t x 1 5 ÷ ( x + 1 )
By using remainder theorem, we get the answer as -1. But the remainder should be positive and less than 4.
Hence adding 4 to -1 we get the answer as 3
∴ F i n a l a n s w e r = 1 + 3 = 4