Addition of Sequences of Numbers: First Principles

Slides:



Advertisements
Similar presentations
Binomial Theorem 11.7.
Advertisements

Graduate Course Characteristics When is it a graduate class?
The Build-up of the Red Sequence at z
Feature Selection and Extraction ☺ Given a set of features S={v 1, v 2, …, v D }, find a subset of S’ with |S’|=d < D such that J(S’)≥J(T) for any subset.
COMP 170 L2 Page 1 L03: Binomial Coefficients l Purpose n Properties of binomial coefficients n Related issues: the Binomial Theorem and labeling.
15-1 Physics I Class 15 Conservation of Angular Momentum.
Binomial Congestion Control  Implement this algorithm into ns-2  Find the c++ source file in ~/ns/ns-2.1b7/tcp.cc  Increase:
Math 143 Section 8.5 Binomial Theorem. (a + b) 2 =a 2 + 2ab + b 2 (a + b) 3 =a 3 + 3a 2 b + 3ab 2 + b 3 (a + b) 4 =a 4 + 4a 3 b + 6a 2 b 2 + 4ab 3 + b.
Binomial Theorem. Go to slide 11 Introduction Notice.
1 Section 3.2 Sequences and Summations. 2 Sequence Function from a subset of Z (usually the set beginning with 1 or 0) to a set S a n denotes the image.
Using Areas to Approximate to Sums of Series In the previous examples it was shown that an area can be represented by the sum of a series. Conversely the.
What Makes a Good Problem?. Kobon Fujimura 3 lines 1 triangle.
Graph the linear function What is the domain and the range of f?
Sequences & Series ♥ By Jen, Cindy, Tommy & Samuel The cool people of group e ☻
Lesson 1-9 Algebra: Arithmetic Sequences
Use the table to write an equation. 1.
15-1 Physics I Class 15 Conservation of Angular Momentum.
Chapter 7: Polynomials This chapter starts on page 320, with a list of key words and concepts.
Hay and Feedstuffs Outlook Dr. Curt Lacy Extension Economist-Livestock.
Chapter 8 The Selection Process McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc., All Rights Reserved.
Ch. 7: Advanced Counting Techniques
CÂRSTOIU ANDA IOANA, VOICU ALEXANDRA, class XII B.
Factorials!. What is a Factorial? A factorial is the result of multiplying a sequence of descending whole, positive numbers. For example, 4 x 3 x 2 x.
Ch.5 Limits & Derivatives Theorems on limits of functions a. b. c. d. e. f.
Find each sum:. 4, 12, 36, 108,... A sequence is geometric if each term is obtained by multiplying the previous term by the same number called the common.
Chapter 2 Mathematical preliminaries 2.1 Set, Relation and Functions 2.2 Proof Methods 2.3 Logarithms 2.4 Floor and Ceiling Functions 2.5 Factorial and.
INTRODUCTION TO DYNAMICS ANALYSIS OF ROBOTS (Part 3)
Quick start guide.  Create a workflow that the users can invoke for a particular customer (contact) which sets the priority of all the customer’s cases.
10.2 Arithmetic Sequences Date: ____________. Arithmetic Sequence Sequence in which each term after the first is obtained by adding a fixed number, called.
Binomial Expansions Image Source:
If various terms of a sequence are formed by adding a fixed number to the previous term or the difference between two successive terms is a fixed number,
2.2-Multiply Polynomials a3 + a3 = 2a3 b4(b3) = b4+3 = b7
Adding and subtracting polynomials. Types of polynomials Monomial Binomial Trinomial Polynomial 1 2x 7xy⁵ -12a + b w - m² a² + x⁴ - n³ x + d – 3y + m⁸.
Section 4.2 Building Linear Models from Data. OBJECTIVE 1.
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
9.2 Arithmetic Sequences & Series. Arithmetic Sequence: The difference between consecutive terms is constant (or the same). The constant difference is.
Social Roles and Relationships.
INTRODUCTION TO DYNAMICS ANALYSIS OF ROBOTS (Part 4)
Objective: Learn to describe the relationships and extend the terms in arithmetic sequence.
Multiplying Binomials. -Distributive Property 2x(x + 3) = 2x(x) + 2x(3) = 2x 2 + 6x Prior Knowledge.
Sequences.
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
1.(-7) (-2) 2.(3)(-6) 3.(4)(5) 4.(-3) (4t) 5.(2)(-2x) 6.(7y)(3) 7.3(s+5) 8.4(-n+2) 9.4-(t+2) 10.3n+(2-n) Algebra S9 Day 21.
Chapter 7: Polynomials This chapter starts on page 320, with a list of key words and concepts.
Moderator. To improve the utilization.
The Binomial Theorem Section 9.2a!!!. Powers of Binomials Let’s expand (a + b) for n = 0, 1, 2, 3, 4, and 5: n Do you see a pattern with the binomial.
Презентацию подготовила Хайруллина Ч.А. Муслюмовская гимназия Подготовка к части С ЕГЭ.
Peptide de novo sequencing Peptide de novo sequencing is the analytical process that derives a peptide’s amino acid sequence from its tandem mass spectrum.
5.3C- Special Patterns for Multiplying Binomials SUM AND DIFFERENCE (a+b)(a-b) = a² - b² (x +2)(x – 2) = x² -4 “O & I” cancel out of FOIL SQUARE OF A BINOMIAL.
BIS 219 Week 2 DQ 1 What is the relationship amongst data, information, and knowledge? What are the advantages of a knowledge management system? How may.
The Recursive Property of the Binomial Distribution
Physics I Class 16 Conservation of Angular Momentum.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Division with negative numbers:
Teaching to mastery There’s a lot of research supporting the idea that students learn better when they immediately use knowledge to solve problems. It.
Solving quadratic equations
Introduction to Fluid Mechanics
Conjugates Surds By Mr Porter.
Learner Control Control options Content sequencing Pacing
Guiding Principles Integration of language, literature, culture at ALL levels Committed to intellectually and theoretically grounded view of language.
Physics 111 Practice Problem Solutions 11 Angular Momentum SJ 8th Ed
LO: To recognise and extend number sequences
Суури мэдлэг Basic Knowledge
Arithmetic Sequence Objective:
Binomial Theorem; Pascal’s Triangle
30 m 2000 m 30 m 2000 m. 30 m 2000 m 30 m 2000 m.
Factor Polynomials Completely
Angular Momentum 角动量.
For more videos visit mrbartonmaths.com/videos
Presentation transcript:

