How many ways can you arrange the integers 1 through 13 ( a 1 through a 1 3 ) such that a n + 2 > a n for n = 1 → 1 1 ?
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.
This solution is only correct if n>0 (or n>=1). If n>1, then the first digit doesn't has to be smaller, than the third, so we can choose the first digit out of 7, and put the rest of the "odd" (and "even") digits into ascending orders.
Hence, the answer of the question in its current form shoul be 7 × 1716 = 12012
Log in to reply
Ooops, good point... I've updated the question wording.
Potential follow-up: Same scenario but with a n + 3 > a n for n = 1 → 1 0 . I get an answer of 5 ! 4 ! 4 ! 1 3 ! = 9 0 0 9 0 .
P.S.. I normally understand "digits" as the integers 0 to 9, so it might be an idea to change "digits" to "integers".
Log in to reply
Good catch with the digits... I've changed it to integers. The follow up question is interesting... I'm not sure if you mixed the answer up with my question, tho, as it appears that would be the answer for n going from 1 to 13.
Log in to reply
Well, I figured that there would be three subsequences, namely ( a 1 , a 4 , a 7 , a 1 0 , a 1 3 ) , ( a 2 , a 5 , a 8 , a 1 1 ) and ( a 3 , a 6 , a 9 , a 1 2 ) . The first subsequence can be filled in ( 5 1 3 ) ways, then the second in ( 4 8 ) ways, locking in the final subsequence. This results in ( 8 1 3 ) ( 4 8 ) = 5 ! 4 ! 4 ! 1 3 ! arrangements.
Log in to reply
@Brian Charlesworth – Looks reasonable!
Log in to reply
@Geoff Pilling – And that appears to hint at the general solution for n numbers where a m + i > a m
Problem Loading...
Note Loading...
Set Loading...
Essentially, this problem boils down to splitting the numbers into two groups, odd and even n . So, we need to choose 6 numbers for even n and 7 numbers for the odd n , then we sort them and shuffle the two groups into their corresponding place in the original list.
So, the number of ways is:
( 6 1 3 ) = 1 7 1 6