what is this number? 1,010,020,030,040,050,060,070,080,090,010,020,030,040,050,060,070,080,090,010,020,030,040,050,060,070,080,0
Andrei [34K]
Answer:
that isn't a number
Step-by-step explanation:
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

Answer:
(2, 34 )
Step-by-step explanation:
Since the points vary inversely then half the x, means double the y, thus
(2, 34) or (1, 68 ) would also belong in this inverse variation
4.41 ounces. 1.5 +2.25 + .66=4.41. You just multiply the faction by the number and add it all up.