80 x 3/10 = 240/10 = 24 times
Answer:
Step-by-step explanation: it is C
Answer:
y + 5 = -2
Step-by-step explanation:
That would be y + 5 = -2
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.
Step-by-step explanation:
x2 + 7x + 12
x2 + 4x + 3x + 12
x(x + 4) + 3( x + 4)
(x + 3) and (x + 4) are the factors
4x2 + 6x + 2
4x2 + 4x + 2x + 2
4x (x + 1) + 2(x + 1)
(x + 1) and (4x + 2) are the factors
