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.
2(n-2)=9
That's the answer. U just set it up as it is written
<h3>
Answer: VX = 37</h3>
=======================================================
Explanation:
VX is a midsegment and it is half as long compared to the parallel side UY. This means UY is twice as long compared to VX
UY = 2*(VX)
s = 2*(s-37)
s = 2s - 74
s-2s = -74
-s = -74
s = 74
This makes UY be 74 units long
So VX = (1/2)*UY = 0.5*74 = 37
