1. **Stating the problem:** We want to find subsets of the digits of the number 141 that sum to the numbers 17, 32, 48, 60, and 64. 2. **Understanding subsets and sums:** A subset is any selection of digits from the number without rearranging or repeating digits. The digits of 141 are 1, 4, and 1. 3. **Listing all possible subsets of digits:** The subsets of digits from 141 are: \{1\}, \{4\}, \{1\}, \{1,4\}, \{4,1\}, \{1,1\}, \{1,4,1\}. 4. **Calculating sums of these subsets:** - \{1\} sums to 1 - \{4\} sums to 4 - \{1,4\} sums to 5 - \{1,1\} sums to 2 - \{1,4,1\} sums to 6 5. **Checking if any subset sums match the target numbers:** None of these sums (1, 2, 4, 5, 6) match 17, 32, 48, 60, or 64. 6. **Conclusion:** It is not possible to get the numbers 17, 32, 48, 60, or 64 by summing any subset of the digits of 141. **Final answer:** No subsets of digits from 141 sum to 17, 32, 48, 60, or 64.