Addition of Sequences of Numbers: First Principles = 1 + 2 + 3 + 4 +…+ (N-1) + N = ? = 12 + 22 + 32 +42 +…+ N2 = ?  n2 n = 1 N = 13 + 23 + 33 +43 +…+ N3 = ?  n3 n = 1 N Derivation based on: R. N. Zare, Angular Momentum, Chap. 1, (1988)

Addition of Sequences of Numbers: First Principles (n+1) – n = n = 1 N 2-1 + 3-2 + 4-3 + … + N +(N-1) + N+1-N

Addition of Sequences of Numbers: First Principles (n+1) – n = n = 1 N 2-1 + 3-2 + 4-3 + … + N +(N-1) + N+1-N

Addition of Sequences of Numbers: First Principles (n+1) – n = n = 1 N 2-1 + 3-2 + 4-3 + … + N +(N-1) + N+1-N

Addition of Sequences of Numbers: First Principles This will disappear with the next term (n+1) – n = n = 1 N 2-1 + 3-2 + 4-3 + … + N +(N-1) + N+1-N

Addition of Sequences of Numbers: First Principles This will disappear with the next term (n+1) – n = n = 1 N 2-1 + 3-2 + 4-3 + … + N +(N-1) + N+1-N This disappears with the previous term

Addition of Sequences of Numbers: First Principles (n+1) – n = n = 1 N 2-1 + 3-2 + 4-3 + … + N +(N-1) + N+1-N This will disappear with the next term This disappears with the previous term

Addition of Sequences of Numbers: First Principles (n+1) – n = n = 1 N 2-1 + 3-2 + 4-3 + … + N +(N-1) + N+1-N The surviving terms

Addition of Sequences of Numbers: First Principles (n+1) – n = n = 1 N N+1-1 = N (n+1) – n = n = 1 N n = 1 N  1 = 1+1+1+1+…+1+1 N1, or

Addition of Sequences of Numbers: First Principles (n+1) – n = n = 1 N N+1-1 = N (n+1) – n = n = 1 N n = 1 N  1 = 1+1+1+1+…+1+1 N1, or N

Addition of Sequences of Numbers: First Principles (n+1)2 – n2 =  N n=1 (N+1)2 - 12 The last: n = N+1 & The first n = 1 The surviving terms: All other terms cancel out

Addition of Sequences of Numbers: First Principles (n+1)2 – n2 =  N n=1 (N+1)2 - 12 = N2 + 2N + 1 – 1 = N2 + 2N + 1 – 1 = N2 + 2N = N(N+2)

Addition of Sequences of Numbers: First Principles (n+1)2 – n2 =  N n=1 N(N+2) n2 + 2n + 1 – n2 n2 + 2n + 1 – n2 (2n + 1) =  N n=1 N(N+2)

Addition of Sequences of Numbers: First Principles  N n=1 N(N+2) 2n +  N n=1  N n=1 1 N

Addition of Sequences of Numbers: First Principles  N n=1 N(N+2)  N n=1 2n + N = N2 + 2N

Addition of Sequences of Numbers: First Principles  N n=1 N(N+2)  N n=1 2n = N2 + N = N(N+1) n  N n=1 = N(N+1) 2

Addition of Sequences of Numbers: First Principles  n2 , To determine first determine  (n+1)3 – n3

Addition of Sequences of Numbers: First Principles (n+1)3 – n3 =  N n=1 (N+1)3 - 13 The last: n = N+1 & The first n = 1 The surviving terms: All other terms cancel out

Addition of Sequences of Numbers: First Principles (n+1)3 – n3 =  N n=1 (N+1)3 - 13 = N3 + 3N2 + 3N + 1 – 1 = N3 + 3N2 + 3N

