Answer:
Z=1
Step-by-step explanation:
please mark me as brainlest
The restaurant needs at least 761 forks.
There are currently 205 forks
Each set on sale contains 10 forks,
The number of set taht have to buy are x
Number of forks in x set are = 10x
Since, we need at least 761
So 761 should be graeter than equal to the sum of reamining forks and the new forks
i.e. 761 ≥ 10x + 205
Answer : 3. 761 ≥ 10x + 205
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
S^2+3s-1”=0 pls give Brainliest Im BEGGING
Answer:
4
Explanation:
Since the third term is the sum of the two previous terms
Continuing in like manner
Since
Recall:
The sequence is therefore:
8,-5,3,-2,1,-1,0
The sum of the seven numbers is 4.