Answer:
Step-by-step explanation:
Given
Required
The domain and range
A function is represented as:
Where
domain
range
So, we have:
It would be 10 because With Nancy, y=4x+30, 30 is the membership fee which is 10 less than Jessicas membership fee of 40.
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.
2(2x + 1) = 4x + 2
4x + 2 = 4x + 2
All real numbers are solutions :)
