We will discuss two techniques for solving two different recurrences. The first recurrence arises in a process of computing the function for the number of Carlitz compositions of positive integer n such that part size j has multiplicity m. The second one occurs in a pursuant of a generating function of 1-composition of n not using part j.