3(4x - 2) = 2(6x - 3)
12x - 6 = 12x - 6
Add 6 on both sides
12x = 12x
Divide by 12 on both sides
x = x
That means this has infinite solutions. Your answer is B.
Answer:
D, not B
Step-by-step explanation:
So using Pythagorean Theorem:

Yep, It's not B, But D.
Hope this helps!
Stay Safe!
Answer:
x = 3
Step-by-step explanation:
Simplifying
4 + -7x = 1 + -6x
Solving
4 + -7x = 1 + -6x
Solving for variable 'x'.
Move all terms containing x to the left, all other terms to the right.
Add '6x' to each side of the equation.
4 + -7x + 6x = 1 + -6x + 6x
Combine like terms: -7x + 6x = -1x
4 + -1x = 1 + -6x + 6x
Combine like terms: -6x + 6x = 0
4 + -1x = 1 + 0
4 + -1x = 1
Add '-4' to each side of the equation.
4 + -4 + -1x = 1 + -4
Combine like terms: 4 + -4 = 0
0 + -1x = 1 + -4
-1x = 1 + -4
Combine like terms: 1 + -4 = -3
-1x = -3
Divide each side by '-1'.
x = 3
Simplifying
x = 3
Answer:
The number of ways to select a sample of 2 computer chips so that at least one of the chips is defective is 33 ways.
Step-by-step explanation:
The box contains 13 computer chips. Of these 13 chips 3 are defective and 10 are good.
A quality control inspector samples 2 computer chips.
The number of ways to select at least 1 defective chip is:
n (At least 1 defective chip) = n (1 defective chip) + n (2 defective chips)
The number of ways to select 1 defective chip is:
ways.
The number of ways to select 2 defective chips is:
ways.
n (At least 1 defective chip) = n (1 defective chip) + n (2 defective chips)
= 30 + 3
= 33
Thus, the number of ways to select a sample of 2 computer chips so that at least one of the chips is defective is 33 ways.