Answer:
Step-by-step explanation:
The given equations are:
(1)
and 
(2)
Now, simply adding equation (1) and equation (2), we get
Now, substituting the value of x=6 in equation (2). we get
Thus, the values of x and y are 6 and 1 respectively.
In order to solve the system of solution, beau can see that in both the given equations, coefficient of y is same and is with opposite sign, thus simply adding both the equations will eliminate y and she will get the value of x and then substituting the value of x in any of the equations, she can get the value of y. With this, she can get closer to the solution.
A combination is an unordered arrangement of r distinct objects in a set of n objects. To find the number of permutations, we use the following equation:
n!/((n-r)!r!)
In this case, there could be 0, 1, 2, 3, 4, or all 5 cards discarded. There is only one possible combination each for 0 or 5 cards being discarded (either none of them or all of them). We will be the above equation to find the number of combination s for 1, 2, 3, and 4 discarded cards.
5!/((5-1)!1!) = 5!/(4!*1!) = (5*4*3*2*1)/(4*3*2*1*1) = 5
5!/((5-2)!2!) = 5!/(3!2!) = (5*4*3*2*1)/(3*2*1*2*1) = 10
5!/((5-3)!3!) = 5!/(2!3!) = (5*4*3*2*1)/(2*1*3*2*1) = 10
5!/((5-4)!4!) = 5!/(1!4!) = (5*4*3*2*1)/(1*4*3*2*1) = 5
Notice that discarding 1 or discarding 4 have the same number of combinations, as do discarding 2 or 3. This is being they are inverses of each other. That is, if we discard 2 cards there will be 3 left, or if we discard 3 there will be 2 left.
Now we add together the combinations
1 + 5 + 10 + 10 + 5 + 1 = 32 choices combinations to discard.
The answer is 32.
-------------------------------
Note: There is also an equation for permutations which is:
n!/(n-r)!
Notice it is very similar to combinations. The only difference is that a permutation is an ORDERED arrangement while a combination is UNORDERED.
We used combinations rather than permutations because the order of the cards does not matter in this case. For example, we could discard the ace of spades followed by the jack of diamonds, or we could discard the jack or diamonds followed by the ace of spades. These two instances are the same combination of cards but a different permutation. We do not care about the order.
I hope this helps! If you have any questions, let me know :)
Call (F) the age of the father and (J) the age of Julio
The F & J are related in this way: F=4J
Now you have a restriction in the form of inequality: The sum of both ages has to be greater or equal than 55.
Algebraically that is: F + J ≥ 55
You can substitute F with 4J to find the solution for J:
4J + J ≥ 55
5J ≥ 55
Now divide both sides by 5
5J/5 ≥ 55/5
J ≥ 11
That Imposes a lower boundary for the value of J of 11, meaning that the youngest age of Julio can be 11
Answer:
whats the question
Step-by-step explanation:
Answer:
translate the graph 5 units left and down 2 units
Step-by-step explanation:
To translate the function f(x) by an amount h units right and k units up, make the transformation ...
g(x) = f(x -h) +k
Comparing this to your equation,
g(x) = f(x +5) -2
we see that the translation is h = -5, k = -2.
The graph of f(x) is translated 5 units left and 2 units down to make the graph of g(x).
