It seems like you have the answer already. but heres how its calculated.
so the missing number is 20 **cross multiply 100 and 3 to get 300 then divide 15 into 300 to get 20**
so the missing number is 50
**cross multiply 100 and 80 to get 8000 then divide 160<span> into 8000 to get 50**</span>
Answer: last one
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.
Hope this helps! Because when you would fill in the variables 0=0 which which make the expression too that they’d equal the same.
Answer:
The answer would be A. 1 1/5
48/40 = 1 8/40
1 8/40 Simplify to 1 1/5
Hope this helps!
Step-by-step explanation:
MARK ME AS BRAINLIEST PLS :)
