All categories

3 years ago

4) Choose the correct inequality for this situation.

Mathematics

1 answer:

Ksenya-84 [330]3 years ago

6 0

Answer:

B. 21x + 40 ≤ 124

Step-by-step Explanation:

Maximum amount budgeted = $124 (this means they can't spend more than this)

x = number of people

Cost per head = $21

Given that Mr Walter already spent $40, which is part of the money budgeted, the number of people that can go canoeing cam be expressed with the following inequality:

21x + 40 ≤ 124

(note: the amount total to be spent will either be equal to or greater than $124, because it's the maximum amount budgeted for spending).

You might be interested in

For which value of x is xyza a rectangle

lisabon 2012 [21]

Well each angle in a rectangle is 90°, so if x is an angle, it's 90°

I hope that helps!

7 0

3 years ago

What is the value of x in this diagram?<br><br><br> Please help

marshall27 [118]

Answer: x=75

Explanation:
x+10+x+20=180
combine like terms
2x+30=180
subtract 30 from each side
2x=150
divide each side by 2
x=75

7 0

2 years ago

S(x)= 22x-8 and f(x)= -5. What is s(x) x f(x)?

zloy xaker [14]

-110x+40
You need to use the distributive property for this problem
You multiply 22x times -5 (which is -110x) and -8 times -5 (which is 40) to get -110x+40

6 0

3 years ago

Please help me answer this question

sukhopar [10]

Answer:

her first mistake was on line 3.

line 1: 80 + [2(3 1/2 + 1 1/2)]

line 2: 80 + [2(5)]

line 3: 80 + 10

line 4: 90

Step-by-step explanation:

on line 3 she added 80 + 2, but she should have multiplied 2 by 5. the correct steps would be:

line 1: 80 + [2(3 1/2 + 1 1/2)]

line 2: 80 + [2(5)]

line 3: 80 + 10

line 4: 90

4 0

3 years ago

NAND"" and ""NOR"" circuits are commonly used as a basis for flash memory chips. A NAND B is defined to be the negation of ""A a

Anit [1.1K]

Answer:

(i) A truth table shows how the truth or falsity of a compound statement depends on the truth or falsity of the simple statements from which it's constructed.

Since A ∧ B (the symbol ∧ means A and B) is true only when both A and B are true, its negation A NAND B is true as long as one of A or B is false.

Since A ∨ B (the symbol ∨ means A or B) is true when one of A or B is true, its negation A NOR B is only true when both A and B are false.

Below are the truth tables for NAND and NOR connectives.

(ii) To show that (A NAND B)∨(A NOR B) is equivalent to (A NAND B) we build the truth table.

Since the last column (A NAND B)∨(A NOR B) is equal to (A NAND B) it follows that the statements are equivalent.

(iii) To show that (A NAND B)∧(A NOR B) is equivalent to (A NOR B) we build the truth table.

Since the last column (A NAND B)∧(A NOR B) is equal to (A NOR B) it follows that the statements are equivalent.

6 0

3 years ago