Chap03: Arithmetic for Computers
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Computation of 2700 Billion Decimal Digits of Pi Using a Desktop Computer
Computation of 2700 billion decimal digits of Pi using a Desktop Computer Fabrice Bellard Feb 11, 2010 (4th revision) This article describes some of the methods used to get the world record of the computation of the digits of π digits using an inexpensive desktop computer. 1 Notations We assume that numbers are represented in base B with B = 264. A digit in base B is called a limb. M(n) is the time needed to multiply n limb numbers. We assume that M(Cn) is approximately CM(n), which means M(n) is mostly linear, which is the case when handling very large numbers with the Sch¨onhage-Strassen multiplication [5]. log(n) means the natural logarithm of n. log2(n) is log(n)/ log(2). SI and binary prefixes are used (i.e. 1 TB = 1012 bytes, 1 GiB = 230 bytes). 2 Evaluation of the Chudnovsky series 2.1 Introduction The digits of π were computed using the Chudnovsky series [10] ∞ 1 X (−1)n(6n)!(A + Bn) = 12 π (n!)3(3n)!C3n+3/2 n=0 with A = 13591409 B = 545140134 C = 640320 . It was evaluated with the binary splitting algorithm. The asymptotic running time is O(M(n) log(n)2) for a n limb result. It is worst than the asymptotic running time of the Arithmetic-Geometric Mean algorithms of O(M(n) log(n)) but it has better locality and many improvements can reduce its constant factor. Let S be defined as n2 n X Y pk S(n1, n2) = an . qk n=n1+1 k=n1+1 1 We define the auxiliary integers n Y2 P (n1, n2) = pk k=n1+1 n Y2 Q(n1, n2) = qk k=n1+1 T (n1, n2) = S(n1, n2)Q(n1, n2). -
Course Notes 1 1.1 Algorithms: Arithmetic
CS 125 Course Notes 1 Fall 2016 Welcome to CS 125, a course on algorithms and computational complexity. First, what do these terms means? An algorithm is a recipe or a well-defined procedure for performing a calculation, or in general, for transform- ing some input into a desired output. In this course we will ask a number of basic questions about algorithms: • Does the algorithm halt? • Is it correct? That is, does the algorithm’s output always satisfy the input to output specification that we desire? • Is it efficient? Efficiency could be measured in more than one way. For example, what is the running time of the algorithm? What is its memory consumption? Meanwhile, computational complexity theory focuses on classification of problems according to the com- putational resources they require (time, memory, randomness, parallelism, etc.) in various computational models. Computational complexity theory asks questions such as • Is the class of problems that can be solved time-efficiently with a deterministic algorithm exactly the same as the class that can be solved time-efficiently with a randomized algorithm? • For a given class of problems, is there a “complete” problem for the class such that solving that one problem efficiently implies solving all problems in the class efficiently? • Can every problem with a time-efficient algorithmic solution also be solved with extremely little additional memory (beyond the memory required to store the problem input)? 1.1 Algorithms: arithmetic Some algorithms very familiar to us all are those those for adding and multiplying integers. We all know the grade school algorithm for addition from kindergarten: write the two numbers on top of each other, then add digits right 1-1 1-2 1 7 8 × 2 1 3 5 3 4 1 7 8 +3 5 6 3 7 914 Figure 1.1: Grade school multiplication. -
A Scalable System-On-A-Chip Architecture for Prime Number Validation
A SCALABLE SYSTEM-ON-A-CHIP ARCHITECTURE FOR PRIME NUMBER VALIDATION Ray C.C. Cheung and Ashley Brown Department of Computing, Imperial College London, United Kingdom Abstract This paper presents a scalable SoC architecture for prime number validation which targets reconfigurable hardware This paper presents a scalable SoC architecture for prime such as FPGAs. In particular, users are allowed to se- number validation which targets reconfigurable hardware. lect predefined scalable or non-scalable modular opera- The primality test is crucial for security systems, especially tors for their designs [4]. Our main contributions in- for most public-key schemes. The Rabin-Miller Strong clude: (1) Parallel designs for Montgomery modular arith- Pseudoprime Test has been mapped into hardware, which metic operations (Section 3). (2) A scalable design method makes use of a circuit for computing Montgomery modu- for mapping the Rabin-Miller Strong Pseudoprime Test lar exponentiation to further speed up the validation and to into hardware (Section 4). (3) An architecture of RAM- reduce the hardware cost. A design generator has been de- based Radix-2 Scalable Montgomery multiplier (Section veloped to generate a variety of scalable and non-scalable 4). (4) A design generator for producing hardware prime Montgomery multipliers based on user-defined parameters. number validators based on user-specified parameters (Sec- The performance and resource usage of our designs, im- tion 5). (5) Implementation of the proposed hardware ar- plemented in Xilinx reconfigurable devices, have been ex- chitectures in FPGAs, with an evaluation of its effective- plored using the embedded PowerPC processor and the soft ness compared with different size and speed tradeoffs (Sec- MicroBlaze processor. -
The Division Algorithm We All Learned Division with Remainder At
The Division Algorithm We all learned division with remainder at elementary school. Like 14 divided by 3 has reainder 2:14 3 4 2. In general we have the following Division Algorithm. Let n be any integer and d 0 be a positive integer. Then you can divide n by d with remainder. That is n q d r,0 ≤ r d where q and r are uniquely determined. Given n we determine how often d goes evenly into n. Say, if n 16 and d 3 then 3 goes 5 times into 16 but there is a remainder 1 : 16 5 3 1. This works for non-negative numbers. If n −16 then in order to get a positive remainder, we have to go beyond −16 : −16 −63 2. Let a and b be integers. Then we say that b divides a if there is an integer c such that a b c. We write b|a for b divides a Examples: n|0 for every n :0 n 0; in particular 0|0. 1|n for every n : n 1 n Theorem. Let a,b,c be any integers. (a) If a|b, and a|cthena|b c (b) If a|b then a|b c for any c. (c) If a|b and b|c then a|c. (d) If a|b and a|c then a|m b n c for any integers m and n. Proof. For (a) we note that b a s and c a t therefore b c a s a t a s t.Thus a b c. -
Version 0.5.1 of 5 March 2010
Modern Computer Arithmetic Richard P. Brent and Paul Zimmermann Version 0.5.1 of 5 March 2010 iii Copyright c 2003-2010 Richard P. Brent and Paul Zimmermann ° This electronic version is distributed under the terms and conditions of the Creative Commons license “Attribution-Noncommercial-No Derivative Works 3.0”. You are free to copy, distribute and transmit this book under the following conditions: Attribution. You must attribute the work in the manner specified by the • author or licensor (but not in any way that suggests that they endorse you or your use of the work). Noncommercial. You may not use this work for commercial purposes. • No Derivative Works. You may not alter, transform, or build upon this • work. For any reuse or distribution, you must make clear to others the license terms of this work. The best way to do this is with a link to the web page below. Any of the above conditions can be waived if you get permission from the copyright holder. Nothing in this license impairs or restricts the author’s moral rights. For more information about the license, visit http://creativecommons.org/licenses/by-nc-nd/3.0/ Contents Preface page ix Acknowledgements xi Notation xiii 1 Integer Arithmetic 1 1.1 Representation and Notations 1 1.2 Addition and Subtraction 2 1.3 Multiplication 3 1.3.1 Naive Multiplication 4 1.3.2 Karatsuba’s Algorithm 5 1.3.3 Toom-Cook Multiplication 6 1.3.4 Use of the Fast Fourier Transform (FFT) 8 1.3.5 Unbalanced Multiplication 8 1.3.6 Squaring 11 1.3.7 Multiplication by a Constant 13 1.4 Division 14 1.4.1 Naive -
Primality Testing for Beginners
STUDENT MATHEMATICAL LIBRARY Volume 70 Primality Testing for Beginners Lasse Rempe-Gillen Rebecca Waldecker http://dx.doi.org/10.1090/stml/070 Primality Testing for Beginners STUDENT MATHEMATICAL LIBRARY Volume 70 Primality Testing for Beginners Lasse Rempe-Gillen Rebecca Waldecker American Mathematical Society Providence, Rhode Island Editorial Board Satyan L. Devadoss John Stillwell Gerald B. Folland (Chair) Serge Tabachnikov The cover illustration is a variant of the Sieve of Eratosthenes (Sec- tion 1.5), showing the integers from 1 to 2704 colored by the number of their prime factors, including repeats. The illustration was created us- ing MATLAB. The back cover shows a phase plot of the Riemann zeta function (see Appendix A), which appears courtesy of Elias Wegert (www.visual.wegert.com). 2010 Mathematics Subject Classification. Primary 11-01, 11-02, 11Axx, 11Y11, 11Y16. For additional information and updates on this book, visit www.ams.org/bookpages/stml-70 Library of Congress Cataloging-in-Publication Data Rempe-Gillen, Lasse, 1978– author. [Primzahltests f¨ur Einsteiger. English] Primality testing for beginners / Lasse Rempe-Gillen, Rebecca Waldecker. pages cm. — (Student mathematical library ; volume 70) Translation of: Primzahltests f¨ur Einsteiger : Zahlentheorie - Algorithmik - Kryptographie. Includes bibliographical references and index. ISBN 978-0-8218-9883-3 (alk. paper) 1. Number theory. I. Waldecker, Rebecca, 1979– author. II. Title. QA241.R45813 2014 512.72—dc23 2013032423 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. -
1 Multiplication
CS 140 Class Notes 1 1 Multiplication Consider two unsigned binary numb ers X and Y . Wewanttomultiply these numb ers. The basic algorithm is similar to the one used in multiplying the numb ers on p encil and pap er. The main op erations involved are shift and add. Recall that the `p encil-and-pap er' algorithm is inecient in that each pro duct term obtained bymultiplying each bit of the multiplier to the multiplicand has to b e saved till all such pro duct terms are obtained. In machine implementations, it is desirable to add all such pro duct terms to form the partial product. Also, instead of shifting the pro duct terms to the left, the partial pro duct is shifted to the right b efore the addition takes place. In other words, if P is the partial pro duct i after i steps and if Y is the multiplicand and X is the multiplier, then P P + x Y i i j and 1 P P 2 i+1 i and the pro cess rep eats. Note that the multiplication of signed magnitude numb ers require a straight forward extension of the unsigned case. The magnitude part of the pro duct can b e computed just as in the unsigned magnitude case. The sign p of the pro duct P is computed from the signs of X and Y as 0 p x y 0 0 0 1.1 Two's complement Multiplication - Rob ertson's Algorithm Consider the case that we want to multiply two 8 bit numb ers X = x x :::x and Y = y y :::y . -
Lesson 8: the Long Division Algorithm
NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 8 8•7 Lesson 8: The Long Division Algorithm Student Outcomes . Students explore a variation of the long division algorithm. Students discover that every rational number has a repeating decimal expansion. Lesson Notes In this lesson, students move toward being able to define an irrational number by first noting the decimal structure of rational numbers. Classwork Example 1 (5 minutes) Scaffolding: There is no single long division Example 1 algorithm. The algorithm commonly taught and used in ퟐퟔ Show that the decimal expansion of is ퟔ. ퟓ. the U.S. is rarely used ퟒ elsewhere. Students may come with earlier experiences Use the example with students so they have a model to complete Exercises 1–5. with other division algorithms that make more sense to them. 26 . Show that the decimal expansion of is 6.5. Consider using formative 4 assessment to determine how Students might use the long division algorithm, or they might simply different students approach 26 13 observe = = 6.5. long division. 4 2 . Here is another way to see this: What is the greatest number of groups of 4 that are in 26? MP.3 There are 6 groups of 4 in 26. Is there a remainder? Yes, there are 2 left over. This means we can write 26 as 26 = 6 × 4 + 2. Lesson 8: The Long Division Algorithm 104 This work is derived from Eureka Math ™ and licensed by Great Minds. ©2015 Great Minds. eureka-math.org This work is licensed under a This file derived from G8-M7-TE-1.3.0-10.2015 Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. -
Divide-And-Conquer Algorithms
Chapter 2 Divide-and-conquer algorithms The divide-and-conquer strategy solves a problem by: 1. Breaking it into subproblems that are themselves smaller instances of the same type of problem 2. Recursively solving these subproblems 3. Appropriately combining their answers The real work is done piecemeal, in three different places: in the partitioning of problems into subproblems; at the very tail end of the recursion, when the subproblems are so small that they are solved outright; and in the gluing together of partial answers. These are held together and coordinated by the algorithm's core recursive structure. As an introductory example, we'll see how this technique yields a new algorithm for multi- plying numbers, one that is much more efficient than the method we all learned in elementary school! 2.1 Multiplication The mathematician Carl Friedrich Gauss (1777–1855) once noticed that although the product of two complex numbers (a + bi)(c + di) = ac bd + (bc + ad)i − seems to involve four real-number multiplications, it can in fact be done with just three: ac, bd, and (a + b)(c + d), since bc + ad = (a + b)(c + d) ac bd: − − In our big-O way of thinking, reducing the number of multiplications from four to three seems wasted ingenuity. But this modest improvement becomes very significant when applied recur- sively. 55 56 Algorithms Let's move away from complex numbers and see how this helps with regular multiplica- tion. Suppose x and y are two n-bit integers, and assume for convenience that n is a power of 2 (the more general case is hardly any different). -
Long Division
Long Division Short description: Learn how to use long division to divide large numbers in this Math Shorts video. Long description: In this video, learn how to use long division to divide large numbers. In the accompanying classroom activity, students learn how to use the standard long division algorithm. They explore alternative ways of thinking about long division by using place value to decompose three-digit numbers into hundreds, tens, and ones, creating three smaller (and less complex) division problems. Students then use these different solution methods in a short partner game. Activity Text Learning Outcomes Students will be able to ● use multiple methods to solve a long division problem Common Core State Standards: 6.NS.B.2 Vocabulary: Division, algorithm, quotients, decompose, place value, dividend, divisor Materials: Number cubes Procedure 1. Introduction (10 minutes, whole group) Begin class by posing the division problem 245 ÷ 5. But instead of showing students the standard long division algorithm, rewrite 245 as 200 + 40 + 5 and have students try to solve each of the simpler problems 200 ÷ 5, 40 ÷ 5, and 5 ÷ 5. Record the different quotients as students solve the problems. Show them that the quotients 40, 8, and 1 add up to 49—and that 49 is also the quotient of 245 ÷ 5. Learning to decompose numbers by using place value concepts is an important piece of thinking flexibly about the four basic operations. Repeat this type of logic with the problem that students will see in the video: 283 ÷ 3. Use the concept of place value to rewrite 283 as 200 + 80 + 3 and have students try to solve the simpler problems 200 ÷ 3, 80 ÷ 3, and 3 ÷ 3. -
"In-Situ": a Case Study of the Long Division Algorithm
Australian Journal of Teacher Education Volume 43 | Issue 3 Article 1 2018 Teacher Knowledge and Learning In-situ: A Case Study of the Long Division Algorithm Shikha Takker Homi Bhabha Centre for Science Education, TIFR, India, [email protected] K. Subramaniam Homi Bhabha Centre for Science Education, TIFR, India, [email protected] Recommended Citation Takker, S., & Subramaniam, K. (2018). Teacher Knowledge and Learning In-situ: A Case Study of the Long Division Algorithm. Australian Journal of Teacher Education, 43(3). Retrieved from http://ro.ecu.edu.au/ajte/vol43/iss3/1 This Journal Article is posted at Research Online. http://ro.ecu.edu.au/ajte/vol43/iss3/1 Australian Journal of Teacher Education Teacher Knowledge and Learning In-situ: A Case Study of the Long Division Algorithm Shikha Takker K. Subramaniam Homi Bhabha Centre for Science Education, TIFR, Mumbai, India Abstract: The aim of the study reported in this paper was to explore and enhance experienced school mathematics teachers’ knowledge of students’ thinking, as it is manifested in practice. Data were collected from records of classroom observations, interviews with participating teachers, and weekly teacher-researcher meetings organized in the school. In this paper, we discuss the mathematical challenges faced by a primary school teacher as she attempts to unpack the structure of the division algorithm, while teaching in a Grade 4 classroom. Through this case study, we exemplify how a focus on mathematical knowledge for teaching ‘in situ’ helped in triggering a change in the teacher’s well-formed knowledge and beliefs about the teaching and learning of the division algorithm, and related students’ capabilities. -
16. the Division Algorithm Note That If F(X) = G(X)H(X) Then Α Is a Zero of F(X) If and Only If Α Is a Zero of One of G(X) Or H(X)
16. The division algorithm Note that if f(x) = g(x)h(x) then α is a zero of f(x) if and only if α is a zero of one of g(x) or h(x). It is very useful therefore to write f(x) as a product of polynomials. What we need to understand is how to divide polynomials: Theorem 16.1 (Division Algorithm). Let n n−1 X i f(x) = anx + an−1x + ··· + a1x + a0 = aix m m−1 X i g(x) = bmx + bm−1x + ··· + b1x + b0 = bix be two polynomials over a field F of degrees n and m > 0. Then there are unique polynomials q(x) and r(x) 2 F [x] such that f(x) = q(x)g(x) + r(x) and either r(x) = 0 or the degree of r(x) is less than the degree m of g(x). Proof. We proceed by induction on the degree n of f(x). If the degree n of f(x) is less than the degree m of g(x), there is nothing to prove, take q(x) = 0 and r(x) = f(x). Suppose the result holds for all degrees less than the degree n of f(x). n−m Put q0(x) = cx , where c = an=bm. Let f1(x) = f(x) − q1(x)g(x). Then f1(x) has degree less than g. By induction then, f1(x) = q1(x)g(x) + r(x); where r(x) has degree less than g(x). It follows that f(x) = f1(x) + q0(x)f(x) = (q0(x) + q1(x))f(x) + r(x) = q(x)f(x) + r(x); where q(x) = q0(x) + q1(x).