A number, when divided by 11, gives a remainder K . If the digit 3 is placed at the end of the number, the remainder when divided by 11 still remains K .
Find the remainder when K ( K − 1 ) ( K − 2 ) … 3 2 1 is divided by 1 1 .
Details and assumptions :-
The number is in base 10.
Placing the digit 5 at the end of 1 2 3 makes the number into 1 2 3 5 .
If K was 5 , you had to find the remainder when 5 4 3 2 1 is divided by 1 1 .
This is a part of the set 11≡ awesome (mod remainders)
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.
I also got that
k
=
7
but I am not getting the right remainder.I am getting
1
as the answer.Please tell me what is wrong with this:
7
≡
(
−
4
)
(
m
o
d
1
1
)
,
7
2
≡
(
5
)
(
m
o
d
1
1
)
,
7
4
≡
(
3
)
(
m
o
d
1
1
)
,multiplying gives,
7
6
≡
4
(
m
o
d
1
1
)
,
7
6
5
≡
4
5
(
m
o
d
1
1
)
,
4
5
≡
1
(
m
o
d
1
1
)
PLEASE HELP!!! @Aditya Raut
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 .
However, exponents are actually evaluated top down. For example, 5 3 2 is actually equal to 5 9 and not ( 5 3 ) 2 = 5 6 .
Log in to reply
Oh!that is just awesome.Thanx a bunch for clearing my doubt sir.
what is wrong with that code?
Did the same.
But lets take no. 12.
We get 12 mod 11=1 Even 123 mod 11 =1
So answer should be 12-11=1
Log in to reply
"123 mod 11 =1" Incorrect, that's equal to 2...
Hello Archit, are you a fiitjee student? Have you cleared for NMTC final test 2015?
If so , what is your expected score ?
Problem Loading...
Note Loading...
Set Loading...
Let the number be x . Thus we have x ≡ K ( m o d 1 1 )
Placing the digit 3 at the end, makes the number x into 1 0 x + 3 .
Thus we have 1 0 x + 3 ≡ 1 0 K + 3 ≡ K ( m o d 1 1 ) (The remainder hadn't changed, hence new remainder is same as K )
This gives 1 0 K + 3 ≡ K ( m o d 1 1 ) ∴ 9 K + 3 ≡ 0 ( m o d 1 1 ) ∴ 3 K ≡ − 1 ( m o d 1 1 ) ∴ 3 K × 7 ≡ − 1 × 7 ( m o d 1 1 ) ∴ 2 1 K ≡ − K ≡ − 7 ( m o d 1 1 ) ∴ K ≡ 7 ( m o d 1 1 )
Hence K = 7 .
Now we have to find the remainder when 7 6 . . . 2 1 is divided by 1 1 .
By Fermat's little theorem,
7 1 0 ≡ 1 ( m o d 1 1 ) And 6 5 . . . 2 1 ≡ 6 ( m o d 1 0 ) (The unit's digit of 6 k is always 6 )
Hence 7 6 . . . 2 1 ≡ 7 6 ≡ 4 ( m o d 1 1 )
Hence the answer is 4