Suppose that we have digital signals represented as Hamming codes whose number of errors are Poisson distributed with a mean of 36 errors. Use Chebyshev's Inequality to compute the lower bound for the number of signals that need to be sent so that the total number of errors are within 10 percent of the expected number of errors with at least 95 percent probability.

in geometry, parallel lines are lines in a plane which do not meet; that is, two lines in a plane that do not intersect or touch each other at any point are said to be parallel. by extension, a line and a plane, or two planes, in three-dimensional euclidean space that do not share a point are said to be parallel.

need more info

step-by-step explanation:

what do you mean by "representation"? graph? table? etc.

d: (13,-1)

step-by-step explanation:

we know the starting point is (1,5)

the ending point is (x,y)   (cristians house)

the total distance is 6 units (5: 1)  

the fast food restaurant is at (11,0) and is 5/6ths of the way from the starting point to the ending point

ending minus starting point * 5/6   is how far they went

(x-1) *5/6, (y-5) * 5/6

we then need to add the starting point to determine the location

5/6(x-1) + 1, (y-5) * 5/6 + 5

this equals the fast food location of 11,0

setting the x locations equal

5/6 (x-1) +1 =11

subtracting 1 from each side

5/6 (x-1) +1-1 =11-1

5/6(x-1) =10

multiplying by 6/5 on each side

6/5*5/6(x-1) = 10*6/5

x-1 =12

add 1 to each side

x-1+1 =12+1

x=13

do the same for the y coordinate

(y-5) * 5/6 + 5 =0

subtract 5 from each side

(y-5) * 5/6 + 5-5 =0-5

5/6 (y-5) = -5

multiplying by 6/5 on each side

6/5*5/6 (y-5) = -5 *6/5

y-5 = -6

add 5 to each side

y-5+5 = -6+5

y=-1

the ending point , or the coordinates of cristians house is

(13,-1)