A political candidate feels that she performed particularly well in the most recent debate against her opponent. Her campaign manager polled a random sample of 400 likely voters before the debate and a random sample of 500 likel voters after the debate. The 95% confidence interval for the true difference (post-debate minus pre-debate) in proportions of likely voters who would vote for this candidate was (-0.014, 0.064). What was the difference (pre- debate minus post-debate) in the sample proportions of likely voters who said they will vote for this candidate? ​

q1 a person or thing situated away or detached from the main body or system. a cluster is a a mash of many things.

q2 do

step-by-step explanation:

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol

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.

answer: -10

step-by-step explanation:

s(t) = 1 - 10t

s(x) = 1 - 10x

s(x + h) = 1 - 10(x + h)

            = 1 - 10x - 10h

s(x + h) - s(x) = 1 - 10x - 10h - (1 - 10x)

                      = 1 - 10x - 10h - 1 + 10x

                      = -10h

= -10