Amir encoded a secret phrase using matrix multiplication. Using A = 1, B = 2, C = 3, and so on, he multiplied the clear text
code for each letter by the matrix C-
to get a matrix that represents the encoded text. The matrix representing the
1-4
3
What is the secret phrase? Determine the location of spaces after you
10 -26 -49 93 -13 -50
encoded text is
116 -33 -63 16 9 - 10 -65
decode the text
THE BEAN IS GREEN
BLUE IS THE GLOVE
GREEN IS THE BEAN
THE GLOVE IS BLUE

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

answer:

step-by-step explanation:

here, the total dishes = 10

dishes having meat = 3 ( chicken, meatloaf and hamburger )

thus, the probability of having meat on the chosen dishes = number of dishes having meat / total dishes

=

therefore, the probability of not having meat = 1- the probability of having meat on the chosen dishes

=

=

=

⇒ option b is correct.

wfirfkfr/jjfi; jn; p/ojkfvlbvmkmgkgkkkgkkg

step-by-step explanation: