{"id":2015,"date":"2015-11-12T18:30:42","date_gmt":"2015-11-12T18:30:42","guid":{"rendered":"https:\/\/courses.candelalearning.com\/collegealgebra1xmaster\/?post_type=chapter&#038;p=2015"},"modified":"2015-11-12T18:30:42","modified_gmt":"2015-11-12T18:30:42","slug":"key-concepts-glossary-20","status":"publish","type":"chapter","link":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/chapter\/key-concepts-glossary-20\/","title":{"raw":"Key Concepts &amp; Glossary","rendered":"Key Concepts &amp; Glossary"},"content":{"raw":"<h2>Key Equations<\/h2>\n<table id=\"eip-id1165135396212\" summary=\"..\"><tbody><tr><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><\/tbody><\/table><h2>Key Concepts<\/h2>\n<ul><li>A sequence is a list of numbers, called terms, written in a specific order.<\/li>\n\t<li>Explicit formulas define each term of a sequence using the position of the term.<\/li>\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>\n\t<li>Recursive formulas define each term of a sequence using previous terms.<\/li>\n\t<li>Recursive formulas must state the initial term, or terms, of a sequence.<\/li>\n\t<li>A set of terms can be written by using a recursive formula.<\/li>\n\t<li>A factorial is a mathematical operation that can be defined recursively.<\/li>\n\t<li>The factorial of [latex]n[\/latex] is the product of all integers from 1 to [latex]n[\/latex]<\/li>\n<\/ul><h2>Glossary<\/h2>\n<dl id=\"fs-id1165135353078\" class=\"definition\"><dt>explicit formula<\/dt><dd id=\"fs-id1165135353083\">a formula that defines each term of a sequence in terms of its position in the sequence<\/dd><\/dl><dl id=\"fs-id1165135353088\" class=\"definition\"><dt>finite sequence<\/dt><dd id=\"fs-id1165135353093\">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]<\/dd><\/dl><dl id=\"fs-id1165135353098\" class=\"definition\"><dt>infinite sequence<\/dt><dd id=\"fs-id1165135353104\">a function whose domain is the set of positive integers<\/dd><\/dl><dl id=\"fs-id1165135251403\" class=\"definition\"><dt>n factorial<\/dt><dd id=\"fs-id1165135251408\">the product of all the positive integers from 1 to [latex]n[\/latex]<\/dd><\/dl><dl id=\"fs-id1165135251412\" class=\"definition\"><dt>nth term of a sequence<\/dt><dd id=\"fs-id1165135251418\">a formula for the general term of a sequence<\/dd><\/dl><dl id=\"fs-id1165135251422\" class=\"definition\"><dt>recursive formula<\/dt><dd id=\"fs-id1165135251427\">a formula that defines each term of a sequence using previous term(s)<\/dd><\/dl><dl id=\"fs-id1165135251432\" class=\"definition\"><dt>sequence<\/dt><dd id=\"fs-id1165135528354\">a function whose domain is a subset of the positive integers<\/dd><\/dl><dl id=\"fs-id1165135528358\" class=\"definition\"><dt>term<\/dt><dd id=\"fs-id1165135528363\">a number in a sequence<\/dd><\/dl>\u00a0","rendered":"<h2>Key Equations<\/h2>\n<table id=\"eip-id1165135396212\" 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<dl id=\"fs-id1165135353078\" class=\"definition\">\n<dt>explicit formula<\/dt>\n<dd id=\"fs-id1165135353083\">a formula that defines each term of a sequence in terms of its position in the sequence<\/dd>\n<\/dl>\n<dl id=\"fs-id1165135353088\" class=\"definition\">\n<dt>finite sequence<\/dt>\n<dd id=\"fs-id1165135353093\">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]<\/dd>\n<\/dl>\n<dl id=\"fs-id1165135353098\" class=\"definition\">\n<dt>infinite sequence<\/dt>\n<dd id=\"fs-id1165135353104\">a function whose domain is the set of positive integers<\/dd>\n<\/dl>\n<dl id=\"fs-id1165135251403\" class=\"definition\">\n<dt>n factorial<\/dt>\n<dd id=\"fs-id1165135251408\">the product of all the positive integers from 1 to [latex]n[\/latex]<\/dd>\n<\/dl>\n<dl id=\"fs-id1165135251412\" class=\"definition\">\n<dt>nth term of a sequence<\/dt>\n<dd id=\"fs-id1165135251418\">a formula for the general term of a sequence<\/dd>\n<\/dl>\n<dl id=\"fs-id1165135251422\" class=\"definition\">\n<dt>recursive formula<\/dt>\n<dd id=\"fs-id1165135251427\">a formula that defines each term of a sequence using previous term(s)<\/dd>\n<\/dl>\n<dl id=\"fs-id1165135251432\" class=\"definition\">\n<dt>sequence<\/dt>\n<dd id=\"fs-id1165135528354\">a function whose domain is a subset of the positive integers<\/dd>\n<\/dl>\n<dl id=\"fs-id1165135528358\" class=\"definition\">\n<dt>term<\/dt>\n<dd id=\"fs-id1165135528363\">a number in a sequence<\/dd>\n<\/dl>\n<p>\u00a0<\/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-2015\">\n\t\t\t\t\t\t\t <div class=\"licensing\"><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":276,"menu_order":6,"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\":\"\"}]","CANDELA_OUTCOMES_GUID":"","pb_show_title":"on","pb_short_title":"","pb_subtitle":"","pb_authors":[],"pb_section_license":""},"chapter-type":[],"contributor":[],"license":[],"class_list":["post-2015","chapter","type-chapter","status-publish","hentry"],"part":2000,"_links":{"self":[{"href":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/wp-json\/pressbooks\/v2\/chapters\/2015","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/wp-json\/pressbooks\/v2\/chapters"}],"about":[{"href":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/wp-json\/wp\/v2\/types\/chapter"}],"author":[{"embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/wp-json\/wp\/v2\/users\/276"}],"version-history":[{"count":1,"href":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/wp-json\/pressbooks\/v2\/chapters\/2015\/revisions"}],"predecessor-version":[{"id":2178,"href":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/wp-json\/pressbooks\/v2\/chapters\/2015\/revisions\/2178"}],"part":[{"href":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/wp-json\/pressbooks\/v2\/parts\/2000"}],"metadata":[{"href":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/wp-json\/pressbooks\/v2\/chapters\/2015\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/wp-json\/wp\/v2\/media?parent=2015"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/wp-json\/pressbooks\/v2\/chapter-type?post=2015"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/wp-json\/wp\/v2\/contributor?post=2015"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/wp-json\/wp\/v2\/license?post=2015"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}