The are 40320 ways in which the 5 indistinguishable rooks be can be placed on an 8-by-8 chess- board so that no rook can attack another and neither the first row nor the first column is empty
<h3 /><h3>What involves the
rook polynomial? </h3>
The rook polynomial as a generalization of the rooks problem
Indeed, its result is that 8 non-attacking rooks can be arranged on an 8 × 8 chessboard in r8.
Hence, 8! = 40320 ways.
Therefore, there are 40320 ways in which the 5 indistinguishable rooks be can be placed on an 8-by-8 chess- board so that no rook can attack another and neither the first row nor the first column is empty.
Read more about rook polynomial
brainly.com/question/2833285
#SPJ4
D D B I think this should be right
Answer:
The domain is all real numbers
Step-by-step explanation:
f(x) = x^2 +6x +8
The domain is what numbers can we put in for x
This is a parabola, we can put in any number for x and the function is defined
Answer:
The range of the function are the values of height which are from 3, 4, 5, ..., 50
Step-by-step explanation:
The given parameters are;
The height at which the ball is caught = 5 feet
The height at which the ball was hit = 3 feet
The maximum height reached by the ball = 50 feet
The height of the ball given as a function of time is f(t) s = u·t - 1/2·g·t²
Where;
s = 50 feet
g = 9.81 m/s²
Therefore, we have;
50 = u·t - 1/2 × 9.81 × t²
50 = u·t - 4.905 × t²
Therefore, the range are obtainable values for f(t) which range from 3 to 50.
