So at the beginning, the friends eat 3 meat pies in total. So that leaves two meat pies left.
So basically, we divide the meat pies by the number of friends.
2/6 is 1/3
So each friend needs to eat 1/3 of a meat pie
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:
x = -15/2
Step-by-step explanation:
For this problem, we will simply use equation properties to solve for x.
2x - 5 = -20
2x - 5 + 5 = -20 + 5
2x = -15 ( Add positive 5 to both sides )
2x * (1/2) = -15 * (1/2)
x = -15/2 ( Multiply both sides by 1/2)
Hence, the solution to x is -15 / 2.
Cheers.
7.6 - 5(k + 1.1) = 1.6
7.6 - 5(k + 1.1) - 7.6 = 1.6 - 7.6
-5(k +1.1) = -6
-5(k + 1.1) -6
-------------- = ---------
-5 -5
k + 1.1 = 6
-----
5
k + 1.1 - 1.1 = 6
----- - 1.1
5
k = 0.1
Answer:
it's going to be 4n so its going to be 4...
Step-by-step explanation: