Sequence of Numbers. Mun Chou, Fong QED Education Scientific Malaysia

Size: px
Start display at page:

Download "Sequence of Numbers. Mun Chou, Fong QED Education Scientific Malaysia"

Transcription

1 Sequence of Numbers Mun Chou, Fong QED Education Scientific Malaysia LEVEL High school after students have learned sequence. OBJECTIVES To review sequences and generate sequences using scientific calculator. OVERVIEW We briefly review properties of sequence of numbers; following the review we explore about using scientific calculator to generate the sequence from different approaches. In this exploration the calculator in discussion is the fx-991es. EXPLORATORY ACTIVITIES [Note] (a) We shall use small letter x an y instead of capitals X and Y as shown on the calculator throughout the paper. (b) Unless otherwise specified, we choose MthIO mode in the SETUP menu by tapping Sequence in Review Sequence is a function by definition. We usually deal either with finite or infinite sequence. For example, the sequence of numbers 1,, 5, 7, 9 is a finite sequence; while the function f ( n) = n + 1, for n positive integer set, is an infinite sequence. Some other finite and infinite sequences: (i) Prime numbers:,, 5, 7, 11, 1, 17, is an infinite sequence. (ii) All positive odd number less then 0: 1,, 5, 7, 9, 11, 1, 15, 17, 19 is finite (iii) Fibonacci numbers: 1, 1,,, 5, 8, 1, 1, 4, is infinite. Usually, the terms within the sequence can be described by some pattern and as such the sequence can be represented with a general term, although some sequences do not 005 CASIO Computer Co., LTD. All Right Reserved. Page A

2 observe any general patterns, such as the sequence of prime numbers. In this exploration we denote the general term as T n. In the study of sequence we are usually required to do one or all of the following: generate the sequence, find the general term, find the n-th term and calculate the sum of the first n-th term. For illustration let s consider this example. Example 1: Given the sequence of all positive even numbers, (i) Write down the first 7 terms of the sequence. To generate the infinite sequence is fairly easy:, 4, 6, 8, 10, 1, 14, (ii) Find the general term of the sequence. The general term can be represented as such: T n = n, where n positive integer set. (iii) Find the 15 th term. Using the general term, we have T 15 = (15) = 0. (iv) Find the sum of the first 1 term. The sum of the first n-th term is denoted as S n in this exploration. We are required to find S 1 = = 156. As this example demonstrated, some calculations can be quite tedious. We now explore the use of calculators to speed up the calculations. We also explore the possibility of using the calculator to find the n-th term and the sum, with the general term T n given. Generate the Sequence with Table Using the calculator we can generate the sequence much more efficiently. One good way is by the use of Table. Example : The n-th term of a sequence is T n =. Write down the first 15 terms. Using the Table mode, we can generate these 15 terms efficiently. The Start value is 1 and End value is 15 while step size is always 1 for sequence. In the calculator we use x to replace the n given in the general term. Enter Table mode x( x + 1) Now input f ( x) = x( x + 1) Continue to input f ( x) = Enter the Start and End values Followed by the Step size A table of values will be tabulated from this function and the values on the F(X) column are the first 15 terms for the sequence represented by T n =. 005 CASIO Computer Co., LTD. All Right Reserved. Page A

3 We can also find the n-th term using the table if we input the setting such that n is Start value n End value of the table. Sequence with Solver A much better approach if we are to find the n-th term is through the use of the calculator solve features as this feature is more accessible than the Table mode. Example : Find the arithmetic mean of the 9 th, 49 th and the 7 rd with the general term T n = n 4n + 8. terms of the sequence T9 + T49 + T7 We are required to find and therefore the solution to this problem is not too hard but the calculation is tedious. With the combination of the CALC function and the independent memory, the problem can be calculated quite efficiently. Here again we replace n in the general term with x. Clear the independent memory Now input x 4x + 8 Continue to input x 4x + 8 Now calculate T 9 This gives T 9 = Now store this value into the independent memory M. Store T 9 into M Now scroll up to find T 49 Add T 49 to T 9 stored in M Scroll up to find T 7 Add T 7 to sum in M 9 + T49 + T Now find T Hence the arithmetic mean is. This example shows that proper use of technology such as a scientific calculator can help to approach a problem efficiently and effectively. 005 CASIO Computer Co., LTD. All Right Reserved. Page A

