Pages are being printed for a brochure four out of every 20 are in color
1 answer:
You might be interested in
Step-by-step explanation (Question 1):
<u>Step 1: (Question 1): Subtract x from both sides.</u>
5x+3=x+13
5x+3−x=x+13−x
4x+3=13
<u>Step 2: (Question 1): Subtract 3 from both sides.</u>
4x+3−3=13−3
4x=10
<u>Step 3: (Question 1): Divide both sides by 4.</u>
4x/4 = 10/4
FIRST ANSWER: x = 5/2
Step-by-step explanation (Question 2):
<u>Step 1: (Question 2): Multiply by LCM</u>
15x^2 - 6 = x
<u>Step 2: (Question 2): Solve 15x^2</u>
15x^2 - 6 = x:
x = 2/3
x = -3/5
<u>Step 3: (Question 2): Solve</u>
ANSWER: x=0.666667 or x=−0.6
See Attachment 1 for question 1 steps (FULL)
See Attachment 2 for question 2 steps (FULL)
Answer:
1) x = 5/2
2) x=0.666667 or x=−0.6
Hope this helps.
Answer:
The probability is
Step-by-step explanation:
We can divide the amount of favourable cases by the total amount of cases.
The total amount of cases is the total amount of ways to put 8 rooks on a chessboard. Since a chessboard has 64 squares, this number is the combinatorial number of 64 with 8,
For a favourable case, you need one rook on each column, and for each column the correspondent rook should be in a diferent row than the rest of the rooks. A favourable case can be represented by a bijective function with A = {1,2,3,4,5,6,7,8}. f(i) = j represents that the rook located in the column i is located in the row j.
Thus, the total of favourable cases is equal to the total amount of bijective functions between a set of 8 elements. This amount is 8!, because we have 8 possibilities for the first column, 7 for the second one, 6 on the third one, and so on.
We can conclude that the probability for 8 rooks not being able to capture themselves is