As a student of CSE, one must complete a course on Discrete mathematics. Many then become confused why they should even learn this mathematical subject. Discrete mathematics is a vast topic, but here are some essential things that you should know to be able to solve programming contest problems:

**Counting :**You are going to see a lot of problems like "Count the number of ways to do X". In most of the cases, enumerating all possible ways is simply not going to work, and you are expected to use some kind of**dynamic programming**. To be able to solve counting problems properly, you need to have a good understanding of certain topics such as:**Recurrence relations**: Ubiquitous in counting problems. In particular, learn to come up with recurrences for counting. Also, learn to convert recurrences of high complexity to lower complexity**Matrix exponentiation**: In the case of recurrences that have constant coefficients, it is possible to express the final state vector as the product of the power of a matrix and the initial state vector. A good example is calculating Fibonacci numbers using matrix multiplication. This trick helps to reduce the complexity of finding Nth term of some recurrences from O(N) to O(Log N)**Binomial coefficient****Pigeonhole principle****Inclusion–exclusion principle**: How to formalise dealing with double counting. It is sometimes so much easier to double count in the beginning and use inclusion-exclusion later than to try some double counting avoiding recurrence**Subsets and Permutations**: Learn to generate subsets of a set and permutations of a sequence. There are some counting problems where you are expected to sum up quantities over permutations or subsets.**DP over subsets**is something that you should learn too in this regard.**Indistinguishable and distinguishable objects**: Learn the difference, and learn how counting changes between the two cases.**Lattice problems**: Counting the number of ways to go between two points on a lattice with various kinds of restrictions is a very common problem. Learn the basic method, and how things like binomial coefficients and Catalan numbers appear in the solutions.**Counting on graphs**: The questions of this type that I have seen commonly include tree DPs. Counting problems on non-tree graphs are usually hard. You see problems coming up based on Kirchhoff's theorem once in a while too.**PĆ³lya enumeration theorem**: I have seen this coming up in contests only a couple of times. But learn this and if something comes up, it should be easy for you.**Learn to work with moduli :**Most of the times, you are asked to do the counting mod some big prime (most favourite is 10^9 +7). Learn to do the calculations without overflow, and learn some basic properties of primes from group theory which help solve some problems.**Probability and****Expectation value**: Here are the basic things you should know:**Calculating probabilities as ratios of counting problems**: Do this and you can calculate things to very good accuracy**Recurrences for probabilities and expectation values :**In a lot of cases, even when you can count and take ratios to get probabilities, it is much easier to find a recurrence directly in terms of probabilities. Taking care of double counting can be a pain though**Linearity of expectation value**: Learn to use it right (I can't) and many expectation value problems should be cakewalks for you**Random walk****Coin toss problems**: Another set of practically overused problems

great tutorial and tips!

ReplyDeletethanks :)

Delete