This question doesn't make sense. are you asking how far did all 4 runners run together ??<span />
Walkers are 2, to make it 1, u divide by 2, to get 1.
so, 1/(7/2)
>7/2 = 3.5
so the ratio is 1/3.5
then the number of bus riders is 3.5 times the number of walkers
Notice that
So as
you have
. Clearly
must converge.
The second sequence requires a bit more work.
The monotone convergence theorem will help here; if we can show that the sequence is monotonic and bounded, then
will converge.
Monotonicity is often easier to establish IMO. You can do so by induction. When
, you have
Assume
, i.e. that
. Then for
, you have
which suggests that for all
, you have
, so the sequence is increasing monotonically.
Next, based on the fact that both
and
, a reasonable guess for an upper bound may be 2. Let's convince ourselves that this is the case first by example, then by proof.
We have
and so on. We're getting an inkling that the explicit closed form for the sequence may be
, but that's not what's asked for here. At any rate, it appears reasonable that the exponent will steadily approach 1. Let's prove this.
Clearly,
. Let's assume this is the case for
, i.e. that
. Now for
, we have
and so by induction, it follows that
for all
.
Therefore the second sequence must also converge (to 2).
Answer:
d. An optimal solution to linear programming problem can be found at an extreme point of the feasible region for the problem.
Step-by-step explanation:
A feasible solution satisfies all the constraints of the problem in linear programming. The constraints are the restrictions on decision variable. They limit the value of decision variable in linear programming. Optimal solutions occur when there is feasible problem in the programming.