Question 884543
<pre>
We use the theorem

2<sup>n(p-1)</sup> &#8801; 1 (mod p)  where p is prime

2<sup>1500</sup> mod 13 = 2<sup>125*12</sup> = 2<sup>125(13-1)</sup>

Using the theorem with n=125, p = 13,

Answer: 1

Edwin</pre>