All categories

1 year ago

Suppose we want to choose 3 letters, without replacement, from the 4 letters A, B, C, and D.

1 answer:

ioda1 year ago

3 0

Answer:A) 24 waysB) 4 waysStep-by-step explanation:a) permutation occurrs when order of choices matters.N = 4P3 = 4!/(4-3)! = 4!/1!N = 24 waysb) combination occurs when order of choices doesn't matter.N = 4C3 = 4!/3!(4-3)! = 4!/3!(1!)N = 4 ways

Step-by-step explanation:

a) permutation occurrs when order of choices matters.N = 4P3 = 4!/(4-3)! = 4!/1!N = 24 waysb) combination occurs when order of choices doesn't matter.N = 4C3 = 4!/3!(4-3)! = 4!/3!(1!)N = 4 ways(hope this helps:)

You might be interested in

IP8.4 #3b

bazaltina [42]

Answer:

Step-by-step explanation:

Stephen Curry

8 0

2 years ago

6. Charlie can spend up to $8 on lunch. He wants to buy a tuna sandwich, a bottle of

PilotLPTM [1.2K]

Answer:

The maximum number of pounds of potato salad that Charlie can buy is 0.375

Step-by-step explanation:

see the attached figure to better understand the problem

Let

a ----> the cost of one tuna sandwich

b ----> the cost of a bottle of apple juice

c ----> the cost per pound of potato salad

x ----> pounds of potato salad

we have

$a=\$4.25$

$b=\$2.25$

$c=\$4.00/lb$

we know that

He wants to buy a tuna sandwich, a bottle of apple juice, and x pounds of potato salad and can spend up to $8

The inequality that represent this situation is

$a+b+cx \leq 8$

substitute the given values

$4.25+2.25+4.00x \leq 8$

Solve for x

Combine like terms

$6.50+4.00x \leq 8$

Subtract 6.50 both sides

$4.00x \leq 8-6.50$

$4.00x \leq 1.50$

Divide by 4 both sides

$x \leq 1.50/4.00$

$x \leq 0.375\ lbs$

therefore

The maximum number of pounds of potato salad that Charlie can buy is 0.375

3 0

3 years ago

Note: Enter your answer and show all the steps that you use to solve this problem in the space provided.

andriy [413]

Answer:

The point that maximizes the objective function is (3,0)

Step-by-step explanation:

we have

Constraints:

$x\geq 0\\y\geq 0\\-x + 3\geq y\\y\leq \frac{1}{3}x+1$

Using a graphing tool

The feasible region is the shaded area

see the attached figure

The vertices of the feasible region are

(0,0),(0,1),(1.5,1.5) and (3,0)

we know that

To find the point in the feasible region that maximizes the objective function, replace each ordered pair of vertices in the objective function and then compare the results.

The objective function is

$C=5x-4y$