Introduction to Sigma Notation

Similar documents
GRADIENT DESCENT. Admin 10/24/13. Assignment 5. David Kauchak CS 451 Fall 2013

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS

The Inverse z-transform

The isoperimetric problem on the hypercube

Factor. 8th Grade Math. 2D Geometry: Transformations. 3 Examples/ Counterexamples. Vocab Word. Slide 3 / 227. Slide 4 / 227.

GRADIENT DESCENT. An aside: text classification. Text: raw data. Admin 9/27/16. Assignment 3 graded. Assignment 5. David Kauchak CS 158 Fall 2016

Here are the coefficients of the terms listed above: 3,5,2,1,1 respectively.

Module 8-7: Pascal s Triangle and the Binomial Theorem

27 Refraction, Dispersion, Internal Reflection

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

Physics 11b Lecture #19

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

COMP 558 lecture 6 Sept. 27, 2010

Assignment 5; Due Friday, February 10

Math Section 2.2 Polynomial Functions

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

Examples and Applications of Binary Search

Civil Engineering Computation

1.2 Binomial Coefficients and Subsets

Def : A radical is an expression consisting of a radical sign (radical symbol), a radicand, and an index.

Numerical Methods Lecture 6 - Curve Fitting Techniques

How do we evaluate algorithms?

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:

Exceptions. Your computer takes exception. The Exception Class. Causes of Exceptions

Python Programming: An Introduction to Computer Science

CS 111: Program Design I Lecture # 7: First Loop, Web Crawler, Functions

The Adjacency Matrix and The nth Eigenvalue

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1

Parabolic Path to a Best Best-Fit Line:

Lecture 1: Introduction and Strassen s Algorithm

Python Programming: An Introduction to Computer Science

CSE 5311 Notes 16: Matrices

Counting Regions in the Plane and More 1

Abstract Syntax Trees. AST Data Structure. Visitor Interface. Accept methods. Visitor Methodology for AST Traversal CS412/CS413

. Written in factored form it is easy to see that the roots are 2, 2, i,

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV

CS473-Algorithms I. Lecture 2. Asymptotic Notation. CS 473 Lecture 2 1

CMPT 125 Assignment 2 Solutions

Our Learning Problem, Again

Spherical Mirrors. Types of spherical mirrors. Lecture convex mirror: the. geometrical center is on the. opposite side of the mirror as

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation

Arithmetic Sequences

EVALUATION OF TRIGONOMETRIC FUNCTIONS

Lecture 5. Counting Sort / Radix Sort

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

Project 2.5 Improved Euler Implementation

Chapter 18: Ray Optics Questions & Problems

c) Did doing the transformations in a different order matter? Explain why?

Pattern Recognition Systems Lab 1 Least Mean Squares

COMPOSITE TRANSFORMATIONS. DOES ORDER MATTER Use the composite transformation to plot A B C and A B C. 1a)

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Message Integrity and Hash Functions. TELE3119: Week4

Overview. Chapter 18 Vectors and Arrays. Reminder. vector. Bjarne Stroustrup

Geometry. Parallel Lines. Slide 1 / 206. Slide 2 / 206. Slide 3 / 206. Table of Contents

Computers and Scientific Thinking

Wavelet Transform. CSE 490 G Introduction to Data Compression Winter Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual)

Existential quantification. Universal quantification. Domain of Quantification. Existential quantification

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Math 216A Notes, Week 4

Which movie we can suggest to Anne?

ENGR Spring Exam 1

Protected points in ordered trees

Orientation. Orientation 10/28/15

Physics 30 Lesson 12 Diffraction Gratings

n Some thoughts on software development n The idea of a calculator n Using a grammar n Expression evaluation n Program organization n Analysis

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

Reading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9.

Ones Assignment Method for Solving Traveling Salesman Problem

Outline. M/M/m Queue. Analysis of M/M/m Queue. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 23

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

CMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago

CSE 417: Algorithms and Computational Complexity

Normals. In OpenGL the normal vector is part of the state Set by glnormal*()

A Resource for Free-standing Mathematics Qualifications

ECE4050 Data Structures and Algorithms. Lecture 6: Searching

Basic Design Principles

Lecture 18. Optimization in n dimensions

The golden search method: Question 1

Location Steps and Paths

Visualization of Gauss-Bonnet Theorem

Σ P(i) ( depth T (K i ) + 1),

CS 11 C track: lecture 1

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

CS Polygon Scan Conversion. Slide 1

CS 111 Green: Program Design I Lecture 27: Speed (cont.); parting thoughts

Introductions to Pochhammer

NTH, GEOMETRIC, AND TELESCOPING TEST

Lecture 2: Spectra of Graphs

Thompson s Group F (p + 1) is not Minimally Almost Convex

Intro to Scientific Computing: Solutions

the beginning of the program in order for it to work correctly. Similarly, a Confirm

Recursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:

Parallel Lines - Corresponding Angles Lines & Transversals. Parallel Lines - Alternate Interior Angles Parallel Lines & Proofs

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

Parametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015

Transcription:

