Home > Just Math
Neighboring strangers (Posted on 2012-09-24) |
|
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.
Comments: (
You must be logged in to post comments.)
|
Subject |
Author |
Date |
| answer | Dej Mar | 2012-09-24 18:03:51 |
|
|
Please log in:
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:
|