• University of Padova

Combinatorics: Strategies and Methods for Counting

Explore the wonderful world of combinatorics with this course exploring simple and efficient ways to count.

Combinatorics: Strategies and Methods for Counting

See combinatorics made simple and how to avoid errors in counting principles

Combinatorics is an area of mathematics primarily concerned with counting. Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry.

On this free online combinatorics course, you’ll discover a simple and efficient method to translate a combinatorial problem into counting the elements of a reference mathematical structure.

You’ll learn basic counting principles, and be able to explain the most frequent errors in their misuse. Ultimately, you’ll discover that combinatorics isn’t as difficult as it seems.

Hear from our courses team

You can sign up at any time. However, if you’d like to take advantage of feedback from the educators and your mentors, you can do so within the following periods:

June 1 - July 15

December 1 - January 15

Download video: standard or HD

Skip to 0 minutes and 3 seconds Hello, my name’s Albert. Hello, I’m Carlo. We both are mathematicians of the University of Padua, which is a very closer to Venice. Actually, we are both Venetians. Here are some problems that we are going to consider in this MOOC. How many hands of five cards can be dealt with a deck of 52? And how many have exactly three red cards? like that one, for instance. Or very famous birthday problem, which is the probability that in the class of 24 students, the least two of them share the same birthday? and there’s another one. Then tourists lift their passport at the desk. Afterwards, the clerk gives them back randomly. What is the probability that nobody receives is on passport?

Skip to 0 minutes and 56 seconds Did you know that this value is strictly related to the Euler number? True Carlo Another problem is counting the derangements of a sequence. The derangement is a complete new way of ordering the elements of a sequence. Like, for example, that thederangements of the islands of our city, Venice. We will show you how to solve this kind of problems. Actually, they are all related to combinatorics. That is, counting the number of elements of a set. It sounds easy. But very often, mistakes occur in this type of computations. True Alberto. But after years of teaching this topic, we developed a full proof method. Yes. We translate the problem, say, in counting the number of elements of a precise mathematical structure.

Skip to 2 minutes and 6 seconds And then it’s enough to apply a specific principle and it’s done. Simple! Let us start, follow us and learn how to count.

What topics will you cover?

  • Convert counting problems into precise mathematical models
  • Count the basic combinatorial objects like sequences and collections
  • Applications on counting anagrams, derangements of a sequence (hats problem)
  • Count card shuffles and understand astonishing magic tricks
  • Basic probabilities (birthday problem)
  • Algebraic tools that allow to solve subtle combinatorial problems

When would you like to start?

Start straight away and learn at your own pace. If the course hasn’t started yet you’ll see the future date listed below.

  • Available now

Learning on this course

You can take this self-guided course and learn at your own pace. On every step of the course you can meet other learners, share your ideas and join in with active discussions in the comments.

What will you achieve?

By the end of the course, you‘ll be able to...

  • Apply the principles of combinatorics to solve the basic combinatorial problems
  • Model some real life counting problems into that of counting precise mathematical structures
  • Identify the mathematical structure which lies besides a combinatorial problem: sequences, collections, sharings, compositions, partitions, derangements.
  • Identify the principle to face a combinatorial problem: bijiection, multiplication, division
  • Calculate the probability of an event when the sample space is composed by equiprobable elementary events
  • Calculate the number of possible outcomes of an aleatory experiment
  • Calculate the number of sequences of prescribed length, with or without repetitions, from a given alphabet
  • Calculate the number of sets of given cardinality
  • Calculate the number of partitions of a given set in a prescribed number of subsets
  • Calculate the number of permutations of a sequence without repetitions
  • Calculate the number of distributions of distinguishable/indistinguishable objects in a given number of numbered boxes (possibly empty)
  • Calculate the number of distributions of distinguishable/indistinguishable objects in a given number of numbered non-empty boxes

Who is the course for?

This course is ideal for anyone interested in mathematical problems, with a basic background in precalculus. It would be useful for anyone wanting to study or work in mathematics, or anyone who wants to develope their critical thinking and problem-solving skills.

Who will you learn with?

I am a professor of algebra at the University of Padova and I teach at the science and engineering faculties. I like very much math and classical music.

I am professor of mathematical analysis at the University of Padova. Among my interests: magic, tango, photography, innovative teaching, technology and e-learning.

Who developed the course?

University of Padova

The University of Padova is one of Europe’s oldest and most prestigious seats of learning; it aims to provide its students with both professional training and a solid cultural background.

Learning on FutureLearn

Your learning, your rules

  • Courses are split into weeks, activities, and steps, but you can complete them as quickly or slowly as you like
  • Learn through a mix of bite-sized videos, long- and short-form articles, audio, and practical activities
  • Stay motivated by using the Progress page to keep track of your step completion and assessment scores

Join a global classroom

  • Experience the power of social learning, and get inspired by an international network of learners
  • Share ideas with your peers and course educators on every step of the course
  • Join the conversation by reading, @ing, liking, bookmarking, and replying to comments from others

Map your progress

  • As you work through the course, use notifications and the Progress page to guide your learning
  • Whenever you’re ready, mark each step as complete, you’re in control
  • Complete 90% of course steps and all of the assessments to earn your certificate

Want to know more about learning on FutureLearn? Using FutureLearn

Join this course

Start this course for free, upgrade for extra benefits, or buy Unlimited to access this course and hundreds of other short courses for a year.

Free

$0

Join free and you will get:

  • Access to this course for 6 weeks

Upgrade

$64

Upgrade this course and you will get:

  • Access to this course for as long as it’s on FutureLearn
  • Access to this course’s tests as well as a print and digital Certificate of Achievement once you’re eligible

Unlimited

$279.99 for one year

Buy Unlimited and you will get:

  • Access to this course, and hundreds of other FutureLearn short courses and tests for a year
  • A printable digital Certificate of Achievement on all short courses once you’re eligible
  • The freedom to keep access to any course you've achieved a digital Certificate of Achievement on, for as long as the course exists on FutureLearn
  • The flexibility to complete your choice of short courses in your own time within the year

Find out more about upgrades or Unlimited.

Get a taste of this course

Find out what this course is like by previewing some of the course steps before you join:

Do you know someone who'd love this course? Tell them about it...

You can use the hashtag #FLcombinatorics to talk about this course on social media.