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.
Answer:
The value of x is 30°
Step-by-step explanation:
X° + 90° = 129° (Exterior angle property)
x° = 129° - 99° = 30°
<u>x°</u><u> </u><u>=</u><u> </u><u>3</u><u>0</u><u>°</u>
Hope it helps:)
Standard form is Ax + By = C, or By = C - Ax.
Dividing both sides by B, we get y = C/B - (A/B)x
Here the y intercept is C/B, and the slope is -A/B.
Answer:
-7
Step-by-step explanation:
-3m+5m=-14
2m=-14
divide both sides by 2
m=-7
