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: error in Comment 10 of 10 |
(In reply to error in "official solution" by Steve Herman)

It is definitely better, but not an error. Trying to make it short nothing was said about the nature of k, but it is actually not a constant number, it is k(n) which is equivalent to  f(n).


Unfortunately there is no way to correct  the official solution, and

your post is most helpful to someone who missed my intentions.

Thank you for your remark.


Edited on October 2, 2015, 9:36 pm
  Posted by Ady TZIDON on 2015-10-02 21:29:54

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 (2)
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