Answer:
17. 6
18. 18 (as shown)
19. 10/3 = 3 1/3
20. 20/3 = 6 2/3
Step-by-step explanation:
17. For this, you can subtract the given length GB=12 from the length you found for problem 18, BF=18. Doing that tells you FG = 18-12 = 6, as you have marked on the diagram.
19. As with median BF, the point G divides it into two parts that have the ratio 1:2. The distance from G to D is the shorter of the distances, so you have ...
... GD = (1/3) CD = (1/3)·10 = 10/3
... GD = 3 1/3
20. You can subtract GD from CD to get CG, or you can multiply CD by 2/3. The result is the same either way.
... CG = CD -GD = 10 -3 1/3
... CG = 6 2/3
_____
<em>Comment on centroid and median</em>
The centroid (G) divides each median into parts in the ratio 1:2. Hence the shorter of those parts is half the length of the longer one, or 1/3 the total length of the median.
The longer of the parts is double the length of the shorter one, or 2/3 the total length of the median.
Your marking of median BF seems to show an understanding of these relationships. (Total length: 18; length of parts: 6 and 12.)
Answer:
4(x-7)^2-(x-7)+3 (Assuming t is f)
Step-by-step explanation:
Let s(x)=x-7 and t(x)=4x^2-x+3 .
(t o s)(x)=t(s(x))=t(x-7)
Before I continue this means replace the orginal x in t with x-7.
This will then give you
4(x-7)^2-(x-7)+3
I got you
Step-by-step explanation:
y=-2/3x-2
Answer:
1680 ways
Step-by-step explanation:
Total number of integers = 10
Number of integers to be selected = 6
Second smallest integer must be 3. This means the smallest integer can be either 1 or 2. So, there are 2 ways to select the smallest integer and only 1 way to select the second smallest integer.
<u>2 ways</u> <u>1 way</u> <u> </u> <u> </u> <u> </u> <u> </u>
Each of the line represent the digit in the integer.
After selecting the two digits, we have 4 places which can be filled by 7 integers. Number of ways to select 4 digits from 7 will be 7P4 = 840
Therefore, the total number of ways to form 6 distinct integers according to the given criteria will be = 1 x 2 x 840 = 1680 ways
Therefore, there are 1680 ways to pick six distinct integers.
