Find the remainder when 5 0 5 1 5 3 is divided by 1 1 .
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.
Since g cd ( 5 0 , 1 1 ) = 1 , we can use Euler's Theorem. First, we need to find 5 3 modulo ϕ ( 1 0 ) = 4 , second, we need to find 5 1 5 3 modulo ϕ ( 1 1 ) = 1 0 , and the last we need to find 5 0 5 1 5 3 modulo 1 1 .
5 3 ≡ 1 ( m o d 4 ) 5 1 5 3 ≡ 5 1 1 ≡ 1 ( m o d 1 0 ) 5 0 5 1 5 3 ≡ 5 0 1 ≡ 6 ( m o d 1 1 )
In last three lines you have just plugged in the values one after the other , but modulo is also changing from m o d 4 to m o d 1 0 and then to m o d 1 0 .We don' t need to care of them ??Just plug in the values ? Please explain.
Log in to reply
For more explanation please check Euler's Theorem . also, you can chek this problem and this , or this
Problem Loading...
Note Loading...
Set Loading...
Euler number E(11) = 11(1-1/11) = 10
Now, if D^m is the number whose remainder is to be found out.then D^E gives remainder 1 when divided by N
here, D= 50 m = 51^52
We should express m in terms of E. So 51^53 is to be written in the form of 10k + a. Now unit digit of 51^53 = 1 => 51^53 = 10k + 1.
=> 50^51^53 = 50^(10k + 1) = 50mod11 = 6mod11.
thus, Answer = 6 .