We want the fractional part of 152403. By definition, if we divide 2403 by 15 we can write
2403=15q+k
where q is the quotient and k is the remainder satisfying 0≤k<15. Then
152403=q+15k,
so the fractional part is exactly 15k. Our task is therefore to find the remainder k when 2403 is divided by 15; symbolically, we must evaluate
k≡2403(mod15).
To do this efficiently we recall Euler’s theorem. First we note that gcd(2,15)=1, so Euler’s theorem applies. The theorem states:
If gcd(a,n)=1, then aϕ(n)≡1(modn).
Here n=15, so we compute Euler’s totient function ϕ(15). Since 15=3⋅5 with both factors prime, we have
ϕ(15)=15(1−31)(1−51)=15⋅32⋅54=8.
Therefore, by Euler’s theorem,
28≡1(mod15).
Now we use this congruence to break the large exponent 403 into manageable parts. Write the exponent in the form
403=8⋅50+3.
So,
2403=28⋅50+3=28⋅50⋅23=(28)50⋅23.
Since 28≡1(mod15), raising it to any power keeps it congruent to 1:
(28)50≡150≡1(mod15).
Hence,
2403≡1⋅23(mod15).
We still need 23, and that is straightforward:
23=8.
So we finally have
2403≡8(mod15).
Comparing this with our earlier definition 2403=15q+k, we see the remainder is
k=8.
Because 0≤k<15, this value is valid. The fractional part of 152403 is therefore 158, and the asked integer is k=8.
Hence, the correct answer is Option C.