Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Counting, Recording: Summary

In course

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, disc ...

Description

This lecture covers the Product Rule, one-to-one functions, Sum Rule, Subtraction Rule, Pigeonhole Principle, Generalized DP, Permutations, Combinations, Binomial Theorem, Pascal's Identities, Repetition, and examples of Permutations and Combinations.

Instructor

Karl Aberer

Karl Aberer received his PhD in mathematics in 1991 from the ETH Zürich. From 1991 to 1992 he was postdoctoral fellow at the International Computer Science Institute (ICSI) at the University of California, Berkeley. In 1992, he joined the Integrated Publication and Information Systems institute (IPSI) of GMD in Germany, where he was leading the research division Open Adaptive Information Management Systems. In 2000 he joined EPFL as full professor. Since 2005 he is the director of the Swiss National Research Center for Mobile Information and Communication Systems ( NCCR-MICS, www.mics.ch ). He is member of the editorial boards of VLDB Journal, ACM Transaction on Autonomous and Adaptive Systems and World Wide Web Journal. He has been consulting for the Swiss government in research and science policy as a member of the Swiss Research and Technology Council ( SWTR ) from 2003 - 2011.

Official source

Related concepts (32)

Binomial theorem

In elementary algebra, the binomial theorem (or binomial expansion) describes the algebraic expansion of powers of a binomial. According to the theorem, it is possible to expand the polynomial (x + y)n into a sum involving terms of the form axbyc, where the exponents b and c are nonnegative integers with b + c = n, and the coefficient a of each term is a specific positive integer depending on n and b. For example, for n = 4, The coefficient a in the term of axbyc is known as the binomial coefficient or (the two have the same value).

Binomial series

In mathematics, the binomial series is a generalization of the polynomial that comes from a binomial formula expression like for a nonnegative integer . Specifically, the binomial series is the Taylor series for the function centered at , where and . Explicitly, where the power series on the right-hand side of () is expressed in terms of the (generalized) binomial coefficients If α is a nonnegative integer n, then the (n + 2)th term and all later terms in the series are 0, since each contains a factor (n − n); thus in this case the series is finite and gives the algebraic binomial formula.

Binomial coefficient

In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers n ≥ k ≥ 0 and is written It is the coefficient of the xk term in the polynomial expansion of the binomial power (1 + x)n; this coefficient can be computed by the multiplicative formula which using factorial notation can be compactly expressed as For example, the fourth power of 1 + x is and the binomial coefficient is the coefficient of the x2 term.

Product rule

In calculus, the product rule (or Leibniz rule or Leibniz product rule) is a formula used to find the derivatives of products of two or more functions. For two functions, it may be stated in Lagrange's notation as or in Leibniz's notation as The rule may be extended or generalized to products of three or more functions, to a rule for higher-order derivatives of a product, and to other contexts. Discovery of this rule is credited to Gottfried Leibniz, who demonstrated it using differentials. (However, J. M.

Differentiation rules

This is a summary of differentiation rules, that is, rules for computing the derivative of a function in calculus. Unless otherwise stated, all functions are functions of real numbers (R) that return real values; although more generally, the formulae below apply wherever they are well defined — including the case of complex numbers (C). For any value of , where , if is the constant function given by , then . Let and . By the definition of the derivative, This shows that the derivative of any constant function is 0.

Related lectures (26)

Combinatorial Mathematics

Explores combinatorial mathematics, covering permutations, combinations, and binomial coefficients, along with probability and statistics concepts.

Combinatorics: Counting Methods

Introduces combinatorics and counting methods for determining possible outcomes in various scenarios, illustrated with examples.

Probability and Statistics

Introduces probability, statistics, distributions, inference, likelihood, and combinatorics for studying random events and network modeling.

Counting: Basic Principles and Applications

Explores the basic principles and applications of counting in computer science and mathematics.

Extended Binomial Theorem