This is a problem dealing with permutations and combinations.
Order does not matter in this problem.
Since order doesn't matter, it is a combination.
Repetition matters, since you can't have the same person count as two people.
There are twelve slots.
_ _ _ _ _ _ _ _ _ _ _ _
Each slot needs to be multiplied by the next.
_*_*_*_*_*_*_*_*_*_*_*_
Now we have to fill in the slots.
Each slot will be filled with a number one less than the one before it. It has to be one less, since repetition matters.
The numbers will be decreasing from 30, since there are 30 possible people.
30 * 29 * 28 * 27 * 26 * 25 * 24 * 23 * 22 * 21 * 20 * 19
Multiply these numbers together and you get your answer.
41,430,393,164,160,000 ways
Given,
- HK is the perpendicular bisector of GJ. So, <u>GK = KJ</u>.
- GK = 2x + 10
- KJ = 3x - 15
_______________
Find KJ .
_______________
First find the value of x
Now, find the value of KJ.
-> The value of KJ is <u>6</u><u>0</u><u>.</u>
_______________
Hope it helps.
RainbowSalt2222
To properly visualize the given, we transform them into equation form rather than words.
f(x) = sqrt (x)
g(x) = 8(sqrt(x))
From these, it may be observed that g(x) is 8 times of f(x). These transformation is in the value of y and is scaling. Because it is multiplied by a a whole number, the transformation is vertical scaling that involves multiplying the y-coordinate by 8.
I believe that it would be 13, unless you were trying to make the 9 negative. Hope that helps.
<span>This is a very nice counting question.
Suggestion / Hint: Count how many ways he can get from (0,0) to (5,7) by going through the point (2,3). Then subtract that from ALL POSSIBLE ways he can get from (0,0) to (5,7).
Hint for the hint: How many ways he can get from (0,0) to (5,7) by going through the point (2,3)? Well, that's the SUM of how many ways he can get from (0,0) to (2,3) and how many ways he get get from (2,3) to (5,7).
Hope this helps! :)</span>
