Answer:
x=3 Y=5
5 - 3 = 2
(y) (x)
Step-by-step explanation:
answer is 2
The question you posted doesn't really show the question. Are there any words like how, when, where.... and do you have answer choices? : ) maybe then I can help?
That's hard to answer, but I'd say between 18-19. June has 30 days, July has 31. It's a hard question, but about 19.
Step-by-step explanation:
again, 2 unknowns.
x = number of 2- points baskets
y = number of 3- points baskets
we know they hit the basket 37 times in a so far unknown mixture of 2-point and 3- point throws.
x + y = 37
which gives us e.g.
x = 37 - y
and we know that with this unknown mixture they scored 80 points.
so,
2x + 3y = 80
as every successful 2-points throw scores 2 points, and every successful 3-points throw scores 3 points.
so, again our 2 equations :
x = 37 - y
2x + 3y = 80
remember, we prepared the first equation so that it gives us already an identity expressing one variable by the other. and that we use in the second equation :
2×(37 - y) + 3y = 80
74 - 2y + 3y = 80
74 + y = 80
y = 6
and from
x = 37 - y
we get
x = 37 - 6 = 31
so, they had 31 2-points throws and 6 3-points throws.
The Statement that "Because all permutation problems are also Fundamental Counting problems, they can be solved using the formula for nPr or using the Fundamental Counting Principle." is True.
As per the question-statement, all permutation problems are also Fundamental Counting problems and they can be solved using the formula for nPr or using the Fundamental Counting Principle.
We will have to find out the truthfulness of this above-mentioned statement.
First of all, permutations are each of several possible ways in which a set or number of things can be ordered or arranged, and thus, the first part of our statement is true that, all permutation problems are also Fundamental Counting problems.
Now, the nPr Formula goes as which itself is based on the fundamental counting principle, and any Fundamental Counting problem can be solved using the fundamental counting principle. Therefore, the second part of our statement is also true that, all permutation problems can be solved using the formula for nPr or using the Fundamental Counting Principle.
- Permutation: Each of several possible ways in which a set or number of things can be ordered or arranged and can be calculated by the formula .
- Fundamental Counting Principle: The Fundamental Counting Principle states that if an event can occur in m different ways, and another event can occur in n different ways, then the total number of occurrences of the events is (m × n).
To learn more about permutations, click on the link below.
brainly.com/question/14767366
#SPJ4