4 Recursive Sequence with Answer Memory Sequence where its n-th term is the function of previous terms is a recursive sequence. The first term of a recursive sequence is usually given. We look at how we may utilize the Answer Memory, or Ans, to help us solve problems on recursive sequence. Example 4: The first term of the recursive sequence Tn = Tn 1 + Tn 1 is given as. Find the first 5 terms of the sequence. From the calculation perspective the generation of the 5 terms is not difficult but tedious. We can improve the calculation using the Answer Memory as follow. We key in the expression Tn = Tn 1 + Tn 1 but with the (n-1)-th term replaced by Ans. Store into the Answer Memory Now enter Ans + Ans Now calculate T T 1 is given as in the problem, and our first press of actually calculates () + () = 10, and this is the second term T. We can find the next terms by simply tapping on the equal key. To calculate T To calculate T 4 To calculate T 5 The operation shows that the first 5 term of the recursive sequence as, 10, 10, 1790, Sum of the First n-th Terms Finding sum of the first n-th term, or S n, is important in the study of sequence. While calculating the sum for a recursive sequence and sequence which has no general pattern demands further study, finding the sum is usually quite academic though again the working involved is tedious. The Summation feature of the 991-ES provides us with avenue to improve this. Example 5: Find the sum of the first terms, or S, for the following sequences. (i) The sequence of numbers with general term T n = n -1, for n = 1,,, 4, (ii) The sequence described in Example whose general term is T n =. 005 CASIO Computer Co., LTD. All Right Reserved. Page A

5 The Summation feature () x = requires us to input the start and end values for the summation. The step size, or increment, within the Summation is fixed as 1. Hence in using the Summation feature to solve (i), the operation is as follow. Enter the Summation mode Move cursor to start value box Enter 1 when the box is selected Now move up to end value box Enter into the end value box Scroll to the function term box Using x to replace n in T n = n -1, enter the general term. Enter x -1 To evaluate The result is 59, and apparently the sequence is the sequence of positive odd number. This result means = 59. To solve (ii) the operation is as followed. Enter the Summation mode Move cursor to start value box Enter 1 when the box is selected Now move up to end value box Enter into the end value box Scroll to the function term box Enter Continue entering then evaluate The result is 4550 as shown on the calculator. The summations of sequence, or S n, are usually referred to as Series. 005 CASIO Computer Co., LTD. All Right Reserved. Page A

6 EXERCISES Use the few features discussed above to solve these exercises. You can choose to work on the same problems with different features or a combination of them. Exercise 1 Write down the 5 th till 19 th term of the sequence with general term T n = 5 n. Exercise Find the first 14 terms of the sequence with general term T n = calculate the sum of its first 14 terms. 7n n n +. Then Exercise Find the geometric mean of the 5 th, 7 th and the 10 th terms of the sequence with the general term 5n T n = n + 1 Hint: Geometric mean of numbers α, β and γ is αβγ. Exercise 4 The first term of the recursive sequence T = n T n 1 1 is given as 5. Find the sum of the first 7 terms of the sequence. Exercise 5 Find the sum of the first 100 terms for the sequences (i) T n = n 1 and (ii) T n = n. SOLUTIONS to Exercises Exercise 1-45, -67, -9, -1, -157, -195, -7, -8, -, -87, -445, 507, -57, -64, -717 Exercise 6, 50, 174, 40, 80, 1446, 10, 464, 4950, 6810, 9086, 1180, 15054, Sum =7550. Exercise Geometric mean is correct to 6 decimal places. Exercise 4 Approximately.6107 X Exercise 5 (i) 850 and (ii) CASIO Computer Co., LTD. All Right Reserved. Page A

4/1/2017. PS. Sequences and Series FROM 9.2 AND 9.3 IN THE BOOK AS WELL AS FROM OTHER SOURCES. TODAY IS NATIONAL MANATEE APPRECIATION DAY

