Answer:
56 times (This is still assuming 1 isnt an option)
Step-by-step explanation:
0,2,3,4,5,6,7,8
There are 8 options, 3 of which are greater than 5
3/8
3/8 = x/150
3*150 = 450
8 * x = 8x
8x = 450
450/8 = 56.25
56 times
-- Gage Millar
(x+6)^(1/2)-5=x+1
(x+6)^(1/2)=x+6
((x+6)^(1/2))^2=(x+6)^2
x+6=x^2+12x+36
0=x^2+11x+30
(-11+(11^2-4(1)(30))^(1/2))/2
(-11+((1)^(1/2))/2
(-11+1)/2=-5
(-11-1)/2=-6
((-6)+6)^1/2-5=(-6)+1
(0^(1/2))-5=-5
-6 is non-extraneous
((-5)+6)^1/2-5=(-5)+1
(1^1/2)-5=-4
1-5=-4
-4=-4
-5 is non-extraneous
I am unable to solve this problem.
This will be 18.39, 6 is higher than 5, so the 8 is going higher so it's a 9 and you will get 18.39
The expected length of code for one encoded symbol is
where 
is the probability of picking the letter 
, and 
is the length of code needed to encode . is given to us, and we have
so that we expect a contribution of
bits to the code per encoded letter. For a string of length 
, we would then expect ![E[L]=1.375n](https://tex.z-dn.net/?f=E%5BL%5D%3D1.375n)
.
By definition of variance, we have
![\mathrm{Var}[L]=E\left[(L-E[L])^2\right]=E[L^2]-E[L]^2](https://tex.z-dn.net/?f=%5Cmathrm%7BVar%7D%5BL%5D%3DE%5Cleft%5B%28L-E%5BL%5D%29%5E2%5Cright%5D%3DE%5BL%5E2%5D-E%5BL%5D%5E2)
For a string consisting of one letter, we have
so that the variance for the length such a string is
"squared" bits per encoded letter. For a string of length , we would get ![\mathrm{Var}[L]=1.859n](https://tex.z-dn.net/?f=%5Cmathrm%7BVar%7D%5BL%5D%3D1.859n)
.
