Andrew is showing his work in simplifying −4.5 + 4.2 + 5.6 − 7.3. Identify any errors in his work or in his reasoning. Step Work Reasoning
−4.5 + 4.2 + 5.6 − 7.3 Original problem
1 −4.5 + 4.2 + 5.6 + (−7.3) Additive inverse
2 −4.5 + (−7.3) + 4.2 + 5.6 Commutative property
3 [−4.5 + (−7.3)] + (4.2 + 5.6) Associative property
4 −11.8 + 9.8 Simplify
5 −21.6 Simplify
Step 1: He wrote −7.3 incorrectly as + (−7.3).
Step 2: He identified changing the order of the numbers as the commutative property, which is incorrect.
Step 3: He identified changing the grouping of the numbers as the associative property, which is incorrect.
Step 5: He simplified incorrectly​

step-by-step explanation:

one of the most important purposes of surface treatment is to alter surface properties according to the requirement of specific applications. for example, hydrophobic coating has been utilized on windshield and eyeglasses. gold atom monolayer on substrate has become a popular surface bioconjugation strategy.  

answer is because 4×10=40

and 98×4= is 392

40,392

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.