× Didn't find what you were looking for? Ask a question
Top Posters
Since Sunday
5
a
5
k
5
c
5
B
5
l
5
C
4
s
4
a
4
t
4
i
4
r
4
New Topic  
davashkai davashkai
wrote...
Posts: 100
Rep: 0 0
11 years ago
Compute the number of subsets {1,2,3,..., 10} that consist entirely of two or more consecutive integers.
why is the answer 45 subsets, how do you get that
what is the way to approach it, is there a pattern
explain and show steps
why is it like 10+9+8+7+6+5
Read 450 times
1 Reply

Related Topics

Replies
wrote...
11 years ago
If the subset is 2 integers, there are 9 consecutive subsets
12, 23, ... 910
If the subset is 3 integers, there are 8 subsets
123, 234, ... 8910
etc,
The total number is 9 + 8 + ...  + 1 = 9*10/2 = 45

Another way to count them: for any pair of integers, there is one subset of consecutive integers from the smallest to the largest of the pair.

The number of pairs is the same as the number of ways to select 2 numbers from 10 without replacement, which is 10x9/2 = 45.

A third way:
There are 9 possible subsets starting with 1 (12, 123, 1234, ... 12345678910)
8 possible subsets starting with 2 (23, 234, ... 2345678910
...
1 subset starting with 9
New Topic      
Explore
Post your homework questions and get free online help from our incredible volunteers
  1195 People Browsing
 101 Signed Up Today
Related Images
  
 388
  
 275
  
 283
Your Opinion
Which 'study break' activity do you find most distracting?
Votes: 741

Previous poll results: Who's your favorite biologist?