# 406 HOW TO FIND THE "GOLDEN NUMBER" WITHOUT REALLY TRYING [Dec. p'^cl) = = 136, REFERENCES

Save this PDF as:

Size: px
Start display at page:

Download "406 HOW TO FIND THE "GOLDEN NUMBER" WITHOUT REALLY TRYING [Dec. p'^cl) = 24-360 + 472 = 136, REFERENCES"

## Transcription

1 406 HOW TO FIND THE "GOLDEN NUMBER" WITHOUT REALLY TRYING [Dec. (5.6) p ( " _1) (i) - ( w ~ 1 )! e,,. For example, in agreement with (5.6). (Please turn to page 465.) p'^cl) = = 136, REFERENCES 1. D. Andre. "Etude sur les maxima, minima et sequences des permutations." Annates soientifiques de l f Eoole Normale Superieure (3) 1 (1894): L. Carlitz. "Enumeration of Permutations by Sequences." The Fibonacci Quarterly 16 (1978):259-68, 3. L. Carlitz. "Eulerian Numbers and Polynomials." Math, Mag, 32 (1959): E. Netto. Lehrbuch der Combinatorik, Leipzig: Teubner, N. E. Norlund. Vorlesungen uber Differenzenrechnung. Berlin: Springer Verlag, E..D-. Rainville. Special Functions, New York: Macmillan, J. Riordan. An Introduction to Combinatorial Analysis, New York: Wiley, HOW TO FIND THE "GOLDEN NUMBER" WITHOUT REALLY TRYING ROGER FISCHLER Carleton University, Ottawa, Canada K155B6 ".... I WAJbh,.. to potnt out that the, aae ol thu qold<in A&ction... hcu> appaxtntly bu/a>t out -into a &uddm and d&voatattng dluzaaz whtch hah &hou)n no AtgnA o& stopping... f? [2, p. 521] Most of the papers involving claims concerning the "golden number" deal with distinct items such as paintings, basing their assertions on measurements of these individual objects. As an example, we may cite the article by Hedian [13]. However measurements, no matter how accurate, cannot be used to reconstruct the original system of proportions used to design an object, for many systems may give rise to approximately the same set of numbers; see [6, 7] for an example of this. The only valid way of determining the system of proportions used by an artist is by means of documentation. A detailed investigation of three cases [8, 9, 10, 11] for which it had been claimed in the literature that the artist in question had used the "golden number" showed that these assertions were without any foundation whatsoever. There is, however, another class of papers that seeks to convince the reader via statistical data applied to a whole class of related objects. The earliest examples of these are Zeising's morphological works, e.g., [17]- More recently we have Duckworth's book [5] on Vergil's Aeneid and a series of papers by Benjafield and his coauthors involving such things as interpersonal relationships (see e.g. [1], which gives a partial listing of some of these papers). Mathematically we may approach the question in the following way. Suppose we have a certain length which is split into two parts, the larger being M and the smaller m. If the length is divided according to the golden section, then it does not matter which of the quantities, m/m or M/(M + m), we use, for they are equal. But now suppose we have a collection of lengths and we are trying to determine statistically if the data are consistent with a partition according to the golden

2 1981] HOW TO FIND THE "GOLDEN NUMBER" WITHOUT REALLY TRYING 407 section. Authors invariably use Ml (M + m), but we may reasonably ask which of the two we should really use or whether or not it matters. Our starting point is a remark by Dalzell in his review of Duckworth's book: "But Professor Duckworth always uses the more complex ratio Ml (M + m), which he describes as 'slightly more accurate. 1 Just the reverse is true. In the relatively few instances when the quotient is exactly.618 then m/m= Ml (M + m) and it does not matter which ratio is used. But in all other cases the more complex ratio is less sensitive to deviations from the perfect figure of.618" [4]. Let us designate m/m by x 9 then M/(M + m) becomes 1/(1 + x). The golden number is \$ = (1 + /5)/2, and we let <p = 1/\$. We then have ValzoZt'A Thdotizm: For all x in [0, 1]; 11/(1 + x) - <p\ <. \x - <p\. Why should this result be true? Intuitively, we might reason that in writing 1/(1 + x) we are starting to form the continued fraction expansion of <p. We shall see later that in a sense our intuition is correct, but that there are limits to its validity. As a direct proof via continued fractions seems difficult, we use a roundabout approach. Lommcii Let f be dif ferentiable on [a, b] with \f'\ <_ M. If a is a root of f(x)-x (i.e., a fixed point of f), then \f(x) - a\ <_ M\x - a\ on [a 9 b] e VHjQOfc Mean value theorem. CoHjottoJiy: Dalzell f s theorem. Alternatively, we can obtain the estimate \f(x) - f(y)\ <. [1/(1 + a) 2 ] x - y\ with f(x) = 1/(1 + x), 0 j<. a <_ x s z/, by simple computation. This shows directly that / is a contraction operator with fixed point <p. In particular, when we restrict ourselves to an interval bounded away from 0, we see that the distortion caused by using M/Qd+m) instead of m/m is larger than that indicated by Dalzell! s theorem. CoKollaAy: On the interval [a, 1] where a = Jl - 1 = , (1 + x) - <P s 1 I Note in fact that as x ranges from.5 to.75, 1/(1 + x) only ranges from.667 to.571. CotiolZcUiyi For x c l o s e to <p s 11/(1 + x) - <p\ * (<p 2 )\x - <P\ (<P 2 = 1 - <p = ). Because of its independent interest we now make a slight digression into continued fractions. We restrict ourselves to the unit interval and therefore write [0, a 19 a 2,...] for l/(a x + l/a 2 + ) Tk<LQK<m* Let a [0, 1] have a periodic continued fraction expansion of the form a = [0, a x, a,..., a^]. Then for any number x in [0, 1], [0, a ls a 2,..., a k9 x] - a <. \x - a. Vnoofc Define / by f(x) = [a l9 a l9..., a k9 x], then, by the periodicity, /(a) = a. Furthermore, f(x) Ax + B = -^ ~r~fj> where the coefficients are integers which

