Counting 7-Letter Palindromes: 26^7 Possibilities

  • Thread starter Thread starter SammC
  • Start date Start date
  • Tags Tags
    Counting
Click For Summary

Discussion Overview

The discussion revolves around the problem of counting the number of seven-letter palindromes that can be formed using the 26 letters of the English alphabet. Participants explore different approaches to arrive at a solution, considering both combinatorial methods and the structure of palindromes.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant states that there are 26^7 possible strings of length 7, arguing that order is important for palindromes.
  • Another participant suggests that a seven-letter palindrome can be represented as ABCDCBA, where A, B, C, and D are letters from the alphabet.
  • A participant calculates that if A, B, C, and D can be the same, then the number of palindromes could be 26^4, but questions whether this might lead to overcounting.
  • There is confusion regarding how to account for cases where letters are repeated in different arrangements, particularly for cases with 5, 4, 3, and 2 of the same letter.

Areas of Agreement / Disagreement

Participants express differing views on the correct approach to counting palindromes, with no consensus reached on whether 26^4 is the correct count or if it leads to overcounting.

Contextual Notes

Participants note the complexity of counting palindromes due to the arrangements of letters and the potential for overlap in counting cases with repeated letters.

Who May Find This Useful

This discussion may be of interest to those studying combinatorics, particularly in the context of palindromic structures, as well as individuals exploring mathematical reasoning related to permutations and combinations.

SammC
Messages
17
Reaction score
0
The problem statement
There are 26 letters in the English Alphabet, how many seven-letter palindromes can be made?


The attempt at a solution
There are 26 letters in the alphabet, so there are 26^7 possible
strings of length 7 (order being important for palindromes, i don't
think 26 choose 7 is appropriate).

One way to do this would be to subtract the number of strings that are not palindromes from 26^7, but I have no idea how to get this number.

Another way to do it is to figure out how many palindromes
match the following cases:

7 of the same letter: 26 cases
6 of the same letter: 26*25 cases
5 of the same letter: ? cases
4 of the same letter: (ex: XXYZYXX)
3 of the same letter: (ex: YZXXXZY)
2 of the same letter: (ex: ZYXWXYZ)

Since after the first two cases, there are multiple ways to arrange
all of the letters that work, i get confused. (for example, 5 can be
arranged as XXYXYXX, or XYXXXYX, or YXXXXXY)

I know if I add all the cases together, i'll get the correct answer,
(subtracting overlap), but this gets out of hand very quickly. Is
there another approach that will work?
 
Physics news on Phys.org
You could start by noting that a seven letter palindrome should look like
ABCDCBA
where A, B, C, D are any letter from the English alphabet.
 
Ah, I see.

So you have 26 choices for A, 25 choices for B, 24 choices for C, and 23 choices for D.

26*25*24*23 = 358800?

EDIT: Actually, the above is incorrect, A, B, C , and D can all be the same.

is 26^4 correct? That seems like it would be over counting, or counting some possibilities multiple times?
 
I would say 26^4, yes.
Which two words, for example, would be overcounted then?
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 8 ·
Replies
8
Views
7K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
Replies
1
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
6
Views
3K
  • · Replies 3 ·
Replies
3
Views
4K