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.
Answer:
Step-by-step explanation:
Correct me is I'm wrong but I believe its a independent variable.
Answer:
3, 5, 7
Step-by-step explanation:
As per triangle inequality theorem:
- <em>Any side of a triangle must be shorter than the other two sides added together</em>
Assume the sides are equal to 3 smallest odd numbers: 1,3 and 5
- Then 1+3< 5 and it is against the above rule, so this is not correct
The next triple is: 3, 5 and 7
- Then 3+ 5 > 7 and it is correct
So 3, 5, 7 is the combination of smallest odd numbers to make sides of a triangle
