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

Home > Just Math
Neighboring strangers (Posted on 2012-09-24) Difficulty: 1 of 5
There are 26 letters in the English alphabet.
How many strings of length n, such that no letter
is repeated twice (or more) in succession, exist?

Examples: for n=4 agir and psop are "permitted", while aggr or ppso are not.

See The Solution Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
answer Comment 1 of 1
I believe the answer is
26*25(n - 1)
  Posted by Dej Mar on 2012-09-24 18:03:51
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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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