Answer:
f(-2) = -5
General Formulas and Concepts:
<u>Pre-Algebra</u>
Order of Operations: BPEMDAS
- Brackets
- Parenthesis
- Exponents
- Multiplication
- Division
- Addition
- Subtraction
<u>Algebra I</u>
Step-by-step explanation:
<u>Step 1: Define</u>
f(x) = 3x + 1
f(-2) is x = -2
<u>Step 2: Evaluate</u>
- Substitute in <em>x</em>: f(-2) = 3(-2) + 1
- Multiply: f(-2) = -6 + 1
- Add: f(-2) = -5
9 packets.
36 divided by 3 = 12
49 divided by 5 = 9.8
76 divided by 7 = 10.8
Maximum packets that can be obtained is 9 packets because only 9 packets with 5 green beads each can be packaged.
No pongas foto por que no puedo ver y no te puedo responder
Answer:
The answer to your questions are in bold
Step-by-step explanation:
a)
C = ![\left[\begin{array}{ccc}-6&6\\-2&4\\\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D-6%266%5C%5C-2%264%5C%5C%5Cend%7Barray%7D%5Cright%5D)
= -24 + 12
= -12
b) -1 7 -4 -1 -1 - 4 7 - 1 - 5 6
-2 -6 -8 8 = -2 - 8 -6 + 8 -10 2
2 -3 2 -7 2 + 2 -3 - 7 4 -10
-1 10 -6 5 -1 - 6 10 + 5 -7 15
Answer:
Following are the solution to this question:
Step-by-step explanation:
They provide various boxes or various objects. It also wants objects to be distributed into containers, so no container is empty. All we select k objects of r to keep no boxes empty, which (r C k) could be done. All such k artifacts can be placed in k containers, each of them in k! Forms. There will be remaining
objects. All can be put in any of k boxes. Therefore, these
objects could in the
manner are organized. Consequently, both possible ways to do this are

Consequently, the number of ways that r objects in k different boxes can be arranged to make no book empty is every possible one