4/1/2017. PS. Sequences and Series FROM 9.2 AND 9.3 IN THE BOOK AS WELL AS FROM OTHER SOURCES. TODAY IS NATIONAL MANATEE APPRECIATION DAY PS. Sequences and Series FROM 9.2 AND 9.3 IN THE BOOK AS WELL AS FROM OTHER SOURCES. TODAY IS NATIONAL MANATEE APPRECIATION DAY 1 Oh the things you should learn How to recognize and write arithmetic sequences

More information

10.2 Series and Convergence

10.2 Series and Convergence 10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and

More information

AFM Ch.12 - Practice Test

AFM Ch.12 - Practice Test AFM Ch.2 - Practice Test Multiple Choice Identify the choice that best completes the statement or answers the question.. Form a sequence that has two arithmetic means between 3 and 89. a. 3, 33, 43, 89

More information

GEOMETRIC SEQUENCES AND SERIES

GEOMETRIC SEQUENCES AND SERIES 4.4 Geometric Sequences and Series (4 7) 757 of a novel and every day thereafter increase their daily reading by two pages. If his students follow this suggestion, then how many pages will they read during

More information

Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.

Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set. Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection

More information

Math 115 Spring 2011 Written Homework 5 Solutions

Math 115 Spring 2011 Written Homework 5 Solutions . Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence

More information

Properties of sequences Since a sequence is a special kind of function it has analogous properties to functions:

Properties of sequences Since a sequence is a special kind of function it has analogous properties to functions: Sequences and Series A sequence is a special kind of function whose domain is N - the set of natural numbers. The range of a sequence is the collection of terms that make up the sequence. Just as the word

More information

ALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite

ALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,

More information

9.2 Summation Notation

9.2 Summation Notation 9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

More information

Arithmetic Progression

Arithmetic Progression Worksheet 3.6 Arithmetic and Geometric Progressions Section 1 Arithmetic Progression An arithmetic progression is a list of numbers where the difference between successive numbers is constant. The terms

More information

Grade 7/8 Math Circles Sequences and Series

Grade 7/8 Math Circles Sequences and Series Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Sequences and Series November 30, 2012 What are sequences? A sequence is an ordered

More information

IB Maths SL Sequence and Series Practice Problems Mr. W Name

IB Maths SL Sequence and Series Practice Problems Mr. W Name IB Maths SL Sequence and Series Practice Problems Mr. W Name Remember to show all necessary reasoning! Separate paper is probably best. 3b 3d is optional! 1. In an arithmetic sequence, u 1 = and u 3 =

