11
A diagonal connects a vertex to another vertex without being a side of the polygon. There are 14 vertices in a 14-gon. This leaves 13 vertices left to connect to (since we cannot connect the vertex to itself). However, two of these vertices will form the sides of the 14-gon. This leaves us with 11 possible diagonals we can draw.
Step-by-step explanation:
135 = 5m
5m = 135
m = 135/5
m = 27
Answer:
the probability that a code word contains exactly one zero is 0.0064 (0.64%)
Step-by-step explanation:
Since each bit is independent from the others , then the random variable X= number of 0 s in the code word follows a binomial distribution, where
p(X)= n!/((n-x)!*x!*p^x*(1-p)^(n-x)
where
n= number of independent bits=5
x= number of 0 s
p= probability that a bit is 0 = 0.8
then for x=1
p(1) = n*p*(1-p)^(n-1) = 5*0.8*0.2^4 = 0.0064 (0.64%)
therefore the probability that a code word contains exactly one zero is 0.0064 (0.64%)
The answer is A. -3 and its a negative result cause that's how it is, like for ex, -15/3 = -5 or 15/-3 = -5 is a negative, and w<span>hen two positive numbers are divided, the answer is a positive number 15/3 = 5.</span>
