0% found this document useful (0 votes)
5 views1 page

Combinatorics Problem Set Solutions

This document contains 6 problems related to combinatorics. The problems cover topics like the binomial coefficient, Euler's totient function, generating functions, distributing identical balls into distinct boxes with restrictions, selecting letters with restrictions, and distributing distinct objects into boxes with parity restrictions.

Uploaded by

Norshida Calibi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views1 page

Combinatorics Problem Set Solutions

This document contains 6 problems related to combinatorics. The problems cover topics like the binomial coefficient, Euler's totient function, generating functions, distributing identical balls into distinct boxes with restrictions, selecting letters with restrictions, and distributing distinct objects into boxes with parity restrictions.

Uploaded by

Norshida Calibi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

UNIVERSITY OF SOUTHEASTERN PHILIPPINES

Combinatorics
Problem Set 2

r

1. Show that D(n, r, k) = k
D(n − k, r − k, 0)

2. For n ∈ N, Show that (


ϕ(n), if n is odd
ϕ(2n) =
2ϕ(n), if n is even
where ϕ(n) is the Euler Phi Function. Moreover, suppose that n = 101 and m = 208. Find ϕ(2n) and
ϕ(2m) using the above formulas.

3. Find the coefficients of x8 in the expansion (1 + x + x2 + · · · + x5 )4 using generating functions.

4. Find the number of ways to distribute 40 identical balls to 7 distinct boxes if box 1 must hold at least
3 and at most 10 of the balls.

5. Find the number of selections of 10 letters from ”F, U,N,C, T, I, O” that contain at most three U’s
and at least one O.

6. For r ∈ N∗ , find the number of ways of distributing r distinct objects into 5 distinct boxes such that
each of the boxes 1,3,and 5 must hold an odd number of objects while each of the remaining boxes
must hold and even number of objects.

You might also like