Skip to main content

CS202: Discrete Structures

Page path
  • Home /
  • Courses /
  • Course Catalog /
  • Computer Science /
  • CS202: Discrete Structures /
  • Unit 4: Mathematical Induction and Introduction to... /
  • 4.4: Factorial Notation
Back to 'Unit 4: Mathematical Induction and Introduction to Sequences'
  • 4.4: Factorial Notation

    •  Massachusetts Institute of Technology: Srini Devadas and Eric Lehman's "Sums, Approximations, and Asymptotics II" URL

      Read Section 2 "The Factorial Function." The reading also applies to the Subunit 4.4.1 and Subunit 4.4.2. In reading for Subunit 4.4.2, below, see the binomial theorem and its generalization to the multinomial theorem.

      Note the first ten factorials: 10! 9! 8! 7! 6! 5! 4! 3! 2! 1! = 101 x 92 x 83 x 74 x 65 x 56 x 47 x 38 x 29 x 110.

    •  Massachusetts Institute of Technology: Srini Devadas and Eric Lehman's "Counting II" and "Counting III" URL

      In "Counting II", read Section 1.3, "Permutations." In "Counting III", read Section 1.3, "Combinations" and Section 2, "Binomial Theorem."

Navigation

Art History
Biology
Business Administration
Chemistry
Communication
Economics
English
History
Mathematics

Creative Commons License
© Saylor Academy 2010-2018 except as otherwise noted. Excluding course final exams, content authored by Saylor Academy is available under a Creative Commons Attribution 3.0 Unported license. Third-party materials are the copyright of their respective owners and shared under various licenses. See www.saylor.org/open/licensinginformation for detailed licensing information.

Saylor Academy and Saylor.org® are trade names of the Constitution Foundation, a 501(c)(3) organization through which our educational activities are conducted.

Terms of Use | Privacy Policy