Write a system of two linear equations showing the distance each animal can travel to model the fair race. Be sure to define all variables.
Y= output (distance) 5 mile lion/ 2.5 mile elephant
M=slope (speed) 50 lion /25 elephant
X=input(time) 6 minutes both

answer: a video game has three difficulty levels: easy, medium, and expert. the game's scoring works in such a way that a player has to score a fixed number of points to advance to the next level, and then the scoring starts over. the total score needed to clear all three difficulty levels is 7,500. two times the number of points needed to clear the easy level is 500 more than the number of points needed to clear the medium level. twice the number of points needed to clear the medium difficulty level is 1,500 more than the number of points needed to clear the expert level. if x, y, and z represent the easy, medium, and expert levels, respectively, and a is the coefficient matrix of the system of equations modeling this situation, identify the inverse matrix, a-1, and the solution matrix, x, of the system of equations.

ask for details followreport by buttfacelily 2 minutes ago

answers

rauschg

rauschg · hand

know the answer? add it here!

step-by-step explanation:

well we know there are 4 clubs in 52 cards so it’s replaced so it should be 3/51

step-by-step explanation:

i think it's eleven too, don't woosh me here, but according to the "experts" it's 2.

the proof starts from the peano postulates, which define the natural

numbers n. n is the smallest set satisfying these postulates:

  p1.   1 is in n.

  p2.   if x is in n, then its "successor" x' is in n.

  p3.   there is no x such that x' = 1.

  p4.   if x isn't 1, then there is a y in n such that y' = x.

  p5.   if s is a subset of n, 1 is in s, and the implication

      (x in s => x' in s) holds, then s = n.

then you have to define addition recursively:

  def: let a and b be in n. if b = 1, then define a + b = a'

      (using p1 and p2). if b isn't 1, then let c' = b, with c in n

      (using p4), and define a + b = (a + c)'.

then you have to define 2:

  def:   2 = 1'

2 is in n by p1, p2, and the definition of 2.

theorem:   1 + 1 = 2

proof: use the first part of the definition of + with a = b = 1.

      then 1 + 1 = 1' = 2   q.e.d.

note: there is an alternate formulation of the peano postulates which

replaces 1 with 0 in p1, p3, p4, and p5. then you have to change the

definition of addition to this:

  def: let a and b be in n. if b = 0, then define a + b = a.

      if b isn't 0, then let c' = b, with c in n, and define

      a + b = (a + c)'.

you also have to define 1 = 0', and 2 = 1'. then the proof of the

theorem above is a little different:

proof: use the second part of the definition of + first:

      1 + 1 = (1 + 0)'

      now use the first part of the definition of + on the sum in

      parentheses:   1 + 1 = (1)' = 1' = 2   q.e.d.