Addition of Sequences of Numbers: First Principles (n+1)3 – n3 =  N n=1 N3 + 3N2 + 3N n3 + 3n2 + 3n + 1 – n3 n3 + 3n2 + 3n + 1 – n3 (3n2 + 3n + 1) =  N n=1 N3 + 3N2 + 3N

Addition of Sequences of Numbers: First Principles (3n2 + 3n + 1) =  N n=1 N3 + 3N2 + 3N 3N(N+1) 2 N 3N(N+1)

Addition of Sequences of Numbers: First Principles  N n=1 3N(N+1) 2 + N = N3 + 3N(N+1)

Addition of Sequences of Numbers: First Principles  N n=1 N = N3 + 3N(N+1) 2 = N3 + 3N2 + 3N 2

Addition of Sequences of Numbers: First Principles  N n=1 N = N3 + 3N2 + 3N 2

Addition of Sequences of Numbers: First Principles  N n=1 = N3 + 3N2 + N 2 n2  N n=1 = N3 + N2 + N 2 6 3

Addition of Sequences of Numbers: First Principles  N n=1 = N3 + N2 + N 2 6 3 = N(N+1)(2N+1) 6

Addition of Sequences of Numbers: First Principles  n3 , To determine determine  (n+1)4 – n4 Utilize the relation obtained for  n2,  n and  1

Addition of Sequences of Numbers: First Principles (n+1)4 – n4 =  N n=1 (N+1)4 - 14 The last: n = N+1 & The first n = 1 The surviving terms: All other terms cancel out

Addition of Sequences of Numbers: First Principles (n+1)4 – n4 =  N n=1 (N+1)4 - 14 = N4 + 4N3 + 6N2 + 4N + 1 – 1 = N4 + 4N3 + 6N2 + 4N

Addition of Sequences of Numbers: First Principles (n+1)4 – n4 =  N n=1 N4 + 4N3 + 6N2 + 4N n4 + 4n3 + 6n2 + 4n + 1- n4, or n4 + 4n3 + 6n2 + 4n + 1- n4

Addition of Sequences of Numbers: First Principles (n+1)4 – n4 =  N n=1 N4 + 4N3 + 6N2 + 4N 4n3 + 6n2 + 4n + 1

Addition of Sequences of Numbers: First Principles (n+1)4 – n4  N n=1 = N4 + 4N3 + 6N2 + 4N 4n3 + 6n2 + 4n + 1

Addition of Sequences of Numbers: First Principles  4n3 + 6n2 + 4n + 1 = N4 + 4N3 + 6N2 + 4N

Addition of Sequences of Numbers: First Principles  4n3 + 6n2 + 4n + 1 = N4 + 4N3 + 6N2 + 4N 6N3 6N2 6N 3 2 6 + + 4N(N+1) 2 N

Addition of Sequences of Numbers: First Principles  4n3 + 6n2 + 4n + 1 = N4 + 4N3 + 6N2 + 4N 6N3 6N2 6N 3 2 6 + + 4N2 + 4N 2 N

Addition of Sequences of Numbers: First Principles  4n3 + 6n2 + 4n + 1 = N4 + 4N3 + 6N2 + 4N 6N3 6N2 6N 3 2 6 + + 4N2 + 4N 2 N

Addition of Sequences of Numbers: First Principles  4n3 + 6n2 + 4n + 1 = N4 + 4N3 + 6N2 + 4N 6N3 5N2 6N 3 6 + + 4N 2 N

Addition of Sequences of Numbers: First Principles  4n3 + 6n2 + 4n + 1 = N4 + 4N3 + 6N2 + 4N 6N3 5N2 4N 3 + +

Addition of Sequences of Numbers: First Principles  4n3 + 6n2 + 4n + 1 = N4 + 4N3 + 6N2 + 4N 2N3 + 5N2 + 4N

Addition of Sequences of Numbers: First Principles  4n3 + 2N3 + 5N2 + 4N = N4 + 4N3 + 6N2 + 4N

Addition of Sequences of Numbers: First Principles  4n3 + 2N3 + 5N2 + 4N = N4 + 4N3 + 6N2 + 4N

Addition of Sequences of Numbers: First Principles  4n3 + 2N3 + 5N2 = N4 + 4N3 + 6N2

Addition of Sequences of Numbers: First Principles  4n3 + 2N3 + 5N2 = N4 + 4N3 + 6N2

Addition of Sequences of Numbers: First Principles  4n3 + 2N3 + 5N2 = N4 + 4N3 + 6N2

Addition of Sequences of Numbers: First Principles  4n3 + 2N3 + 5N2 = N4 + 2N3 + 6N2

Addition of Sequences of Numbers: First Principles  4n3 = N4 + 2N3 + N2

Addition of Sequences of Numbers: First Principles  4n3 = N4 + 2N3 + N2 4 [N(N+1)]2 4 =

Addition of Sequences of Numbers: First Principles Advantage Derivation: Does not require any prior knowledge on the compact form. nk relies on the knowledge of binomial expansion, and the compact relationship derived for nk-1.