First, we are going to want to plug in the values we are given. In this case, we will end up with the equation:
From here, we can solve the equation to find 
:
- Apply the commutative property to rearrange the terms on the right-side of the equation to make the distributive property more apparent
- Apply the distributive property
- Subtract 8 from both sides of the equation
- Divide both sides of the equation by -2
We have found that c = 1.
Try to refrain from asking more than three questions per question for future reference.
11+4=15
6+4=10
4+7=11
12+4=16
0+4=4
4+0=4
10+4=14
4+5=9
9+4=13
4+2=6
4+8=12
4+3=7
7+4=11
4+4=8
4+1=5
8+4=12
Hope this helps.
-Benjamin
Answer: The greatest number of pages Kenji can decorate = 3
Step-by-step explanation:
Given: Total heart stickers = 15
Total star stickers =12
If all the papers identical, with the same combination of heart and star stickers and no stickers left over.
Then the greatest number of pages Kenji can decorate = GCD(15,12) [GCD=greatest common divisor]
Since 15 = 3 x 5
12=2 x 2 x 3
GCD(15,12) =3
Hence, the greatest number of pages Kenji can decorate = 3
Answer:
Both 
and 
are solutions to the system.
Step-by-step explanation:
In order to determine whether the two given points represent solutions to our system of equations, we must "plug" thos points into both equations and check that the equality remains valid.
Step 1: Plug into 
The solution verifies the equation.
Step 2: Plug into 
The solution verifies both equations. Therefore, is a solution to this system.
Now we must check if the second point is also valid.
Step 3: Plug into
Step 4: Plug into
The solution verifies both equations. Therefore, is another solution to this system.
We are asked to determine what happens to the values of
as
approaches
using values of
less than
AND using values of
greater than
.
<span>Observe from the graph that as </span>
approaches
from the left or the right, the values of
increase without bound.
Therefore, we know the following. 
