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.)
Some Thoughts re(2): I guess simplicity is in the mind of the user | Comment 6 of 10 |
(In reply to re: I guess simplicity is in the mind of the user by Steve Herman)

Chacun à son gout.

I full-heartedly  agree that both approaches are elegant, plausible and simple. So is the puzzle itself.
As to which way is simpler or more straightforward, depends  on a personal taste and/or predefined criteria.
If brevity of the proof is one of them please see my "official" definition, where I will try to use minimum of words to expose my (=Jer's) approach.

  Posted by Ady TZIDON on 2015-10-02 12:57:26
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 (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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