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
Answer:
Step-by-step explanation:
Yes daddy put itbinside
Answer:
The Commutative Law of Addition.
Step-by-step explanation:
Basically, this law says we can swap numbers over and still get the same number when we add. This has demonstrated exactly that.
Hope this helped!
The option third "P(Male or Type B) < P(Male | Type B)" is correct because 0.575 < 0.76
<h3>What is probability?</h3>
It is defined as the ratio of the number of favorable outcomes to the total number of outcomes, in other words, the probability is the number that shows the happening of the event.
P(Male or Type B) = (number of male + number of type B - number that are both)/total population

= 0.575
P(Male | Type B) = (number of male people inside the type B)/(number of Type B people)
= 38/(38 + 12)
= 0.76
0.575 < 0.76
P(Male or Type B) < P(Male | Type B)
Thus, the option third "P(Male or Type B) < P(Male | Type B)" is correct because 0.575 < 0.76
Learn more about the probability here:
brainly.com/question/11234923
#SPJ1
Set each set of parentheses to 0 and solve for x.
X—6 = 0
X = 6
X + 5 = 0
X = -5
X-9 = 0
X = 9
The zeros are 6, -5, 9