Remainders Revisited #2

6 5 3 7 80 m o d 39 = ? \Large 65^{37^ {80}} \bmod 39 = \, ?


The answer is 26.

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

Otto Bretscher
Apr 12, 2016

6 5 3 7 80 6 5 1 ( m o d 3 ) 65^{37^{80}}\equiv 65^1 \pmod{3} by Fermat. This holds modulo 13 as well so 6 5 3 7 80 65 26 ( m o d 39 ) 65^{37^{80}}\equiv 65\equiv \boxed{26}\pmod{39} .

Matin Naseri
Mar 17, 2018

65 \text{}65 \equiv 26 ( m o d 39 ) \text{}26~{\pmod{39}}

Alex Spagnoletti
Apr 12, 2016

Being lambda of 39 = 12 39 = 12 37 1 ( m o d 12 ) 37 \equiv 1 \pmod{12} so 6 5 3 7 80 65 ( m o d 39 ) 65^{37^{80}} \equiv 65 \pmod{39} and 65 26 ( m o d 39 ) 65 \equiv 26 \pmod{39} . Thus the solution is 26 \boxed{26}

I don't think you can use lambda here since gcd ( 65 , 39 ) = 13 1 \gcd(65,39)=13\neq 1 .

Otto Bretscher - 5 years, 2 months ago

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.

Alex Spagnoletti - 5 years, 2 months ago

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.

Otto Bretscher - 5 years, 2 months ago

Log in to reply

@Otto Bretscher Yes. This is the best way

Alex Spagnoletti - 5 years, 2 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...