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.3: Products
Back to 'Unit 4: Mathematical Induction and Introduction to Sequences'
  • 4.3: Products

      • 4.3.1: Product Notation

        •  University of California, San Diego: Edward Bender and S. Williamson's "Arithmetic, Logic and Numbers: Induction, Sequences, and Series" URL

          Read Section 1 on pages 1 - 11. ∏ is the symbol for product. If p1 , p2, ... , pk ... is a sequence, the series p1 , p1 p2 , p1 p2 p3 , p1 p2 , ... , pk is written ∏ p1 p2 ... pk. If you look over the exercises for section 1, you will see that this reading applies to ∏ examples as well as ∑ examples. This reading also applies to topics in Subunit 4.3.2.

      • 4.3.2: Computing Products

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

          Study Section 3.4 "Approximating 1 + x."

          Product computation is similar to the evaluation of the product of numbers in arithmetic. Product or multiplication is a binary operation that is commutative [i.e. a times b = a b = b a]; associative [i.e. (a b) c = a (b c)]; and has an identity (i.e. a times 1 = 1). In addition, there are some tricks that can be used.

          Some simple properties of products are:

          1. a ∏ pi = ∏ a pi, where the ∏ ranges over a set of positive integers i.

          2. ∏ pi ∏ qij = ∏ pi qj, where the product symbols varies over ranges for i and j.

        •  University of California, San Diego: Edward Bender and S. Williamson's "Arithmetic, Logic and Numbers: Induction, Sequences, and Series" URL

          Read Theorem 11 and example 17 on pages IS-27 through IS-30. In doing calculation involving series, we work with sums (since a series is the sum of the succeeding terms of a sequence). In working these calculations, we also encounter the product of terms, for example when determining whether a series is bounded.

    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