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:.........................................................................................................................
I wish I could tell you, I’m stuck on it too
Answer:
<em>p ≥ 5</em>
<em>Scott will buy at least 5 kilograms of candy.</em>
Step-by-step explanation:
<u>Inequalities</u>
The candy Scott buys cost $7 per kilogram.
Let's set p=number of kilograms of candy Scott will buy.
The money spent to buy p kilograms of candy is 7p dollars.
The condition states he will spend at least $35 on candies, thus the following inequality is formed:
7p ≥ 35
Dividing by 7:
p ≥ 35/7
Operating:
p ≥ 5
Scott will buy at least 5 kilograms of candy.
Answer:
Option C: 41
Step-by-step explanation:
<ABD+<CBD=90
<ABD=8x+1
<CBD=6x+5
(8x+1)+(6x+5)=90
Combine like terms
(8x+6x)+(1+5)=90
14x+6=90
14x=90-6
14x=84
divide both sides by 14
x=6
Now we plug that value into <DBC = 6x+5
6(6)+5=
36+5
41
