Skip main navigation

Let’s count. Compositions with constraints

Let's count. Compositions with constraints
© AT

Do your best in trying to solve the following problems. It is normal that this step will take some time, we recommend to perseverate and wait before looking at the complete solution of the exercises in the video or in the pdf below.

Exercise 1. How many sequences formed with the letters (a, e, i, o, u, x, x, x, x, x, x, x, x,) (8 (x)’s) are there if one requires that no two vowels appear consecutively?

Hint: Chosen a 5-sequence of vowels, write (y_1) for the number of (x)’s to the left of the first vowel, then (y_2) for the number of (x)’s between the first and second vowels, …, (y_5) for the number of (x)’s between the fourth and fifth vowel, and finally (y_6) for the number of (x)’s appearing after the last vowel. Then (y_1+cdots+y_6=8) with (y_2,…, y_5geq 1).

Exercise 2. How many words can be formed using three (A)’s and no more than seven (B)’s?

© AT
This article is from the free online

Combinatorics: Strategies and Methods for Counting

Created by
FutureLearn - Learning For Life

Our purpose is to transform access to education.

We offer a diverse selection of courses from leading universities and cultural institutions from around the world. These are delivered one step at a time, and are accessible on mobile, tablet and desktop, so you can fit learning around your life.

We believe learning should be an enjoyable, social experience, so our courses offer the opportunity to discuss what you’re learning with others as you go, helping you make fresh discoveries and form new ideas.
You can unlock new opportunities with unlimited access to hundreds of online short courses for a year by subscribing to our Unlimited package. Build your knowledge with top universities and organisations.

Learn more about how FutureLearn is transforming access to education