How do I solve for g(x) and h(x)?

false

step-by-step explanation:

rulers and compasses arent required in order to bisect an angle because when bisecting angles, you're making a "half circle" and considering in order to bisect an angle it wouldn't be straight, you wouldn't need either of the two

answer: the distance

step-by-step explanation:

to calculate the distance d of a line segment with endpoints (x1, y1) and (x2, y2) use the formula d (x2 x1)2 (y2 y1)2. to calculate the midpoint of a line segment with endpoints (x1, y1) and (x2, y2) use the formula

simplifying

5(x + -6) = 2(x + 3)

reorder the terms:

5(-6 + x) = 2(x + 3)

(-6 * 5 + x * 5) = 2(x + 3)

(-30 + 5x) = 2(x + 3)

reorder the terms:

-30 + 5x = 2(3 + x)

-30 + 5x = (3 * 2 + x * 2)

-30 + 5x = (6 + 2x)

solving

-30 + 5x = 6 + 2x

solving for variable 'x'.

move all terms containing x to the left, all other terms to the right.

add '-2x' to each side of the equation.

-30 + 5x + -2x = 6 + 2x + -2x

combine like terms: 5x + -2x = 3x

-30 + 3x = 6 + 2x + -2x

combine like terms: 2x + -2x = 0

-30 + 3x = 6 + 0

-30 + 3x = 6

add '30' to each side of the equation.

-30 + 30 + 3x = 6 + 30

combine like terms: -30 + 30 = 0

0 + 3x = 6 + 30

3x = 6 + 30

combine like terms: 6 + 30 = 36

3x = 36

divide each side by '3'.

x = 12

simplifying

x = 12

this should .

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.