Let us name the players A,Dave,Zack,Paul,E and F
For the first position there are two candidades ( Zack / Paul )
For the second position there is only one candidate i.e. Dave
For the third place there will be 4 candidates (out of Zack and Paul - 1 as one of them is already taken for the first position and A, E and F total-4)
For the fourth place there will be 3 candidates ( out of the four available candidates in the 3rd place, one will be taken up for 3rd place )
For the fifth place there will be 2 candidates
Finally, for the last place there will be only one candidate left.
On multiplying the no. of available cadidates, we get 2 * 1 * 4 * 3 * 2 * 1 = 48 i.e. option (A)
Please mention minor spelling mistakes
For the second question:
Let the no of dotted marbles be 'x' and no of striped marbles be 'y'
then the equation will become as follows
(y+6)/x = 3
and
(x+6)/y = (2/3)
On solving the equations, we will get x = 10 and y = 24
Total balls = 10+24+6 = 40 (option E)
Answer 3 will be ) For the first edge, he can choose 3 paths
For the second edge he can choose 2 paths for each path of its first edge's path
For the third , he is bounded to move on the paths created by the first and the second edges hence 1 path for each path created by the first and the second edge together
It will be multiplication of all the possibilities of the paths of the three edges differently.........
i.e. 3 * 2 * 1 = 6
Answer:
In programming, a recursive function is a function that calls itself. Recursion is used very commonly in programming, although many simple examples (including some shown in this section) are actually not very efficient and can be replaced by iterative methods (loops or vectorized code in MATLAB).
Step-by-step explanation:
Answer:
it’s g ! i just turned it in and it’s g :)
Answer:
5 friends
Step-by-step explanation:
Candy pieces = 60
Chocolate = 45
What should be the smallest number of her sister's friends for the distribution of candy and chocolate so each friend gets an equal number of candy pieces and chocolates in a way that there should not be left any chocolate or candy pieces left over?
To calculate this, find the lowest factor of 60 and 45
60:
Factors = 2, 4, 5, 6,
45:
Factors= 3, 5, 9
The lowest common factor of 60 and 45 is 5
The smallest number of her sister's friend so each person get an equal number of candy pieces and chocolate so there won't be any leftover is 5
That is
If there are 5 friends at the birthday party
60 candy pieces among 5 friends
= 60/5
= 12 pieces each
45 chocolate among 5 friends
= 45/5
= 9 each
The distance bewtween -12 and 19 is 31
and -2 -7 is 5
and then 25 and -1 is 26
