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:
C. 4.1*10^-5
Step-by-step explanation:
that is the answer
What you have to do to find the median of the data is first put that data into order numerically. You can go largest to smallest or smallest to largest, it doesn't matter. <span>
22, 24, 28, 28, 30, 31, 31, 32, 32, 35, 36, 37, 38, 41, 42, 42, 44, 44, 45, 46, 46, 47, 47, 49, 50
Once you put them into order, you count towards the middle. You have 25 data points, so the middle, which will be your median number, will be 13 points in.
The median is 38</span>
Answer:
6 eggs
Step-by-step explanation: you need to divide 2 by one-third. So, set it up. 2/1 divided by 1/3. The method I use is keep, change, flip. Keep 2/1, and flip 1/3 to 3/1. Now you have 2/1 multiplied by 3/1 which is 6.
I think the answer is chunking.
This is due to effect of chunking because chunking is basically the multi-store memorizing method.