I WILL MARK BRANLIEST FOR THE FIRST AND CORRECT ANSWER. PLEASE HELP I DON'T UNDERSTAND THIS QUESTION. How you can use patterns to find units digits for powers too large to display on the calculator.

i hope this is what you were looking for.

see attached graph

hi! i think the answer is 1/2 : )

d. 24+-0.114

step-by-step explanation:

the question requires us to calculate the approximate 95% confidence interval for the mean number of ounces of ketchup per bottle in the sample given the following statistics;

sample mean = 24

standard deviation, σ = 0.4

sample size , n = 49

the confidence interval for a population mean is calculated using the formula;

sample mean ± z-score*(σ/sqrt(n))

the z-score associated with a 95% confidence interval, from the standard normal tables, is;

1.96

substituting these values into the formula;

24 ± 1.96*(0.4/7)

= 24 ± 0.112

from the alternatives given, choice d is closest to the above expression;

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.