All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
One-peak sets (Posted on 2018-10-30) Difficulty: 3 of 5
Take a set of n distinct numbers.
How many permutations of this set with exactly one local maximum
are there?

Provide a proof of the formula you've derived.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts First Thoughts (spoiler?) | Comment 1 of 4
It seems to me that the largest of the n numbers is necessarily the maximum.  The other (n-1) are either on the left or the right of the maximum.  Those on the left are in ascending order and those on the right are in descending order.  For each of the other (n-1), the only question is whether it is on the left or the right.  So there should be 2^(n-1) permutations that work.
  Posted by Steve Herman on 2018-10-30 09:01:37
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information