How to write 100, 203 in two other forms
1 answer:
You might be interested in
Answer:
3
Step-by-step explanation:
because if you are doing negatives it is kinda like subtracting
Answer:
(2, - 9 )
Step-by-step explanation:
Since 2 is the output when - 9 is input to f(x)
Then reversing the procedure, that is the inverse gives an output of - 9 for an input of 2.
(- 9, 2) is a point on the graph of f(x), then
(2, - 9) is a point on the graph o the inverse function (x)
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