Which solution set is graphed on the number line? A number line going from negative 4 to positive 4. An open circle is at 1. Everything to the left is shaded.

intensity of the vector is v= √37 ≈ 6.08 units and make angle ∡α ≈ 9.46° with east direction

step-by-step explanation:

required vector is consists of the two componentsvx= 2+4=6 units   and vy= 1 unit and vx ⊥ vywe will use pythagorian theorem to find intensity of the vector vv∧2 = vx∧2 + vy∧2 => v = √vx∧2 + vy∧2 = √6∧2 + 1∧2 = √36+1 = √37 ≈ 6.08 unitsthe angle ∡α between vector and east direction we wil find with tanαtanα = 1/6 => α = arc tanα = arc 1/6 => α ≈ 9.46°

hope this

18

step-by-step explanation:

draw the shape and you will see that f and k are actually at adjacent vertices (points of the hexagon that are neighboring).   so find the distance between (1,2) and (4,2).   that is easy since (1,2) and (4,2) is just a vertical distance to count, which is 3.   it is a regular polygon which means all sides are congruent.   you have 6 sides (hexa) so multiply 6 by 3 to receive 18.

it could be 1,3 and more others to create a cylinder.

step-by-step explanation:

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.