3 408 HOW TO FIND THE "GOLDEN NUMBER" WITHOUT REALLY TRYING [Dec. do not depend on x and satisfy \AD - BC\ = 1 (A/C and B/D are, respectively, the (k - l)st and kth convergents to a; see [12, Th. 175] and [15, Th. 7.3]). From this we obtain / f (#) = 11 \ {Cx-\~ D) \ 2 < 1 on [0, 1], The proof is concluded by use of the lemma. CoKollaAy: Dalzell's theorem. Vh Oi} > = [0, 1, 1, 1,... ] ; [0, 1, X] = 1/(1 + RojmoJik' This theorem justifies our earlier intuitive remark as to why Dalzell's theorem should hold; however, our intuition will lead us into difficulties unless we stop at the end of a period. Indeed, if a = [0, ^,..., b k ] and j < k 9 then for x = a, x - a is zero, whereas [0, b l9..., bj, x] - x is not zero. RemcUik* The above approach can be used to place some results involving continued fractions in the domain of attraction of fixed points and contraction operators, but we shall not pursue this path here. RemaAk: It is known that every periodic continued fraction is a quadratic surd, i.e., an irrational root of a quadratic equation with integral coefficients, and conversely ([10, Ths. 176, 177] and [15, Th. 7.19]). In the case of a =<p, the corresponding equation ±s x 2 + x - 1 or x = 1/(1 + x). One would thus be tempted to treat the general periodic case as follows: Suppose a satisfies Ax 2 + Bx = C. We rewrite this as x = f(x) ~ C/(Ax + B), and would like to conclude that \f(x) - a <. \x - a as above. However, we run into difficulty because we no longer have a control on / ' Let us now turn our attention to the statistical aspects. We denote random variables by capital letters, expectation by E 9 variance by a 2, and standard deviation by SD. We restrict ourselves to distributions with continuous densities concentrated on the unit interval. By the second corollary above (p. 407) and the Mean value theorem for integrals, we have immediately Tko.OXem: If I is a random variable taking values in a small interval near, then the ratios P X = \E(X) - <p\/\e(i) - <p\ and r 2 = SD(J)/SD(J) are both near \$ 2. Now consider a general "aesthetic" situation involving lengths of various sizes. We should not be surprised that, rather than being controlled by some mystical numerical force, our ratios m/m occur randomly. Furthermore, in situations such as the lengths of sections in a poem, there will be a tendency to avoid the two extremes of complete asymmetry and equality, i.e., we can expect values relatively far away from 0 and bounded away from 1. Thus we are led to consider the situation where X is uniformly distributed on a subinterval [a, b] of the unit interval. In this case, E(X) = (a 4- b)/2 and a 2 (J) = (b -a) [14, pp. 74, 101, 111] and straightforward calculations [14, p. 78] now show that the distribution functions of I = 1/(1 + X) assigns weight {lie - l/d)/(b - a) to a subinterval [e 9 d] of [1/(1 + b), 1/(1 -f a)]. Furthermore, and E^ = ( r b ) ' ln (fri) x). * 2(J) = (i + a'd + b)~ [W- Note that if [c 9 d] is contained in [1/(1+2?), 1/(1+ a)] and also in [a, b] then the distribution function of y assigns l/od times more weight to [o 9 d] than does the unifrom distribution on [a, b]. Under these conditions, if [o 9 d] is a small subinterval about 1/\$, then this ratio is approximately \$ 2 = 2.618, i.e., for a large sample over two and one-half times as many values of the transformed data as of the untransformed values will lie in the interval. Also note that the

4 1981] HOW TO FIND THE "GOLDEN NUMBER" WITHOUT REALLY TRYING 409 weight assigned by the distribution of Y to an interval [c 9 d] depends only on the length of the interval [a, b] and not on the actual values of the endpoints. In fact, numerical computation shows that even for large intervals relatively far away from 0 and bounded away from 1 the ratios r 1 and r 2 as well as the probability.ratios will not be too far from 2.6. To illustrate this situation, let us suppose that our ratios are uniformly distributed on [.45,.70] so that the average value is.575 and the standard deviation.072. For a large sample, only 16% of the values will fall in the sub interval [.60,.64]. If we now transform the data, the mean is.636 and the standard deviation only.029. This means that for a sample size of 20 or so it is almost sure that the mean will lie in the interval [.607,.665]. Furthermore, for a large sample, 42% of the actual values of l/(l+#) will lie in our subinterval [.60,.64]. If we look at [.59,.65], then the probabilities are 24% and 62%. Finally, to support our claim that the various seemingly impressive results in the literature are really due to an invalid transformation of data from a more or less uniform distribution, we mention two case studies. The first is due to Shiffman and Bobko [16] who considered linear portionings and concluded that a uniform distribution of preferences was indeed the most likely hypothesis. The other, a study on Duckworth 1 s data, was done by the present author in connection with a historical study [3] of the numerical treatment of \$ by Hero of Alexandria who lived soon after Vergil. If we consider the first hundred entries in Duckworth 1 s Table I, then the range of the m/m values is from 4/7 =.571 (four times) to 2/3 =.667 (twelve times). If this range is split up into five equal parts, then the five subintervals contain 10, 25, 33, 15, and 17 values, respectively. When we look at the actual values, we note that the Fibonacci ratios 3/5, 5/8, and 13/21 appear 15, 16, and 2 times, respectively. In other words, 2/3 of the ratios are not Fibonacci approximations to the "golden number." If we compute means and standard deviations, then for the m/m ratios we obtain the values.621 and.025 as opposed to the values.616 and.010 for the M/(M + m) ratios, which only range from.600 to.637. It is interesting to note that if Vergil had used the end values 4/7 and 2/3 fifty times each, then the average would have been 2V7 3/ 21' which is a good Fibonacci approximation to <p. This only proves once more how deceiving averages can be. A similar study of the sixteen values in Duckworth's Table IV the main divisions reveals that not a single Fibonacci ratio appears. The m/m values range from.594 to.663 with a mean of.625 and standard deviation of.021 as opposed to values of.615 and.008 for the M/(M + m) values. ACKNOWLEDGMENTS We wish to thank mssrs. Len Curchin (Calgary) and David Fowler (Warwick) for various references, comments, and suggestions. REFERENCES 1. J. Benjafield & C. Davis. "The Golden Number and the Structure of Connotation." J. Aesthetics and Art Criticism 36 (1978): T. Cook. "A New Disease in Architecture." The Nineteenth Century and After 91 (1922): L. Curchin & R. Fischler. "Hero of Alexandria's Numerical Treatment of Division in Extreme and Mean Ratio, and Its Implications." To appear in Phoenix, The Canadian Classical Journal 35 (1981):

5 410 EXTENDED BINET FORMS FOR GENERALIZED QUATERNIONS OF HIGHER ORDER [Dec. 4. A. Dalzell. "Book Review of Duckworth 1 s Structural Patterns...." Phoenix 3 The Canadian Classical Journal 17 (1963): G. Duckworth. Structural Patterns and Proportions in Vergil 1 s Aeneid. Ann Arbor: University of Michigan Press, R. Fischler. "Theories mathematiques de la Grande Pyramide." Crux Mathematicorum 4 (1978): R. Fischler. "What Did Herodotus Really Say? or How To Build (a Theory of) the Great Pyramid." Environment and Planning 6 (1979): R. Fischler. "The Early Relationship of Le Corbusier to the 'Golden Number.! " Environment and Planning B. 6 (1979): R. Fischler. "An Investigation of Claims Concerning Seurat and the 'Golden Number.'" To appear in Gazette des Beaux Arts. 10. R. Fischler & E. Fischler. "Juan Gris, son milieu et le nombre d? or." Canadian Art Review 7 (1980): R. Fischler. "On Applications of the Golden Ratio in the Visual Arts." Leonardo 14 (1981): G. Hardy & E. Wright. An Introduction to the Theory of Numbers. 4th ed. Oxford: Clarendon, H. Hedian. "The Golden Section and the Artist." The Fibonacci Quarterly 14 (1976):406-18, 14. H. Kyburg. Probability Theory. Englewood Cliffs, N.J. : Prentice-Hall, I. Niven & H. Zuckerman* Introduction to the Theory of Numbers. New York: Wiley, H. Shiffman & D. Bobko. "Preference in Linear Partitioning: The Golden Section Reexamined." Perception and Psychophysics 24 (1978): A. Zeising. "Uber die Metamorphosen in den Verhaltnissen der menschilichen Gestalt von der Gerburt bis zur Vollendung des Langenwachsturns." Deutsche Akademie der Naturforscher Nova Acta Leopoldine 26 (1857): EXTENDED BINET FORMS FOR GENERALIZED QUATERNIONS OF HIGHER ORDER A. L. IAKIN University of New England, Armidale, Australia In a prior article [4], the concept of a higher-order quaternion was established and some identities for these quaternions were then obtained. In this paper we introduce a "Binet form" for generalized quaternions and then proceed to develop expressions for extended Binet forms for generalized quaternions of higher order. The extended Binet formulas make possible an approach for generating results which differs from that used in [4]. We recall from Horadam [1] the Binet form for the sequence W n (a 9 b; p, q), viz., W n = Aa n - SB n where W 0 = a, W 1 = b. b - a\$ ' b - aa A 7T-9 D 7Ta - 3 a - 3 and where a and 3 are the roots of the quadratic equation x z - px + q = 0. We define the vectors a, and _3 such that a = 1 + ia + ja 2 + to 3 and 3 = 1 + i& + J*3 2 + k\$ 3,

### JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

### 4.3 Lagrange Approximation

206 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION Lagrange Polynomial Approximation 4.3 Lagrange Approximation Interpolation means to estimate a missing function value by taking a weighted average

MA 134 Lecture Notes August 20, 2012 Introduction The purpose of this lecture is to... Introduction The purpose of this lecture is to... Learn about different types of equations Introduction The purpose

### Zeros of Polynomial Functions

Review: Synthetic Division Find (x 2-5x - 5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 3-5x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 3-5x 2 + x + 2. Zeros of Polynomial Functions Introduction

### THE DYING FIBONACCI TREE. 1. Introduction. Consider a tree with two types of nodes, say A and B, and the following properties:

THE DYING FIBONACCI TREE BERNHARD GITTENBERGER 1. Introduction Consider a tree with two types of nodes, say A and B, and the following properties: 1. Let the root be of type A.. Each node of type A produces

### It is time to prove some theorems. There are various strategies for doing

CHAPTER 4 Direct Proof It is time to prove some theorems. There are various strategies for doing this; we now examine the most straightforward approach, a technique called direct proof. As we begin, it

### A GENERALIZED PYTHAGOREAN THEOREM

A GENERALIZED PYTHAGOREAN THEOREM A. G. SHANNON University of Papua and New Guinea, Boroko, T, P. N. G. and A, F. HORADAfV! University of New England, Armidale, Australia 1. INTRODUCTION The results in

### Continued Fractions. Darren C. Collins

Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history

### 3.2 The Factor Theorem and The Remainder Theorem

3. The Factor Theorem and The Remainder Theorem 57 3. The Factor Theorem and The Remainder Theorem Suppose we wish to find the zeros of f(x) = x 3 + 4x 5x 4. Setting f(x) = 0 results in the polynomial

### 1 Lecture: Integration of rational functions by decomposition

Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.

### 5. Factoring by the QF method

5. Factoring by the QF method 5.0 Preliminaries 5.1 The QF view of factorability 5.2 Illustration of the QF view of factorability 5.3 The QF approach to factorization 5.4 Alternative factorization by the

### Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00

18.781 Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00 Throughout this assignment, f(x) always denotes a polynomial with integer coefficients. 1. (a) Show that e 32 (3) = 8, and write down a list

### CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

### 6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives

6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise

### Functions and Equations

Centre for Education in Mathematics and Computing Euclid eworkshop # Functions and Equations c 014 UNIVERSITY OF WATERLOO Euclid eworkshop # TOOLKIT Parabolas The quadratic f(x) = ax + bx + c (with a,b,c

### Some Notes on Taylor Polynomials and Taylor Series

Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited

### The Method of Partial Fractions Math 121 Calculus II Spring 2015

Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method

### Subsets of Euclidean domains possessing a unique division algorithm

Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness

### The Method of Least Squares

The Method of Least Squares Steven J. Miller Mathematics Department Brown University Providence, RI 0292 Abstract The Method of Least Squares is a procedure to determine the best fit line to data; the

### Zero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P.

MATH 11011 FINDING REAL ZEROS KSU OF A POLYNOMIAL Definitions: Polynomial: is a function of the form P (x) = a n x n + a n 1 x n 1 + + a x + a 1 x + a 0. The numbers a n, a n 1,..., a 1, a 0 are called

### 2.4 Real Zeros of Polynomial Functions

SECTION 2.4 Real Zeros of Polynomial Functions 197 What you ll learn about Long Division and the Division Algorithm Remainder and Factor Theorems Synthetic Division Rational Zeros Theorem Upper and Lower

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### The Not-Formula Book for C1

Not The Not-Formula Book for C1 Everything you need to know for Core 1 that won t be in the formula book Examination Board: AQA Brief This document is intended as an aid for revision. Although it includes

### Zeros of Polynomial Functions

Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n-1 x n-1 + + a 1 x + a 0 has integer coefficients and p/q (where p/q is reduced) is a rational zero, then p is a factor of

### Introduction to polynomials

Worksheet 4.5 Polynomials Section 1 Introduction to polynomials A polynomial is an expression of the form p(x) = p 0 + p 1 x + p 2 x 2 + + p n x n, (n N) where p 0, p 1,..., p n are constants and x os

### 5 Indefinite integral

5 Indefinite integral The most of the mathematical operations have inverse operations: the inverse operation of addition is subtraction, the inverse operation of multiplication is division, the inverse

### Taylor Polynomials and Taylor Series Math 126

Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will

### 3 1. Note that all cubes solve it; therefore, there are no more

Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if

### Senior Secondary Australian Curriculum

Senior Secondary Australian Curriculum Mathematical Methods Glossary Unit 1 Functions and graphs Asymptote A line is an asymptote to a curve if the distance between the line and the curve approaches zero

### FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

### Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

### THE GOLDEN RATIO AND THE FIBONACCI SEQUENCE

/ 24 THE GOLDEN RATIO AND THE FIBONACCI SEQUENCE Todd Cochrane Everything is Golden 2 / 24 Golden Ratio Golden Proportion Golden Relation Golden Rectangle Golden Spiral Golden Angle Geometric Growth, (Exponential

### A Curious Case of a Continued Fraction

A Curious Case of a Continued Fraction Abigail Faron Advisor: Dr. David Garth May 30, 204 Introduction The primary purpose of this paper is to combine the studies of continued fractions, the Fibonacci

### 1 Mathematical Induction

Extra Credit Homework Problems Note: these problems are of varying difficulty, so you might want to assign different point values for the different problems. I have suggested the point values each problem

Section 5.4 The Quadratic Formula 481 5.4 The Quadratic Formula Consider the general quadratic function f(x) = ax + bx + c. In the previous section, we learned that we can find the zeros of this function

### Polynomials can be added or subtracted simply by adding or subtracting the corresponding terms, e.g., if

1. Polynomials 1.1. Definitions A polynomial in x is an expression obtained by taking powers of x, multiplying them by constants, and adding them. It can be written in the form c 0 x n + c 1 x n 1 + c

### since by using a computer we are limited to the use of elementary arithmetic operations

> 4. Interpolation and Approximation Most functions cannot be evaluated exactly: x, e x, ln x, trigonometric functions since by using a computer we are limited to the use of elementary arithmetic operations

### pp. 4 8: Examples 1 6 Quick Check 1 6 Exercises 1, 2, 20, 42, 43, 64

Semester 1 Text: Chapter 1: Tools of Algebra Lesson 1-1: Properties of Real Numbers Day 1 Part 1: Graphing and Ordering Real Numbers Part 1: Graphing and Ordering Real Numbers Lesson 1-2: Algebraic Expressions

### Nonparametric adaptive age replacement with a one-cycle criterion

Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk

### Notes from February 11

Notes from February 11 Math 130 Course web site: www.courses.fas.harvard.edu/5811 Two lemmas Before proving the theorem which was stated at the end of class on February 8, we begin with two lemmas. The

### Infinite Algebra 1 supports the teaching of the Common Core State Standards listed below.

Infinite Algebra 1 Kuta Software LLC Common Core Alignment Software version 2.05 Last revised July 2015 Infinite Algebra 1 supports the teaching of the Common Core State Standards listed below. High School

### Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

### PROBLEM SET 6: POLYNOMIALS

PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other

### The van Hoeij Algorithm for Factoring Polynomials

The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial

### The minimum number of monochromatic 4-term progressions

The minimum number of monochromatic 4-term progressions Rutgers University May 28, 2009 Monochromatic 3-term progressions Monochromatic 4-term progressions 1 Introduction Monochromatic 3-term progressions

### Understanding Basic Calculus

Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other

### SOLVING POLYNOMIAL EQUATIONS

C SOLVING POLYNOMIAL EQUATIONS We will assume in this appendix that you know how to divide polynomials using long division and synthetic division. If you need to review those techniques, refer to an algebra

### 3.3. Solving Polynomial Equations. Introduction. Prerequisites. Learning Outcomes

Solving Polynomial Equations 3.3 Introduction Linear and quadratic equations, dealt within Sections 3.1 and 3.2, are members of a class of equations, called polynomial equations. These have the general

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### Limit processes are the basis of calculus. For example, the derivative. f f (x + h) f (x)

SEC. 4.1 TAYLOR SERIES AND CALCULATION OF FUNCTIONS 187 Taylor Series 4.1 Taylor Series and Calculation of Functions Limit processes are the basis of calculus. For example, the derivative f f (x + h) f

### Lecture 5 : Solving Equations, Completing the Square, Quadratic Formula

Lecture 5 : Solving Equations, Completing the Square, Quadratic Formula An equation is a mathematical statement that two mathematical expressions are equal For example the statement 1 + 2 = 3 is read as

### 3.3. The Factor Theorem. Investigate Determining the Factors of a Polynomial. Reflect and Respond

3.3 The Factor Theorem Focus on... factoring polynomials explaining the relationship between the linear factors of a polynomial expression and the zeros of the corresponding function modelling and solving

### LOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO

LOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO PETER MÜLLER AND MICHAEL E. ZIEVE Abstract. Planar functions over finite fields give rise to finite projective planes and other combinatorial objects.

### a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x

### 0.4 FACTORING POLYNOMIALS

36_.qxd /3/5 :9 AM Page -9 SECTION. Factoring Polynomials -9. FACTORING POLYNOMIALS Use special products and factorization techniques to factor polynomials. Find the domains of radical expressions. Use

### 10.3 POWER METHOD FOR APPROXIMATING EIGENVALUES

58 CHAPTER NUMERICAL METHODS. POWER METHOD FOR APPROXIMATING EIGENVALUES In Chapter 7 you saw that the eigenvalues of an n n matrix A are obtained by solving its characteristic equation n c nn c nn...

### 15.062 Data Mining: Algorithms and Applications Matrix Math Review

.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

### NON SINGULAR MATRICES. DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that

NON SINGULAR MATRICES DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that AB = I n = BA. Any matrix B with the above property is called

### 5. Convergence of sequences of random variables

5. Convergence of sequences of random variables Throughout this chapter we assume that {X, X 2,...} is a sequence of r.v. and X is a r.v., and all of them are defined on the same probability space (Ω,

### Continued fractions and good approximations.

Continued fractions and good approximations We will study how to find good approximations for important real life constants A good approximation must be both accurate and easy to use For instance, our

### CHAPTER 2. Inequalities

CHAPTER 2 Inequalities In this section we add the axioms describe the behavior of inequalities (the order axioms) to the list of axioms begun in Chapter 1. A thorough mastery of this section is essential

### Montana Common Core Standard

Algebra I Grade Level: 9, 10, 11, 12 Length: 1 Year Period(s) Per Day: 1 Credit: 1 Credit Requirement Fulfilled: A must pass course Course Description This course covers the real number system, solving

### 3.4 Complex Zeros and the Fundamental Theorem of Algebra

86 Polynomial Functions.4 Complex Zeros and the Fundamental Theorem of Algebra In Section., we were focused on finding the real zeros of a polynomial function. In this section, we expand our horizons and

### CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

### Factoring Cubic Polynomials

Factoring Cubic Polynomials Robert G. Underwood 1. Introduction There are at least two ways in which using the famous Cardano formulas (1545) to factor cubic polynomials present more difficulties than

### 1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

### minimal polyonomial Example

Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We

### CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical

### Taylor and Maclaurin Series

Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions

### Gambling Systems and Multiplication-Invariant Measures

Gambling Systems and Multiplication-Invariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### Answer Key for California State Standards: Algebra I

Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.

### FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.

FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is

### A simple application of the implicit function theorem

Boletín de la Asociación Matemática Venezolana, Vol. XIX, No. 1 (2012) 71 DIVULGACIÓN MATEMÁTICA A simple application of the implicit function theorem Germán Lozada-Cruz Abstract. In this note we show

### PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

### MATH 21. College Algebra 1 Lecture Notes

MATH 21 College Algebra 1 Lecture Notes MATH 21 3.6 Factoring Review College Algebra 1 Factoring and Foiling 1. (a + b) 2 = a 2 + 2ab + b 2. 2. (a b) 2 = a 2 2ab + b 2. 3. (a + b)(a b) = a 2 b 2. 4. (a

### Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions

Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions D. R. Wilkins Copyright c David R. Wilkins 2016 Contents 3 Functions 43 3.1 Functions between Sets...................... 43 3.2 Injective

### 1.1 Solving a Linear Equation ax + b = 0

1.1 Solving a Linear Equation ax + b = 0 To solve an equation ax + b = 0 : (i) move b to the other side (subtract b from both sides) (ii) divide both sides by a Example: Solve x = 0 (i) x- = 0 x = (ii)

### Polynomials Classwork

Polynomials Classwork What Is a Polynomial Function? Numerical, Analytical and Graphical Approaches Anatomy of an n th -degree polynomial function Def.: A polynomial function of degree n in the vaiable

### Worksheet 4.7. Polynomials. Section 1. Introduction to Polynomials. A polynomial is an expression of the form

Worksheet 4.7 Polynomials Section 1 Introduction to Polynomials A polynomial is an expression of the form p(x) = p 0 + p 1 x + p 2 x 2 + + p n x n (n N) where p 0, p 1,..., p n are constants and x is a

### 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,

### 1.5. Factorisation. Introduction. Prerequisites. Learning Outcomes. Learning Style

Factorisation 1.5 Introduction In Block 4 we showed the way in which brackets were removed from algebraic expressions. Factorisation, which can be considered as the reverse of this process, is dealt with

### 10.3 POWER METHOD FOR APPROXIMATING EIGENVALUES

55 CHAPTER NUMERICAL METHODS. POWER METHOD FOR APPROXIMATING EIGENVALUES In Chapter 7 we saw that the eigenvalues of an n n matrix A are obtained by solving its characteristic equation n c n n c n n...

### Numerical methods for finding the roots of a function

Numerical methods for finding the roots of a function The roots of a function f (x) are defined as the values for which the value of the function becomes equal to zero. So, finding the roots of f (x) means

### MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

### Topic: Solving Linear Equations

Unit 1 Topic: Solving Linear Equations N-Q.1. Reason quantitatively and use units to solve problems. Use units as a way to understand problems and to guide the solution of multi-step problems; choose and

### APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

### HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

### 1. R In this and the next section we are going to study the properties of sequences of real numbers.

+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### High School Algebra 1 Common Core Standards & Learning Targets

High School Algebra 1 Common Core Standards & Learning Targets Unit 1: Relationships between Quantities and Reasoning with Equations CCS Standards: Quantities N-Q.1. Use units as a way to understand problems

### 1.7. Partial Fractions. 1.7.1. Rational Functions and Partial Fractions. A rational function is a quotient of two polynomials: R(x) = P (x) Q(x).

.7. PRTIL FRCTIONS 3.7. Partial Fractions.7.. Rational Functions and Partial Fractions. rational function is a quotient of two polynomials: R(x) = P (x) Q(x). Here we discuss how to integrate rational

### Algebra I Vocabulary Cards

Algebra I Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Absolute Value Order of Operations Expression

### it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New