More information

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES DARRYL MCCULLOUGH AND ELIZABETH WADE In [9], P. W. Wade and W. R. Wade (no relation to the second author gave a recursion formula that produces Pythagorean

More information

Overview. Essential Questions. Precalculus, Quarter 4, Unit 4.5 Build Arithmetic and Geometric Sequences and Series

Overview. Essential Questions. Precalculus, Quarter 4, Unit 4.5 Build Arithmetic and Geometric Sequences and Series Sequences and Series Overview Number of instruction days: 4 6 (1 day = 53 minutes) Content to Be Learned Write arithmetic and geometric sequences both recursively and with an explicit formula, use them

More information

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

More information

THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0

THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0 THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0 RICHARD J. MATHAR Abstract. We count solutions to the Ramanujan-Nagell equation 2 y +n = x 2 for fixed positive n. The computational

More information

Section 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4.

Section 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4. Difference Equations to Differential Equations Section. The Sum of a Sequence This section considers the problem of adding together the terms of a sequence. Of course, this is a problem only if more than

More information

Chapter Table & Graph

Chapter Table & Graph Chapter Table & Graph The Table & Graph menu makes it possible to generate numeric tables from functions stored in memory. You can also use multiple functions to generate tables. Since Table & Graph uses

More information

Mathematical Induction. Lecture 10-11

Mathematical Induction. Lecture 10-11 Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

More information

Note: In the authors opinion the Ativa AT 10 is not recommended as a college financial calculator at any level of study

Note: In the authors opinion the Ativa AT 10 is not recommended as a college financial calculator at any level of study Appendix 1: Ativa AT 10 Instructions Note: DNS = Does Not Calculate Note: Loan and Savings Calculations Automatically round to two decimals. -Clear -Store Data in Memory -Recall Stored Data in Memory [CE]

More information

Casio Financial Consultant A Supplementary Reader - Part 2

Casio Financial Consultant A Supplementary Reader - Part 2 Casio Financial Consultant A Supplementary Reader - Part 2 An Electronic Publication By Contents i CASIO Financial Consultant: A Supplementary Reader - Part 2 CONTENTS Page Introduction ii Compound Interest

More information

Mathematical Induction

Mathematical Induction Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

More information

SECTION 10-2 Mathematical Induction

SECTION 10-2 Mathematical Induction 73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

More information

I remember that when I

I remember that when I 8. Airthmetic and Geometric Sequences 45 8. ARITHMETIC AND GEOMETRIC SEQUENCES Whenever you tell me that mathematics is just a human invention like the game of chess I would like to believe you. But I

More information

#1-12: Write the first 4 terms of the sequence. (Assume n begins with 1.)

#1-12: Write the first 4 terms of the sequence. (Assume n begins with 1.) Section 9.1: Sequences #1-12: Write the first 4 terms of the sequence. (Assume n begins with 1.) 1) a n = 3n a 1 = 3*1 = 3 a 2 = 3*2 = 6 a 3 = 3*3 = 9 a 4 = 3*4 = 12 3) a n = 3n 5 Answer: 3,6,9,12 a 1

More information

For another way to generate recursive sequences, see Calculator Note 1D.

For another way to generate recursive sequences, see Calculator Note 1D. !"# If you want to do further calculation on a result you ve just found, and that result is the first number in the expression you now want to evaluate, you can simply continue the expression. For example,

More information

Some practice problems for midterm 2

Some practice problems for midterm 2 Some practice problems for midterm 2 Kiumars Kaveh November 15, 2011 Problem: What is the remainder of 6 2000 when divided by 11? Solution: This is a long-winded way of asking for the value of 6 2000 mod

More information

Getting started Texas Instruments TI-85 and TI-86 calculators

Getting started Texas Instruments TI-85 and TI-86 calculators Getting started Texas Instruments TI-85 and TI-86 calculators Overview: Your graphing calculator or computer is a powerful and flexible tool, which you would probably be able to use fairly well without

More information

Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions

Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Stanford Math Circle: Sunday, May 9, 00 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Recall that triangular numbers are numbers of the form T m = numbers that can be arranged in

More information

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

More information

The Pointless Machine and Escape of the Clones

The Pointless Machine and Escape of the Clones MATH 64091 Jenya Soprunova, KSU The Pointless Machine and Escape of the Clones The Pointless Machine that operates on ordered pairs of positive integers (a, b) has three modes: In Mode 1 the machine adds

More information

Display Format To change the exponential display format, press the [MODE] key 3 times.

Display Format To change the exponential display format, press the [MODE] key 3 times. Tools FX 300 MS Calculator Overhead OH 300 MS Handouts Other materials Applicable activities Activities for the Classroom FX-300 Scientific Calculator Quick Reference Guide (inside the calculator cover)

More information

We can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b

We can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should

More information

Handout #1: Mathematical Reasoning

Handout #1: Mathematical Reasoning Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

More information

Probability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Probability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom Probability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom 1 Learning Goals 1. Know the definitions of sample space, event and probability function. 2. Be able to

More information

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

More information

Collatz Sequence. Fibbonacci Sequence. n is even; Recurrence Relation: a n+1 = a n + a n 1.

Collatz Sequence. Fibbonacci Sequence. n is even; Recurrence Relation: a n+1 = a n + a n 1. Fibonacci Roulette In this game you will be constructing a recurrence relation, that is, a sequence of numbers where you find the next number by looking at the previous numbers in the sequence. Your job

More information

To discuss this topic fully, let us define some terms used in this and the following sets of supplemental notes.

To discuss this topic fully, let us define some terms used in this and the following sets of supplemental notes. INFINITE SERIES SERIES AND PARTIAL SUMS What if we wanted to sum up the terms of this sequence, how many terms would I have to use? 1, 2, 3,... 10,...? Well, we could start creating sums of a finite number

More information

Chapter. Numerical Calculations

Chapter. Numerical Calculations Chapter 3 Numerical Calculations 3-1 Before Performing a Calculation 3-2 Differential Calculations 3-3 Quadratic Differential Calculations 3-4 Integration Calculations 3-5 Maximum/Minimum Value Calculations

More information

Chapter 31 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M.

Chapter 31 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. 31 Geometric Series Motivation (I hope) Geometric series are a basic artifact of algebra that everyone should know. 1 I am teaching them here because they come up remarkably often with Markov chains. The

More information

Greatest Common Factor and Least Common Multiple

Greatest Common Factor and Least Common Multiple Greatest Common Factor and Least Common Multiple Intro In order to understand the concepts of Greatest Common Factor (GCF) and Least Common Multiple (LCM), we need to define two key terms: Multiple: Multiples

More information

Introduction. Appendix D Mathematical Induction D1

Introduction. Appendix D Mathematical Induction D1 Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

More information

COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012

COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012 Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about

More information

Regions in a circle. 7 points 57 regions

Regions in a circle. 7 points 57 regions Regions in a circle 1 point 1 region points regions 3 points 4 regions 4 points 8 regions 5 points 16 regions The question is, what is the next picture? How many regions will 6 points give? There's an

More information

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections

More information

Using Casio Graphics Calculators

Using Casio Graphics Calculators Using Casio Graphics Calculators (Some of this document is based on papers prepared by Donald Stover in January 2004.) This document summarizes calculation and programming operations with many contemporary

More information

1.2. Successive Differences

1.2. Successive Differences 1. An Application of Inductive Reasoning: Number Patterns In the previous section we introduced inductive reasoning, and we showed how it can be applied in predicting what comes next in a list of numbers

More information

Patterns in Pascal s Triangle

Patterns in Pascal s Triangle Pascal s Triangle Pascal s Triangle is an infinite triangular array of numbers beginning with a at the top. Pascal s Triangle can be constructed starting with just the on the top by following one easy

More information

Basic Use of the TI-84 Plus

Basic Use of the TI-84 Plus Basic Use of the TI-84 Plus Topics: Key Board Sections Key Functions Screen Contrast Numerical Calculations Order of Operations Built-In Templates MATH menu Scientific Notation The key VS the (-) Key Navigation

More information

ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS

ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS YANN BUGEAUD, FLORIAN LUCA, MAURICE MIGNOTTE, SAMIR SIKSEK Abstract If n is a positive integer, write F n for the nth Fibonacci number, and ω(n) for the number

More information

Math Workshop October 2010 Fractions and Repeating Decimals

Math Workshop October 2010 Fractions and Repeating Decimals Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,

More information

SECTION 10-5 Multiplication Principle, Permutations, and Combinations

SECTION 10-5 Multiplication Principle, Permutations, and Combinations 10-5 Multiplication Principle, Permutations, and Combinations 761 54. Can you guess what the next two rows in Pascal s triangle, shown at right, are? Compare the numbers in the triangle with the binomial

More information

ECE 842 Report Implementation of Elliptic Curve Cryptography

ECE 842 Report Implementation of Elliptic Curve Cryptography ECE 842 Report Implementation of Elliptic Curve Cryptography Wei-Yang Lin December 15, 2004 Abstract The aim of this report is to illustrate the issues in implementing a practical elliptic curve cryptographic

More information

Acquisition Lesson Planning Form Key Standards addressed in this Lesson: MM2A3d,e Time allotted for this Lesson: 4 Hours

Acquisition Lesson Planning Form Key Standards addressed in this Lesson: MM2A3d,e Time allotted for this Lesson: 4 Hours Acquisition Lesson Planning Form Key Standards addressed in this Lesson: MM2A3d,e Time allotted for this Lesson: 4 Hours Essential Question: LESSON 4 FINITE ARITHMETIC SERIES AND RELATIONSHIP TO QUADRATIC

More information

1 Sufficient statistics

1 Sufficient statistics 1 Sufficient statistics A statistic is a function T = rx 1, X 2,, X n of the random sample X 1, X 2,, X n. Examples are X n = 1 n s 2 = = X i, 1 n 1 the sample mean X i X n 2, the sample variance T 1 =

More information

Probability Distributions

Probability Distributions CHAPTER 6 Probability Distributions Calculator Note 6A: Computing Expected Value, Variance, and Standard Deviation from a Probability Distribution Table Using Lists to Compute Expected Value, Variance,

More information

Common Core Standards for Fantasy Sports Worksheets. Page 1

Common Core Standards for Fantasy Sports Worksheets. Page 1 Scoring Systems Concept(s) Integers adding and subtracting integers; multiplying integers Fractions adding and subtracting fractions; multiplying fractions with whole numbers Decimals adding and subtracting

More information

FX 115 MS Training guide. FX 115 MS Calculator. Applicable activities. Quick Reference Guide (inside the calculator cover)

FX 115 MS Training guide. FX 115 MS Calculator. Applicable activities. Quick Reference Guide (inside the calculator cover) Tools FX 115 MS Calculator Handouts Other materials Applicable activities Quick Reference Guide (inside the calculator cover) Key Points/ Overview Advanced scientific calculator Two line display VPAM to

More information

6.2 Permutations continued

6.2 Permutations continued 6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

More information

a cos x + b sin x = R cos(x α)

a cos x + b sin x = R cos(x α) a cos x + b sin x = R cos(x α) In this unit we explore how the sum of two trigonometric functions, e.g. cos x + 4 sin x, can be expressed as a single trigonometric function. Having the ability to do this

More information

fx-92b Collège 2D+ User s Guide http://edu.casio.com http://edu.casio.com/forum/ CASIO Worldwide Education Website CASIO EDUCATIONAL FORUM

fx-92b Collège 2D+ User s Guide http://edu.casio.com http://edu.casio.com/forum/ CASIO Worldwide Education Website CASIO EDUCATIONAL FORUM E fx-92b Collège 2D+ User s Guide CASIO Worldwide Education Website http://edu.casio.com CASIO EDUCATIONAL FORUM http://edu.casio.com/forum/ Contents Important Information... 2 Sample Operations... 2 Initializing

More information

Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities

Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities Algebra 1, Quarter 2, Unit 2.1 Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned

More information

Binary Number System. 16. Binary Numbers. Base 10 digits: 0 1 2 3 4 5 6 7 8 9. Base 2 digits: 0 1

Binary Number System. 16. Binary Numbers. Base 10 digits: 0 1 2 3 4 5 6 7 8 9. Base 2 digits: 0 1 Binary Number System 1 Base 10 digits: 0 1 2 3 4 5 6 7 8 9 Base 2 digits: 0 1 Recall that in base 10, the digits of a number are just coefficients of powers of the base (10): 417 = 4 * 10 2 + 1 * 10 1

More information

2) Based on the information in the table which choice BEST shows the answer to 1 906? 906 899 904 909

