# Number of ways of partitioning a string of alphabetical characters with two two letters?

Given a string constituting of only two characters, like 'FFA' ,'OOPP' or ' GGGD' , in how many ways could one partition it into groups of letters?.ie for GGGD we have 7 ways of doing this namely: GGGD or G,GGD or G,G,GD or G,G,G,D or G,GG,D or GGG,D or GG,GD . How would we compute this for larger strings such as 'PPPPPPGGGGG' or 'DDDDDDDDDDDDDDEEEEEEEE'?(Sorry about the typo with the title, I meant 'two letters' not 'two two letters')

5 years, 4 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$