Adding 3, and still no change? Strange!

A number, when divided by 11, gives a remainder K K . If the digit 3 3 is placed at the end of the number, the remainder when divided by 11 still remains K K .

Find the remainder when K ( K 1 ) ( K 2 ) 3 2 1 \displaystyle K^{(K-1)^{(K-2)^{\dots^{3^{2^1}}}}} is divided by 11 11 .


Details and assumptions :-

The number is in base 10.

Placing the digit 5 at the end of 123 123 makes the number into 1235 1235 .

If K K was 5 5 , you had to find the remainder when 5 4 3 2 1 5^{4^{3^{2^1}}} is divided by 11 11 .


This is a part of the set 11≡ awesome (mod remainders)


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.

1 solution

Aditya Raut
Oct 21, 2014

Let the number be x x . Thus we have x K ( m o d 11 ) x \equiv K \pmod{11}

Placing the digit 3 3 at the end, makes the number x x into 10 x + 3 10x+3 .

Thus we have 10 x + 3 10 K + 3 K ( m o d 11 ) 10x+3 \equiv 10K+3 \equiv K \pmod{11} (The remainder hadn't changed, hence new remainder is same as K K )

This gives 10 K + 3 K ( m o d 11 ) 9 K + 3 0 ( m o d 11 ) 3 K 1 ( m o d 11 ) 3 K × 7 1 × 7 ( m o d 11 ) 21 K K 7 ( m o d 11 ) K 7 ( m o d 11 ) 10K+3 \equiv K \pmod{11} \\ \therefore 9K +3\equiv 0 \pmod{11} \\ \therefore 3K \equiv -1 \pmod{11} \\ \therefore 3K \times 7 \equiv -1\times 7 \pmod{11}\\ \therefore 21 K \equiv -K \equiv -7 \pmod{11} \\ \therefore K \equiv 7 \pmod{11}

Hence K = 7 K=7 .

Now we have to find the remainder when 7 6 . . . 2 1 7^{6^{...{2^1}}} is divided by 11 11 .

By Fermat's little theorem,

7 10 1 ( m o d 11 ) 7^{10} \equiv 1 \pmod{11} And 6 5 . . . 2 1 6 ( m o d 10 ) 6^{5^{...^{2^1}}} \equiv 6 \pmod{10} (The unit's digit of 6 k 6^k is always 6 6 )

Hence 7 6 . . . 2 1 7 6 4 ( m o d 11 ) 7^{6^{...{2^1}}} \equiv 7^6 \equiv 4\pmod{11}

Hence the answer is 4 \boxed{4}

I also got that k = 7 k=7 but I am not getting the right remainder.I am getting 1 1 as the answer.Please tell me what is wrong with this:
7 ( 4 ) ( m o d 11 ) 7\equiv(-4)(mod11) , 7 2 ( 5 ) ( m o d 11 ) 7^{2}\equiv(5)(mod11) ,
7 4 ( 3 ) ( m o d 11 ) 7^{4}\equiv(3)(mod11) ,multiplying gives,
7 6 4 ( m o d 11 ) 7^{6}\equiv4(mod11) ,
7 6 5 4 5 ( m o d 11 ) 7^{6^{5}} \equiv 4^{5} (mod11) , 4 5 1 ( m o d 11 ) 4^{5}\equiv1(mod11)


PLEASE HELP!!! @Aditya Raut

satyendra kumar - 6 years, 7 months ago

Log in to reply

Your main issue is that you are evaluating the exponent from the "bottom up", ie you are looking at 7 , 7 6 , ( 7 6 ) 5 7, 7 ^ 6 , {(7 ^ 6)} ^ 5 .

However, exponents are actually evaluated top down. For example, 5 3 2 5 ^ { 3 ^ 2 } is actually equal to 5 9 5 ^ 9 and not ( 5 3 ) 2 = 5 6 ( 5 ^3 ) ^ 2 = 5 ^ 6 .

Calvin Lin Staff - 6 years, 7 months ago

Log in to reply

Oh!that is just awesome.Thanx a bunch for clearing my doubt sir.

satyendra kumar - 6 years, 7 months ago

what is wrong with that code?

Adarsh Kumar - 6 years, 7 months ago

Did the same.

Priyanshu Mishra - 5 years, 7 months ago

But lets take no. 12.

We get 12 mod 11=1 Even 123 mod 11 =1

So answer should be 12-11=1

Archit Boobna - 6 years, 7 months ago

Log in to reply

"123 mod 11 =1" Incorrect, that's equal to 2...

Raphael Nasif - 6 years, 7 months ago

Hello Archit, are you a fiitjee student? Have you cleared for NMTC final test 2015?

If so , what is your expected score ?

Priyanshu Mishra - 5 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...