Answer:
b
Step-by-step explanation:
it has the largest iqr box.
Answer:
7:04 p.m.
Step-by-step explanation:
Fermat's little theorem states that

≡a mod p
If we divide both sides by a, then

≡1 mod p
=>

≡1 mod 17

≡1 mod 17
Rewrite

mod 17 as

mod 17
and apply Fermat's little theorem

mod 17
=>

mod 17
So we conclude that

≡1 mod 17
The chances are 3/6 or 1/2
Answer:
17m
(Anyone can correct me if I'm wrong)
Step-by-step explanation:
The following equation would be used: 
We would simply substitute the given values, move the values around then we would get our answer:
