Consider s=(1,2,3,10). In how many ways two numbers can be selected from s so that sum of selected is a double digit number ?
Answers
Answered by
0
Answer:
3 ways
Step-by-step explanation:
Given set of numbers;
S = {1, 2, 3, 10}
Two numbers are to be selected, and the sum of the selected numbers should be a double digit.
The possible ways to select the numbers with the given constraints.
{(1,10), (2,10), (3,10), (10,1), (10,2), (10,3)} = 6 ways
The numbers are not selected one after the other, two numbers are picked at the same time. So, there is no repetition of the possible ways.
Therefore, the number of ways to select two numbers with the given constraints = 3 ways.
Similar questions