Applications in the History of Mathematics Teaching
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
The Enigmatic Number E: a History in Verse and Its Uses in the Mathematics Classroom
To appear in MAA Loci: Convergence The Enigmatic Number e: A History in Verse and Its Uses in the Mathematics Classroom Sarah Glaz Department of Mathematics University of Connecticut Storrs, CT 06269 [email protected] Introduction In this article we present a history of e in verse—an annotated poem: The Enigmatic Number e . The annotation consists of hyperlinks leading to biographies of the mathematicians appearing in the poem, and to explanations of the mathematical notions and ideas presented in the poem. The intention is to celebrate the history of this venerable number in verse, and to put the mathematical ideas connected with it in historical and artistic context. The poem may also be used by educators in any mathematics course in which the number e appears, and those are as varied as e's multifaceted history. The sections following the poem provide suggestions and resources for the use of the poem as a pedagogical tool in a variety of mathematics courses. They also place these suggestions in the context of other efforts made by educators in this direction by briefly outlining the uses of historical mathematical poems for teaching mathematics at high-school and college level. Historical Background The number e is a newcomer to the mathematical pantheon of numbers denoted by letters: it made several indirect appearances in the 17 th and 18 th centuries, and acquired its letter designation only in 1731. Our history of e starts with John Napier (1550-1617) who defined logarithms through a process called dynamical analogy [1]. Napier aimed to simplify multiplication (and in the same time also simplify division and exponentiation), by finding a model which transforms multiplication into addition. -
Pure Mathematics Professors Teaching and Leading Research CO-OP OR REGULAR 28
PURE MATHEMATICS Pure Mathematics professors teaching and leading research CO-OP OR REGULAR 28 Mathematician ranked among top 10 TOP 10 jobs from 2011-2017 – Comcast.com of grads are employed Search for a deeper 96.6% within 2 years understanding of mathematics Pure mathematics is at the foundation of all mathematical reasoning. If first-year calculus ALEX teaches you how to drive the car, Pure Mathematics teaches you how to build one. 3B, PURE MATHEMATICS AND Mathematicians know that there could be no general relativity without differential COMBINATORICS AND geometry, and no computer security without advanced number theory. OPTIMIZATION Pure Mathematics at Waterloo is a small, cohesive, and challenging program that will open countless doors for you. Our graduates have used the program as a springboard into careers WHAT DO YOU LOVE ABOUT in information technology, finance, business, science, education, and insurance, often by way PURE MATHEMATICS? The satisfaction from understanding of some of the most prestigious graduate programs in the world. an idea at a deeper level and tying together unrelated branches of ALEX’S FAVOURITE COURSES mathematics or physics for the › PMATH 320 Euclidean Geometry: This course is everything you love about Geometry: first time is the most rewarding Euclid’s axioms, isometries of the Euclidean plane and of Euclidean space, polygons, part of learning and understanding polyhedral, polytopes, and the kissing problem. mathematics. What I really enjoy is › PMATH 351 Real Analysis: It’s a very intuitive and natural approach to real analysis, and the developing a deep understanding of complexity of the course builds very naturally to the end of the semester. -
Pure Mathematics
Why Study Mathematics? Mathematics reveals hidden patterns that help us understand the world around us. Now much more than arithmetic and geometry, mathematics today is a diverse discipline that deals with data, measurements, and observations from science; with inference, deduction, and proof; and with mathematical models of natural phenomena, of human behavior, and social systems. The process of "doing" mathematics is far more than just calculation or deduction; it involves observation of patterns, testing of conjectures, and estimation of results. As a practical matter, mathematics is a science of pattern and order. Its domain is not molecules or cells, but numbers, chance, form, algorithms, and change. As a science of abstract objects, mathematics relies on logic rather than on observation as its standard of truth, yet employs observation, simulation, and even experimentation as means of discovering truth. The special role of mathematics in education is a consequence of its universal applicability. The results of mathematics--theorems and theories--are both significant and useful; the best results are also elegant and deep. Through its theorems, mathematics offers science both a foundation of truth and a standard of certainty. In addition to theorems and theories, mathematics offers distinctive modes of thought which are both versatile and powerful, including modeling, abstraction, optimization, logical analysis, inference from data, and use of symbols. Mathematics, as a major intellectual tradition, is a subject appreciated as much for its beauty as for its power. The enduring qualities of such abstract concepts as symmetry, proof, and change have been developed through 3,000 years of intellectual effort. Like language, religion, and music, mathematics is a universal part of human culture. -
B.S. in Mathematics - Pure Math Emphasis, 2020-2021
B.S. in Mathematics - Pure Math Emphasis, 2020-2021 Course Title Cr. Sched. Prerequisites Required Quantitative Lit. MATH 1210 - Calculus I 4 F/S/Su MATH 1050 & 1060 or ACT 26+ GE Course Other GE Courses are required to graduate with a Bachelor’s Degree from SUU.* MATH 1220 Calculus II 4 F/S/Su MATH 1210 MATH 2210 Calculus III 4 F/S/Su MATH 1220 MATH 2270 Linear Algebra 3 F/S/Su MATH 1220 MATH 2280 Differential Equations 3 S MATH 1220 & 2270** Math Core MATH 3120 Transition to Advanced Math 3 F/S MATH 1220 & MATH 2270 Courses MATH 3250 Complex Variables 3 S-Odd MATH 2210 MATH 3700 Probability and Statistics 4 F/S/Su MATH 1220 MATH 4220 Abstract Algebra I 3 F MATH 3120 MATH 4400 Advanced Calculus I 3 F MATH 2210 & 3120 Choose 1 MATH 4230 Abstract Algebra II 3 S-Even MATH 4220 Advanced Class MATH 4410 Advanced Calculus II 3 S-Odd MATH 4400 Choose 1 CS 1400 Fundamentals of Programming 3 F/S CSIS 1030 or MATH 1050 or Permission Program- ming Class CS 1410 Object Oriented Programming 3 F/S/Su CS 1400 MATH 3130 Modern Geometries 3 S MATH 3120 MATH 3160 Number Theory 3 F-Odd MATH 3120 MATH 3500 Actuarial Mathematics 3 S-Even MATH 1100 or MATH 1210 MATH 3600 Numerical Analysis 3 S-Even MATH 2250 or 2280 & comp. knowledge Math MATH 3770 Mathematical Modeling 3 S-Odd MATH 3700 Elective MATH 3800 Partial Differential Equations 3 F-Odd MATH 2210 and 2250 or 2280 Credits (15 total Instructor Permissission; may repeat up MATH 3990 Undergraduate Research 1-3 *** credits to 5 cr. -
Grade 6 Math Circles Fall 2019 - Oct 22/23 Exponentiation
Faculty of Mathematics Centre for Education in Waterloo, Ontario Mathematics and Computing Grade 6 Math Circles Fall 2019 - Oct 22/23 Exponentiation Multiplication is often thought as repeated addition. Exercise: Evaluate the following using multiplication. 1 + 1 + 1 + 1 + 1 = 7 + 7 + 7 + 7 + 7 + 7 = 9 + 9 + 9 + 9 = Exponentiation is repeated multiplication. Exponentiation is useful in areas like: Computers, Population Increase, Business, Sales, Medicine, Earthquakes An exponent and base looks like the following: 43 The small number written above and to the right of the number is called the . The number underneath the exponent is called the . In the example, 43, the exponent is and the base is . 4 is raised to the third power. An exponent tells us to multiply the base by itself that number of times. In the example above,4 3 = 4 × 4 × 4. Once we write out the multiplication problem, we can easily evaluate the expression. Let's do this for the example we've been working with: 43 = 4 × 4 × 4 43 = 16 × 4 43 = 64 The main reason we use exponents is because it's a shorter way to write out big numbers. For example, we can express the following long expression: 2 × 2 × 2 × 2 × 2 × 2 as2 6 since 2 is being multiplied by itself 6 times. We say 2 is raised to the 6th power. 1 Exercise: Express each of the following using an exponent. 7 × 7 × 7 = 5 × 5 × 5 × 5 × 5 × 5 = 10 × 10 × 10 × 10 = 9 × 9 = 1 × 1 × 1 × 1 × 1 = 8 × 8 × 8 = Exercise: Evaluate. -
Axiomatic Foundations of Mathematics Ryan Melton Dr
Axiomatic Foundations of Mathematics Ryan Melton Dr. Clint Richardson, Faculty Advisor Stephen F. Austin State University As Bertrand Russell once said, Gödel's Method Pure mathematics is the subject in which we Consider the expression First, Gödel assigned a unique natural number to do not know what we are talking about, or each of the logical symbols and numbers. 2 + 3 = 5 whether what we are saying is true. Russell’s statement begs from us one major This expression is mathematical; it belongs to the field For example: if the symbol '0' corresponds to we call arithmetic and is composed of basic arithmetic question: the natural number 1, '+' to 2, and '=' to 3, then symbols. '0 = 0' '0 + 0 = 0' What is Mathematics founded on? On the other hand, the sentence and '2 + 3 = 5' is an arithmetical formula. 1 3 1 1 2 1 3 1 so each expression corresponds to a sequence. Axioms and Axiom Systems is metamathematical; it is constructed outside of mathematics and labels the expression above as a Then, for this new sequence x1x2x3…xn of formula in arithmetic. An axiom is a belief taken without proof, and positive integers, we associate a Gödel number thus an axiom system is a set of beliefs as follows: x1 x2 x3 xn taken without proof. enc( x1x2x3...xn ) = 2 3 5 ... pn Since Principia Mathematica was such a bold where the encoding is the product of n factors, Consistent? Complete? leap in the right direction--although proving each of which is found by raising the j-th prime nothing about consistency--several attempts at to the xj power. -
Meta-Complex Numbers Dual Numbers
Meta- Complex Numbers Robert Andrews Complex Numbers Meta-Complex Numbers Dual Numbers Split- Complex Robert Andrews Numbers Visualizing Four- Dimensional Surfaces October 29, 2014 Table of Contents Meta- Complex Numbers Robert Andrews 1 Complex Numbers Complex Numbers Dual Numbers 2 Dual Numbers Split- Complex Numbers 3 Split-Complex Numbers Visualizing Four- Dimensional Surfaces 4 Visualizing Four-Dimensional Surfaces Table of Contents Meta- Complex Numbers Robert Andrews 1 Complex Numbers Complex Numbers Dual Numbers 2 Dual Numbers Split- Complex Numbers 3 Split-Complex Numbers Visualizing Four- Dimensional Surfaces 4 Visualizing Four-Dimensional Surfaces Quadratic Equations Meta- Complex Numbers Robert Andrews Recall that the roots of a quadratic equation Complex Numbers 2 Dual ax + bx + c = 0 Numbers Split- are given by the quadratic formula Complex Numbers p 2 Visualizing −b ± b − 4ac Four- x = Dimensional 2a Surfaces The quadratic formula gives the roots of this equation as p x = ± −1 This is a problem! There aren't any real numbers whose square is negative! Quadratic Equations Meta- Complex Numbers Robert Andrews What if we wanted to solve the equation Complex Numbers x2 + 1 = 0? Dual Numbers Split- Complex Numbers Visualizing Four- Dimensional Surfaces This is a problem! There aren't any real numbers whose square is negative! Quadratic Equations Meta- Complex Numbers Robert Andrews What if we wanted to solve the equation Complex Numbers x2 + 1 = 0? Dual Numbers The quadratic formula gives the roots of this equation as Split- -
Reihenalgebra: What Comes Beyond Exponentiation? M
Reihenalgebra: What comes beyond exponentiation? M. M¨uller, [email protected] Abstract Addition, multiplication and exponentiation are classical oper- ations, successively defined by iteration. Continuing the iteration process, one gets an infinite hierarchy of higher-order operations, the first one sometimes called tetration a... aa a b = a b terms , ↑ o followed by pentation, hexation, etc. This paper gives a survey on some ideas, definitions and methods that the author has developed as a young pupil for the German Jugend forscht science fair. It is meant to be a collection of ideas, rather than a serious formal paper. In particular, a definition for negative integer exponents b is given for all higher-order operations, and a method is proposed that gives a very natural (but non-trivial) interpolation to real (and even complex) integers b for pentation and hexation and many other operations. It is an open question if this method can also be applied to tetration. 1 Introduction Multiplication of natural numbers is nothing but repeated addition, a + a + a + ... + a = a b . (1) · b terms | {z } Iterating multiplication, one gets another operation, namely exponentiation: b a a a ... a = a =: aˆb . (2) · · · · b terms | {z } Classically, this is it, and one stops here. But what if one continues the iteration process? One could define something like aˆaˆaˆ ... ˆa = a b . ↑ b terms | {z } But, wait a minute, in contrast to eq. (1) and (6), this definition will depend on the way we set brackets, i.e. on the order of exponentiation! Thus, we have to distinguish between the two canonical possibilities aaa.. -
LARGE PRIME NUMBERS This Writeup Is Modeled Closely on A
LARGE PRIME NUMBERS This writeup is modeled closely on a writeup by Paul Garrett. See, for example, http://www-users.math.umn.edu/~garrett/crypto/overview.pdf 1. Fast Modular Exponentiation Given positive integers a, e, and n, the following algorithm quickly computes the reduced power ae % n. (Here x % n denotes the element of f0; ··· ; n − 1g that is congruent to x modulo n. Note that x % n is not an element of Z=nZ since such elements are cosets rather than coset representatives.) • (Initialize) Set (x; y; f) = (1; a; e). • (Loop) While f > 0, do as follows: { If f%2 = 0 then replace (x; y; f) by (x; y2 % n; f=2), { otherwise replace (x; y; f) by (xy % n; y; f − 1). • (Terminate) Return x. The algorithm is strikingly efficient both in speed and in space. Especially, the operations on f (halving it when it is even, decrementing it when it is odd) are very simple in binary. To see that the algorithm works, represent the exponent e in binary, say e = 2g + 2h + 2k; 0 ≤ g < h < k: The algorithm successively computes (1; a; 2g + 2h + 2k) g (1; a2 ; 1 + 2h−g + 2k−g) g g (a2 ; a2 ; 2h−g + 2k−g) g h (a2 ; a2 ; 1 + 2k−h) g h h (a2 +2 ; a2 ; 2k−h) g h k (a2 +2 ; a2 ; 1) g h k k (a2 +2 +2 ; a2 ; 0); and then it returns the first entry, which is indeed ae. Fast modular exponentiation is not only for computers. For example, to compute 237 % 149, proceed as follows, (1; 2; 37) ! (2; 2; 36) ! (2; 4; 18) ! (2; 16; 9) ! (32; 16; 8) ! (32; −42; 4) ! (32; −24; 2) ! (32; −20; 1) ! ( 105 ; −20; 0): 2. -
The Strange Properties of the Infinite Power Tower Arxiv:1908.05559V1
The strange properties of the infinite power tower An \investigative math" approach for young students Luca Moroni∗ (August 2019) Nevertheless, the fact is that there is nothing as dreamy and poetic, nothing as radical, subversive, and psychedelic, as mathematics. Paul Lockhart { \A Mathematician's Lament" Abstract In this article we investigate some "unexpected" properties of the \Infinite Power Tower 1" function (or \Tetration with infinite height"): . .. xx y = f(x) = xx where the \tower" of exponentiations has an infinite height. Apart from following an initial personal curiosity, the material collected here is also intended as a potential guide for teachers of high-school/undergraduate students interested in planning an activity of \investigative mathematics in the classroom", where the knowledge is gained through the active, creative and cooperative use of diversified mathematical tools (and some ingenuity). The activity should possibly be carried on with a laboratorial style, with no preclusions on the paths chosen and undertaken by the students and with little or no information imparted from the teacher's desk. The teacher should then act just as a guide and a facilitator. The infinite power tower proves to be particularly well suited to this kind of learning activity, as the student will have to face a challenging function defined through a rather uncommon infinite recursive process. They'll then have to find the right strategies to get around the trickiness of this function and achieve some concrete results, without the help of pre-defined procedures. The mathematical requisites to follow this path are: functions, properties of exponentials and logarithms, sequences, limits and derivatives. -
Definition of a Vector Space
i i “main” 2007/2/16 page 240 i i 240 CHAPTER 4 Vector Spaces 5. Verify the commutative law of addition for vectors in 8. Show with examples that if x is a vector in the first R4. quadrant of R2 (i.e., both coordinates of x are posi- tive) and y is a vector in the third quadrant of R2 (i.e., 6. Verify the associative law of addition for vectors in both coordinates of y are negative), then the sum x +y R4. could occur in any of the four quadrants. 7. Verify properties (4.1.5)–(4.1.8) for vectors in R3. 4.2 Definition of a Vector Space In the previous section, we showed how the set Rn of all ordered n-tuples of real num- bers, together with the addition and scalar multiplication operations defined on it, has the same algebraic properties as the familiar algebra of geometric vectors. We now push this abstraction one step further and introduce the idea of a vector space. Such an ab- straction will enable us to develop a mathematical framework for studying a broad class of linear problems, such as systems of linear equations, linear differential equations, and systems of linear differential equations, which have far-reaching applications in all areas of applied mathematics, science, and engineering. Let V be a nonempty set. For our purposes, it is useful to call the elements of V vectors and use the usual vector notation u, v,...,to denote these elements. For example, if V is the set of all 2 × 2 matrices, then the vectors in V are 2 × 2 matrices, whereas if V is the set of all positive integers, then the vectors in V are positive integers. -
Efficient Modular Exponentiation
Efficient Modular Exponentiation R. C. Daileda February 27, 2018 1 Repeated Squaring Consider the problem of finding the remainder when am is divided by n, where m and n are both is \large." If we assume that (a; n) = 1, Euler's theorem allows us to reduce m modulo '(n). But this still leaves us with some (potential) problems: 1. '(n) will still be large as well, so the reduced exponent as well as the order of a modulo n might be too big to handle by previous techniques (e.g. with a hand calculator). 2. Without knowledge of the prime factorization of n, '(n) can be very hard to compute for large n. 3. If (a; n) > 1, Euler's theorem doesn't apply so we can't necessarily reduce the exponent in any obvious way. Here we describe a procedure for finding the remainder when am is divided by n that is extremely efficient in all situations. First we provide a bit of motivation. Begin by expressing m in binary1: N X j m = bj2 ; bj 2 f0; 1g and bN = 1: j=0 Notice that N N m PN b 2j Y b 2j Y 2j b a = a j=0 j = a j = (a ) j j=0 j=0 and that 2 2 j j−1 2 j−2 2 2 a2 = a2 = a2 = ··· = a22 ··· : | {z } j squares So we can compute am by repeatedly squaring a and then multiplying together the powers for which bj = 1. If we perform these operations pairwise, reducing modulo n at each stage, we will never need to perform modular arithmetic with a number larger than n2, no matter how large m is! We make this procedure explicit in the algorithm described below.