We weere taking samples that were too large for the population too biased
Answer:
Step-by-step explanation:
x-y=7
-3x+9y=-39
Divide the second equation by 3
-x +3y = -13
Add this to the first equation
x-y=7
-x +3y = -13
----------------------
0x +2y = -6
Divide by 2
2y/2 = -6/2
y = -3
Now find x
x-y = 7
x -(-3) = 7
x+3 = 7
Subtract 3 from each side
x = 4
(4,-3)
Or by substitution
x-y=7
solve for x
x = 7+y
-3x+9y=-39
Substitute y+7 in for x
-3(7+y) +9y = -39
Distribute
-21 -3y +9y = -39
Combine like terms
-21 +6y = -39
Add 21 to each side
6y = -18
Answer:
Okay so,
Step-by-step explanation:
the first one is
1.25 or 1 
second one is
0.5 or 
the third one is
i'm not sure what the question is
the fourth one is
i'm not sure what the question is. Are you dividing?
the fifth one is
153.18
the sixth one is
1010.25
the seventh one is
4.066362
the eight one is
i'm not sure what the question is
Can you make me brainliest please
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.
