The answer is 23 because you would substitute in the 4 for the X and multiply 5 times 4 = 20 then add 20 plus 3 and you get 23
Answer:
![E(X)= n \int_{0}^1 x^n dx = n [\frac{1}{n+1}- \frac{0}{n+1}]=\frac{n}{n+1}](https://tex.z-dn.net/?f=E%28X%29%3D%20n%20%5Cint_%7B0%7D%5E1%20x%5En%20dx%20%3D%20n%20%5B%5Cfrac%7B1%7D%7Bn%2B1%7D-%20%5Cfrac%7B0%7D%7Bn%2B1%7D%5D%3D%5Cfrac%7Bn%7D%7Bn%2B1%7D)
Step-by-step explanation:
A uniform distribution, "sometimes also known as a rectangular distribution, is a distribution that has constant probability".
We need to take in count that our random variable just take values between 0 and 1 since is uniform distribution (0,1). The maximum of the finite set of elements in (0,1) needs to be present in (0,1).
If we select a value
we want this:

And we can express this like that:
for each possible i
We assume that the random variable
are independent and
from the definition of an uniform random variable between 0 and 1. So we can find the cumulative distribution like this:

And then cumulative distribution would be expressed like this:



For each value
we can find the dendity function like this:

So then we have the pdf defined, and given by:
and 0 for other case
And now we can find the expected value for the random variable X like this:

![E(X)= n \int_{0}^1 x^n dx = n [\frac{1}{n+1}- \frac{0}{n+1}]=\frac{n}{n+1}](https://tex.z-dn.net/?f=E%28X%29%3D%20n%20%5Cint_%7B0%7D%5E1%20x%5En%20dx%20%3D%20n%20%5B%5Cfrac%7B1%7D%7Bn%2B1%7D-%20%5Cfrac%7B0%7D%7Bn%2B1%7D%5D%3D%5Cfrac%7Bn%7D%7Bn%2B1%7D)
1) m∠1 = 360°/8 = 45° . . . . . a regular octagon is 8-way rotationally symmetrical, so each sector is 1/8 of a circle.
2) m∠2 = (180° -45°)/2 = 67.5° . . . . . . the angles of a triangle add to 180°. The base angles of an isosceles triangle are equal.
Answer:
y=-2(x+2)
Step-by-step explanation:
plug in(-2,0) into y-y1=m(x-x1)
y=m(x+2)
slope =m=-2
y=-2(x+2)
Answer:
option C: 120
Step-by-step explanation:
total marks = 5× 100 = 500
marks he obtained = 380
marks he lost = 500 - 380 = 120
plz mark my answer as brainlist plzzzz.
hope this will be helpful to you.