Numerical Expressions and Factors 2 ACTIVITY: Checking Answers Math Work with a Partner
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Black Hills State University
Black Hills State University MATH 341 Concepts addressed: Mathematics Number sense and numeration: meaning and use of numbers; the standard algorithms of the four basic operations; appropriate computation strategies and reasonableness of results; methods of mathematical investigation; number patterns; place value; equivalence; factors and multiples; ratio, proportion, percent; representations; calculator strategies; and number lines Students will be able to demonstrate proficiency in utilizing the traditional algorithms for the four basic operations and to analyze non-traditional student-generated algorithms to perform these calculations. Students will be able to use non-decimal bases and a variety of numeration systems, such as Mayan, Roman, etc, to perform routine calculations. Students will be able to identify prime and composite numbers, compute the prime factorization of a composite number, determine whether a given number is prime or composite, and classify the counting numbers from 1 to 200 into prime or composite using the Sieve of Eratosthenes. A prime number is a number with exactly two factors. For example, 13 is a prime number because its only factors are 1 and itself. A composite number has more than two factors. For example, the number 6 is composite because its factors are 1,2,3, and 6. To determine if a larger number is prime, try all prime numbers less than the square root of the number. If any of those primes divide the original number, then the number is prime; otherwise, the number is composite. The number 1 is neither prime nor composite. It is not prime because it does not have two factors. It is not composite because, otherwise, it would nullify the Fundamental Theorem of Arithmetic, which states that every composite number has a unique prime factorization. -
VECTOR ALGEBRAIC THEORY of ARITHMETIC: Part 2
7/25/13 VECTOR ALGEBRAIC THEORY OF ARITHMETIC: Part 2 VECTOR ALGEBRAIC THEORY OF ARITHMETIC: Part 2 Clyde L. Greeno The American Institute for the Improvement of MAthematics LEarning and Instruction (a.k.a. The MALEI Mathematics Institute) P.O. Box 54845 Tulsa, OK 74154 [email protected] ABSTRACT: Virtually unrecognized by curricular educators is that the theory of Arabic/base-number arithmetic relies on equivalence classes of whole-scalar vectors. Sooner or later the recognition will catalyze a major re-formation of scholastic curricular mathematics – and also of the mathematics education of all teachers of mathematics. Part 1 of this survey appears in the 2005 Proceedings of the MAA’s OK-AR Section Meeting. It sketches the vector-algebraic foundations of the Hindu-Arabic arithmetic for whole-number calculations – and that theory easily generalizes to include all base-number systems. As promised in Part 1, this Part 2 sequel outlines that theory’s extension to cover the whole-scalar vector arithmetic of fractions – which includes the arithmetics of finite decimal-points and of all other n-al points. Of course, the extension to infinite-dimensional whole-scalar vectors leads off to the n-al arithmetics for the reals. SUMMARY OF PART 1. Part 1 opened with an alphabetic construction of the Peano line of simple Arabic digit-strings – devoid of any reference to numbers – and extended that construction to achieve an Arabic numbers kind of whole-numbers system. Part 1 concluded by disclosing how the whole-scalars, vector-algebraic structure which underlies the Arabic arithmetic for whole numbers can serve as a mathematical basis for greatly improving the instructional effectiveness of curricular education in the arithmetic of whole numbers. -
Mathematics Standards Review and Revision Committee
Proposed for SBE Adoption – 2019-12-31 – Page 1 Mathematics Standards Review and Revision Committee Chairperson Joanie Funderburk President Colorado Council of Teachers of Mathematics Members Lisa Bejarano Lanny Hass Teacher Principal Aspen Valley High School Thompson Valley High School Academy District 20 Thompson School District Michael Brom Ken Jensen Assessment and Accountability Teacher on Mathematics Instructional Coach Special Assignment Aurora Public Schools Lewis-Palmer School District 38 Lisa Rogers Ann Conaway Student Achievement Coordinator Teacher Fountain-Fort Carson School District 8 Palisade High School Mesa County Valley School District 51 David Sawtelle K-12 Mathematics Specialist Dennis DeBay Colorado Springs School District 11 Mathematics Education Faculty University of Colorado Denver T. Vail Shoultz-McCole Early Childhood Program Director Greg George Colorado Mesa University K-12 Mathematics Coordinator St. Vrain Valley School District Ann Summers K-12 Mathematics and Intervention Specialist Cassie Harrelson Littleton Public Schools Director of Professional Practice Colorado Education Association This document was updated in December 2019 to reflect typographic and other corrections made to Standards Online. State Board of Education and Colorado Department of Education Colorado State Board of Education CDE Standards and Instructional Support Office Angelika Schroeder (D, Chair) 2nd Congressional District Karol Gates Boulder Director Joyce Rankin (R, Vice Chair) Carla Aguilar, Ph.D. 3rd Congressional District Music Content Specialist Carbondale Ariana Antonio Steve Durham (R) Standards Project Manager 5th Congressional District Colorado Springs Joanna Bruno, Ph.D. Science Content Specialist Valentina (Val) Flores (D) 1st Congressional District Lourdes (Lulu) Buck Denver World Languages Content Specialist Jane Goff (D) Donna Goodwin, Ph.D. 7th Congressional District Visual Arts Content Specialist Arvada Stephanie Hartman, Ph.D. -
The Least Common Multiple of a Quadratic Sequence
The least common multiple of a quadratic sequence Javier Cilleruelo Abstract For any irreducible quadratic polynomial f(x) in Z[x] we obtain the estimate log l.c.m. (f(1); : : : ; f(n)) = n log n + Bn + o(n) where B is a constant depending on f. 1. Introduction The problem of estimating the least common multiple of the ¯rstPn positive integers was ¯rst investigated by Chebyshev [Che52] when he introduced the function ª(n) = pm6n log p = log l.c.m.(1; : : : ; n) in his study on the distribution of prime numbers. The prime number theorem asserts that ª(n) » n, so the asymptotic estimate log l.c.m.(1; : : : ; n) » n is equivalent to the prime number theorem. The analogous asymptotic estimate for any linear polynomial f(x) = ax + b is also known [Bat02] and it is a consequence of the prime number theorem for arithmetic progressions: q X 1 log l.c.m.(f(1); : : : ; f(n)) » n ; (1) Á(q) k 16k6q (k;q)=1 where q = a=(a; b). We address here the problem of estimating log l.c.m.(f(1); : : : ; f(n)) when f is an irreducible quadratic polynomial in Z[x]. When f is a reducible quadratic polynomial the asymptotic estimate is similar to that we obtain for linear polynomials. This case is studied in section x4 with considerably less e®ort than the irreducible case. We state our main theorem. Theorem 1. For any irreducible quadratic polynomial f(x) = ax2 + bx + c in Z[x] we have log l.c.m. -
Eureka Math™ Tips for Parents Module 2
Grade 6 Eureka Math™ Tips for Parents Module 2 The chart below shows the relationships between various fractions and may be a great Key Words tool for your child throughout this module. Greatest Common Factor In this 19-lesson module, students complete The greatest common factor of two whole numbers (not both zero) is the their understanding of the four operations as they study division of whole numbers, division greatest whole number that is a by a fraction, division of decimals and factor of each number. For operations on multi-digit decimals. This example, the GCF of 24 and 36 is 12 expanded understanding serves to complete because when all of the factors of their study of the four operations with positive 24 and 36 are listed, the largest rational numbers, preparing students for factor they share is 12. understanding, locating, and ordering negative rational numbers and working with algebraic Least Common Multiple expressions. The least common multiple of two whole numbers is the least whole number greater than zero that is a What Came Before this Module: multiple of each number. For Below is an example of how a fraction bar model can be used to represent the Students added, subtracted, and example, the LCM of 4 and 6 is 12 quotient in a division problem. multiplied fractions and decimals (to because when the multiples of 4 and the hundredths place). They divided a 6 are listed, the smallest or first unit fraction by a non-zero whole multiple they share is 12. number as well as divided a whole number by a unit fraction. -
Map Math Instruction Sheet
Converting Units � � � from to do this Examples � � � milimeters meters 1,000mm = 1m An expanded mm m divide by 1000 4,321mm = 4.321m � � meters milimeters 1m = 1,000mm � tutorial on using m mm multiply by 1000 4.3m = 4,300mm map math � meters kilometers 1,000m = 1km � divide by 1000 � is available at m km 4,300m = 4.3km kilometers meters 1km = 1,000m � www.MapTools.com multiply by 1000 � km m 4.3km = 4,300m � inches feet 12 in. = 1 ft. � in. ft. divide by 12 48 in. = 4 ft. � � feet inches multiply by 12 1 ft. = 12 in. � ft. in. 4 ft. = 48 in. � � Map scales feet miles 5,280 ft. = 1 mi. ft. mi. divide by 5280 7,392 ft. = 1.4 mi. � grid tools, rulers, � � miles feet 1 mi. = 5,280 ft. and other tools mi. ft. multiply by 5280 1.4 mi. = 7,392 ft. � � for measuring inches milimeters 1 in. = 24.5mm � multiply by 24.5 map coordinates in. mm 12 in. = 294mm � � milimeters inches divide by 24.5 24.5mm = 1 in. � are available mm in. 294mm = 12 in. miles kilometers multiply by 1 mi. = 1.6093km � � mi. km 1.6093 5 mi. = 8.0465km kilometers miles divide by 1.6093 1.6093km = 1 mi. � km mi. 1km = 0.6213 mi. � Check with your Map Distance v.s. Terrain Distance � � local map store or visit Distances measured on a map assume a flat surface and do not account or the Map Math � additional distance introduced as you climb up and down over the terrain. -
Hardin Middle School Math Cheat Sheets
Name: __________________________________________ 7th Grade Math Teacher: ______________________________ 8th Grade Math Teacher: ______________________________ Hardin Middle School Math Cheat Sheets You will be given only one of these books. If you lose the book, it will cost $5 to replace it. Compiled by Shirk &Harrigan - Updated May 2013 Alphabetized Topics Pages Pages Area 32 Place Value 9, 10 Circumference 32 Properties 12 22, 23, Comparing 23, 26 Proportions 24, 25, 26 Pythagorean Congruent Figures 35 36 Theorem 14, 15, 41 Converting 23 R.A.C.E. Divisibility Rules 8 Range 11 37, 38, 25 Equations 39 Rates Flow Charts Ratios 25, 26 32, 33, 10 Formulas 34 Rounding 18, 19, 20, 21, 35 Fractions 22, 23, Scale Factor 24 Geometric Figures 30, 31 Similar Figures 35 Greatest Common 22 Slide Method 22 Factor (GF or GCD) Inequalities 40 Substitution 29 Integers 18, 19 Surface Area 33 Ladder Method 22 Symbols 5 Least Common Multiple 22 Triangles 30, 36 (LCM or LCD) Mean 11 Variables 29 Median 11 Vocabulary Words 43 Mode 11 Volume 34 Multiplication Table 6 Word Problems 41, 42 Order of 16, 17 Operations 23, 24, Percent 25, 26 Perimeter 32 Table of Contents Pages Cheat Sheets 5 – 42 Math Symbols 5 Multiplication Table 6 Types of Numbers 7 Divisibility Rules 8 Place Value 9 Rounding & Comparing 10 Measures of Central Tendency 11 Properties 12 Coordinate Graphing 13 Measurement Conversions 14 Metric Conversions 15 Order of Operations 16 – 17 Integers 18 – 19 Fraction Operations 20 – 21 Ladder/Slide Method 22 Converting Fractions, Decimals, & 23 Percents Cross Products 24 Ratios, Rates, & Proportions 25 Comparing with Ratios, Percents, 26 and Proportions Solving Percent Problems 27 – 28 Substitution & Variables 29 Geometric Figures 30 – 31 Area, Perimeter, Circumference 32 Surface Area 33 Volume 34 Congruent & Similar Figures 35 Pythagorean Theorem 36 Hands-On-Equation 37 Understanding Flow Charts 38 Solving Equations Mathematically 39 Inequalities 40 R.A.C.E. -
Fundamental Arithmetic
FUNDAMENTAL ARITHMETIC Prime Numbers Prime numbers are any whole numbers greater than 1 that can only be divided by 1 and itself. Below is the list of all prime numbers between 1 and 100: 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 Prime Factorization Prime factorization is the process of changing non-prime (composite) numbers into a product of prime numbers. Below is the prime factorization of all numbers between 1 and 20. 1 is unique 6 = 2 ∙ 3 11 is prime 16 = 2 ∙ 2 ∙ 2 ∙ 2 2 is prime 7 is prime 12 = 2 ∙ 2 ∙ 3 17 is prime 3 is prime 8 = 2 ∙ 2 ∙ 2 13 is prime 18 = 2 ∙ 3 ∙ 3 4 = 2 ∙ 2 9 = 3 ∙ 3 14 = 2 ∙ 7 19 is prime 5 is prime 10 = 2 ∙ 5 15 = 3 ∙ 5 20 = 2 ∙ 2 ∙ 5 Divisibility By using these divisibility rules, you can easily test if one number can be evenly divided by another. A Number is Divisible By: If: Examples 2 The last digit is 5836 divisible by two 583 ퟔ ퟔ ÷ 2 = 3, Yes 3 The sum of the digits is 1725 divisible by three 1 + 7 + 2 + 5 = ퟏퟓ ퟏퟓ ÷ 3 = 5, Yes 5 The last digit ends 885 in a five or zero 88 ퟓ The last digit ends in a five, Yes 10 The last digit ends 7390 in a zero 739 ퟎ The last digit ends in a zero, Yes Exponents An exponent of a number says how many times to multiply the base number to itself. -
3Understanding Addition and Subtraction
Understanding Addition 3 and Subtraction Copyright © Cengage Learning. All rights reserved. SECTION Understanding Addition and 3.3 Subtraction of Fractions Copyright © Cengage Learning. All rights reserved. What do you think? • Why do we need a common denominator to add (or subtract) two fractions ? • What pictorial representations can we use for addition and subtraction with fractions? 3 Understanding Addition and Subtraction of Fractions There are many algorithms that enable us to manipulate fractions quickly : I is simply not enough for an elementary teacher to know how to compute. It is crucial that the teacher also know the whys behind the hows and can use a variety of representations to explain them. 4 Investigation 3.3a – Using Fraction Models to Understand Addition of Fractions Using the area model, the length model, or the set model, determine the sum of and then explain why we need to find a common denominator in order to add fractions. 5 Investigation 3.3a – Discussion This is an excellent place to demonstrate the role of manipulatives. Using pattern blocks How might you use pattern blocks to add and (see Figure 3.8)? Figure 3.8 6 Investigation 3.3a – Discussion continued If we let the hexagon represent 1, then the trapezoid is the parallelogram is and the triangle is Using the notion of addition as combining, we can combine the two, and we have We could be humorous and say that parallelogram + trapezoid = baby carriage! The key question , though, is to determine the value of this amount . The solution lies in realizing that to name an amount with a fraction, we must have equal - size parts. -
Greatest Common Divisor and Least Common Multiple
Greatest Common Divisor and Least Common Multiple Document #: WG21 N3845 Date: 2014-01-01 Revises: None Project: JTC1.22.32 Programming Language C++ Reply to: Walter E. Brown <[email protected]> Contents 1 Introduction ............. 1 4 Acknowledgments .......... 3 2 Implementation ........... 2 5 Bibliography ............. 4 3 Proposed wording .......... 3 6 Document history .......... 4 Abstract This paper proposes two frequently-used classical numeric algorithms, gcd and lcm, for header <cstdlib>. The former calculates the greatest common divisor of two integer values, while the latter calculates their least common multiple. Both functions are already typically provided in behind-the-scenes support of the standard library’s <ratio> and <chrono> headers. Die ganze Zahl schuf der liebe Gott, alles Übrige ist Menschenwerk. (Integers are dear God’s achievement; all else is work of mankind.) —LEOPOLD KRONECKER 1 Introduction 1.1 Greatest common divisor The greatest common divisor of two (or more) integers is also known as the greatest or highest common factor. It is defined as the largest of those positive factors1 shared by (common to) each of the given integers. When all given integers are zero, the greatest common divisor is typically not defined. Algorithms for calculating the gcd have been known since at least the time of Euclid.2 Some version of a gcd algorithm is typically taught to schoolchildren when they learn fractions. However, the algorithm has considerably wider applicability. For example, Wikipedia states that gcd “is a key element of the RSA algorithm, a public-key encryption method widely used in electronic commerce.”3 Note that the standard library’s <ratio> header already requires gcd’s use behind the scenes; see [ratio.ratio]: Copyright c 2014 by Walter E. -
New Results on the Least Common Multiple of Consecutive Integers
New results on the least common multiple of consecutive integers Bakir FARHI and Daniel KANE Département de Mathématiques, Université du Maine, Avenue Olivier Messiaen, 72085 Le Mans Cedex 9, France. [email protected] Harvard University, Department of Mathematics 1 Oxford Street, Cambridge MA 02139, USA. [email protected] Abstract When studying the least common multiple of some nite sequences of integers, the rst author introduced the interesting arithmetic functions , dened by n(n+1):::(n+k) . He gk (k 2 N) gk(n) := lcm(n;n+1;:::;n+k) (8n 2 N n f0g) proved that is periodic and is a period of . He raised gk (k 2 N) k! gk the open problem consisting to determine the smallest positive period Pk of gk. Very recently, S. Hong and Y. Yang have improved the period k! of gk to lcm(1; 2; : : : ; k). In addition, they have conjectured that Pk is always a multiple of the positive integer lcm(1;2;:::;k;k+1) . An immediate k+1 consequence of this conjecture states that if (k+1) is prime then the exact period of gk is precisely equal to lcm(1; 2; : : : ; k). In this paper, we rst prove the conjecture of S. Hong and Y. Yang and then we give the exact value of . We deduce, as a corollary, Pk (k 2 N) that Pk is equal to the part of lcm(1; 2; : : : ; k) not divisible by some prime. MSC: 11A05 Keywords: Least common multiple; arithmetic function; exact period. 1 Introduction Throughout this paper, we let N∗ denote the set N n f0g of positive integers. -
Exploring Least Common Multiples and Divisibility Through Visual Art
Bridges 2019 Conference Proceedings Divisible Skylines: Exploring Least Common Multiples and Divisibility through Visual Art Saara Lehto1, Anne-Maria Ernvall-Hytönen2, and Tommi Sottinen3 1Dept. of Mathematics and Statistics, University of Helsinki, Finland; saara.lehto@helsinki.fi 2Mathematics and Statistics, Åbo Akademi University, Finland; aernvall@abo.fi 3School of Technology and Innovations, University of Vaasa, Finland; tommi.sottinen@iki.fi Abstract We present an alternative way to consider number theoretic concepts through visual art. Our visualization method, Divisible Skylines, is an artistically motivated study of least common multiples. It demonstrates how beauty and mathematical understanding can join hands in the study of divisibility. We present original artwork based on our method, examine mathematical properties of Divisible Skylines through the artwork, and point out several artisti- cally interesting visual aspects. Our method opens possibilities for developing playful and creative ways to teach divisibility and number theory. Divisible Skylines offer interest for artists, educators and students alike. Introduction The basis of this paper is the artwork Divisible Dreams by Saara Lehto (Figure1). The creative process behind this work entwines mathematics and visual art in a natural and intriguing way. Divisibility has previously been embodied with rhythms [3], but not many visual representations can be found. We present a visualization method that is both mathematically illustrative and artistically pleasing. Figure 1: Divisible Dreams by Saara Lehto, 2019 335 Lehto, Ernvall-Hytönen, and Sottinen In the heart of Divisible Dreams is a visualization method designed for finding least common multiples. In this paper we will explain this method and discover how number theoretic concepts and artistically interesting questions intertwine in the exploration of the artwork.