{"id":10362,"date":"2017-06-22t10:50:57","date_gmt":"2017-06-22t17:50:57","guid":{"rendered":"\/\/www.catharsisit.com\/hs\/?p=10362"},"modified":"2017-06-18t16:00:56","modified_gmt":"2017-06-18t23:00:56","slug":"ap-calculus-bc-review-sequences-convergence","status":"publish","type":"post","link":"\/\/www.catharsisit.com\/hs\/ap\/ap-calculus-bc-review-sequences-convergence\/","title":{"rendered":"ap calculus bc review: sequences and convergence"},"content":{"rendered":"
one important topic that shows up on the ap calculus bc exam (but not on the ab) is sequences<\/em>. this review article is dedicated to sequences and their convergence properties.<\/p>\n basically, a sequence is just a list of numbers. <\/p>\n however, it’s also much more than that.<\/p>\n we usually study infinite sequences<\/strong>, those that go on forever according to some rule or pattern. furthermore, we are often interested in determining whether a sequence converges<\/strong> (that is, approaches some fixed value) or not.<\/p>\n a sequence<\/strong> is a list of (infinitely many) numbers, called the terms<\/strong> of the sequence.<\/p>\n there are a number of different ways to write a sequence.<\/p>\n <\/p>\n when n<\/em> is unspecified, the expression a<\/em>n<\/sub><\/em> is called the general term<\/strong> of the sequence. <\/p>\n moreover, if we know that a<\/em>n<\/sub><\/em> = f<\/em>(n<\/em>) for some function f<\/em>, then we say that f<\/em>(n<\/em>) is the formula for the general term.<\/p>\n you have probably seen and worked with many different kinds of sequences already even if you didn’t call them sequences.<\/p>\n the fibonacci sequences is an example of a recursively-defined sequence<\/strong>, because we can write it by the following recursive rule. <\/p>\n <\/p>\n by the way, the fibonacci sequence is important for many reasons, showing up in nature in the most unexpected ways.<\/p>\nwhat are sequences?<\/h2>\n
definition and notation<\/h3>\n
common sequences<\/h3>\n
\n