Itroductio to Siga Notatio Steph de Silva //207 What is siga otatio? is the capital Greek letter for the soud s I this case, it s just shorthad for su Siga otatio is what we use whe we have a series of ubers that eed to be sued It s that siple This is a really coo sceario i data sciece ad statistics, that s why the otatio exists You ay ot wat to be derivig equatios yourself, but it s really helpful to kow what soeoe else is talkig about There s a few quirks ad rules of otatio that are cooly used that are helpful to kow Here they are! What are the bits? Siga otatio is t just about the It coes with accoutreets that describe where the series to su starts, where it eds It also describes whether you wat a plai-vailla add the ubers up, or if you re goig to add toppigs - ultiply the ubers by soethig, square the, take soethig away etc The basic forat of siga otatio is this: There are alot of parts to this oe, let s defie the oe by oe: is siply the operator It s ot a variable or aythig you chage, it s a sybol like + or - It s short had for a whole lot of + sigs actually! s the series that will be sued There are a whole buch of xs ad they have a order To keep that order straight, they have subscripts (the little uber ext to the) i is the subscript of x, it s a covetio that gives each eber of the series x a ae, i this case i =, 2, 3, Here, is the last eber of the series It could be 0, 20, 00 or eve ifiity The betwee 3 ad just stads for all the ubers betwee the that are issig The piece of siga otatio we have above ca be expressed as a siple su I highly recoed that whe you are tryig to uderstad soethig, you siply write out the su to begi with Here s what that would look like here: = x + x 2 + x 3 + x + + x The idicates there are ebers of this series we have t writte out explicitly - i this case we do t really kow what is so we ca t write out the whole series Let s take soe cocrete exaples to ake this ore clear

If = 5 let s write out xi i log for xi x x 2 x 3 x x 5 = + + + + 2 If = 2 let s write out yi i log for j= See what happeed here? We gave the variable a differet ae, y, the subscript y a differet ae, j, ad the ed poit of the series,, a ew ae too It all works i precisely the sae way: j= y i = y + y 2 Let s put soe ubers i to play We ow uderstad what all the bits are Let s see what happes with real ubers Let s say that x = 2,, 5, 6 All this is sayig is that s a series of ubers I this case x = 2, x 2 =, x xi = x + x 2 + x 3 + x x 3 = 5 ad = 6 If we wated to add the all together, we could say that where This could be writte out as: = = x + x 2 + x 3 + x = 2 + + 5 + 6 = 7 y =,, 0,, 0 y =, y 2 =, y 3 = 0, y =, y 5 = 0 yi = y + y 2 + y 3 + y + y 5 = 5 Let s try aother exaple Say that I this case If we wated to add the all together, we could say that where This could be writte out as: y i = y + y 2 + y 3 + y + y 5 Costats ca be treated specially i siga otatio Costats are just a uber that does ot chage, it is ot part of a series: it just lives o its ow Thik about this: xi ( + 2) = + + 0 + + 0 = 3 This is the sae thig as sayig

2 ( + 2) We have added to this suatio ties So we could siply rewrite this as = ( x + 2) + ( x 2 + 2) + ( x 3 + 2)+ +( x + 2) ( + 2) = 2 + I geeral, if a is a costat, the ( xi + a) = xi + a Let s cosider aother sceario where costats are iside a suatio of a series If we have (2 ), we could rewrite this as We just ultiplied each ter by 2 It would ea exactly the sae thig to pull this to the outside of the suatio like this (2 ) = 2 x + 2 x 2 + 2 x 3 + +2x (2 ) = 2 ( ) I geeral, if a is a costat, the (a ) = a ( ) We eed soe exaples! Say that y =,, 0,, 0 I this case, what is (3 )? I geeral, whe a ed poit is ot specified, we assue we are to add the whole series So i this case, = 5

Let s try aother (3 ) If x = 2,, 5, 6, let s fid ( ) This is a little differet, but the sae priciples apply Here we will take = Sice is a costat, it ca be brought to the frot of the suatio like this: = 3 ( ) = 3( + + 0 + + 0) = 3(3) = 9 ( ) = = (2 + + 5 + 6) = (7) = 25 Cogratulatios, you just calculated your first average with siga otatio! We ca use siga otatio o ore tha oe series at the sae tie What if you have two series that iteract with each other? Suatio otatio is used alot i this cotext You ay see soethig like: y i x y i =, 2,, This siply eas that we ultiply each atchig ter of ad for all The equatio the looks like this: Let s take a cocrete exaple If =, x = 2,, 5, 6 ad y =,, 0,, 0 the we could fid xi y i Note how here We could t use because the series oly has four ubers i it! y i = x y + x 2 y 2 + x 3 y 3 + + x y = = 5 x

Let s work this oe out: y i There are lots of uses for siga otatio Siga otatio is used all over statistics ad data sciece i differet fors You ll see ters squared, added, divided by ad so o If you keep these basic rules i id, you ll have a ore clear idea of what s goig o If you d like to see soe ore iforatio o siga otatio, try this site fro Colubia (http://wwwcolubiaedu/itc/sipa/ath/suatiohtl) (C) Steph de Silva = 2() + () + 0(5) + 6() = 2 + + 0 + 6 = 2