All categories

3 years ago

Which points are solutions to the system of inequalities shown below? Check all that apply.

1 answer:

6 0

I: y<2*x
II: y<8
III: x>2

a: (5,3):
I: 3<2*5
3<10 ?yes
II: 3<8 ?yes
III: 5>2 ?yes
This is a solution

b: (6,0):
I: 0<2*6
0<12 ?yes
II: 0<8 ?yes
III: 6>2 ?yes
This is a solution

c: (3,3):
I: 3<2*3
3<6 ?yes
II: 3<8 ?yes
III: 3>2 ?yes
This is a solution

d: (1,-4):
I: -4<2*1
-4<2 ?yes
II: -4<8 ?yes
III: 1>2 ?no
This is not a solution

e: (4,-2):
I: -2<2*4
-2<8 ?yes
II: -2<8 ?yes
III: 4>2 ?yes
This is a solution

f: (5,9):
I: 9<2*5
9<10 ?yes
II: 9<8 ?no
This is not a solution

so a,b,c,e are solutions and d,f not

You might be interested in

Stephan has a piece of wood that measures 18 inches long and 12 inches wide. He wants to make a tray with sides 2 inches high. M

valkas [14]

Answer:

i. No, Maurice statement is wrong.

ii. Stephan does not have sufficient pieces of wood to make the tray because the square inches required is more than what he has.

Step-by-step explanation:

Stephan's piece of wood measures; 18 inches in length and 12 inches in width.

Since the piece of wood has a shape of a rectangle,

the area of the piece of wood = length × width

= 18 × 12

= 216 square inches

According to Maurice's statement, he could make a tray that has a base of 1012 inches by 1012 inches.

The base has the shape of a square, so that;

the area of the base = length × width = $length^{2}$

= 1012 ×1012

= 1024144 squared inches

This shows that Stephan does not have sufficient wood to make the tray because the square inches required is more than what he has.

5 0

3 years ago

A leprechaun places a magic penny under a girl's pillow. The next night there are 2 magic pennies under her pillow. The followi

vfiekz [6]

Answer:

Step-by-step explanation:

Since the pennies need to be kept under the pillow in order to be doubled, we're really looking for the day the girl will wake up with 5 billion pennies under her pillow.

The general formula of that geometric sequence will be: t = 1 + 2^(n-1)

We need to find the value of n when t will be over 5,000,000,000.

So, the equation becomes:

5,000,000,001 = 1 + 2^(n-1)

$2^{n-1}= 5,000,000,001$

$log(2^{n-1}) = log(5,000,000,000)$

(n-1) * log(2) = log(5,000,000,000)

n-1 = log(5,000,000,000) / log(2)

n-1 = 22.25

n = 33.25

Since it has to be complete days, and we have to reach over 5 billion, then we round it up to 34.

7 0

3 years ago

With a short time remaining in the day, a delivery driver has time to make deliveries at 4 locations among the 7 locations rema

omeli [17]

Answer:

35 different routes

Step-by-step explanation:

The problem of how many different routes are possible if a driver wants to make deliveries at 4 locations among 7 locations is a combination problem.

Combination problems are usually selection problems, of all or part of a set of options, without considering the order in which options are selected.

The number of combinations of n objects taken r at a time is: ⁿCᵣ

So, the number of ways the driver can make deliveries at 4 locations out of 7 locations of given by

⁷C₄ = 35 different ways.

Hence, 35 different routes are possible to make deliveries at 4 locations out of 7 locations.

Hope this Helps!!!

3 0

3 years ago

Determine the intercepts of the line.<br> y = -2x-21<br> X-intercept:<br> y-intercept:

vfiekz [6]

Ummm eeee i dont knowwwe

4 0

2 years ago

Seven-eighths minus five-twelfths

Elenna [48]

The answer to your question is A, 11/24

5 0

3 years ago

Read 2 more answers