Since K is the midpoint of JL, it divides the segment JL into two equal halves.
That means ⇒ JK = KL
Substitute expressions for the parts ⇒ 7x + 4 = 12x - 21
Now solve the equation: 7x - 7x + 4 = 12x - 7x - 21
4 = 5x - 21
4 + 21 = 5x - 21 + 21
25 = 5x
5 = x
Substitute the value into one of the expressions: JK = 7(5) + 4 = 39
JL = JK + KL
JL = 39 + 39 = 78
Answer:
Step-by-step explanation:
We need to find the conditional probability P( T1 < s|N(t)=1 ) for all s ≥ 0
P( time of the first person's arrival < s till time t exactly 1 person has arrived )
= P( time of the first person's arrival < s, till time t exactly 1 person has arrived ) / P(exactly 1 person has arrived till time t )
{ As till time t, we know that exactly 1 person has arrived, thus relevant values of s : 0 < s < t }
P( time of the first person arrival < s, till time t exactly 1 person has arrived ) / P(exactly 1 person has arrived till time t )
= P( exactly 1 person has arrived till time s )/ P(exactly 1 person has arrived till time t )
P(exactly x person has arrived till time t ) ~ Poisson(kt) where k = lambda
Therefore,
P(exactly 1 person has arrived till time s )/ P(exactly 1 person has arrived till time t )
= [ kse-ks/1! ] / [ kte-kt/1! ]
= (s/t)e-k(s-t)
First, we'd need to find the feasible region which is bounded by the constraints 2 ≤ x ≤ 6, 1 ≤ y ≤ 5 and x + y ≤ 8. Let's graph all of them and we'll get the feasible region as unshaded in the attached image. To find the maximum for p = 3x + 2y, we'll plug the coordinates of the vertices in and compare them.
p(6,1) = 3(6) + 2(1) = 20
p(2,1) = 3(2) + 2(1) = 8
p(2,5) = 3(2) + 2(5) = 16
p(3,5) = 3(3) + 2(5) = 19
p(6,2) = 3(6) + 2(2) = 22
So the maximum value of p is 22 as x = 6 and y = 2.