Consider now an election with 3 candidates. say there is a winner only if a candidate recieves more than 50 percent of the vote, otherwise there is no winner. if we’re given another integer’s worth of storage, come up with an algorithm to determine the winner if there is one. for simplicity, your algorithm can output any of the candidates in the case that there is no winner (not necessarily the one with the most votes). votes are now numbered 0, 1, 2.

first one is a: renaming a fraction. second one is c: de-c

step-by-step explanation:

my explanation is that these were the answers on edg : )

-1/2 +2

step-by-step explanation:

answer: c, the green line

step-by-step explanation:

there is no black line, eliminate b.

simple interest implies periodic payments, but the red line shows no payments, eliminate d.

simple interest has equal payments. if paid say every day, the graph is about a straight line (actually a stairstep).

the yellow line is not straight, eliminate a.

check: the green line is straight, answer is c.

simple interest with positive interest rate gives a straight line sloping up to the right. green line:

g(t) = $100 + ($200-$100) ÷ (20 years) × (t years)

= $100 + (4%/year) × ($100)(t years)

incidentally, the yellow line curving upward represents continuously compounded interest

y = $100 × 2^(t years / (14 assuming the yellow line hits $200 at 14 years. 2^0 is 1, so y(0) = $100; 2^(14/14) is 2, so y(14) = $200.

guess at question:

a vertical line intersects the graph of g(x,y) = 0 at two points. what conclusion follows about the function f(x) implicitly defined by g(x,f(x)) = 0?

the domain of f(x) cannot include the x coordinate of any such vertical line.

informally, f(x) is not a function, and

g(x,y)=0 cannot be solved for y uniquely.

the relation r = {(x,y) such that g(x,y) = 0} is a function if

for all (a,b) ∊ r and (c,d) ∊ r, a=c implies b=d.

step-by-step explanation: