"show all your work. indicate clearly the methods you use, because you will be scored on the correctness of your methods as well as on the accuracy and completeness of your results and explanations.

researchers are investigating whether people who exercise with a training partner have a greater increase, on average, in targeted exercise intensity compared with people who exercise alone. two methods of collecting data have been proposed.

method i: recruit volunteers who are willing to participate. randomly assign each participant to exercise with a training partner or to exercise alone.
method ii: select a random sample of people from all the people who exercise at a community fitness center. ask each person in the sample whether they use a training partner, and use the response to create the two groups.

(a) for each method, the researchers will record the change in targeted exercise intensity for each person in the investigation. they will compare the mean change in intensity between those who exercise with a training partner and those who do not.
(i) describe the population of generalization if method i is used. explain your answer.
(ii) describe the population of generalization if method ii is used. explain your answer."
(b) suppose the investigation produces a result that is statistically significant using both methods. what can be concluded if method is used that cannot be concluded if method ii is used? explain your answer.

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: it actually depends on which is the independent variable and which is the dependent variable. let us say we're looking at a linear equation. y=2x+3. we theoretically could switch the equation to be x=(y-3)/2 and it would be the same line. so either a causes b or it can be that b causes a. so technically the answer is false

step-by-step explanation:

1. a^4+8a^3+24a^2+32a+16

2.y^8+8y^7+28y^6+56y^5+70y^4+56y^3+28y^2+8y+1

3.x^6-3x^4y^2+3x^2y^4-y^6

using the formula for pythagorean theorem (a2+b2=c2)(the twos are exponents), and knowing that you have b squared and c squared, just reverse it. 26 squared minus 10 squared equals c squared. 26 squared is 676 and 10 squared is 100. you get 576, then use your square roots to undo the squared numbers to get 24.