Chase was trying to solve for x and y. he knows that the value of x is 3 times the value of y and that half of x plus twice y is equivalent to –14.

which system of equations could he use to solve for x and y?
a. 3 y = x
12 x + 2 y = –14

b. 3 x = y
12 y + 2 x = –14

c. 3 y + x = –14
12 x = 2 y

d. 3 x + y = –14
12 y = 2 x

answer:

it is general formula that is used to write value to its excet position

a11 a12 a13

a21 a22 a23

it is the example of order 2 by 3 matrix in this

a11 means value occur in 1 st row 1st column

a12 means value occurs in 1st row 2nd column

a13 means value occur in 1st row and 3rd column

a21 means value occurs in 2nd row and 1st column

a22 means value occurs in 2nd row and in 2nd column

a23 means value occurs in 2nd row and in 3rd column

step-by-step explanation:

left be aligning the decimal points is required to not required see the number of digits to the right

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.

this is a good question! i’ll do some research and what i find, i’ll contact you asap when i have something! ✊