Since q(x) is inside p(x), find the x-value that results in q(x) = 1/4
so we conclude that
therefore
plug
into p( q(x) ) to get answer
You're looking for the largest number <em>x</em> such that
<em>x</em> ≡ 1 (mod 451)
<em>x</em> ≡ 4 (mod 328)
<em>x</em> ≡ 1 (mod 673)
Recall that
<em>x</em> ≡ <em>a</em> (mod <em>m</em>)
<em>x</em> ≡ <em>b</em> (mod <em>n</em>)
is solvable only when <em>a</em> ≡ <em>b</em> (mod gcd(<em>m</em>, <em>n</em>)). But this is not the case here; with <em>m</em> = 451 and <em>n</em> = 328, we have gcd(<em>m</em>, <em>n</em>) = 41, and clearly
1 ≡ 4 (mod 41)
is not true.
So there is no such number.
If it's like the in and out things, I think i can help. So a number goes in and and comes out. What is the rule? What happened from the in to the out?
77 is the median score for rhis propblem
Point-slope form:
y − b = m(x − a<span>), where m is the slope and (a, b) is a point on the graph.
Here that would look like:
y - 2 = 12(x - (-8))
y - 2 = 12(x + 8)
The answer:
</span>y - 2 = 12(x + 8)
Hope this helps.
