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.
Being lambda of 3 9 = 1 2 3 7 ≡ 1 ( m o d 1 2 ) so 6 5 3 7 8 0 ≡ 6 5 ( m o d 3 9 ) and 6 5 ≡ 2 6 ( m o d 3 9 ) . Thus the solution is 2 6
I don't think you can use lambda here since g cd ( 6 5 , 3 9 ) = 1 3 = 1 .
Log in to reply
Mhh, yes it's true, anyway I tryed also with phi and then lambda and both works. But I think that probably in these cases it's better to use Chinese remainder theorem.
Log in to reply
Exactly! Just solve the congruency modulo 3 (using Fermat) and you will get it "for free" modulo 13. I have modified my solution to show this approach explicitly.
Log in to reply
@Otto Bretscher – Yes. This is the best way
Problem Loading...
Note Loading...
Set Loading...
6 5 3 7 8 0 ≡ 6 5 1 ( m o d 3 ) by Fermat. This holds modulo 13 as well so 6 5 3 7 8 0 ≡ 6 5 ≡ 2 6 ( m o d 3 9 ) .