perplexus.info :: Numbers : Permutations count

Home > Numbers

Permutations count (Posted on 2015-10-01)

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.)

re: I guess simplicity is in the mind of the user

| Comment 5 of 10 |

(In reply to I guess simplicity is in the mind of the user by Charlie)

Yes, simplicity is definitely in the mind of the user. I found Charlie's direct calculation to be simpler than the Jer's use of induction, although both were clear and elegant.

Posted by Steve Herman on 2015-10-02 12:10:50

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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info