Suppose you have two disks each with 128 pie-shaped sectors. one disk has 32 red sectors and 96 white sectors. the other disk has 64 white sectors and 64 red sectors. the two patterns can be completely arbitrary. can we place one over the other such that at least 64 sectors on each disk have the same color? justify your answer using probabilistic methods and be sure to provide a sample space to support your reasoning.

answer: 12

step-by-step explanation:

it has 4

step-by-step explanation:

les

elee

fg

elle

fetish

ser

el

le

f

lent

clee hd

lg

ad

be

hu

te

see

te

ele

cele

her

t

errel

c

s​

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

honestly bro aint no one got time to answer these dumb question just do it p***y

step-by-step explanation: