MathDB
Problems
Contests
National and Regional Contests
USA Contests
USA - College-Hosted Events
Harvard-MIT Mathematics Tournament
2017 Harvard-MIT Mathematics Tournament
17
17
Part of
2017 Harvard-MIT Mathematics Tournament
Problems
(1)
2017 Guts #17: Maximal number of subsequences
Source:
2/21/2017
Sean is a biologist, and is looking at a strng of length
66
66
66
composed of the letters
A
A
A
,
T
T
T
,
C
C
C
,
G
G
G
. A substring of a string is a contiguous sequence of letters in the string. For example, the string
A
G
T
C
AGTC
A
GTC
has
10
10
10
substrings:
A
A
A
,
G
G
G
,
T
T
T
,
C
C
C
,
A
G
AG
A
G
,
G
T
GT
GT
,
T
C
TC
TC
,
A
G
T
AGT
A
GT
,
G
T
C
GTC
GTC
,
A
G
T
C
AGTC
A
GTC
. What is the maximum number of distinct substrings of the string Sean is looking at?
combinatorics