Answer:
(x+4)( 8x^{2}+1)
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:
p(on schedule) ≈ 0.7755
Step-by-step explanation:
A suitable probability calculator can show you this answer.
_____
The z-values corresponding to the build time limits are ...
z = (37.5 -45)/6.75 ≈ -1.1111
z = (54 -45)/6.75 ≈ 1.3333
You can look these up in a suitable CDF table and find the difference between the values you find. That will be about ...
0.90879 -0.13326 = 0.77553
The probability assembly will stay on schedule is about 78%.
5(x^2 - 14x + 258/5)
= 5((x-7)^2 -49+258/5)
= 5((x-7)^2 + 13/5)
= 5(x-7)^2 + 13
I belive this is how it should be done
Answer:
Solutions are -10 and 26
Step-by-step explanation:
( - the abolute sign I'm using
( x - 8 ) + 2 = 20
( x - 8 ) = 18
x - 8 = 18 (postive case)
x - 8 + 8 = 18 + 8
x = 26
( x - 8 ) = 18
x - 8 = -18 (negative case)
x - 8 + 8 = -18 + 8
x = -10