2) Based on the information in the table which choice BEST shows the answer to 1 906? 906 899 904 909 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ) Multiplying a number by results in what type of. even. 0. even.,0. odd..,0. even ) Based on the information in the table which choice BEST shows the answer to 0? 0 0 0 )

More information

1 Description of The Simpletron

1 Description of The Simpletron Simulating The Simpletron Computer 50 points 1 Description of The Simpletron In this assignment you will write a program to simulate a fictional computer that we will call the Simpletron. As its name implies

More information

Academic Support Center. Using the TI-83/84+ Graphing Calculator PART II

Academic Support Center. Using the TI-83/84+ Graphing Calculator PART II Academic Support Center Using the TI-83/84+ Graphing Calculator PART II Designed and Prepared by The Academic Support Center Revised June 2012 1 Using the Graphing Calculator (TI-83+ or TI-84+) Table of

More information

Math 181 Handout 16. Rich Schwartz. March 9, 2010

Math 181 Handout 16. Rich Schwartz. March 9, 2010 Math 8 Handout 6 Rich Schwartz March 9, 200 The purpose of this handout is to describe continued fractions and their connection to hyperbolic geometry. The Gauss Map Given any x (0, ) we define γ(x) =

More information

Chapter. Formulas for linear recursion between three terms, made up of an+2, an+1, an, and n

