pre-calculus(sequences and series)II

最新推荐文章于 2021-09-29 10:40:55 发布

jacksonshe

最新推荐文章于 2021-09-29 10:40:55 发布

阅读量296

点赞数

分类专栏：微积分预备

本文链接：https://blog.csdn.net/u013688181/article/details/85230475

版权

微积分预备专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Let's learn a little bit about sequences and series .A sequences is just a bunch of numbers in some order ,and what's the series ?

it's also represented - it's just a sum of sequences.So for example the arithmetic sequences .Before we move forward ,let's get a notation for how we can represent these sums without necessarily having to write out all of the digits and that notation is sigma notation $\small \sum$ although it's not a formal expression,so what is the formal expression?right over here : $\small \sum_{x=k}^n k = 1+2+3+...+N-2+N-1+N$ once we learn calculus ,I'll show you the power and Taylor series ,the Taylor series is a specific version of a power series .Later I'll show you how to derive the arithmetic series

$\small S=\sum_{x=n}^n k=1+2+3+4+...+N-2+N-1+N$

the sum of the arithmetic series is also equal to the reverse order sum of the arithmetic series So we also get this expression :

$\small S=\sum_{x=n}^n k=N+N-1+N-2+N-3+...+3+2+1$ we can learn the pattern right here 1+N is equal to 2+N-1 is also equal to 3+N-2,so these expression can be added up with each corresponding term of each series .we also get this expression :

$\small S=\frac{N(N+1)}{2} \quad \quad \quad S=\frac{n(a_0+a_n)}{2}$

parlor(living room)

there is the geometric series over here: $\small S=\sum_{k=0}^n a^k=a^0+a^1+...+a^{n-1}$

and so I wanna figure out the sum of a geometric series of base a ,we need some trick over there

$\small S=a^0+a^1+a^2+a^3+.....+a^n$ how about we multipy with a to this series:

$\small aS=a^1+a^2+a^3+a^4.....+a^n+a^{n+1}$ as you can see if we substract these series ,we'll get (1-a)s=a0-a(n+1) so what we can derive the sum of geometric series of base a is : $\small S=\frac{a_0-a_{n+1}}{1-q}=\frac{a_0(1-q^n)}{1-q}$ {converge（gather intersect with unique point）

1 2 3 there are three chairs but seven person want to sit ,so how many situation they will take in this circumstances.

when the number one chair would be occupied is 7 kind of case ,and go on number two chair would be occupied is 6 kind of this case ,because the number one chair have been taken by one of these persons and the number three chair would be occupied is 5 kind of this case .so we got 210 kind of results.the ways in which we're ording ,we call these permutations $\small 3^p7 \quad p^7_{3} \quad p(7,3)$ factorial (阶乘)

here is a question : $\small n^pk$ that 's represent in k spaces how many situation it have by n persons. it's always have formal formula : $\small \frac{n!}{(n-k)!}$ ! exclamation mark is represented as factorial (amazing mathematic concept) how about the situation with combinations some pattern we'll find : $\small n^Ck=\frac{n^Pk}{k!}$ that is the result of in which this situation how many groups of k can be selected from n people.

jacksonshe

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
pre-calculus(sequences and series)II

Let's learn a little bit about sequences and series .A sequences is just a bunch of numbers in some order ,and what's the series ?it's also represented - it's just a sum of sequences.So for example ...
复制链接

扫一扫

专栏目录