Math-o-Fun

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 15 { 3 }^{ 15 } is divided by 2 and when 3 15 { 3 }^{ 15 } is divided by 4.


The answer is 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.

3 solutions

Manish Dash
Jun 2, 2015

Let 3 = x

Part 1 When 3 15 { 3 }^{ 15 } is divided by 2

2 = (x-1)

W h e n 3 15 i s d i v i d e d b y 2 , w e g e t x 15 ÷ ( x 1 ) \therefore \quad When\quad { 3 }^{ 15 }\quad is\quad divided\quad by\quad 2,\quad we\quad get\quad { x }^{ 15 }\div (x-1)

By using remainder theorem, we get the answer as 1.

Part 2 When 3 15 { 3 }^{ 15 } is divided by 4

4 = (x+1)

W h e n 3 15 i s d i v i d e d b y 4 , w e g e t x 15 ÷ ( x + 1 ) \therefore \quad When\quad { 3 }^{ 15 }\quad is\quad divided\quad by\quad 4,\quad we\quad get\quad { x }^{ 15 }\div (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 \boxed { \therefore \quad Final\quad answer\quad =\quad 1+3=4 }

@Swapnil Das , Cheers!

Manish Dash - 6 years ago

Log in to reply

Cheers! @Manish Dash

Swapnil Das - 6 years ago
Nihar Mahajan
Jun 3, 2015

3 1 ( m o d 2 ) 3 15 1 15 1 ( m o d 2 ) 3 1 ( m o d 4 ) 3 15 ( 1 ) 15 1 3 ( m o d 4 ) \large{3 \equiv 1 \pmod{2} \\ \Rightarrow 3^{15} \equiv 1^{15} \equiv 1 \pmod{2} \\ 3 \equiv -1 \pmod{4} \\ \Rightarrow 3^{15} \equiv (-1)^{15} \equiv -1 \equiv 3 \pmod{4}}

Hence , sum of remainders = 1 + 3 = 4 =1+3=\boxed{4}

Well, I did it the same way!

Swapnil Das - 6 years ago

hey! our methods of solving are very very similar bro...

Sarthak Rath - 6 years ago

Log in to reply

Thanks!Upvote it then :) :) :) :P

Nihar Mahajan - 6 years ago

Log in to reply

done..... in which class are u? 10?

Sarthak Rath - 6 years ago

Log in to reply

@Sarthak Rath 10th yeah..

Nihar Mahajan - 6 years ago

Log in to reply

@Nihar Mahajan So you are looking at my status..... ?????

Sarthak Rath - 6 years ago

Log in to reply

@Sarthak Rath yeah!!!! :P

Nihar Mahajan - 6 years ago

Log in to reply

@Nihar Mahajan what is" :P "??

Sarthak Rath - 6 years ago
Prakhar Gupta
Jun 3, 2015

Let's first of all we find the remainder when 3 15 3^{15} is divided by 2.

We know that 3 15 3^{15} is an odd number. So the remainder is 1 1 .

Now we have to find the remainder when 3 15 3^{15} is divided by 3.

Let's observe a pattern:- 3 = 0 × 4 + 3 3 = 0\times4+3 3 2 = 2 × 4 + 1 3^{2} = 2\times4 +1 3 3 = 6 × 4 + 3 3^{3} = 6\times4+3 3 4 = 20 × 4 + 1 3^{4} = 20\times4+1 On observing this we can conclude that:-

3 n = p × 4 + 1 3^{n} = p\times4 +1 , if n is even.

3 n = q × 4 + 3 3^{n} = q\times4+3 , if n is odd.( Here, p p and q q , are integers).

But here n = 15 n=15 so remainder is 3.

So, sum of remainders is, 1 + 3 = 4 1+3=\boxed{4} .

Now I'm going to post the proof of conclusion made on observation.

Claim:- 3 n 3^{n} leaves remainder 3 3 when divided by 4 4 when n n is odd.

Proof:- Every odd number can be written as 2 m + 1 2m+1 .

Hence, n = 2 m + 1 n = 2m+1 , where m m is an integer. Now:- 3 n = 3 2 m + 1 3^{n} = 3^{2m+1} = 3. 3 2 m = 3.3^{2m} = 3. 9 m = 3.9^{m} = 3. ( 1 + 8 ) m = 3.(1+8)^{m} 3 ( 1 + ( m 1 ) 8 + ( m 2 ) 8 2 + ) 3(1+\binom{m}{1}8 + \binom{m}{2}8^{2} + \ldots ) 3 + 3.4 ( ( m 1 ) 2 + ( m 2 ) 16 + ) 3 + 3.4(\binom{m}{1}2+\binom{m}{2}16+ \ldots ) Now this can be written as 3 n = 4 p + 3 3^{n} = 4p+3 Similarly, we can prove that 3 n 3^{n} leaves remainder 1 1 when divided by 4 4 if n n is even.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...