How to solve this 1+1+1+1+1+1+1+1+1+1+1+1×0+1=?

the value of v.w= -12.

step-by-step explanation:

we are given three vector r,v and w as:

r = < 5, -5, -2> ; v = < 2, -8, -8> ; w = < -2, 6, -5>

we know that r,v and w could also be represented as:

r=5i-5j-2k

v=2i-8j-8k

and w= -2i+6j-5k

where i,j and k are the unit vectors of x,y and z-axis respectively.

also we know that it has the following property:

i.i=1 ; j.j=1; k.k=1

and i.=j.i=i.k=k.i=j.k=k.j=0

i.e. when we multiply two vectors or we find it's dot product we need to only multiply the components of x coordinates with each other; y with each other and z with each other.

hence, v.w= (2i-8j- -2i+6j-5k)

                  = 2×(-2)+(-8)×(6)+(-8)×(-5)

                  = -4-48+40

                  = -12

hence, v.w= -12

the correct answers i think are b. and d.

give me brainliest if it is correct!

you ignore the remainder, therefore the answer is y = x+2

step-by-step explanation:

you have to divide the denominator by the numerator. you can use synthetic division or long division.

[-5] .     1 .     7 .     11

x + 2 + 1/x+5

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.