Answer:
8 pounds of peanuts, 6 pounds of raisins and 6 pounds of chocolate chips
Step-by-step explanation:
Let x be the number of pounds of peanuts and y be the number of pounds of raisins and chocolate chips.
Peanuts cost $2 per pound, then x pounds cost $2x.
Raisins cost $2.50 per pound, then y pounds cost $2.50y.
Chocolate chips cost $4 per pound, then y pounds cost $4y.
In total, x+y+y=20 and those 20 pounds cost
2x+2.50y+4y=20·2.75.
Solve the system of two equations:

From the first equation:

Substitute x into the second equation:

Answer = 10=21
When you’re multiplying numbers with exponents with the same base (10 is the base) all you have to do is add the exponents
18 and 3 are the exponents we’re dealing with, so we add them and get 21. The base stays the same
10^18 x 10^3 = 10^21
Answer = 10=21
Answer:
<h2>y=7x-47</h2>
Step-by-step explanation:


Answer:
0.0625 kg per bag
or 1/16th of a kilogram per bag
Step-by-step explanation:
You'd need to divide the total amount the the number of sections.
In this case, it'd be 0.5 kg/8 bags, resulting in 0.0625 kg of flour per bag.
I hope this helps!

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).