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:
The bike repair costs $35
Step-by-step explanation:
If Tony bought 20 out of 80 tickets, then it would be 25% because 20 is 1/4 of 80.
Hope I helped!
Answer:
f(x)=3(x-4)(x+3)
Step-by-step explanation:
Quadratic function follows the f(x) = ax^2 +bx+c pattern
f(x)=3(x-4)(x+3) after multiplying out is equal to
f(x)=(3x-12)(x+3) = (3x^2+9x-12x-36) = (3x^2-3x-36)
f(x) = (3x^2-3x-36)
where
a = 3
b = -3
c = -36
Answer:
4/a
Step-by-step explanation:
