Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.22362 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- In this paper we address the well-known problem of counting the number of $3n$-letter words that can be formed from a three-letter alphabet by decomposing it into four possible cases based on its remainder when divided by three. The solution to the problem also gives us some sums of trinomial coefficients.