(a) let us prove fermat's little theorem. let p be a prime number. prove by induction on n that for all n e nu {0}, it holds that np = n (mod p). mark, where you need that p is a prime. (hint: use #5,#6 from page 12 and show that when 0

the inequality is:

250c+180g≥950

step-by-step explanation:

let c denotes the number of days in a week   miyoko worked as a cryptographer.

and g denotes the number of days in a week she works as a geologist.

now we are given that she earns $250 for every day she works as a cryptographer,and earns $180 for every day she works as a geologist.

now miyoko's goal is to earn more than $950 this week.

hence, the inequality could be represented as:

250c+180g≥950

what level of math? also i don't need to be paid if i can you.