The Scenario: You’re looking for a sponsor to pay for you to participate in a sailboat race. Now that you’ve solved the parallax problem, use the same skills you used there to write a proposal that shows that you can win the race. The Project: Use the information provided in the performance task to estimate your travel costs and to calculate your average speed and the speed of last year’s winner. Use the questions below to help you gather information to write your proposal. Part I: Which race? Choose a city (8 points)When you write your proposal, you’ll need to tell your sponsor about the costs and risks involved in the race you’ve chosen. You’ll investigate these in Part I.1. Which city did you pick and why? (2 points)2. What is one common boating hazard in this city? (2 points)3. What are your total travel expenses? (4 points: 2 points for airfare/hotel. 1 point for total)Part II: Which category? Choose your boat (10 points)Your proposal will also discuss how likely it is t

exa:

)

3+11

14

step-by-step explanation:

from this example, we can see that subtracting with integers is the same as adding the opposite. we can solve using a number line or by using the saying "keep, change, change" to us solve. it is important to remember that we can subtract a negative and end up with a larger number than we started with.

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.