1. 8
2. 15
3. 2
4. 1/2
5. 3
those are the answers in order, hope this helps!
Answer:
1716 ways
Step-by-step explanation:
Given that :
Number of entrants = 13
The number of ways of attaining first, second and third position :
The number of ways of attaining first ; only 1 person can be first ;
Using permutation :
nPr = n! ÷(n-r)!
13P1 = 13! ÷ 12! = 13
Second position :
We have 12 entrants left :
nPr = n! ÷(n-r)!
12P1 = 12! ÷ 11! = 12
Third position :
We have 11 entrants left :
nPr = n! ÷(n-r)!
11P1 = 11! ÷ 10! = 11
Hence, Number of ways = (13 * 12 * 11) = 1716 ways
8x4=32
32=(yx7)-(yx3)
(yx7)=7y
(yx3)=3y
32=7y-3y
7y and 3y are like terms so you subtract them
=4y
32=4y
then divided 4y by 4 (to get y on its own) this cancels out if you ÷ 4y on one side of the equation you have to divide on the other side to make it balanced 32÷4=8
y=8
Answer:
The question is open ended as i suppose since there are infinitely many possibilities. one possible form of the solution can be 
Step-by-step explanation:
The base in this case is 5 while the exponent is simply the power to which the base is raised in which case it would be 2. Both values are positive and the exponent is less than the base.
