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.
20 divided by 40=2
20x40=800
800 divided by 40= 20
No because 3 x 4 = 12 and 8 x 4 ≠ 24
Answer:
1/6
Step-by-step explanation:
Answer:
360 hours
Step-by-step explanation:
To convert 15 days into hours, we need to find hours in a day. There are 24 hours in a day.
We can take 15 days/1 and multiply it by 24 hours/1 day, and we can cancel out the day units.
Then, we multiply 15 by 24 to get 360 hours.
Hope this helps
