I will give brainliest just please help The equation ax2 + bx + c = 0 has no real solutions.
Which statement about the graph of f(x) = ax2 + bx + c could be true?

A. It could pass through the origin.
B. Its vertex could be at (–6, 0).
C. It could have a maximum at (–3, 2).
D. It could have a minimum at (0, 4).

D. It could have a minimum at (0, 4).

Step-by-step explanation:

ax2 + bx + c = 0  has no real solutions, which means it does not touch the x axis

Since it points upwards, the vertex must be above the x axis

It will have a minimum since it opens upwards

A. It could pass through the origin.   False

B. Its vertex could be at (–6, 0).   False

C. It could have a maximum at (–3, 2).   False

D. It could have a minimum at (0, 4).  True

hope it you

step-by-step explanation:

sin(7pi/6 - pi/3)  

= sin(7pi/6 - 2pi/6)  

= sin(5pi/6)  

= sin(pi - pi/6)  

= sin(pi/6)  

= 1/2  

sin 7pi/6 - sin pi/3  

= sin (pi + pi/6) - sin pi/3  

= -sin pi/6 - sin pi/3  

= -1/2 - sqrt(3)/2  

= -(1+sqrt(3))2

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.