DOCSLIB.ORG

A Glossary for IWGS (Auto-Generated)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Glossary for IWGS (Auto-Generated) A Glossary for IWGS (Auto-Generated) Michael Kohlhase Computer Science, FAU Erlangen-Nürnberg https://kwarc.info/kohlhase July 1, 2021 Preface This document contains an English glossary for the course Informatische Werkzeuge in den Geistes- und Sozialwissenschaften at FAU Erlangen-Nürnberg (IWGS). It is automatically generated from the sources of the IWGS course notes and should be up-to-date with the course progress. The glossary contains definitions for all technical terms used in the course, both theones defined in the course, as well as the ones presupposed. The latter should be relatively few,since IWGS is intended as a beginner’s course. 1 1 Glossary for IWGS Given a description logic D, a D-ontology consists of D-ontology–a terminology (or TBox): concepts and roles and a set of concept axioms that describe them, and – assertions (or ABox): a set of individuals and statements about concept membership and role relationships for them. To make the role of arguments extremely clear, we write functions in λ-notation. For f = f(x; E) j x 2 Xg, where E is an expression, we write λx 2 X:E. n n-dim Cartesianλ-notation space n-dim Cartesian space: A := fha1; : : : ; ani j 1≤i≤n ) ai 2 Ag, call ha1; : : : ; ani a vector n-dimensional Cartesian space An n-dimensional Cartesian product A1 × ::: × An is called a n-dimensional Cartesian space n n over A (and denoted A ) iff Ai = A for some set A for all i. We call ha1; : : : ; ani 2 A a vector. n-fold Cartesian product Let A := fAi j 1≤i≤ng be a collection of sets, then the n-fold Cartesian product A1 × ::: × An is fha1; : : : ; ani j ai 2 Ai for all 1≤i≤ng, we call ha1; : : : ; ani 2 A1 × ::: × An an n-tuple. n is called the dimension of A1 × ::: × An. n-fold Cartesian product n-fold Cartesian product: A1 × ::: × An := fha1; : : : ; ani j 8 i 1≤i≤n ) ai 2 Aig, call ha1; : : : ; ani an n-tuple n-fold composition We write the n-fold composition of the relation R as Rn and define it by R1 := R and Ri + 1 := fS ◦ R j S 2 Rig n-tuple Defined along with n-fold Cartesian product n-tuple Defined along with n-fold Cartesian product p-closure Let p be a properties and R ⊆ A × B a relation, then we call the smallest (in terms of the ⊆) relation R0 ⊇ R that has property p the p-closure of R. p-closure Let p be one of the properties above and R be a relation, then we call the smallest relation ⊇ R0R (in terms of the ⊆) that has property p the p-closure of R. ABox Defined along with terminology ABox Defined along with ontology ABox Defined along with D-ontology ADT See abstract data type AI See Artificial Intelligence AI Defined along with Artificial Intelligence AI See Artificial Intelligence AJAX JSON is for JavaScript as (nested) dictionaries are for python. – The browser can directly read JSON and use it via JavaScript. – AJAX =b JavaScript can query the backend for JSON data to update parts of the ;DOM.(lightweight interaction) 2 AJAX See Ajax ALU Defined along with central processing unit API See application programming interface Ajax Ajax, (also AJAX; short for “Asynchronous JavaScript and XML”) is a set of client-side techniques for creating asynchronous web applications. American Standard Code for Information Interchange The American Standard Code for Information Interchange( ASCII) is a character code that assigns characters to numbers 0-127 Code ···0 ···1 ···2 ···3 ···4 ···5 ···6 ···7 ···8 ···9 ···A ···B ···C ···D ···E ···F 0··· NUL SOH STX ETX EOT ENQ ACK BEL BS HT LF VT FF CR SO SI 1··· DLE DC1 DC2 DC3 DC4 NAK SYN ETB CAN EM SUB ESC FS GS RS US 2··· !"#$%&’()*+,-./ 3··· 0123456789:;<=>? 4··· @ABCDEFGHIJKLMNO 5··· PQRSTUVWXYZ[\]^_ 6··· ‘abcdefghijklmno 7··· p q r s t u v w x y z { | } ~ DEL Anti-Counterfeiting Trade Agreement The Anti-Counterfeiting Trade Agreement (ACTA) is a multinational treaty on interna- tional standards for intellectual property rights enforcement. Artificial Intelligence Artificial Intelligence(AI) is intelligence exhibited by machines Artificial Intelligence Artificial Intelligence(AI) is a sub-field of Computer Science that is concerned with the automation of intelligent behavior. Artificial Intelligence Artificial Intelligence(AI) studies how we can make the computer do things that humans can still do better at the moment. Berne convention The Berne convention process is a series of international treaties that try to harmonize internationalIP laws. It started with the original Berne convention 1886 and went through revision in 1896, 1908, 1914, 1928, 1948, 1967, 1971, and 1979. Boolean Defined along with integer CC provision The CC licenses stipulate that (cf. http://www.creativecommons.org) – Creators retain the copyright on their works. – Creators license their works to the world with under the CC provisions: +/- attribuition(must reference the author) +/- commercial use(can be restricted) +/- derivative works(can allow modification) +/- share alike(copyleft)(modifications must be donated back) CIDOC CRM CIDOC CRM provides an extensible ontology for concepts and information in cultural heritage and museum documentation. It is the international standard (ISO 21127:2014) for the controlled exchange of cultural heritage information. The central classes include – space-time specified by title/identifier, place, era/period, time-span, and relationship to persistent items – events specified by title/identifier, beginning/ending of existence, participants (people, either individually or in groups), creation/modification of things (physical or concep- tional), and relationship to persistent items 3 – material things specified by title/identifier, place, the information object the material thing carries, part-of relationships, and relationship to persistent items – immaterial things specified by title/identifier, information objects (propositional or symbolic), conceptional things, and part-of relationships CLI See command-line interface CMS See content management system CPU See central processing unit CS See computer science CWA See closed world assumption Cartesian product The Cartesian product of an arbitrary (possibly infinite) indexed family of sets is defined Q S as i2I Xi := ff : I ! i2I Xi j f(i) 2 Xig. Cartesian product Cartesian product: A × B := f(a; b) j a 2 A ^ b 2 Bg, call (a; b) pair. Cascading Style Sheets The Cascading Style Sheets(CSS), is a style sheet language that allows authors and users to attach style (e.g., fonts, colors, and spacing) to HTML and XML documents. Content MathML Defined along with Mathematics Markup Language Creative Commons license The Creative Commons licenses are – a common legal vocabulary for sharing content – to create a kind of “public domain” using licensing – presented in three layers (human/lawyer/machine)-readable DAG We will sometimes use the abbreviation DAG for “directed acyclic graph”. DAG Defined along with cyclic DBMS See database management system DDL See data definition language DELETE Defined along with method DOM See document object model DTM Defined along with nondeterministic Turing machine DUPLICATE Defined along with issue number ERD See entity relationship diagram EU directive A EU directive is a legal act of the European Union which requires member states to achieve a particular result without dictating the means of achieving that result. EU regulation A EU regulation is a legal act of the European Union that becomes immediately enforceable as law in all member states simultaneously. Erlangen CRM/OWL Erlangen CRM/OWL implements CIDOC CRM in OWL Extensible Markup Language See XML FAIR Research data should be FAIR: 4 – Findable: easy to identify and find for both humans and computers, e.g. with metadata that facilitate searching for specific datasets, – Accessible: stored for long term so that they can easily be accessed and/or downloaded with well-defined access conditions, whether at the level of metadata, or at thelevelof the actual data, – Interoperable: ready to be combined with other datasets by humans or computers, without ambiguities in the meanings of terms and values, – Reusable: ready to be used for future research and to be further processed using com- putational methods. Consensus in the research data community; for details see [FAIR; WilDumAal:FAIR16]. FIXED Defined along with issue number FLOSS See Free/Libre/Open-Source Software Free/Libre/Open-Source Software Free/Libre/Open-Source Software(FLOSS or just open source) is software that is and licensed via licenses that ensure that its source code is available. GDPR See General Data Protection Regulation GET Defined along with method GFM See GitHub flavored markdown GIT flow [gitflow:url] suggests GIT flow, which includes: – A main branch called main that all other branches merge into. – New functionality is developed “feature-by-feature” on feature branches. – A development branch (usually called devel) that integrates all feature branches and is merged into master once the integrated functionality is stable. – (possibly) release branches for every release; they collect bugfixes, but no new features. GND But there are some sources that are useful – the GND(Gemeinsame Normdatei[ GND:on]), an authority file for personal/corporate names and keywords from literary catalogs, – geonames[ geonames:on], a geographical database with more than 25M names and locations – Wikipedia Gemeinsame Normdatei See GND General Data Protection Regulation The General Data Protection Regulation(GDPR) is a EU regulation created in 2016 to harmonize information privacy regulations within Europe. The GDPR applies to data controllers, i.e organizations that process personal data of EU citizens (the data subjects). It sanctions violations to GDPR mandates with substantial punishments – up to 20Me or 4% of annual worldwide turnover. General Public License The General Public License (GPL) is a copyleft license for FLOSS software originally writ- ten by Richard Stallman in 1989.
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.
    [Show full text]
  • Cambridge University Press 978-1-108-78987-5 — How to Write Good Programs Perdita Stevens Index More Information
    Cambridge University Press 978-1-108-78987-5 — How to Write Good Programs Perdita Stevens Index More Information Index A bold page number indicates where a term is deined. abstract syntax tree, 105 C, 35, 45, 189 abstraction, 29, 141 C♯,35 see also model C++, 35, 190 agile, 64, 159, 198 camel case, 89 algorithm, 29, 147, 148, 196 change, 141, 144, 197 Alice, 44 checklist, 127 arguments, 25,28 cloud, 66 functions as, 45 code order of, 108 commented-out, 62 type of, 41, 108 completion, 52,90 assert, 71 dead, 64 assignment, 131 line length, 99 vs. comparison, 126 reputable body of, 46, 63, 94, 99 Atom, 18 spaghetti, 98, 122 autocompletion, 52,90 unreachable, 64 autosave, 57 code sense, 3, 133 coding, 4 backups, 65 coding dojo, 153 bar, see metasyntactic variable coding interview, 148 BASIC, 44, 125 command line, 15, 49 baz, see metasyntactic variable comment, 27, 70, 85–88 BlueJ, 44, 54 commenting-out, 62 breakpoint, 111 comparison bug, 32, 101, 190, 191 of booleans, 126 after removing, 124 of objects, 130 avoiding, 138 vs. assignment, 126 avoiding recurrence of, 77 compiler, 13, 35 in compiler, 109 bug, 109 removing, 122 incremental, 51 the Lauren bug, 78 computational complexity, 148 see also debugging content assist, 52,90 build, 51, 53 contract, 88 202 © in this web service Cambridge University Press www.cambridge.org Cambridge University Press 978-1-108-78987-5 — How to Write Good Programs Perdita Stevens Index More Information Index 203 crash, 118 time, 146 currying, 23 user, 146 Emacs, 18, 49, 58, 90, 95 data science, 192 embedded
    [Show full text]
  • Section “Creating R Packages” in Writing R Extensions
    Writing R Extensions Version 3.1.0 Under development (2013-03-29) R Core Team Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the con- ditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another lan- guage, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the R Core Team. Copyright c 1999{2013 R Core Team i Table of Contents Acknowledgements ::::::::::::::::::::::::::::::::: 1 1 Creating R packages:::::::::::::::::::::::::::: 2 1.1 Package structure :::::::::::::::::::::::::::::::::::::::::::::: 3 1.1.1 The `DESCRIPTION' file :::::::::::::::::::::::::::::::::::: 4 1.1.2 Licensing:::::::::::::::::::::::::::::::::::::::::::::::::: 9 1.1.3 The `INDEX' file :::::::::::::::::::::::::::::::::::::::::: 10 1.1.4 Package subdirectories:::::::::::::::::::::::::::::::::::: 11 1.1.5 Data in packages ::::::::::::::::::::::::::::::::::::::::: 14 1.1.6 Non-R scripts in packages :::::::::::::::::::::::::::::::: 15 1.2 Configure and cleanup :::::::::::::::::::::::::::::::::::::::: 16 1.2.1 Using `Makevars'::::::::::::::::::::::::::::::::::::::::: 19 1.2.1.1 OpenMP support::::::::::::::::::::::::::::::::::::
    [Show full text]
  • 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.
    [Show full text]
  • 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-
    [Show full text]
  • 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..
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • Logarithms and Exponentiation Guide
    Skills Refresher: Exponentiation, Scientific Notation, Logarithms, and pH Logarithms and exponentiation are opposite mathematical functions involving two numbers, one a base and the other an exponent. This method of expressing numbers is important because many relationships found in the environment and in nature are logarithmic, such as the pH scale. Exponentiation Exponentiation expresses a base number (a) to the power of an exponent (n): x=an. This is also expressed as "a raised to the nth power" (where a and n are numbers). Here are some examples for different exponents (the * symbol indicates multiplication): Exponent Equivalent Examples positive number multiplying a by itself n times 64 = 6*6*6*6 = 1,296 negative number multiplying the reciprocal of a by itself n times 4-3 = 1/43 = 1/(4*4*4) = 1/64 1 (one) multiplying a by itself one time 171 = 17 0 (zero) called an 'empty product'; result for any non-zero base always 1 270 = 1 Common Exponents Exponents of 2 (squaring the number), used in the binary number system, are important in computer work, since computers can only choose between two options, commonly expressed as 0 and 1, represented by one bit. Commonly used to describe file sizes, there are 8 bits in one byte (computers show file sizes in kilobytes, megabytes, and gigabytes). One byte can be any of 28 (=2*2*2*2*2*2*2*2 = 256) values. The result of a number with the exponent 3 is the cube of the number: a3 = a*a*a. We use a base ten (decimal) number system, and exponentiation with base 10 (called scientific notation) is commonly used to describe very large and very small numbers.
    [Show full text]
  • Student Understanding of Large Numbers and Powers: the Effect of Incorporating Historical Ideas
    Student Understanding of Large Numbers and Powers: The Effect of Incorporating Historical Ideas Mala S. Nataraj Michael O. J. Thomas The University of Auckland The University of Auckland <[email protected]> <[email protected]> The value of a consideration of large numbers and exponentiation in primary and early secondary school should not be underrated. In Indian history of mathematics, consistent naming of, and working with large numbers, including powers of ten, appears to have provided the impetus for the development of a place value system. While today’s students do not have to create a number system, they do need to understand the structure of numeration in order to develop number sense, quantity sense and operations. We believe that this could be done more beneficially through reflection on large numbers and numbers in the exponential form. What is reported here is part of a research study that involves students’ understanding of large numbers and powers before and after a teaching intervention incorporating historical ideas. The results indicate that a carefully constructed framework based on an integration of historical and educational perspectives can assist students to construct a richer understanding of the place value structure. Introduction In the current era where very large numbers (and also very small numbers) are used to model copious amounts of scientific and social phenomena, understanding the multiplicative and exponential structure of the decimal numeration system is crucial to the development of quantity and number sense, and multi-digit operations. It also provides a sound preparation for algebra and progress to higher mathematics.
    [Show full text]