For All Your Quant Queries

**How many ways can a size k + 1 subset with maximum element m + 1 can be created from the given set S={1,2,3,…..,n+1} ?**

Written by Implex

October 15, 2008 at 12:43 pm

Posted in Algebra, Problem of the week

Tagged with Algebra, Combinatorics

Subscribe to comments with RSS.

- Para Jumbles 19.08.09
- Fill In the blanks 08.08.09
- Fill In The Blanks 05.08.09
- Para Jumbles 05.08.09
- Para Jumbles 04.08.09

- Algebra
- Announcements
- Arithmetic
- CAT 2008
- CAT 2009
- Combinatorics
- concepts
- Conundrum
- Coordinate Geometry
- Data Sufficiency
- Functions
- General
- Geometry
- IIM Interview Experiences
- Inequalities
- Mock Cat
- Mock Quant
- Number Thoery
- Online CAT
- Power Play
- Prime Numbers
- Probability
- Problem of the week
- Problems
- Tips

- Problem of the day 26.08.09
- Problem of The day 06.08.09
- Problem of the Day 30.07.09
- Bonus QUestion 28.07.09
- Problem of the day 28.07.09

- Art of Problem Solving
- CAT Material (free)
- Math Lessons
- Pagal Guy
- Pagalbille
- Test Funda
- Verbal Logic

vinit on Bonus Question 26.07.09 | |

harsh bansal on The Funny Side of Mathema… | |

KT on IIM A Interview Experienc… | |

tushar on Concept 3 Circle and Triangles… | |

ankeshgupta09 on Problem of the Day 30.07.… |

- 122,697 hits

- RT @PandaJay: Capitalism is great when there's no competition. But when there is competition, Socialism is soooooo much better 😁 https://t.… 1 day ago
- RT @ShivAroor: Unemployment levels soaring under Modi. https://t.co/mWh7OkQVk0 3 days ago
- RT @unurag: Cheapster @ravishndtv uses even tragedy of Jaya's ill health to make snide remarks at Amitabh Bachchan. https://t.co/w2LbdZW5ar 4 days ago
- RT @Nesenag: Support #Jayalalithaa you are supporting a cult leader, support Modi you are a Bhakt but being a doormat of fake Gandhis makes… 4 days ago
- RT @abhijitmajumder: Tariq Anwar made up Murthal rapes. All media lies abt church attacks fell flat. Intelligentsia used both, never retrac… 4 days ago

%d bloggers like this:

Here, the maximum value that m can take is n and same for k.

Tried with examples but m not able to come to a general solution.

When m=k, the no. of ways =1

When m>k, the solution is

(m+1)C{k+1) + mC(k+1) + (m-1)C(k+1)…

A stupid solution I know. Working on generalizing this.

Still in CAT the best way to tackle such questions would be to go for value of n=5/6 and the values of k upto 5 and similarly for m.

milindOctober 20, 2008 at 4:42 pm

its simpler

the highest term can be selected in one way

as it is m+1

now other k terms have to be selected from m values

so mck

outtimedOctober 21, 2008 at 12:36 pm