Answer:
3
Step-by-step explanation:
All factorials 5 and above are evenly divisible by 15, so have no remainder. Thus, you are interested in ...
mod(1! +2! +3! +4!, 15) = mod(1 +2 +6 +24, 15)
= mod(33, 15) = 3
The remainder is 3.
B. 39
Good luck on yourself timed exam!
Answer:
The probability that he teleports at least once a day = 
Step-by-step explanation:
Given -
Evan lives in Stormwind City and works as an engineer in the city of ironforge in the morning he has three Transportation options teleport ride a dragon or walk to work and in the evening he has the same three choices for his trip home.
Total no of outcomes = 3
P( He not choose teleport in the morning ) = 
P( He not choose teleport in the evening ) = 
P ( he choose teleports at least once a day ) = 1 - P ( he not choose teleports in a day )
= 1 - P( He not choose teleport in the morning )
P( He not choose teleport in the evening )
= 
= 
Answer: number 3
Step-by-step explanation: