{"id":2434,"date":"2016-11-03T22:16:10","date_gmt":"2016-11-03T22:16:10","guid":{"rendered":"https:\/\/courses.lumenlearning.com\/waymakercollegealgebra\/?post_type=chapter&#038;p=2434"},"modified":"2017-04-04T20:00:01","modified_gmt":"2017-04-04T20:00:01","slug":"summary-sequences-and-their-notations","status":"publish","type":"chapter","link":"https:\/\/courses.lumenlearning.com\/ivytech-wmopen-collegealgebra\/chapter\/summary-sequences-and-their-notations\/","title":{"raw":"Summary: Sequences and Their Notations","rendered":"Summary: Sequences and Their Notations"},"content":{"raw":"<h2>Key Equations<\/h2>\r\n<table summary=\"..\">\r\n<tbody>\r\n<tr>\r\n<td>Formula for a factorial<\/td>\r\n<td>[latex]\\begin{array}{l}0!=1\\\\ 1!=1\\\\ n!=n\\left(n - 1\\right)\\left(n - 2\\right)\\cdots \\left(2\\right)\\left(1\\right)\\text{, for }n\\ge 2\\end{array}[\/latex]<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<h2>Key Concepts<\/h2>\r\n<ul>\r\n \t<li>A sequence is a list of numbers, called terms, written in a specific order.<\/li>\r\n \t<li>Explicit formulas define each term of a sequence using the position of the term.<\/li>\r\n \t<li>An explicit formula for the [latex]n\\text{th}[\/latex] term of a sequence can be written by analyzing the pattern of several terms.<\/li>\r\n \t<li>Recursive formulas define each term of a sequence using previous terms.<\/li>\r\n \t<li>Recursive formulas must state the initial term, or terms, of a sequence.<\/li>\r\n \t<li>A set of terms can be written by using a recursive formula.<\/li>\r\n \t<li>A factorial is a mathematical operation that can be defined recursively.<\/li>\r\n \t<li>The factorial of [latex]n[\/latex] is the product of all integers from 1 to [latex]n[\/latex]<\/li>\r\n<\/ul>\r\n<h2>Glossary<\/h2>\r\n<strong>explicit formula<\/strong> a formula that defines each term of a sequence in terms of its position in the sequence\r\n\r\n<strong>finite sequence<\/strong> a function whose domain consists of a finite subset of the positive integers [latex]\\left\\{1,2,\\dots n\\right\\}[\/latex] for some positive integer [latex]n[\/latex]\r\n\r\n<strong>infinite sequence<\/strong> a function whose domain is the set of positive integers\r\n\r\n<strong>n factorial<\/strong> the product of all the positive integers from 1 to [latex]n[\/latex]\r\n\r\n<strong>nth term of a sequence<\/strong> a formula for the general term of a sequence\r\n\r\n<strong>recursive formula<\/strong> a formula that defines each term of a sequence using previous term(s)\r\n\r\n<strong>sequence<\/strong> a function whose domain is a subset of the positive integers\r\n\r\n<strong>term<\/strong> a number in a sequence","rendered":"<h2>Key Equations<\/h2>\n<table summary=\"..\">\n<tbody>\n<tr>\n<td>Formula for a factorial<\/td>\n<td>[latex]\\begin{array}{l}0!=1\\\\ 1!=1\\\\ n!=n\\left(n - 1\\right)\\left(n - 2\\right)\\cdots \\left(2\\right)\\left(1\\right)\\text{, for }n\\ge 2\\end{array}[\/latex]<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2>Key Concepts<\/h2>\n<ul>\n<li>A sequence is a list of numbers, called terms, written in a specific order.<\/li>\n<li>Explicit formulas define each term of a sequence using the position of the term.<\/li>\n<li>An explicit formula for the [latex]n\\text{th}[\/latex] term of a sequence can be written by analyzing the pattern of several terms.<\/li>\n<li>Recursive formulas define each term of a sequence using previous terms.<\/li>\n<li>Recursive formulas must state the initial term, or terms, of a sequence.<\/li>\n<li>A set of terms can be written by using a recursive formula.<\/li>\n<li>A factorial is a mathematical operation that can be defined recursively.<\/li>\n<li>The factorial of [latex]n[\/latex] is the product of all integers from 1 to [latex]n[\/latex]<\/li>\n<\/ul>\n<h2>Glossary<\/h2>\n<p><strong>explicit formula<\/strong> a formula that defines each term of a sequence in terms of its position in the sequence<\/p>\n<p><strong>finite sequence<\/strong> a function whose domain consists of a finite subset of the positive integers [latex]\\left\\{1,2,\\dots n\\right\\}[\/latex] for some positive integer [latex]n[\/latex]<\/p>\n<p><strong>infinite sequence<\/strong> a function whose domain is the set of positive integers<\/p>\n<p><strong>n factorial<\/strong> the product of all the positive integers from 1 to [latex]n[\/latex]<\/p>\n<p><strong>nth term of a sequence<\/strong> a formula for the general term of a sequence<\/p>\n<p><strong>recursive formula<\/strong> a formula that defines each term of a sequence using previous term(s)<\/p>\n<p><strong>sequence<\/strong> a function whose domain is a subset of the positive integers<\/p>\n<p><strong>term<\/strong> a number in a sequence<\/p>\n\n\t\t\t <section class=\"citations-section\" role=\"contentinfo\">\n\t\t\t <h3>Candela Citations<\/h3>\n\t\t\t\t\t <div>\n\t\t\t\t\t\t <div id=\"citation-list-2434\">\n\t\t\t\t\t\t\t <div class=\"licensing\"><div class=\"license-attribution-dropdown-subheading\">CC licensed content, Original<\/div><ul class=\"citation-list\"><li>Revision and Adaptation. <strong>Provided by<\/strong>: Lumen Learning. <strong>License<\/strong>: <em><a target=\"_blank\" rel=\"license\" href=\"https:\/\/creativecommons.org\/licenses\/by\/4.0\/\">CC BY: Attribution<\/a><\/em><\/li><\/ul><div class=\"license-attribution-dropdown-subheading\">CC licensed content, Shared previously<\/div><ul class=\"citation-list\"><li>College Algebra. <strong>Authored by<\/strong>: Abramson, Jay et al.. <strong>Provided by<\/strong>: OpenStax. <strong>Located at<\/strong>: <a target=\"_blank\" href=\"http:\/\/cnx.org\/contents\/9b08c294-057f-4201-9f48-5d6ad992740d@5.2\">http:\/\/cnx.org\/contents\/9b08c294-057f-4201-9f48-5d6ad992740d@5.2<\/a>. <strong>License<\/strong>: <em><a target=\"_blank\" rel=\"license\" href=\"https:\/\/creativecommons.org\/licenses\/by\/4.0\/\">CC BY: Attribution<\/a><\/em>. <strong>License Terms<\/strong>: Download for free at http:\/\/cnx.org\/contents\/9b08c294-057f-4201-9f48-5d6ad992740d@5.2<\/li><\/ul><div class=\"license-attribution-dropdown-subheading\">CC licensed content, Specific attribution<\/div><ul class=\"citation-list\"><li>Precalculus. <strong>Authored by<\/strong>: OpenStax College. <strong>Provided by<\/strong>: OpenStax. <strong>Located at<\/strong>: <a target=\"_blank\" href=\"http:\/\/cnx.org\/contents\/fd53eae1-fa23-47c7-bb1b-972349835c3c@5.175:1\/Preface\">http:\/\/cnx.org\/contents\/fd53eae1-fa23-47c7-bb1b-972349835c3c@5.175:1\/Preface<\/a>. <strong>License<\/strong>: <em><a target=\"_blank\" rel=\"license\" href=\"https:\/\/creativecommons.org\/licenses\/by\/4.0\/\">CC BY: Attribution<\/a><\/em><\/li><\/ul><\/div>\n\t\t\t\t\t\t <\/div>\n\t\t\t\t\t <\/div>\n\t\t\t <\/section>","protected":false},"author":21,"menu_order":5,"template":"","meta":{"_candela_citation":"[{\"type\":\"cc-attribution\",\"description\":\"Precalculus\",\"author\":\"OpenStax College\",\"organization\":\"OpenStax\",\"url\":\"http:\/\/cnx.org\/contents\/fd53eae1-fa23-47c7-bb1b-972349835c3c@5.175:1\/Preface\",\"project\":\"\",\"license\":\"cc-by\",\"license_terms\":\"\"},{\"type\":\"original\",\"description\":\"Revision and Adaptation\",\"author\":\"\",\"organization\":\"Lumen Learning\",\"url\":\"\",\"project\":\"\",\"license\":\"cc-by\",\"license_terms\":\"\"},{\"type\":\"cc\",\"description\":\"College Algebra\",\"author\":\"Abramson, Jay et al.\",\"organization\":\"OpenStax\",\"url\":\"http:\/\/cnx.org\/contents\/9b08c294-057f-4201-9f48-5d6ad992740d@5.2\",\"project\":\"\",\"license\":\"cc-by\",\"license_terms\":\"Download for free at http:\/\/cnx.org\/contents\/9b08c294-057f-4201-9f48-5d6ad992740d@5.2\"}]","CANDELA_OUTCOMES_GUID":"8e4d4f2f-04bc-4c96-8b3a-5a0af2bf3401","pb_show_title":"on","pb_short_title":"","pb_subtitle":"","pb_authors":[],"pb_section_license":""},"chapter-type":[],"contributor":[],"license":[],"class_list":["post-2434","chapter","type-chapter","status-publish","hentry"],"part":2419,"_links":{"self":[{"href":"https:\/\/courses.lumenlearning.com\/ivytech-wmopen-collegealgebra\/wp-json\/pressbooks\/v2\/chapters\/2434","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/courses.lumenlearning.com\/ivytech-wmopen-collegealgebra\/wp-json\/pressbooks\/v2\/chapters"}],"about":[{"href":"https:\/\/courses.lumenlearning.com\/ivytech-wmopen-collegealgebra\/wp-json\/wp\/v2\/types\/chapter"}],"author":[{"embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/ivytech-wmopen-collegealgebra\/wp-json\/wp\/v2\/users\/21"}],"version-history":[{"count":3,"href":"https:\/\/courses.lumenlearning.com\/ivytech-wmopen-collegealgebra\/wp-json\/pressbooks\/v2\/chapters\/2434\/revisions"}],"predecessor-version":[{"id":3293,"href":"https:\/\/courses.lumenlearning.com\/ivytech-wmopen-collegealgebra\/wp-json\/pressbooks\/v2\/chapters\/2434\/revisions\/3293"}],"part":[{"href":"https:\/\/courses.lumenlearning.com\/ivytech-wmopen-collegealgebra\/wp-json\/pressbooks\/v2\/parts\/2419"}],"metadata":[{"href":"https:\/\/courses.lumenlearning.com\/ivytech-wmopen-collegealgebra\/wp-json\/pressbooks\/v2\/chapters\/2434\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/courses.lumenlearning.com\/ivytech-wmopen-collegealgebra\/wp-json\/wp\/v2\/media?parent=2434"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/ivytech-wmopen-collegealgebra\/wp-json\/pressbooks\/v2\/chapter-type?post=2434"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/ivytech-wmopen-collegealgebra\/wp-json\/wp\/v2\/contributor?post=2434"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/ivytech-wmopen-collegealgebra\/wp-json\/wp\/v2\/license?post=2434"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}