Greater and Greater!

{ A > 0 B > A C > B + 1 D > C + 2 E > D + 3 E < 30 \begin{cases} A > 0 \\ B>A \\ C> B+1 \\ D > C+2 \\ E > D+3 \\ E<30 \end{cases}

How many different ways can you pick integers A , B , C , D A, B, C, D and E E that satisfy the system of inequalities above?


The answer is 33649.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Kai Ott
Jul 12, 2016

Relevant wiki: Combinations - Problem Solving

The 5 distinct numbers can range from 1 to 29. Let's first not worry about the order of these numbers, because we could sort them later. Now, between B and C there is one "free spot" that will be "lost" (cannot be occupied by any number), so there are only 28 spots to fill. Similarily we will lose 2 and 3 spots between C and D, and D and E respectively. So there are only 23 spots to fill with 5 numbers which can be expressed as ( 23 5 ) = 33649 {23 \choose 5} = 33649 .

Edit: Realized too late this approach is very similar to the one of @Brian Charlesworth. Sorry, no intention to take your credit.

Geoff Pilling
Jul 10, 2016

Define the following functions:

  • A ( n ) = A(n) = The number of ways you can pick A A less than n + 1 n+1
  • B ( n ) = B(n) = The number of ways you can pick A A and B B with B < n + 1 B < n+1
  • C ( n ) = C(n) = The number of ways you can pick A A , B B , and C C with C < n + 1 C < n+1
  • D ( n ) = D(n) = The number of ways you can pick A A , B B , C C , and D D with D < n + 1 D < n+1
  • E ( n ) = E(n) = The number of ways you can pick A A , B B , C C , D D , and E E with E < n + 1 E < n+1

Then,

  • A ( n ) = n A(n) = n
  • B ( 1 ) = 0 B(1) = 0
  • B ( n > 1 ) = A ( n 1 ) + B ( n 1 ) B(n>1) = A(n-1) + B(n-1)
  • C ( n < 4 ) = 0 C(n<4) = 0
  • C ( n > 3 ) = B ( n 2 ) + C ( n 1 ) C(n>3) = B(n-2) + C(n-1)
  • D ( n < 7 ) = 0 D(n<7) = 0
  • D ( n > 6 ) = C ( n 3 ) + D ( n 1 ) D(n>6) = C(n-3) + D(n-1)
  • E ( n < 11 ) = 0 E(n<11) = 0
  • E ( n > 10 ) = D ( n 4 ) + E ( n 1 ) E(n>10) = D(n-4) + E(n-1)

Solving for these you get:

E ( 29 ) = 33649 E(29) = \boxed{33649}

We could also summarize the set of inequalities as

0 < A < B < C 1 < D 3 < E 6 < 24 0 \lt A \lt B \lt C - 1 \lt D - 3 \lt E - 6 \lt 24 .

Now let C = C 1 , D = D 3 C' = C - 1, D' = D - 3 and E = E 6 E' = E - 6 , giving us

0 < A < B < C < D < E < 24 0 \lt A \lt B \lt C' \lt D' \lt E' \lt 24 .

The number of solutions to this inequality is the same as the number of ways of choosing 5 distinct elements from the set { 1 , 2 , 3 , . . . , 23 } \{1,2,3,...,23\} , (which can then be placed in ascending order in only one way), giving us an answer of ( 23 5 ) = 33649 \dbinom{23}{5} = 33649 .

Brian Charlesworth - 4 years, 11 months ago

Log in to reply

Ah, once again... Great perspective on the problem, @Brian Charlesworth !

Geoff Pilling - 4 years, 11 months ago

Beautifully explained!

Siva Bathula - 4 years, 11 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...