Solve the following inequalities with whichever method you like. a) −2x( x− 2)² 2 (x − 1)( x+ 1) ≤ 0

b)x ³+x= -4x²+6

let's add {f(x)=x+1}f(x)=x+1 and {g(x)=2x}g(x)=2x together to make a new function.

f(x)+g(x) =(x+1)+(2x)=x+1+2x=3x+1

let's call this new function hh. so we have:

{h(x)}={f(x)}+{g(x)}{=3x+1}h(x)=f(x)+g(x)=3x+1

we can also evaluate combined functions for particular inputs. let's evaluate function hh above for x=2x=2. below are two ways of doing this.

method 1: substitute x=2x=2 into the combined function hh.

h(x)

h(2)

​    

=3x+1

=3(2)+1

=7

​ since h(x)=f(x)+g(x)h(x)=f(x)+g(x), we can also find h(2)h(2) by finding f(2) +g(2)f(2)+g(2).

first, let's find f(2)f(2):

f(x)

f(2)

​    

=x+1

=2+1

=3

​  

now, let's find g(2)g(2):

g(x)

g(2)

​    

=2x

=2⋅2

=4

​  

so f(2)+g(2)=3+4=\greend7f(2)+g(2)=3+4=7.

notice that substituting x =2x=2 directly into function hh and finding f(2) + g(2)f(2)+g(2) gave us the same answer!

hope this !

let me know

answer: y = 3/2 x - 3

y = 1/8 x - 3/4 that would be your correct option

step-by-step explanation: w

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.