Find the remainder when the above expression is divided by 19.
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 15, 23 and 19 are coprime integers, we can apply Euler's theorem as follows:
1 5 2 3 + 2 3 1 2 3 ≡ 1 5 2 3 mod ϕ ( 1 9 ) + 2 3 1 2 3 mod ϕ ( 1 9 ) ≡ 1 5 5 + 2 3 1 5 (mod 19) ≡ ( 1 9 − 4 ) 5 + ( 1 9 + 4 ) 1 5 (mod 19) ≡ ( − 4 ) 5 + 4 1 5 (mod 19) ≡ ( 1 6 ) ( 1 6 ) ( − 4 ) + 2 3 0 mod 1 8 (mod 19) ≡ ( − 3 ) ( − 3 ) ( − 4 ) + 2 1 2 (mod 19) ≡ − 3 6 + 1 6 3 (mod 19) ≡ 2 + ( − 3 ) 3 (mod 19) ≡ 2 − 2 7 (mod 19) ≡ − 2 5 (mod 19) ≡ 1 3 (mod 19) Euler’s totient function ϕ ( 1 9 ) = 1 8