Step-by-step explanation:
Below is an attachment containing the solution.
Answer:
The absolute value of 5 is 5
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:
Hope this helps :)
Step-by-step explanation:
15
(3^5)÷(3^5)
Simplify 3^5
243÷243
1
(3^5)÷(3^5)
3^5/3^5=3^5-5
3^5-5
3^5-5= 1
1
Formula: x^a/x^b=x^a-b
16
2^10/2^10
Cancel out 2^10
1
2^10/2^10
2^10/2^10=2^10-10
2^10-10
2^10-10=1
1
Formula: x^a/x^b=x^a-b
17
x^7/x^7x≠0
x≠0
18
(4x+2y)5÷(4x+2y)^5(4x+2y) ≠ 0
5/(4x+2y)^3 ≠ 0
5 ≠ 0
≠ =-y/2
19
No solution
20
p^4/p^4p ≠ 0
p≠ 0
no solution