Combinatorics intense question

  • Thread starter Thread starter newchie
  • Start date Start date
  • Tags Tags
    Combinatorics
Click For Summary

Homework Help Overview

The problem involves finding the number of non-empty subsets of the set {1, 2, 3, ..., 15} that meet specific criteria regarding the inclusion of consecutive integers and the minimum value of elements based on the size of the subset.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the use of combinatorial identities and casework, with some confusion about the application of the expression "n-k+1 choose k".
  • Questions arise regarding the significance of "n" in the context of the problem and the implications of choosing elements without selecting consecutive integers.
  • There is an exploration of the relationship between the number of elements chosen and the constraints imposed by the problem.

Discussion Status

The discussion is ongoing, with participants seeking clarification on various aspects of the problem and exploring different interpretations. Some guidance has been offered regarding combinatorial identities, but there is no explicit consensus on the approach to take.

Contextual Notes

Participants are grappling with the implications of the problem's constraints, particularly the definitions of the subsets and the conditions that must be satisfied. There is also mention of external resources that may provide additional context or solutions, but understanding remains incomplete.

newchie
Messages
19
Reaction score
0

Homework Statement


How many non- empty subsets of {1,2,3...,15} have the following two properties?
1) No two consecutive integers belong to S.
2)If S contains K elements, then S contains no number less than K .



Homework Equations



choosing identities, not sure which one

The Attempt at a Solution


Tried casework, but I don't understand how the solution gets
n-k+1 choose k
 
Physics news on Phys.org
you said n-k+1 choose k
what is n?
 
If we have ways are there to choose k elements from an ordered n element set without choosing two consecutive members
 
newchie said:
If we have ways are there to choose k elements from an ordered n element set without choosing two consecutive members

Okay, so what does it mean when you take a choose b?
You're taking the number of ways to choose b items out of a, right?

So why would you suppose the answer to your question is n-k+1 choose k?
What is the significance of n-k+1?
 
http://www.artofproblemsolving.com/Wiki/index.php/2006_AMC_12A_Problems/Problem_25
I don't understand the solution
 
Last edited by a moderator:
What about it do you not understand?
 
Defining the boxes into n-2k+1 elements, then the general choosing statement, i get the first part, but the second part is a bit opaque
 
Interesting problem! Fiddling with pencil & paper and looking for patterns suggests that for n integers, the answer involves sums of triangle numbers, T(n) = n(n+1)/2, but I don't see a good way to get there from simple combinetrics.
 
Last edited:

Similar threads

  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 23 ·
Replies
23
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 29 ·
Replies
29
Views
5K
Replies
4
Views
3K