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

Home > Numbers
Permutations count (Posted on 2015-10-01) Difficulty: 3 of 5
Find the number of permutations of (1,2,3...n) possessing the following feature:

The number n is the only local maximum e.g. 123465, 123564, 654321,
as opposed to 651432, 261354.

See The Solution Submitted by Ady TZIDON    
Rating: 3.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Hints/Tips re: solution | Comment 2 of 10 |
(In reply to solution by Charlie)

Of course the result is true and nicely explained.

Still, there is a significantly shorter simple proof.

I will publish it within few days, allowing solvers to give it a trial.


  Posted by Ady TZIDON on 2015-10-02 00:00:20
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information