T3 - a n . Problem 3: Find the number of non-negative...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Problem 1: Find the generating function for the number of compositions of n with an odd number of parts, each of which is congruent to 1 (mod 3). Problem 2: Consider the set A of compositions of n in which at least one of the parts is greater than 3. (a) Find the generating function of A . (b) Let a n be the number of compositions of n in which at least one of the parts is greater than 3, find a recurrence relation for
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a n . Problem 3: Find the number of non-negative integers less than 1,000,000 whose digits sum up to no more than 23. Problem 4: We call an n-digit number valid if it contains an even number of 0s. Let a n be the number of valid n-digit numbers. (a) Find a recurrence relation for a n . (b) Use generating functions to nd an explicit formula for a n . 1...
View Full Document

This note was uploaded on 11/26/2011 for the course MATH 239 taught by Professor M.pei during the Spring '09 term at Waterloo.

Ask a homework question - tutors are online