DOCSLIB.ORG

The AMATYC Review, Fall 1992-Spring 1993. INSTITUTION American Mathematical Association of Two-Year Colleges

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The AMATYC Review, Fall 1992-Spring 1993. INSTITUTION American Mathematical Association of Two-Year Colleges DOCUMENT RESUME ED 354 956 JC 930 126 AUTHOR Cohen, Don, Ed.; Browne, Joseph, Ed. TITLE The AMATYC Review, Fall 1992-Spring 1993. INSTITUTION American Mathematical Association of Two-Year Colleges. REPORT NO ISSN-0740-8404 PUB DATE 93 NOTE 203p. AVAILABLE FROMAMATYC Treasurer, State Technical Institute at Memphis, 5983 Macon Cove, Memphis, TN 38134 (for libraries 2 issues free with $25 annual membership). PUB TYPE Collected Works Serials (022) JOURNAL CIT AMATYC Review; v14 n1-2 Fall 1992-Spr 1993 EDRS PRICE MF01/PC09 Plus Postage. DESCRIPTORS *College Mathematics; Community Colleges; Computer Simulation; Functions (Mathematics); Linear Programing; *Mathematical Applications; *Mathematical Concepts; Mathematical Formulas; *Mathematics Instruction; Mathematics Teachers; Technical Mathematics; Two Year Colleges ABSTRACT Designed as an avenue of communication for mathematics educators concerned with the views, ideas, and experiences of two-year collage students and teachers, this journal contains articles on mathematics expoition and education,as well as regular features presenting book and software reviews and math problems. The first of two issues of volume 14 contains the following major articles: "Technology in the Mathematics Classroom," by Mike Davidson; "Reflections on Arithmetic-Progression Factorials," by William E. Rosentl,e1; "The Investigation of Tangent Polynomials with a Computer Algebra System," by John H. Mathews and Russell W. Howell; "On Finding the General Term of a Sequence Using Lagrange Interpolation," by Sheldon Gordon and Robert Decker; "The Floating Leaf Problem," by Richard L. Francis; "Approximations to the Hypergeometric Distribution," by Chltra Gunawardena and K. L. D. Gunawardena; aid "Generating 'JE(3)' with Some Elementary Applications," by John J. Edgeli, Jr. The second issue contains: "Strategies for Making Mathematics Work for Minorities," by Beverly J. Anderson; "Two-Year Mathematics Pioneers," an interview with Allyn J. Washington; "Using Linear Programming To Obtaina Minimum Cost Balanced Organic Fertilizer Mix," by Stephen J. Turner; "Problems Whose Solutions Lie on a Hyperbola," by Steven Schwartzman; and "The Shape of a Projectile's Path: Explorations witha Computer Algebra System," by John H. Mathews and Robert Lopez. (BCY) *****************k************************************************ Reproductions supplied by EDRS are the best thatcan be made from the original document. *********************************************************************** The AMATYC Review Volume 14, Numbers 1-2 Fall 1992Spring 1993 c.4 PEr4M!SS'O'S7C, REPROD.JCETHIS U.S DEPARTMENT Office of Eclocauonav OF EDUCATION MAEP AL HAS BEENGRANTED60 Research and improvement EDUCATIONAL RESOURCES INFORMATION J. Browne CENTER (ERIC' Th.s document has Oeen reproduced as ,7,gaen,efOng ,IIrOrnthe person or organ.zahon Minor cnanges havebees made to improve reproducton quanty 70 THE EDUCA''ONAL RESOURCES PoInd s of new or meal do not necessarilyoprrsons stated m thrs doco 'NPORMAT:CN CENTER ERIC OERI oosikon or pokey represent offIc.al American Mathematical Association of Two-YearColleges North Carolina, California BEST CiTY THE A ATYC REVIE Published by the AMERICAN MATHEMATICAL ASSOCIATION OF TWO-YEAR COLLEGES VOLUME 14, NUMBER 1 Fall 1992 - -0.0414101...4;.toole-040a \ I II . a a I. ALSO IN THIS ISSUE On Finding the General Term of a Sequence Using Lagrange Interpolation The Floating Leaf Problem A Case for In-Context Placement Testing BEST COPY MAILABLE American Mathematical Association of Two-Year Colleges EXECUTIVE BOARD 1991-1993 President President-Elect Karen Sharp Marilyn Mays Mott Community College North Lake College 1401 E. Court St. 5001 MacArthur Blvd. Flint, MI 48503 Irving, TX 75038-3899 (313) 232-3980 (214) 659-5328 Treasurer Secretary Past President Margie Hobbs Wanda Garner Dale Ewen State Technical Institute Cabrillo College Parkland College 5983 Macon Cove 6500 Soquel Drive 2400 W. Bradley Ave. Memphis, TN 38134 Aptos, CA 95003 Champaign, IL 61821 (901) 377-4110 (408) 479-6329 (217) 351-2440 REGIONAL VICE PRESIDENTS Northeast Mid-Atlantic Southeast Carol Westfall Susan S. Wood Bill E. Jordan SUNY Ag-Tech College J. Sargeant Reynolds C. C. Seminole Comm. College Cobleskill, NY 12043 Box C-32040 100 Weldon Blvd. (518) 234-5521 Richmond, VA 23261-2040 Sanford, FL 32773 (804) 371-3027 (407) 323-1450 Midwest Central Southwest Dave Gustafson Helen Burrier Therese Jones Rock Valley College Kirkwood Community College Amarillo Jr. College 3301 N. Mulford Rd. 6301 Kirkwood Blvd., SW P.O. Box 447 Rockford, IL 61111 Cedar Rapids, IA 52406 Amarillo, TX 79178 (815) 654-4365 (319) 398-1244 (806) 371-5091 Northwest West Vicky Ringen Bill D. New N. Seattle Comm. College Cerritos College 9600 College Way N. 11110 E. Allondra Seattle, WA 98103 Norwalk, CA 90650 (206) 527-3746 (310) 860-2451 ACADEMIC COMMITTEES Developmental Mathematics Student Mathematics League Technical Mathematics Martha Wood Steve Blasberg Rob Kimball Clayton State College West Valley College Wake Technical College Morrow, GA 30260 14000 Fruitvale.Ave. 9101 Fayetville Rd. (404) 961-3463 Saratoga, CA 95070 Raleigh, NC 27603-5696 Academic Computing (408) 867-2200 Ext. 6331 (919) 772-0551 Ext. 285 Don Huchison Equal Opportunity in Mathematics Education Clackamas Comm. College Sadie C. Bragg Robert Malena Oregon City, OR 97045 Borough of Manhattan C. C. CCAC-South (503) 657-8400 199 Chambers St. 1750 Clairton Rd. Placement and Assessment New York, NY 10007 W. Mifflin, PA 15122 Richelle Blair (212) 618-1571 (412) 469-6228 Lakeland Corn. College 7700 Clocktower Dr. Mentor, OH 44060 (216) 953-7341 4 The Official Journal of the American Mathematical Association of Two-Year Colleges PURPOSE: AMATYC remains committed to its originalpurposes: To provide a national forum for the exchange of ideas To further develop and improve the mathematics education of students oftwo-year colleges To coordinate activities of affiliated organizations on a national level To promote the professional development and welfare of its members The AMATYC Review provides an avenue of communication for all mathematics educators concerned with the views, ideas and experiences pertinentto two-year college teachers and students. SUBMISSION OF MANUSCRIPTS: Manuscripts must be typed, doubled-spaced,on one side of 8-1/2" x 11" paper. They should not have been published before,nor should they be under consideration for publication elsewhere. Photographsshould be black and white glossy prints. To provide for anonymous reviews, the author'sname and affiliation should appear on a separate title page. The title should alsoappear on the first page of the exposition. Authors are advised to consult the PublicationManual of the American Psychological Association. A guideline for authors is availablefrom the editor. If facilities are available, authors are advised toprepare manuscripts using a word processing program on a 5-1/4" IBM compatible floppy disk. Final drafts of accepted manuscripts may be submitted on sucha disk.Five copies of each manuscript should be submitted to Joseph Browne, Onondaga Comm. College, Syracuse, NY 13215. PHOTOCOPYING AND REPRINTS: General permission is granted to educatorsto photocopy material from The AMATYC Review for noncommercial instructionalor scholarly use. Permission must be sought from the authors in order to charge for photocopies, to quote material in advertising, or to reprint articles in other educational publications. Once permission is obtained, credit should be given to the source of the material by citing a complete reference. ADVERTISING: For information concerning advertising rates and schedules,contact the advertising manager, Larry Gilligan, at the address given below. STAFF Editor. Don Cohen, SUNY Ag-Tech College, Cobleskill, NY 12043, (518) 234-5011 Production: Roy Cameron, SUNY Ag-Tech College, Cobleskill, NY 12043, (518) 234-= 1 Advertising: Larry Gilligan, OMI College of Applied Science, Cincinnati, OH 45206 (513) 556-6580 Artwork: Robert Burghardt, Rockland Community College, Suffern, NY 10901 EDITORIAL PANEL Max Cisneros, Jr. Albuquerque Tech-Voc. Inst. Albuquerque, NM Mike Davidson Cabrillo College Aptos, CA Brian llickey East Central College Union, MO Gordon W. Hoagland Ricks College Rexburg, ID Marvin L. Johnson College of Lake County Grayslake, IL Charlotte Newsom Tidewater Comm. College Virginia Beach, VA Dennis Reissig Suffolk County Community College Selden, NY Nelson G. Rich Nazareth College Rochester, NY Carla Thompson Tulsa Junior College Tulsa, OK Jacqueline Thornherry DcKalb College Clarkston, GA August Zarcone College of DuPage Glen Ellyn, IL PUBLICATION: The AMA TYC Review is published twicea year in the Fall and Spring. ISSN 0740-8404 The AMATYC Review Fall 1992 Volume 13, Number 2 TABLE OF CONTENTS EDITOR'S COMMENTS p. 4 LETTER TO THE EDITOR p. 5 ABOUT THE COVER Honeybees, Hexagons, and the Industrial Workplace p. 8 by Samuel F. Mclnroy VIEWPOINT Technology in the Mathematics Classroom P. 9 by Mike Davidson MATHEMATICAL EXPOSITION Reflections on Arithmetic -progression Factorials p. 13 by William E. Rosenthal The Investigation of Tangent Polynomials with a Computer Algebra System p. 20 by John H. Mathews and Russell W. Howell On Finding the General Term of a Sequence Using Lagrange Interpolation p. 30 by Sheldon Gordon and Robert Decker The Floating Leaf Problem p. 36 by Richard L. Francis Approximations to the Hypergeometric Distribution p. 41 by Chitra Gunawardena and K. L. D. Gunawardena Generating JE(3) With Some Elementary
Load more

Recommended publications
  • Fast and Efficient Algorithms for Evaluating Uniform and Nonuniform
    World Academy of Science, Engineering and Technology International Journal of Computer and Information Engineering Vol:13, No:8, 2019 Fast and Efficient Algorithms for Evaluating Uniform and Nonuniform Lagrange and Newton Curves Taweechai Nuntawisuttiwong, Natasha Dejdumrong Abstract—Newton-Lagrange Interpolations are widely used in quadratic computation time, which is slower than the others. numerical analysis. However, it requires a quadratic computational However, there are some curves in CAGD, Wang-Ball, DP time for their constructions. In computer aided geometric design and Dejdumrong curves with linear complexity. In order to (CAGD), there are some polynomial curves: Wang-Ball, DP and Dejdumrong curves, which have linear time complexity algorithms. reduce their computational time, Bezier´ curve is converted Thus, the computational time for Newton-Lagrange Interpolations into any of Wang-Ball, DP and Dejdumrong curves. Hence, can be reduced by applying the algorithms of Wang-Ball, DP and the computational time for Newton-Lagrange interpolations Dejdumrong curves. In order to use Wang-Ball, DP and Dejdumrong can be reduced by converting them into Wang-Ball, DP and algorithms, first, it is necessary to convert Newton-Lagrange Dejdumrong algorithms. Thus, it is necessary to investigate polynomials into Wang-Ball, DP or Dejdumrong polynomials. In this work, the algorithms for converting from both uniform and the conversion from Newton-Lagrange interpolation into non-uniform Newton-Lagrange polynomials into Wang-Ball, DP and the curves with linear complexity, Wang-Ball, DP and Dejdumrong polynomials are investigated. Thus, the computational Dejdumrong curves. An application of this work is to modify time for representing Newton-Lagrange polynomials can be reduced sketched image in CAD application with the computational into linear complexity.
    [Show full text]
  • Nhl Media Directory 2011-12 Table of Contents Page Page Nhl Directory Nhl Media 1+/2I¿Fhv
    NHL MEDIA DIRECTORY 2011-12 TABLE OF CONTENTS PAGE PAGE NHL DIRECTORY NHL MEDIA 1+/2I¿FHV ...........................................3 1+/FRP .............................................11 1+/([HFXWLYH .......................................4 1+/1HWZRUN .......................................11 1+/&RPPXQLFDWLRQV ............................4 1+/5DGLR ...........................................12 1+/*UHHQ ............................................6 1+/6WXGLRV ........................................12 NHL MEMBER CLUBS NHL MEDIA RESOURCES .................. 13 $QDKHLP'XFNV ...................................20 HOCKEY ORGANIZATIONS %RVWRQ%UXLQV ......................................27 %XIIDOR6DEUHV .....................................34 +RFNH\&DQDGD .................................260 &DOJDU\)ODPHV ...................................40 +RFNH\+DOORI)DPH .........................261 &DUROLQD+XUULFDQHV .............................46 1+/$OXPQL$VVRFLDWLRQ ........................7 &KLFDJR%ODFNKDZNV ...........................52 1+/%URDGFDVWHUV¶$VVRFLDWLRQ .........264 &RORUDGR$YDODQFKH ............................57 1+/3OD\HUV¶$VVRFLDWLRQ ....................17 &ROXPEXV%OXH-DFNHWV .......................66 3URIHVVLRQDO+RFNH\:ULWHUV¶ 'DOODV6WDUV .........................................72 $VVRFLDWLRQ ...................................263 'HWURLW5HG:LQJV ...............................78 86+RFNH\+DOORI)DPH0XVHXP ..261 (GPRQWRQ2LOHUV ..................................85 86$+RFNH\,QF ...............................262 )ORULGD3DQWKHUV ..................................92
    [Show full text]
  • Mials P
    Euclid's Algorithm 171 Euclid's Algorithm Horner’s method is a special case of Euclid's Algorithm which constructs, for given polyno- mials p and h =6 0, (unique) polynomials q and r with deg r<deg h so that p = hq + r: For variety, here is a nonstandard discussion of this algorithm, in terms of elimination. Assume that d h(t)=a0 + a1t + ···+ adt ;ad =06 ; and n p(t)=b0 + b1t + ···+ bnt : Then we seek a polynomial n−d q(t)=c0 + c1t + ···+ cn−dt for which r := p − hq has degree <d. This amounts to the square upper triangular linear system adc0 + ad−1c1 + ···+ a0cd = bd adc1 + ad−1c2 + ···+ a0cd+1 = bd+1 . adcn−d−1 + ad−1cn−d = bn−1 adcn−d = bn for the unknown coefficients c0;:::;cn−d which can be uniquely solved by back substitution since its diagonal entries all equal ad =0.6 19aug02 c 2002 Carl de Boor 172 18. Index Rough index for these notes 1-1:-5,2,8,40 cartesian product: 2 1-norm: 79 Cauchy(-Bunyakovski-Schwarz) 2-norm: 79 Inequality: 69 A-invariance: 125 Cauchy-Binet formula: -9, 166 A-invariant: 113 Cayley-Hamilton Theorem: 133 absolute value: 167 CBS Inequality: 69 absolutely homogeneous: 70, 79 Chaikin algorithm: 139 additive: 20 chain rule: 153 adjugate: 164 change of basis: -6 affine: 151 characteristic function: 7 affine combination: 148, 150 characteristic polynomial: -8, 130, 132, 134 affine hull: 150 circulant: 140 affine map: 149 codimension: 50, 53 affine polynomial: 152 coefficient vector: 21 affine space: 149 cofactor: 163 affinely independent: 151 column map: -6, 23 agrees with y at Λt:59 column space: 29 algebraic dual: 95 column
    [Show full text]
  • CS321-001 Introduction to Numerical Methods
    CS321-001 Introduction to Numerical Methods Lecture 3 Interpolation and Numerical Differentiation Professor Jun Zhang Department of Computer Science University of Kentucky Lexington, KY 40506-0633 Polynomial Interpolation Given a set of discrete values, how can we estimate other values between these data The method that we will use is called polynomial interpolation. We assume the data we had are from the evaluation of a smooth function. We may be able to use a polynomial p(x) to approximate this function, at least locally. A condition: the polynomial p(x) takes the given values at the given points (nodes), i.e., p(xi) = yi with 0 ≤ i ≤ n. The polynomial is said to interpolate the table, since we do not know the function. 2 Polynomial Interpolation Note that all the points are passed through by the curve 3 Polynomial Interpolation We do not know the original function, the interpolation may not be accurate 4 Order of Interpolating Polynomial A polynomial of degree 0, a constant function, interpolates one set of data If we have two sets of data, we can have an interpolating polynomial of degree 1, a linear function x x1 x x0 p(x) y0 y1 x0 x1 x1 x0 y1 y0 y0 (x x0 ) x1 x0 Review carefully if the interpolation condition is satisfied Interpolating polynomials can be written in several forms, the most well known ones are the Lagrange form and Newton form. Each has some advantages 5 Lagrange Form For a set of fixed nodes x0, x1, …, xn, the cardinal functions, l0, l1,…, ln, are defined as 0 if i j li (x j ) ij
    [Show full text]
  • NHL MEDIA DIRECTORY 2012-13 TABLE of CONTENTS Page Page NHL DIRECTORY NHL MEDIA NHL Offices
    NHL MEDIA DIRECTORY 2012-13 TABLE OF CONTENTS PAGE PAGE NHL DIRECTORY NHL MEDIA NHL Offices ...........................................3 NHL.com ...............................................9 NHL Executive .......................................4 NHL Network .......................................10 NHL Communications ............................4 NHL Studios ........................................11 NHL Green ............................................6 NHL MEDIA RESOURCES .................. 12 NHL MEMBER CLUBS Anaheim Ducks ...................................19 HOCKEY ORGANIZATIONS Boston Bruins ......................................25 Hockey Canada .................................248 Buffalo Sabres .....................................32 Hockey Hall of Fame .........................249 Calgary Flames ...................................39 NHL Alumni Association ........................7 Carolina Hurricanes .............................45 NHL Broadcasters’ Association .........252 Chicago Blackhawks ...........................51 NHL Players’ Association ....................16 Colorado Avalanche ............................56 Professional Hockey Writers’ Columbus Blue Jackets .......................64 Association ...................................251 Dallas Stars .........................................70 U.S. Hockey Hall of Fame Museum ..249 Detroit Red Wings ...............................76 USA Hockey Inc. ...............................250 Edmonton Oilers ..................................83 NHL STATISTICAL CONSULTANT Florida
    [Show full text]
  • Lagrange & Newton Interpolation
    Lagrange & Newton interpolation In this section, we shall study the polynomial interpolation in the form of Lagrange and Newton. Given a se- quence of (n +1) data points and a function f, the aim is to determine an n-th degree polynomial which interpol- ates f at these points. We shall resort to the notion of divided differences. Interpolation Given (n+1) points {(x0, y0), (x1, y1), …, (xn, yn)}, the points defined by (xi)0≤i≤n are called points of interpolation. The points defined by (yi)0≤i≤n are the values of interpolation. To interpolate a function f, the values of interpolation are defined as follows: yi = f(xi), i = 0, …, n. Lagrange interpolation polynomial The purpose here is to determine the unique polynomial of degree n, Pn which verifies Pn(xi) = f(xi), i = 0, …, n. The polynomial which meets this equality is Lagrange interpolation polynomial n Pnx=∑ l j x f x j j=0 where the lj ’s are polynomials of degree n forming a basis of Pn n x−xi x−x0 x−x j−1 x−x j 1 x−xn l j x= ∏ = ⋯ ⋯ i=0,i≠ j x j −xi x j−x0 x j−x j−1 x j−x j1 x j−xn Properties of Lagrange interpolation polynomial and Lagrange basis They are the lj polynomials which verify the following property: l x = = 1 i= j , ∀ i=0,...,n. j i ji {0 i≠ j They form a basis of the vector space Pn of polynomials of degree at most equal to n n ∑ j l j x=0 j=0 By setting: x = xi, we obtain: n n ∑ j l j xi =∑ j ji=0 ⇒ i =0 j=0 j=0 The set (lj)0≤j≤n is linearly independent and consists of n + 1 vectors.
    [Show full text]
  • Mathematical Topics
    A Mathematical Topics This chapter discusses most of the mathematical background needed for a thor­ ough understanding of the material presented in the book. It has been mentioned in the Preface, however, that math concepts which are only used once (such as the mediation operator and points vs. vectors) are discussed right where they are introduced. Do not worry too much about your difficulties in mathematics, I can assure you that mine a.re still greater. - Albert Einstein. A.I Fourier Transforms Our curves are functions of an arbitrary parameter t. For functions used in science and engineering, time is often the parameter (or the independent variable). We, therefore, say that a function g( t) is represented in the time domain. Since a typical function oscillates, we can think of it as being similar to a wave and we may try to represent it as a wave (or as a combination of waves). When this is done, we have the function G(f), where f stands for the frequency of the wave, and we say that the function is represented in the frequency domain. This turns out to be a useful concept, since many operations on functions are easy to carry out in the frequency domain. Transforming a function between the time and frequency domains is easy when the function is periodic, but it can also be done for certain non periodic functions. The present discussion is restricted to periodic functions. 1IIIt Definition: A function g( t) is periodic if (and only if) there exists a constant P such that g(t+P) = g(t) for all values of t (Figure A.la).
    [Show full text]
  • A Low‐Cost Solution to Motion Tracking Using an Array of Sonar Sensors and An
    A Low‐cost Solution to Motion Tracking Using an Array of Sonar Sensors and an Inertial Measurement Unit A thesis presented to the faculty of the Russ College of Engineering and Technology of Ohio University In partial fulfillment of the requirements for the degree Master of Science Jason S. Maxwell August 2009 © 2009 Jason S. Maxwell. All Rights Reserved. 2 This thesis titled A Low‐cost Solution to Motion Tracking Using an Array of Sonar Sensors and an Inertial Measurement Unit by JASON S. MAXWELL has been approved for the School of Electrical Engineering Computer Science and the Russ College of Engineering and Technology by Maarten Uijt de Haag Associate Professor School of Electrical Engineering and Computer Science Dennis Irwin Dean, Russ College of Engineering and Technology 3 ABSTRACT MAXWELL, JASON S., M.S., August 2009, Electrical Engineering A Low‐cost Solution to Motion Tracking Using an Array of Sonar Sensors and an Inertial Measurement Unit (91 pp.) Director of Thesis: Maarten Uijt de Haag As the desire and need for unmanned aerial vehicles (UAV) increases, so to do the navigation and system demands for the vehicles. While there are a multitude of systems currently offering solutions, each also possess inherent problems. The Global Positioning System (GPS), for instance, is potentially unable to meet the demands of vehicles that operate indoors, in heavy foliage, or in urban canyons, due to the lack of signal strength. Laser‐based systems have proven to be rather costly, and can potentially fail in areas in which the surface absorbs light, and in urban environments with glass or mirrored surfaces.
    [Show full text]
  • Chapter 3 Interpolation and Polynomial Approximation
    Chapter 3 Interpolation and Polynomial Approximation The computational procedures used in computer software for the evaluation of a li- brary function such as sin(x); cos(x), or ex, involve polynomial approximation. The state-of-the-art methods use rational functions (which are the quotients of polynomi- als). However, the theory of polynomial approximation is suitable for a first course in numerical analysis, and we consider them in this chapter. Suppose that the function f(x) = ex is to be approximated by a polynomial of degree n = 2 over the interval [¡1; 1]. The Taylor polynomial is shown in Figure 1.1(a) and can be contrasted with 2 x The Taylor polynomial p(x)=1+x+0.5x2 which approximates f(x)=ex over [−1,1] The Chebyshev approximation q(x)=1+1.129772x+0.532042x for f(x)=e over [−1,1] 3 3 2.5 2.5 y=ex 2 2 y=ex 1.5 1.5 2 1 y=1+x+0.5x 1 y=q(x) 0.5 0.5 0 0 −1 −0.8 −0.6 −0.4 −0.2 0 0.2 0.4 0.6 0.8 1 −1 −0.8 −0.6 −0.4 −0.2 0 0.2 0.4 0.6 0.8 1 Figure 1.1(a) Figure 1.1(b) Figure 3.1 (a) The Taylor polynomial p(x) = 1:000000+ 1:000000x +0:500000x2 which approximate f(x) = ex over [¡1; 1]. (b) The Chebyshev approximation q(x) = 1:000000 + 1:129772x + 0:532042x2 for f(x) = ex over [¡1; 1].
    [Show full text]
  • Anl-7826 Chinese Remainder Ind Interpolation
    ANL-7826 CHINESE REMAINDER IND INTERPOLATION ALGORITHMS John D. Lipson UolC-AUA-USAEC- ARGONNE NATIONAL LABORATORY, ARGONNE, ILLINOIS Prepared for the U.S. ATOMIC ENERGY COMMISSION under contract W-31-109-Eng-38 The facilities of Argonne National Laboratory are owned by the United States Govern­ ment. Under the terms of a contract (W-31 -109-Eng-38) between the U. S. Atomic Energy 1 Commission. Argonne Universities Association and The University of Chicago, the University employs the staff and operates the Laboratory in accordance with policies and programs formu­ lated, approved and reviewed by the Association. MEMBERS OF ARGONNE UNIVERSITIES ASSOCIATION The University of Arizona Kansas State University The Ohio State University Carnegie-Mellon University The University of Kansas Ohio University Case Western Reserve University Loyola University The Pennsylvania State University The University of Chicago Marquette University Purdue University University of Cincinnati Michigan State University Saint Louis University Illinois Institute of Technology The University of Michigan Southern Illinois University University of Illinois University of Minnesota The University of Texas at Austin Indiana University University of Missouri Washington University Iowa State University Northwestern University Wayne State University The University of Iowa University of Notre Dame The University of Wisconsin NOTICE This report was prepared as an account of work sponsored by the United States Government. Neither the United States nor the United States Atomic Energy Commission, nor any of their employees, nor any of their contractors, subcontrac­ tors, or their employees, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness or usefulness of any information, apparatus, product or process disclosed, or represents that its use would not infringe privately-owned rights.
    [Show full text]
  • Mathematics for IT Engineers
    Mathematics for IT Engineers Pál Burai Copyright c 2019 Pál Burai UNIVERSITY OF DEBRECEN WWW.UNIDEB.HU Licensed under the Creative Commons Attribution-NonCommercial 3.0 Unported License (the “License”). You may not use this file except in compliance with the License. You may obtain a copy of the License at http://creativecommons.org/licenses/by-nc/3.0. Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an “AS IS” BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. This work was supported by the construction EFOP-3.4.3-16-2016-00021. The project was sup- ported by the European Union, co-financed by the European Social Fund. Contents 1 Complex numbers .............................................5 1.1 A possible motivation introducing complex numbers5 1.2 Operations with complex numbers in algebraic form6 1.2.1 Algebraic form, real part, imaginary part..............................6 1.2.2 Graphical representation of complex numbers on the complex plane.......7 1.2.3 Addition of complex numbers in algebraic form........................8 1.2.4 Multiplication of complex numbers in algebraic form.....................9 1.2.5 Conjugate of complex numbers.................................... 12 1.3 Polar form and exponential form of complex numbers 13 1.3.1 Length and angle of complex numbers.............................. 13 1.3.2 Calculation with complex numbers in polar form....................... 18 1.3.3 Euler’s formula.................................................. 26 1.3.4 Calculation with complex numbers in exponential form................
    [Show full text]
  • NHL MEDIA DIRECTORY 2013-2014 TABLE of CONTENTS Page Page NHL DIRECTORY NHL MEDIA NHL Offices
    NHL MEDIA DIRECTORY 2013-2014 TABLE OF CONTENTS PAGE PAGE NHL DIRECTORY NHL MEDIA NHL Offices ...........................................3 NHL.com ...............................................7 NHL Executive .......................................4 NHL Network .........................................8 NHL Communications ............................4 NHL Studios ..........................................9 NHL Green ............................................6 NHL MEDIA RESOURCES ...................10 NHL MEMBER CLUBS Anaheim Ducks ...................................22 ADDITIONAL NHL INFORMATION Boston Bruins ......................................28 Critical Dates, 2013-2014 ....................12 Buffalo Sabres .....................................35 NHL Officials ........................................20 Calgary Flames ...................................42 Realignment ........................................15 Carolina Hurricanes .............................48 Playoff Format .....................................17 Chicago Blackhawks ...........................54 Schedule Format .................................16 Colorado Avalanche ............................59 HOCKEY ORGANIZATIONS Columbus Blue Jackets .......................67 Dallas Stars .........................................73 Hockey Canada .................................253 Detroit Red Wings ...............................79 Hockey Hall of Fame .........................254 Edmonton Oilers ..................................86 NHL Alumni Association ......................19
    [Show full text]