Click an item in the list or group of pictures at the bottom of the problem and, holding the button down, drag it into the correct position in the answer box. Release your mouse button when the item is place. If you change your mind, drag
the item to the trashcan. Click the trashcan to clear all your answers.
Find the missing part.

from the sentence, "tomorrow morning, akiko will arrive an hour late" depicts a third person perspective because it doesn't use any pronoun to replace akiko, the subject of the sentence, and it is in singular form since akiko is only one person.

step-by-step explanation: given equation a = h(b 1+b 2)

also we are given values of a, h and b 1 as :

a = 16, h = 4, and b 1 = 3.

in order to solve it for b 2, we need to plug the given values of   a, h and b 1 .

therefore, plugging values of   a, h and b 1   in given equation, we get

16 = 4( 3 + b 2)

first dividing both sides by 4, we get

4 = 3 + b 2

subtracting 3 from both sides, we get

4 -3 = 3 -3 + b 2

1 = b 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.