DOCSLIB.ORG

Properties of the Real Numbers 2 (G) |X + X − 5| > 0 Solve the Following Equations Over R

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Properties of the Real Numbers 2 (G) |X + X − 5| > 0 Solve the Following Equations Over R The Real Line Philip Pennance1 Version: { February 2019. 1. Introduction. shows thatp there is a point on the line at distance 2 from the origin. By the In the elementary school, fractions or previous claim, this point cannot corre- rational numbers are or should be de- spond to a fraction. fined as points on a number line. It is a consequence of the next result that p not all points on such a line represent 2 fractions. 1 2. Claim. p 0 1 2 2 There do not exist natural numbers n, m such that n2 = 2m2 (i.e., there is no n fraction n whose square is 2). 3. Definition. Proof. The set of all points on the number line is called the set of real numbers and is Suppose to the contrary that such n; m denoted : exist. Since common factors between R the numerator and denominator of a 4. Claim. fraction can be cancelled it may be as- Let x 2 : The following are equivalent. sumed that n and m have no common R factor other than 1. (a) x is a fraction (rational number). Now, n2 = 2m2 means that n2 is even. (b) x has a repeating decimal repre- Since the square of an odd number is sentation. odd, it must be that n is also even. Proof. Hence there exists a natural number k such that n = 2k. But then n2 = See, for example, Dolciani et al. Intro- 2m2 = 4k2 and so m2 = 2k2. This ductory Analysis. means that m2 and hence m are both 5. Example. even. But if n and m are both even they 1 have 2 as a common factor, contradict- The rational number 2 has repeating ing the fact that 1 is the only common decimal representation 0:500000 ··· factor. Hence the numbers n and m do 6. Example. not exist. This means that there is no fraction whose square is 2. Let x = :32456. Find natural numbers n and m such that x = n : Corollary. m Solution. Not all points on the number line core- spond to fractions. 103x = 324:56 5 Proof. 10 x = 32456:56 (105 − 103)x = 32456 − 324 This result has been know since the time of Pythagoras. Indeed, a simple Hence we may take n = 32132 and application of the Pythagorian theorem m = 105 − 103. 1https://pennance.us 1 7. Claim. 12. Claim. Let x 2 . Let x ≥ 0. Then there exists a uniquep R non negative real number (denoted x) d(x; 0) = maxfx; −xg whose square is x: ( x if x ≥ 0 ; Proof. = −x if x < 0 The proof is beyond the scope of this course. Proof. p 8. The number x is called the principal The two formulae are just two alterna- square root of x. tive ways of ensuring that distance is non negative (as required by its defini- 9. Let x 2 . The distance of x from the R tion). A human can (hopefully) evalu- origin denoted d(x; 0) is defined by ate j − 5j without using these formulae. p A machine (IQ = 0) cannot. d(x; 0) = x2 (1) 13. Claim Justification. Let x; x0 2 R. The distance between x 0 Distance is a non negative quantity. and x is given by The square root symbol is necessary to d(x; x0) = jx − x0j: ensure non-negativity. Remark. Proof. Subtraction of the same number from The absolute value of jxj is just an- 0 other notation for this distance. Thus, both x and x does not change the dis- tance between them. Subtracting x0 jxj = d(x; 0) from both yields d(x; x0) = d(x − x0; x0 − x0:) . = d(x − x0; 0) 10. Example. = jx − x0j: d(−5; 0) = p(−5)2 p 14. Example. = 52 Writep withoutp the absolute value sign = 5 j 51 − 2 13j: Solution. 11. Remarks. pNotice 51p< 52 = 4×13. It follows that Equation (1) is just the 1-dimensional 51 < 2 13. Hence, version of Pythagorus' theorem. In two p p p p dimensions, the distance P = (x; y) j 51 − 2 13j = 2 13 − 51: from the origin O = (0; 0) is given by 15. Example. p 2 2 d(P; O) = x + y Write the interval −10 < x < 12 in the form jx − aj < r. Replacing y by 0 yields the one dimen- sional formula. Solution. 2 1 An open interval consists of all points Case 1. If x ≥ 2 ; then whose distance from the center of the 2 2 interval is less than the radius of the j2x − 1j = x () 2x − 1 = x 2 interval. In this case, the given interval () x − 2x + 1 = 0 has midpoint () (x − 1)2 = 0 −10 + 12 () x = 1 a = = 1 2 1 Case 2. If x < 2 ; then and radius j2x − 1j = x2 () 1 − 2x = x2 12 − (−10) 2 r = = 11: () x + 2x − 1 = 0 2 () (x + 1)2 − 2 = 0 p Hence, a point x falls in the interval () x = −1 ± 2 −10 < x < 12 if and only if Both of these solutions are consistent d(x; 1) < 11: 1 with the condition x < 2 . Hence That is, if and only if p j2x − 1j = x2 () x 2 f1; −1 ± 2g: jx − 1j < 11: 18. Example. 16. Example. Let A; B be the points shown on the fol- lowing scale: p Solve j5 − 2xj ≥ 5: 2 B A 108 2 1 Solution. Si P = 3 B + 3 A : 2 Since the absolute value of a number is Show that jP − Aj = 3 jB − Aj: the distance between the number and Solution. the origin. It follows that the distance 2 1 jP − Aj = B + A − A between the number 5−2x and the ori- 3 3 = 2 B − 2 A gin is at least 5: This means that either 3 3 2 5 − 2x ≤ −5 or 5 − 2x ≥ 5: It follows = 3 · jB − Aj that either x ≥ 5 or x ≤ 0. 2 = 3 jB − Aj: 17. Example. Thus, the distance d(P; A) is two thirds Solve j2x − 1j = x2: of the distance d(A; B): Solution. Remark: It is left as an exercise to ver- Notice that ify that B < P < A. 1 2x − 1 ≥ 0 () x ≥ 19. Additional Remarks. 2 Let λ1; λ2 be positive real numbers. It Hence is not difficult to show that if λ1 + λ2 = 1; ( 1 then a linear combination of points 2x − 1 if x ≥ 2 ; j2x − 1j = 1 1 − 2x if x < 2 : P = λ1A + λ2B 3 does not depend on the location of the (d) Commutative law for addition: origin. Moreover the ratio of the dis- tances PA : PB is λ2 : λ1: (Note the a + b = b + a: order!). This invariance with respect to choice of origin can be seen in the for- (e) Associative law for multiplication: mulae for the midpoint 1 1 a · (b · c) = (a · b) · c: P = A + B 2 2 (f) Existence of multiplicative iden- and, in Physics, the formula for center tity: of mass. If there is a mass m1 at point A and a mass m2 at a point B then the 91 6= 0 : a · 1 = 1 · a = a: center of mass is given by m1 m2 XCM = A + A (g) Existence of multiplicative inverse: m1 + m2 m1 + m2 −1 −1 Notice that the sum of the coefficients a 6= 0 =) a · a = a · a = 1: of A and B is 1. These remarks extend to more points and higher dimensions. (h) Commutative law for multiplica- The formula for student grade point av- tion: erage exhibits this same invariance. a · b = b · a: 20. Remarks. (i) Distributive law It is beyond the scope of this course to rigorously extend the multiplication a · (b + c) = a · b + a · c: and division of rational numbers to real numbers. It suffices for our purposes 22. Definition. to know that this can be done, and that the resulting operations retain the Subtraction and division are defined by usual algebraic properties of the addi- a a − b = a + (−b); = a · b−1 = ab: tion and multiplication of rational frac- b tions. These properties will be taken as axioms. 23. Remark. 21. Axioms for Elementary Arithmetic. The above list is not complete. Later, There exist binary operations of addi- the axioms of order will be given and tion and multiplication, such that in the Calculus class, the important completeness axiom, without which, (a) Associative law for addition: the subtler properties of R cannot be a + (b + c) = (a + b) + c: proven. 24. Cancelation Theorems for Addition (b) Existence of additive identity: For all a; b; c 2 R. 90 : 0 + a = a + 0 = a: (a) if a + c = b + c then a = b: (Right cancelation) (c) Existence of additive inverse: (b) if c + a = c + b then a = b: a + (−a) = (−a) + a = 0: (Left cancelation) 4 Proof of (a). Proof. Suppose a + c = b + c. Since c has Using respectivly the property of the an additive inverse −c it follows that multiplicative inverse, the distributive (a+c)+(−c) =( b+c)+(−c). Associa- law, and the property of the additive tivity gives a+(c+(−c))= b+(c+(−c)). inverse, we obtain x + (−1) · x = 1 · By the property of the additive inverse x + (−1) · x = (1 + (−1)) · x = 0:x. the latter implies a + 0 = b + 0. Fi- It follows (using the previous theorem) nally by the property of the additive that x + (−1) · x = 0. Since the addi- identity 0 we have a = b, which was to tive inverse is unique we conclude that be proven. The proof of (b) is similar.
Load more

Recommended publications
  • Chapter 4 Complex Numbers Course Number
    Chapter 4 Complex Numbers Course Number Section 4.1 Complex Numbers Instructor Objective: In this lesson you learned how to perform operations with Date complex numbers. Important Vocabulary Define each term or concept. Complex numbers The set of numbers obtained by adding real number to real multiples of the imaginary unit i. Complex conjugates A pair of complex numbers of the form a + bi and a – bi. I. The Imaginary Unit i (Page 328) What you should learn How to use the imaginary Mathematicians created an expanded system of numbers using unit i to write complex the imaginary unit i, defined as i = Ö - 1 , because . numbers there is no real number x that can be squared to produce - 1. By definition, i2 = - 1 . For the complex number a + bi, if b = 0, the number a + bi = a is a(n) real number . If b ¹ 0, the number a + bi is a(n) imaginary number .If a = 0, the number a + bi = bi is a(n) pure imaginary number . The set of complex numbers consists of the set of real numbers and the set of imaginary numbers . Two complex numbers a + bi and c + di, written in standard form, are equal to each other if . and only if a = c and b = d. II. Operations with Complex Numbers (Pages 329-330) What you should learn How to add, subtract, and To add two complex numbers, . add the real parts and the multiply complex imaginary parts of the numbers separately. numbers Larson/Hostetler Trigonometry, Sixth Edition Student Success Organizer IAE Copyright © Houghton Mifflin Company.
    [Show full text]
  • Ring (Mathematics) 1 Ring (Mathematics)
    Ring (mathematics) 1 Ring (mathematics) In mathematics, a ring is an algebraic structure consisting of a set together with two binary operations usually called addition and multiplication, where the set is an abelian group under addition (called the additive group of the ring) and a monoid under multiplication such that multiplication distributes over addition.a[›] In other words the ring axioms require that addition is commutative, addition and multiplication are associative, multiplication distributes over addition, each element in the set has an additive inverse, and there exists an additive identity. One of the most common examples of a ring is the set of integers endowed with its natural operations of addition and multiplication. Certain variations of the definition of a ring are sometimes employed, and these are outlined later in the article. Polynomials, represented here by curves, form a ring under addition The branch of mathematics that studies rings is known and multiplication. as ring theory. Ring theorists study properties common to both familiar mathematical structures such as integers and polynomials, and to the many less well-known mathematical structures that also satisfy the axioms of ring theory. The ubiquity of rings makes them a central organizing principle of contemporary mathematics.[1] Ring theory may be used to understand fundamental physical laws, such as those underlying special relativity and symmetry phenomena in molecular chemistry. The concept of a ring first arose from attempts to prove Fermat's last theorem, starting with Richard Dedekind in the 1880s. After contributions from other fields, mainly number theory, the ring notion was generalized and firmly established during the 1920s by Emmy Noether and Wolfgang Krull.[2] Modern ring theory—a very active mathematical discipline—studies rings in their own right.
    [Show full text]
  • 1 Sets and Set Notation. Definition 1 (Naive Definition of a Set)
    LINEAR ALGEBRA MATH 2700.006 SPRING 2013 (COHEN) LECTURE NOTES 1 Sets and Set Notation. Definition 1 (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most often name sets using capital letters, like A, B, X, Y , etc., while the elements of a set will usually be given lower-case letters, like x, y, z, v, etc. Two sets X and Y are called equal if X and Y consist of exactly the same elements. In this case we write X = Y . Example 1 (Examples of Sets). (1) Let X be the collection of all integers greater than or equal to 5 and strictly less than 10. Then X is a set, and we may write: X = f5; 6; 7; 8; 9g The above notation is an example of a set being described explicitly, i.e. just by listing out all of its elements. The set brackets {· · ·} indicate that we are talking about a set and not a number, sequence, or other mathematical object. (2) Let E be the set of all even natural numbers. We may write: E = f0; 2; 4; 6; 8; :::g This is an example of an explicity described set with infinitely many elements. The ellipsis (:::) in the above notation is used somewhat informally, but in this case its meaning, that we should \continue counting forever," is clear from the context. (3) Let Y be the collection of all real numbers greater than or equal to 5 and strictly less than 10. Recalling notation from previous math courses, we may write: Y = [5; 10) This is an example of using interval notation to describe a set.
    [Show full text]
  • Reachability Problems in Quaternion Matrix and Rotation Semigroups
    Reachability Problems in Quaternion Matrix and Rotation Semigroups Paul Bell , Igor Potapov ∗ Department of Computer Science, University of Liverpool, Ashton Building, Ashton St, Liverpool L69 3BX, U.K. Abstract We examine computational problems on quaternion matrix and rotation semigroups. It is shown that in the ultimate case of quaternion matrices, in which multiplication is still associative, most of the decision problems for matrix semigroups are un- decidable in dimension two. The geometric interpretation of matrix problems over quaternions is presented in terms of rotation problems for the 2 and 3-sphere. In particular, we show that the reachability of the rotation problem is undecidable on the 3-sphere and other rotation problems can be formulated as matrix problems over complex and hypercomplex numbers. Key words: Quaternions, Matrix semigroups, Rotation semigroups, Membership problem, Undecidability, Post’s correspondence problem 1 Introduction Quaternions have long been used in many fields including computer graphics, robotics, global navigation and quantum physics as a useful mathematical tool for formulating the composition of arbitrary spatial rotations and establishing the correctness of algorithms founded upon such compositions. Many natural questions about quaternions are quite difficult and correspond to fundamental theoretical problems in mathematics, physics and computational theory. Unit quaternions actually form a double cover of the rotation group ∗ Corresponding author. Email addresses: [email protected] (Paul Bell), [email protected] (Igor Potapov). Preprint submitted to Elsevier 4 July 2008 SO3, meaning each element of SO3 corresponds to two unit quaternions. This makes them expedient for studying rotation and angular momentum and they are particularly useful in quantum mechanics.
    [Show full text]
  • Vector Spaces
    Chapter 1 Vector Spaces Linear algebra is the study of linear maps on finite-dimensional vec- tor spaces. Eventually we will learn what all these terms mean. In this chapter we will define vector spaces and discuss their elementary prop- erties. In some areas of mathematics, including linear algebra, better the- orems and more insight emerge if complex numbers are investigated along with real numbers. Thus we begin by introducing the complex numbers and their basic✽ properties. 1 2 Chapter 1. Vector Spaces Complex Numbers You should already be familiar with the basic properties of the set R of real numbers. Complex numbers were invented so that we can take square roots of negative numbers. The key idea is to assume we have i − i The symbol was√ first a square root of 1, denoted , and manipulate it using the usual rules used to denote −1 by of arithmetic. Formally, a complex number is an ordered pair (a, b), the Swiss where a, b ∈ R, but we will write this as a + bi. The set of all complex mathematician numbers is denoted by C: Leonhard Euler in 1777. C ={a + bi : a, b ∈ R}. If a ∈ R, we identify a + 0i with the real number a. Thus we can think of R as a subset of C. Addition and multiplication on C are defined by (a + bi) + (c + di) = (a + c) + (b + d)i, (a + bi)(c + di) = (ac − bd) + (ad + bc)i; here a, b, c, d ∈ R. Using multiplication as defined above, you should verify that i2 =−1.
    [Show full text]
  • List of Mathematical Symbols by Subject from Wikipedia, the Free Encyclopedia
    List of mathematical symbols by subject From Wikipedia, the free encyclopedia This list of mathematical symbols by subject shows a selection of the most common symbols that are used in modern mathematical notation within formulas, grouped by mathematical topic. As it is virtually impossible to list all the symbols ever used in mathematics, only those symbols which occur often in mathematics or mathematics education are included. Many of the characters are standardized, for example in DIN 1302 General mathematical symbols or DIN EN ISO 80000-2 Quantities and units – Part 2: Mathematical signs for science and technology. The following list is largely limited to non-alphanumeric characters. It is divided by areas of mathematics and grouped within sub-regions. Some symbols have a different meaning depending on the context and appear accordingly several times in the list. Further information on the symbols and their meaning can be found in the respective linked articles. Contents 1 Guide 2 Set theory 2.1 Definition symbols 2.2 Set construction 2.3 Set operations 2.4 Set relations 2.5 Number sets 2.6 Cardinality 3 Arithmetic 3.1 Arithmetic operators 3.2 Equality signs 3.3 Comparison 3.4 Divisibility 3.5 Intervals 3.6 Elementary functions 3.7 Complex numbers 3.8 Mathematical constants 4 Calculus 4.1 Sequences and series 4.2 Functions 4.3 Limits 4.4 Asymptotic behaviour 4.5 Differential calculus 4.6 Integral calculus 4.7 Vector calculus 4.8 Topology 4.9 Functional analysis 5 Linear algebra and geometry 5.1 Elementary geometry 5.2 Vectors and matrices 5.3 Vector calculus 5.4 Matrix calculus 5.5 Vector spaces 6 Algebra 6.1 Relations 6.2 Group theory 6.3 Field theory 6.4 Ring theory 7 Combinatorics 8 Stochastics 8.1 Probability theory 8.2 Statistics 9 Logic 9.1 Operators 9.2 Quantifiers 9.3 Deduction symbols 10 See also 11 References 12 External links Guide The following information is provided for each mathematical symbol: Symbol: The symbol as it is represented by LaTeX.
    [Show full text]
  • 24 Rings: Definition and Basic Results
    Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 24 Rings: Definition and Basic Results In this section, we introduce another type of algebraic structure, called ring. A group is an algebraic structure that requires one binary operation. A ring is an algebraic structure that requires two binary operations that satisfy some conditions listed in the following definition. Definition 24.1 A ring is a nonempty set R with two binary operations (usually written as ad- dition and multiplication) such that for all a; b; c 2 R; (1) R is closed under addition: a+b 2 R: (2) Addition is associative: (a+b)+c = a + (b + c). (3) Addition is commutative: a + b = b + a: (4) R contains an additive identity element, called zero and usually denoted by 0 or 0R: a + 0 = 0 + a = a: (5) Every element of R has an additive inverse: a + (¡a) = (¡a) + a = 0: (6) R is closed under multiplication: ab 2 R: (7) Multiplication is associative: (ab)c = a(bc): (8) Multiplication distributes over addition: a(b + c) = ab + ac and (a + b)c = ac + bc: If ab = ba for all a; b 2 R then we call R a commutative ring. In other words, a ring is a commutative group with the operation + and an additional operation, multiplication, which is associative and is distributive with respect to +. Remark 24.1 Note that we don’t require a ring to be commutative with respect to multiplica- tion, or to have multiplicative identity, or to have multiplicative inverses. A ring may have these properties, but is not required to.
    [Show full text]
  • Vector Spaces
    Vector Spaces Math 240 Definition Properties Set notation Subspaces Vector Spaces Math 240 | Calculus III Summer 2013, Session II Wednesday, July 17, 2013 Vector Spaces Agenda Math 240 Definition Properties Set notation Subspaces 1. Definition 2. Properties of vector spaces 3. Set notation 4. Subspaces Vector Spaces Motivation Math 240 Definition Properties Set notation Subspaces We know a lot about Euclidean space. There is a larger class of n objects that behave like vectors in R . What do all of these objects have in common? Vector addition a way of combining two vectors, u and v, into the single vector u + v Scalar multiplication a way of combining a scalar, k, with a vector, v, to end up with the vector kv A vector space is any set of objects with a notion of addition n and scalar multiplication that behave like vectors in R . Vector Spaces Examples of vector spaces Math 240 Definition Real vector spaces Properties n Set notation I R (the archetype of a vector space) Subspaces I R | the set of real numbers I Mm×n(R) | the set of all m × n matrices with real entries for fixed m and n. If m = n, just write Mn(R). I Pn | the set of polynomials with real coefficients of degree at most n I P | the set of all polynomials with real coefficients k I C (I) | the set of all real-valued functions on the interval I having k continuous derivatives Complex vector spaces n I C, C I Mm×n(C) Vector Spaces Definition Math 240 Definition Properties Definition Set notation A vector space consists of a set of scalars, a nonempty set, V , Subspaces whose elements are called vectors, and the operations of vector addition and scalar multiplication satisfying 1.
    [Show full text]
  • Introduction to Groups, Rings and Fields
    Introduction to Groups, Rings and Fields HT and TT 2011 H. A. Priestley 0. Familiar algebraic systems: review and a look ahead. GRF is an ALGEBRA course, and specifically a course about algebraic structures. This introduc- tory section revisits ideas met in the early part of Analysis I and in Linear Algebra I, to set the scene and provide motivation. 0.1 Familiar number systems Consider the traditional number systems N = 0, 1, 2,... the natural numbers { } Z = m n m, n N the integers { − | ∈ } Q = m/n m, n Z, n = 0 the rational numbers { | ∈ } R the real numbers C the complex numbers for which we have N Z Q R C. ⊂ ⊂ ⊂ ⊂ These come equipped with the familiar arithmetic operations of sum and product. The real numbers: Analysis I built on the real numbers. Right at the start of that course you were given a set of assumptions about R, falling under three headings: (1) Algebraic properties (laws of arithmetic), (2) order properties, (3) Completeness Axiom; summarised as saying the real numbers form a complete ordered field. (1) The algebraic properties of R You were told in Analysis I: Addition: for each pair of real numbers a and b there exists a unique real number a + b such that + is a commutative and associative operation; • there exists in R a zero, 0, for addition: a +0=0+ a = a for all a R; • ∈ for each a R there exists an additive inverse a R such that a+( a)=( a)+a = 0. • ∈ − ∈ − − Multiplication: for each pair of real numbers a and b there exists a unique real number a b such that · is a commutative and associative operation; • · there exists in R an identity, 1, for multiplication: a 1 = 1 a = a for all a R; • · · ∈ for each a R with a = 0 there exists an additive inverse a−1 R such that a a−1 = • a−1 a = 1.∈ ∈ · · Addition and multiplication together: forall a,b,c R, we have the distributive law a (b + c)= a b + a c.
    [Show full text]
  • Finite Fields (PART 2): Modular Arithmetic
    Lecture 5: Finite Fields (PART 2) PART 2: Modular Arithmetic Theoretical Underpinnings of Modern Cryptography Lecture Notes on “Computer and Network Security” by Avi Kak ([email protected]) February 2, 2021 5:20pm ©2021 Avinash Kak, Purdue University Goals: To review modular arithmetic To present Euclid’s GCD algorithms To present the prime finite field Zp To show how Euclid’s GCD algorithm can be extended to find multiplica- tive inverses Perl and Python implementations for calculating GCD and mul- tiplicative inverses CONTENTS Section Title Page 5.1 Modular Arithmetic Notation 3 5.1.1 Examples of Congruences 5 5.2 Modular Arithmetic Operations 6 5.3 The Set Zn and Its Properties 9 5.3.1 So What is Zn? 11 5.3.2 Asymmetries Between Modulo Addition and Modulo 13 Multiplication Over Zn 5.4 Euclid’s Method for Finding the Greatest Common Divisor 16 of Two Integers 5.4.1 Steps in a Recursive Invocation of Euclid’s GCD Algorithm 18 5.4.2 An Example of Euclid’s GCD Algorithm in Action 19 5.4.3 Proof of Euclid’s GCD Algorithm 21 5.4.4 Implementing the GCD Algorithm in Perl and Python 22 5.5 Prime Finite Fields 29 5.5.1 What Happened to the Main Reason for Why Zn Could Not 31 be an Integral Domain 5.6 Finding Multiplicative Inverses for the Elements of Zp 32 5.6.1 Proof of Bezout’s Identity 34 5.6.2 Finding Multiplicative Inverses Using Bezout’s Identity 37 5.6.3 Revisiting Euclid’s Algorithm for the Calculation of GCD 39 5.6.4 What Conclusions Can We Draw From the Remainders? 42 5.6.5 Rewriting GCD Recursion in the Form of Derivations for 43 the Remainders 5.6.6 Two Examples That Illustrate the Extended Euclid’s Algorithm 45 5.7 The Extended Euclid’s Algorithm in Perl and Python 47 5.8 Homework Problems 54 Computer and Network Security by Avi Kak Lecture 5 Back to TOC 5.1 MODULAR ARITHMETIC NOTATION Given any integer a and a positive integer n, and given a division of a by n that leaves the remainder between 0 and n − 1, both inclusive, we define a mod n to be the remainder.
    [Show full text]
  • Dictionary of Mathematical Terms
    DICTIONARY OF MATHEMATICAL TERMS DR. ASHOT DJRBASHIAN in cooperation with PROF. PETER STATHIS 2 i INTRODUCTION changes in how students work with the books and treat them. More and more students opt for electronic books and "carry" them in their laptops, tablets, and even cellphones. This is This dictionary is specifically designed for a trend that seemingly cannot be reversed. two-year college students. It contains all the This is why we have decided to make this an important mathematical terms the students electronic and not a print book and post it would encounter in any mathematics classes on Mathematics Division site for anybody to they take. From the most basic mathemat- download. ical terms of Arithmetic to Algebra, Calcu- lus, Linear Algebra and Differential Equa- Here is how we envision the use of this dictio- tions. In addition we also included most of nary. As a student studies at home or in the the terms from Statistics, Business Calculus, class he or she may encounter a term which Finite Mathematics and some other less com- exact meaning is forgotten. Then instead of monly taught classes. In a few occasions we trying to find explanation in another book went beyond the standard material to satisfy (which may or may not be saved) or going curiosity of some students. Examples are the to internet sources they just open this dictio- article "Cantor set" and articles on solutions nary for necessary clarification and explana- of cubic and quartic equations. tion. The organization of the material is strictly Why is this a better option in most of the alphabetical, not by the topic.
    [Show full text]
  • Notes on Ring Theory
    Notes on Ring Theory S. F. Ellermeyer Department of Mathematics Kennesaw State University January 15, 2016 Abstract These notes contain an outline of essential definitions and theorems from Ring Theory but only contain a minimal number of examples. Many examples are presented in class and thus it is important to come to class. Also of utmost importance is that the student put alot of effort into doing the assigned homework exercises.The material in these notes is outlined in the order of Chapters 17—33 of Charles Pinter’s “A Book of Abstract Algebra”, which is the textbook we are using in the course. 1Rings A ring is a non—empty set, , along with two operations called addition (usually denoted by the symbol +) and multiplication (usually denoted by the symbol or by no symbol) such that · 1. is an abelian group under addition. (The additive identity element of is usually denoted by 0.) 2. The multiplication operation is associative. 3. Multiplication is distributive over addition, meaning that for all and in we have ( + )= + · · · 1 and ( + ) = + . · · · Letuslookatafewexamplesofrings. Example 1 The trivial ring is the one—element set = 0 with addition operation defined by 0+0 = 0 and multiplication operation de{fi}ned by 0 0=0. · Example 2 The set of integers, , with the standard operations of addition and multiplication is a ring. The set of real numbers, , with the standard operations of addition and multiplication is a ring. The set of rational num- bers, , with the standard operations of addition and multiplication is a ring. The set of complex numbers, , with the standard operations of addition and multiplication is a ring.
    [Show full text]