Abstract
In this paper we address the well-known problem of counting the number of -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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.