Chapter. Formulas for linear recursion between three terms, made up of an+2, an+1, an, and n Chapter 16 Recursion Table and Graph You can input two formulas for any of the three following types of recursion, which you can then use to generate a table and draw graphs. General term of sequence {an},

More information

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,

More information

Doug Ravenel. October 15, 2008

Doug Ravenel. October 15, 2008 Doug Ravenel University of Rochester October 15, 2008 s about Euclid s Some s about primes that every mathematician should know (Euclid, 300 BC) There are infinitely numbers. is very elementary, and we

More information

Core Maths C1. Revision Notes

Core Maths C1. Revision Notes Core Maths C Revision Notes November 0 Core Maths C Algebra... Indices... Rules of indices... Surds... 4 Simplifying surds... 4 Rationalising the denominator... 4 Quadratic functions... 4 Completing the

More information

What Is Recursion? Recursion. Binary search example postponed to end of lecture

What Is Recursion? Recursion. Binary search example postponed to end of lecture Recursion Binary search example postponed to end of lecture What Is Recursion? Recursive call A method call in which the method being called is the same as the one making the call Direct recursion Recursion

More information

Recursive Algorithms. Recursion. Motivating Example Factorial Recall the factorial function. { 1 if n = 1 n! = n (n 1)! if n > 1

Recursive Algorithms. Recursion. Motivating Example Factorial Recall the factorial function. { 1 if n = 1 n! = n (n 1)! if n > 1 Recursion Slides by Christopher M Bourke Instructor: Berthe Y Choueiry Fall 007 Computer Science & Engineering 35 Introduction to Discrete Mathematics Sections 71-7 of Rosen cse35@cseunledu Recursive Algorithms

More information

Finding Rates and the Geometric Mean

Finding Rates and the Geometric Mean Finding Rates and the Geometric Mean So far, most of the situations we ve covered have assumed a known interest rate. If you save a certain amount of money and it earns a fixed interest rate for a period

More information

Teaching & Learning Plans. Arithmetic Sequences. Leaving Certificate Syllabus

Teaching & Learning Plans. Arithmetic Sequences. Leaving Certificate Syllabus Teaching & Learning Plans Arithmetic Sequences Leaving Certificate Syllabus The Teaching & Learning Plans are structured as follows: Aims outline what the lesson, or series of lessons, hopes to achieve.

More information

8 Fractals: Cantor set, Sierpinski Triangle, Koch Snowflake, fractal dimension.

8 Fractals: Cantor set, Sierpinski Triangle, Koch Snowflake, fractal dimension. 8 Fractals: Cantor set, Sierpinski Triangle, Koch Snowflake, fractal dimension. 8.1 Definitions Definition If every point in a set S has arbitrarily small neighborhoods whose boundaries do not intersect

More information

4. How many integers between 2004 and 4002 are perfect squares?

4. How many integers between 2004 and 4002 are perfect squares? 5 is 0% of what number? What is the value of + 3 4 + 99 00? (alternating signs) 3 A frog is at the bottom of a well 0 feet deep It climbs up 3 feet every day, but slides back feet each night If it started

More information

α α λ α = = λ λ α ψ = = α α α λ λ ψ α = + β = > θ θ β > β β θ θ θ β θ β γ θ β = γ θ > β > γ θ β γ = θ β = θ β = θ β = β θ = β β θ = = = β β θ = + α α α α α = = λ λ λ λ λ λ λ = λ λ α α α α λ ψ + α =

More information

To convert an arbitrary power of 2 into its English equivalent, remember the rules of exponential arithmetic:

To convert an arbitrary power of 2 into its English equivalent, remember the rules of exponential arithmetic: Binary Numbers In computer science we deal almost exclusively with binary numbers. it will be very helpful to memorize some binary constants and their decimal and English equivalents. By English equivalents

More information

Sequences. A sequence is a list of numbers, or a pattern, which obeys a rule.

Sequences. A sequence is a list of numbers, or a pattern, which obeys a rule. Sequences A sequence is a list of numbers, or a pattern, which obeys a rule. Each number in a sequence is called a term. ie the fourth term of the sequence 2, 4, 6, 8, 10, 12... is 8, because it is the

More information

Irrational Numbers. A. Rational Numbers 1. Before we discuss irrational numbers, it would probably be a good idea to define rational numbers.

Irrational Numbers. A. Rational Numbers 1. Before we discuss irrational numbers, it would probably be a good idea to define rational numbers. Irrational Numbers A. Rational Numbers 1. Before we discuss irrational numbers, it would probably be a good idea to define rational numbers. Definition: Rational Number A rational number is a number that

More information

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS. Christopher Heil Georgia Institute of Technology WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

More information

Solving simultaneous equations using the inverse matrix

Solving simultaneous equations using the inverse matrix Solving simultaneous equations using the inverse matrix 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix

More information

Math Circle Beginners Group October 18, 2015

Math Circle Beginners Group October 18, 2015 Math Circle Beginners Group October 18, 2015 Warm-up problem 1. Let n be a (positive) integer. Prove that if n 2 is odd, then n is also odd. (Hint: Use a proof by contradiction.) Suppose that n 2 is odd

More information

8 Divisibility and prime numbers

8 Divisibility and prime numbers 8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

More information

Graphing Calculator Workshops

Graphing Calculator Workshops Graphing Calculator Workshops For the TI-83/84 Classic Operating System & For the TI-84 New Operating System (MathPrint) LEARNING CENTER Overview Workshop I Learn the general layout of the calculator Graphing

More information

The thing that started it 8.6 THE BINOMIAL THEOREM

The thing that started it 8.6 THE BINOMIAL THEOREM 476 Chapter 8 Discrete Mathematics: Functions on the Set of Natural Numbers (b) Based on your results for (a), guess the minimum number of moves required if you start with an arbitrary number of n disks.

More information

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +... 6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

More information

Trigonometric Functions and Triangles

Trigonometric Functions and Triangles Trigonometric Functions and Triangles Dr. Philippe B. Laval Kennesaw STate University August 27, 2010 Abstract This handout defines the trigonometric function of angles and discusses the relationship between

More information

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers. MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

Square Roots and the Pythagorean Theorem

Square Roots and the Pythagorean Theorem 4.8 Square Roots and the Pythagorean Theorem 4.8 OBJECTIVES 1. Find the square root of a perfect square 2. Use the Pythagorean theorem to find the length of a missing side of a right triangle 3. Approximate

More information

Calculator Notes for the TI-89, TI-92 Plus, and Voyage 200

Calculator Notes for the TI-89, TI-92 Plus, and Voyage 200 CHAPTER 1 Note 1A Reentry Calculator Notes for the TI-89, TI-92 Plus, and Voyage 200 If you want to do further calculation on a result you ve just found, and that result is the first number in the expression

More information

fx-300es PLUS User s Guide

fx-300es PLUS User s Guide E fx-300es PLUS User s Guide CASIO Worldwide Education Website http://edu.casio.com CASIO EDUCATIONAL FORUM http://edu.casio.com/forum/ Contents Important Information...2 Sample Operations...2 Initializing

More information

6.1. The Exponential Function. Introduction. Prerequisites. Learning Outcomes. Learning Style

6.1. The Exponential Function. Introduction. Prerequisites. Learning Outcomes. Learning Style The Exponential Function 6.1 Introduction In this block we revisit the use of exponents. We consider how the expression a x is defined when a is a positive number and x is irrational. Previously we have

More information

Playing with Numbers

Playing with Numbers PLAYING WITH NUMBERS 249 Playing with Numbers CHAPTER 16 16.1 Introduction You have studied various types of numbers such as natural numbers, whole numbers, integers and rational numbers. You have also

More information

3. Mathematical Induction

3. Mathematical Induction 3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

More information

Chapter 13: Fibonacci Numbers and the Golden Ratio

Chapter 13: Fibonacci Numbers and the Golden Ratio Chapter 13: Fibonacci Numbers and the Golden Ratio 13.1 Fibonacci Numbers THE FIBONACCI SEQUENCE 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, The sequence of numbers shown above is called the Fibonacci

More information

SEQUENCES ARITHMETIC SEQUENCES. Examples

SEQUENCES ARITHMETIC SEQUENCES. Examples SEQUENCES ARITHMETIC SEQUENCES An ordered list of numbers such as: 4, 9, 6, 25, 36 is a sequence. Each number in the sequence is a term. Usually variables with subscripts are used to label terms. For example,

More information