1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
77julia77 [94]
4 years ago
12

A store is having a sale on jelly beans and almonds. For 2 pounds of jellybeans and 6 pounds of almonds the total cost is $12. F

or 5 pounds of jellybeans and 3 pounds of almonds the total cost is $15. Find the cost for each pound of jellybeans in each pound of find the cost for each pound of jellybeans in each pound of almonds
Mathematics
2 answers:
miskamm [114]4 years ago
8 0

Answer:

1 pound of jellybeans costs $2.25

and 1 pound of almond costs $1.25

Step-by-step explanation:

Say jellybeans is j and almonds is a. The question can be interpreted as

2j + 6a = 12 ....................... equation 1

5j + 3a = 15 ....................... equation 2

Using elimination method for the above simultaneous equation, lets multiply equation 1 by the coefficient of j in equation 2 and vice versa

(2j + 6a = 12)*5 .......................... eqn 3

(5j + 3a = 15)*2 .......................... eqn 4

Then we will have

10j + 30a = 60 ........................... eqn 5

10j + 6a   = 30 ........................... eqn 6

Subtract equation 6 from equation 5 to eliminate j, we will have

24a = 30

Divide both side by 24, we will have

a = 30/24

a = 1.25

Therefore 1 pound of almonds cost $1.25

To get the price of jellybeans, we substitute for a in any of the equations above

2j + 6a = 12

2j + 6(1.25) = 12

2j + 7.5 = 12        Collecting the like terms, we will have

2j = 12 - 7.5

2j = 4.5               Divide both sides by 2, we will have

j = 2.25

Therefore the cost of 1 pound jellybeans is $2.25

stich3 [128]4 years ago
5 0

Answer:

mom

Step-by-step explanation:

You might be interested in
What is the standard form of the equation of a circle with the radius ( r=6) and the center (h,k)= (0,0)?
kupik [55]

Answer:

π·6^2

Step-by-step explanation:

7 0
3 years ago
What is 10% of 70m awnser?
Savatey [412]
The answer is 7. That's the answer
3 0
3 years ago
Find the value of x that makes m || n
ch4aika [34]

Answer:

x=133

Step-by-step explanation:

Given: m║n

This means that 147 and x+14 are <em>alternate exterior angles</em>. This also means that they are equivalent. We can use this information to set up an equation:

x+14=147

Subtract 14 from both sides to isolate x

x=133

8 0
2 years ago
Need answer asap.thanks​
Marrrta [24]

Answer:

0.46=\frac{23}{50}

Step-by-step explanation:

To write any decimal as a fraction you divide by 1 and multiply by a number (ranging from 10, 100, 1000 etc.) that will make 0.46 a whole number, this will explain:

Let x = \frac{0.46}{1}

10x = 10*\frac{0.46}{1} =\frac{4.6}{10}

100x = 100*\frac{0.46}{1}=\frac{46}{100} this is our perfect fraction, now we simplify later

100x - 10x = \frac{46}{100} -\frac{4.6}{10}

90x = \frac{46}{100} -\frac{4.6}{10} =0  this is to confirm both fractions are equal

x is the same as \frac{0.46}{1} as \frac{4.6}{10} as \frac{46}{100} but here x = \frac{46}{100} because a fraction has to have no decimals.

So  0.46 is equal any of these values, as a fraction, on the other hand, it's improperly equal to \frac{46}{100} = \frac{23}{50} here I divided by 2 to bring down the proper fraction. (fraction at its simplest form)

6 0
3 years ago
Provide an example of optimization problem
Mashutka [201]

Answer:

a. Convex solutions ,GO Methods

b. market efficiency

Explanation :

Step-by-step explanation:

A globally optimal solution is one where there are no other feasible solutions with better objective function values. A locally optimal solution is one where there are no other feasible solutions "in the vicinity" with better objective function values. You can picture this as a point at the top of a "peak" or at the bottom of a "valley" which may be formed by the objective function and/or the constraints -- but there may be a higher peak or a deeper valley far away from the current point.

In convex optimization problems, a locally optimal solution is also globally optimal. These include LP problems; QP problems where the objective is positive definite (if minimizing; negative definite if maximizing); and NLP problems where the objective is a convex function (if minimizing; concave if maximizing) and the constraints form a convex set. But many nonlinear problems are non-convex and are likely to have multiple locally optimal solutions, as in the chart below. (Click the chart to see a full-size image.) These problems are intrinsically very difficult to solve; and the time required to solve these problems to increases rapidly with the number of variables and constraints.

GO Methods

Multistart methods are a popular way to seek globally optimal solutions with the aid of a "classical" smooth nonlinear solver (that by itself finds only locally optimal solutions). The basic idea here is to automatically start the nonlinear Solver from randomly selected starting points, reaching different locally optimal solutions, then select the best of these as the proposed globally optimal solution. Multistart methods have a limited guarantee that (given certain assumptions about the problem) they will "converge in probability" to a globally optimal solution. This means that as the number of runs of the nonlinear Solver increases, the probability that the globally optimal solution has been found also increases towards 100%.

Where Multistart methods rely on random sampling of starting points, Continuous Branch and Bound methods are designed to systematically subdivide the feasible region into successively smaller subregions, and find locally optimal solutions in each subregion. The best of the locally optimally solutions is proposed as the globally optimal solution. Continuous Branch and Bound methods have a theoretical guarantee of convergence to the globally optimal solution, but this guarantee usually cannot be realized in a reasonable amount of computing time, for problems of more than a small number of variables. Hence many Continuous Branch and Bound methods also use some kind of random or statistical sampling to improve performance.

Genetic Algorithms, Tabu Search and Scatter Search are designed to find "good" solutions to nonsmooth optimization problems, but they can also be applied to smooth nonlinear problems to seek a globally optimal solution. They are often effective at finding better solutions than a "classic" smooth nonlinear solver alone, but they usually take much more computing time, and they offer no guarantees of convergence, or tests for having reached the globally optimal solution.

5 0
3 years ago
Other questions:
  • What is the answer to this 6.7w- (-3)w = -5?
    13·2 answers
  • Kevin has $25 . MP3 downloads cost $0.75 each . How many songs can he download and still have $13 left to spend
    8·1 answer
  • Whats 6099×6646×09880
    13·1 answer
  • Factor out coefficient 4n-3
    8·1 answer
  • Which of the following is a common denominator of
    9·1 answer
  • A researcher surveyed 8 people to see if there is a
    13·2 answers
  • Answer please<br> please please please
    11·2 answers
  • Simplify -2.5f+0.4f-14-5
    8·2 answers
  • . Darlene is making punch. She pours 4 quarts 2 cups of apple juice into a bowl. Then she pours 3 quarts 1 cup of grape juice in
    13·2 answers
  • What is the slope of a line parallel to the line whose equation is
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!