Finding the remainder when (1523+2323) is divided by 19.
When dividing by 19, we work with remainders:
15≡15(mod19)
23=19+4
23≡4(mod19)
The problem becomes finding the remainder of (1523+423) when divided by 19.
By Fermat's Little Theorem, for prime p=19:
a18≡1(mod19)
Since 23=18+5:
1523=1518×155
1523≡1×155(mod19)
423=418×45
423≡1×45(mod19)
Calculating 155(mod19):
152=225
225=11(19)+16
152≡16(mod19)
154=(152)2
154≡162=256(mod19)
256=13(19)+9
154≡9(mod19)
155=154×15
155≡9×15=135(mod19)
135=7(19)+2
155≡2(mod19)
Calculating 45(mod19):
42=16(mod19)
44=(42)2
44≡162=256(mod19)
256=13(19)+9
44≡9(mod19)
45=44×4
45≡9×4=36(mod19)
36=1(19)+17
45≡17(mod19)
(1523+423)≡155+45(mod19)
(1523+423)≡2+17(mod19)
(1523+423)≡19(mod19)
(1523+423)≡0(mod19)
Therefore, the remainder is 0.
The answer is option 4.