4, 7 and 9 are mutually coprime, so you can use the Chinese remainder theorem.
Start with
Taken mod 4, the last two terms vanish and we're left with
We have 
, so we can multiply the first term by 3 to guarantee that we end up with 1 mod 4.
Taken mod 7, the first and last terms vanish and we're left with
which is what we want, so no adjustments needed here.
Taken mod 9, the first two terms vanish and we're left with
so we don't need to make any adjustments here, and we end up with 
.
By the Chinese remainder theorem, we find that any 
such that
is a solution to this system, i.e. 
for any integer 
, the smallest and positive of which is 149.
Answer:
Step-by-step explanation:
B. Yes, because it passes the vertical line test, is the answer.
Answer:
B=62, a=3.7, C=7.9
Step-by-step explanation:
Answer:
[improper fraction]
[mixed fraction]
[decimal]
Explanation:
12/13 divided by 3/15 →
→
→
→
________________________________
Answer:
Step-by-step explanation:
Graph the absolute value function y = |x|. This is v-shaped and opens up.
Now translate the entire graph 2 units to the left. You will then have the graph of y=|x+2|.
