Give an example of a two-person zero-sum game where there are no pure nash equilibria. can you give an example where all the entries of the payoff matrix are different?

the solution is x=1

step-by-step explanation:

we are given our   equation as

let's assume

left side function is

right side function is

now, we can draw graph

and then we can get intersection point

the intersection point will be solution

so, the solution is

x=1

c = 0.429t

step-by-step explanation:

the constant rate at which carlos harvests cassava is 35 minutes per 15 cassavas 15/35 = 0.429 cassava per minute

therefore, an equation that models the number of cassava (c) that harvest carlos in a time (t) is the following:

where t is the time in minutes.

this means that when 35 minutes have elapsed 15 cassava have been harvested, at 70 minutes 30 cassava have been harvested and so on.