And how would I do that via computer? If this is homework, do it your self, it's not that hard. Draw it and scan it (man computer doesn't have the ability to scan things)
Answer:
i not good at this but i think 2 6 18 54 could be the answer if not im so sorry
Step-by-step explanation:
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:
-6F
Step-by-step explanation: It would be 5F(4hr) = 20F. So if you have 14F subtract 20F you get -6F. Hope this helped.
Two numbers that would make up 49 would be 7 times 7. Because if you multiply 7 times 7 you will get the number 49.
