Answer: -2, 0, 1, 3
Step-by-step explanation:
when you multiply -7 and -6 by -5 than add 5 you get a higher number than 25.
when you multiply -2, 0, 1 And 3 by -5 than add 5 you get a lower number than 25.
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:
Not exactly sure but I think it should be 30 pieces
Step-by-step explanation:
Answer:
[- 4, ∞ )
Step-by-step explanation:
the expression inside the radical must be greater than or equal to zero
x +4 ≥ 0 ⇔ x ≥ - 4
domain: x ∈ [- 4, ∞ )
