padic Egyptian Fractions


 Laurence Daniel
 4 years ago
 Views:
Transcription
1 padic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Setup 3 4 pgreedy Algorithm 5 5 pegyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction is sum of distinct positive unit frctions In mny cses given frction hs severl representtions, for exmple = or more simply, = The former is otined from the greedy lgorithm while the ltter comes from performing the greedy 11dic lgorithm tht we will introduce in Section 4 1
2 2 Trditionl Egyptin Frctions nd Greedy Algorithm Proposition 1 (Clssicl Division Algorithm For ll positive integers, Z there exist unique positive integers q nd r such tht = q r with r strictly less thn Proof This proof is similr to the stndrd proof of the originl clssicl division lgorithm Let nd e positive integers To show existence, consider the set S = {n 0 : n Z} Clerly there is t lest one nonnegtive entry since lrge multiple of must exceed Among these entries there is lest clled r tht s gurnteed y the WellOrdering Principle Then y definition for some integer, denoted q, we hve r = q or = q r s desired As with the originl clssicl lgorithm we require 0 r < The first inequlity is given since it s n element of S To prove tht the second holds, suppose for contrdiction tht r Then r = q implies r = (q 1 0 which shows tht r > r S which contrdicts the minimlity of r Like the clssicl division lgorithm we otin uniqueness Suppose tht = q r = q r Sutrcting gives (q q = r r so r r Which is impossile since r r < unless r r = 0 nd so r = r s needed Then, q = q nd q = q s well Definition 1 (The Greedy Algorithm The Greedy Algorithm pplied to strts y using the modified division lgorithm to find the unique q 1 nd r 1 such tht = q 1 r 1 Next, we pply the modified division lgorithm to q 1 nd r 1 Continuing we hve, = q 1 r 1 q 1 = r 1 q 2 r 2 q 1 q 2 q 3 q n 2 = r n 2 q n 1 r n 1 q 1 q 2 q 3 q n 2 q n 1 = r n 1 q n 0 with r n = 0 2
3 The lgorithm eventully termintes since the modified division lgorithm requires ech reminder to e less thn the previous nd therefore yields decresing sequence of positive integers Notice tht rerrnging the terms from the lgorithm yields, = 1 + r 1 q 1 q 1 r 1 = 1 + r 2 q 1 q 2 q 1 q 2 r n 2 = 1 q 1 q 2 q 3 q n 2 r n 1 r n 1 + q n 1 q 1 q 2 q 3 q n 2 q n 1 ( q 1 q 2 q 3 q n 2 q n 1 = 1 q n which shows tht the sum of the reciprocls of the q i is equl to ie = n To e n Egyptin frction expnsion ech term must e distinct Indeed, q i > q i 1 since q 1 = nd q 2 = q 1 r 1 = r 1 /q 1 >, the lst inequlity follows from r 1 q 1 < 1 q i Exmple 1 Performing the Clssicl Greedy Algorithm on following expnsion, 3 Setup 5 11 = gives the Definition 2 (Order The order of some integer n with respect to prime p, denoted ord p (n, is the power of p tht exctly divides n We define ( ord p = ord p ( ord p ( 3
4 Definition 3 (Unit prt Let r = Q nd p prime The unit prt of r, denoted r is given y r := rp ordp(r Note tht ord p (â = 0 nd â nd p re reltively prime Throughout we will write ord p ( = α nd ord p ( = β Proposition 2 If, Q then ord p ( = ord p ( + ord p ( Proof Using units we write = âp α nd = p β Then ord p ( = ord p ( â p α+β = α + β Lemm 1 If, Q nd p prime then ord p ( + min{ord p (, ord p (} We hve equlity when ord p ( ord p ( Proof Tking, Q we ssume without loss of generlity tht β α Using units we write = âp α nd = p β ( ord p ( + = ord p âp α + p β ( = ord p p (âp β α β + = β + ord p (âp α β + Proposition 2 Should α = β, we hve ord p ( + = β + ord p (â + min {α, β} In the cse where α β we hve tht α β is positive Then the order of âp α β + is zero nd ord p ( + = min{α, β} 4
5 4 pgreedy Algorithm Theorem 2 (pdivision Algorithm Let, p Z with p prime nd Z[ 1] = p {mpk m, k Z} Then, there exist unique r Z nd q Z[ 1] such p tht = q r with 0 r < p nd ord p (r > ord p ( Proof Existence Let, Z nd p prime Since â nd p re reltively prime ny power of p hs n inverse mod â Tke 0 r < â such tht r p β α 1 mod â For some integer m we cn write, rp β+α+1 ( = âm rp α+1 + p β = âmp β with q = mp β α nd r = rp α+1 p β = âp α mp β α rp α+1 = q r Uniqueness Given, Z nd p prime suppose tht there exist corresponding q 1, r 1, q 2, r 2 such tht = q 1 r 1 = q 2 r 2 Then, (q 1 q 2 = r 1 r 2 (1 By (1 we hve tht r 1 r 2 mod â nd r 1 r 2 mod p α+1 since y ssumption ord p (r i > Therefore, r 1 r 2 mod p Thus, r 1 = r 2 or only one is etween 0 nd p; so r 1 = r 2 nd q 1 = q 2 nd we hve uniqueness s desired Note, it s possile tht r r The vlue of ord p (r cn vry depending on the choice of prime Consider the cse where = 23 nd = 60 If we tke p = 5 then = , = Then, r (12( (mod 23 nd ord 5 (r = 0 However, if p = 3 then = , = Then, nd the order of r is 1 r (20( (mod 23 5
6 Definition 4 A jump occurs when fter performing the pdivision Algorithm we hve ord p (r 1 Lemm 3 If p > â then r = r, ie there is no jump Proof Simply note tht r is tken mod â; hence r < â < p Definition 5 (pgreedy Algorithm Let,, p Z with p prime Theorem 2 gives unique q 1 Z[ 1 p ] nd r 1 Z such tht = q 1 r 1 Repeting on q 1 nd r 1 gives, = q 1 r 1 q 1 = r 1 q 2 r 2 q 1 2 q n 2 = r n 2 q n 1 r n 1 q 1 q 2 q n 1 = r n 1 q n 0 until r n = 0 Note y??( we gin get = 1 q i Exmple 2 Consider the frction 12 Performing the Greedy 3Adic Algorithm yields, 5 ( 8 5 = r 1 = 3 3 ( ( = nd 12 5 = In the clssicl cse typiclly the q s re ny integer greter thn one; these come from expnding frction whose size is less thn one We get q = 1 only if the frction eing expnded is greter thn one (The clssicl greedy lgorithm lwys tkes the next lrgest unit frction, including 1 The padic q s from the ove exmple look very different ut re in fct typicl in tht their order is decresing nd we will see lter tht they re otined from expnding frctions whose order is nonnegtive Frctions with negtive order led to the typicl padic cse where q = p s shown 6
7 elow Even though the padic cse dels with order, it should e noted tht s elements of the padic field Q p, frctions with negtive order re considered greter thn one, nd q = p leds to the term 1/p ppering in the expnsion which is nlogous to 1/1 ppering in clssicl expnsion since under the padic norm 1/p hs size p Exmple 3 Consider the frction 85 Adic Algorithm yields, nd = Performing the Greedy = 85(7 469 r 1 = = 469( r 2 = 49 ( = = Theorem 4 The pgreedy Algorithm termintes in finite numer of steps Proof Note tht r k is tken mod r k 1 with representtives in {0, 1, 2,, r k 1 1} nd therefore, r k r k < r k 1 Since r k is nonnegtive, this is decresing sequence of nturl numers tht must end with zero Eventully r n nd r n re identiclly zero nd the lgorithm termintes Corollry 5 The pgreedy Algorithm termintes in t most â steps This follows from the fct tht the sequence of the unit prts of the reminders r 1, r 2,, 0 is defined so tht r i is tken mod r i 1 with r 0 := â Definition 6 (Pure pegyptin Frction For fixed prime p, if = n with l i strictly incresing nonnegtive nd m i positive reltively prime to p then the sum is pegyptin frction expnsion for Lemm 6 ( (Clssifiction Let,, p Z with p prime Suppose tht l = ord p 1 Let q denote the quotient from the pdic division lgorithm nd q the quotient from the clssicl division lgorithm on p Then, q = pq 7 p l i m i
8 Proof Since l 1 we cn write = â p l p = â p l 1 The pdic division lgorithm gives r nd q such tht, p l = âq rp r p l 1 (mod â q = p l + rp â Applying the modified clssicl division lgorithm yields q nd r such tht, p l 1 = âq r Finlly, r = âq l 1 p r p l 1 r (mod â r = r q = p l 1 + r â (smllest nonnegtive representtives lwys used q p = p l + rp â = p l + rp â = q ( Corollry 7 If ord p 1 nd if no jumps occur thn ech term of the padic Greedy Algorithm for is equl to the corresponding term in the clssicl Greedy Algorithm on p divided y p For exmple, ( consider the frction = 5 = 51 If we tke p = then ord p = 2 Applying the 11Adic Greedy Algorithm to 5 yields 121 r 1 = 4, r 2 = 3, r 3 = 0 ll of order zero Using the q i we cn write, = Recll exmple 1 gve p = 5 11 = Note, the restriction on jumps is sufficient ut not necessry, for n exmple use 22 with p =
9 Lemm 8 Suppose tht ord p ( 0, then the quotient from the division lgorithm is not p Proof If ord p ( > 0 then ordp (q = β α 0 Suppose ord p ( = 0 For ske of contrdiction, suppose tht q = p Since q = mp β α nd the order is zero we hve tht q = m = p nd rp + = âm = âp however this is impossile since ord p (rp + = 0 1 = ord p (âp ( Theorem 9 Let,, p Z with p prime Suppose tht ord p 1 nd p 1, then dividing y using the padic Division Algorithm yields q = p nd = 1 p + r p Proof The frction p 1 nd therefore its Clssicl Greedy Egyptin Frction Expnsion egins with 1 By ssumption ord ( p 1 so y Lemm 6 the quotient from using the padic Divison Algorithm to divide y is p Theorem 10 If, p Z with p prime nd Z[ 1 p ] nd 0 ord p ( then pplying the padic Division lgorithm to divide y yields q nd r such tht ord p (q ord p ( ord p ( < ord p (r Proof The padic Division lgorithm sys tht r = rp ordp(+1 which llows us to write ord p ( < ord p ( + 1 ord p (r By hypothesis we lredy hve ord p ( ord p ( Therefore, it remins to show tht ord p (q 0 Drwing on the pdivision lgorithm gin we hve, ord p (q = ord p ( + r ord p ( = ord p ( ord p ( since ord p ( < ord p (r 0 Hence, ord p (q = ord p ( + ord p (q ord p ( 9
10 Theorem 11 Let,, p Z with p prime Then performing the padic Greedy Algorithm yields quotients such tht q i = p for i K where K is the lest K such tht one of the following is true: p K p ord p ( p K p p 1 (2 0 (3 Proof First note tht K lwys exists since the frction in condition 2 is decresing For 0 i < K we hve tht the negtions of 2 nd 3 re stisfied Should K = 0 then either p 1 in which cse the quotient from the Greedy Expnsion ( isn t 1 nd therefore q 1 from the padic Greedy Algorithm isn t p or ord p 0 nd y Lemm 8 q1 p Suppose tht K 1 Recll tht t ech step of the padic Greedy Algorithm we perform the padic Division Algorithm on r K q 1 q K = K p p K = p Note tht K is the first integer such tht p K fils to stisfy the hypotheses p of theorem 9 Susequent reminders re either strictly less thn p K or p their orders re greter y Lemm 10 5 pegyptin Trditionl In oth the clssicl nd the pdic cse, repeted ppliction of modified division lgorithm yielded the following sum, = n The clssicl q i re lwys integers so the sum is n Egyptin frction expnsion The pdic cse yields q i tht force powers of p to pper in the numertor of ech term Even though this sum isn t immeditely n Egyptin frction expnsion, it ecomes one once you divide out y the highest power of p present mong the terms Of course it s no longer n Egyptin 1 q i 10
11 frction expnsion for ut it is vlid expnsion for nother rtionl, nmely p ordp(qn It s possile in some cses to reverse this process y strting with frction nd for ech prime tht mkes up, remove it nd find the corresponding pdic Egyptin frction expnsion for wht remins A frction works if the desired power k of p in the denomintor is greter thn or equl to the order of the lst term in the expnsion so tht dividing out doesn t leve ny powers of p ehind The order of 1/q n sets the lowest power of p tht is llowed in the denomintor Exmple 4 Suppose tht we wnt n Egyptin frction expnsion for 189 = From the primes in the denomintor we see tht we cn either perform the 3Adic lgorithm on or the 7Adic lgorithm on In the 3Adic cse 7 27 we will e successful if the finl term in the expnsion hs no more thn 3 powers of p = 3 in the numertor, while the 7Adic cse would require tht the finl term hve order t most one The 7Adic cse yields, Dividing y 7 we find tht 27 = = which won t work for our purposes since there re still terms of positive order in the expnsion The 3Adic cse yields, which when divided y 3 3 yields, 7 = =
12 which is n Egyptin frction expnsion tht s significntly more lnced thn the one otined from the clssicl greedy lgorithm: 189 = The kinds of frctions tht cn e expnded in this wy depend on the order of q n Corollry 12 Inspecting susequent steps of the pgreedy lgorithm we see tht, ord p (q k = ord p (q 1 q 2 q k 1 ord p (r k 1 Proof Since q k r k 1 = q 1 q k 1 + r k nd ord p (q 1 q k 1 < ord p (r k y Lemm 1 ord p (q k = ord p ( q1 q k 1 r k 1 = ord p (q 1 q 2 q k 1 ord p (r k 1 Theorem Let,, p Z with p prime nd ord p ( = β, ord p ( = α Then, n 1 ord p (q n = (β n 1 ord p (r i α 1 2 i with q n nd r i defined s per the pgreedy lgorithm in Definition 5 Proof We proceed y induction on n Bse Cse: n = 1 By Theorem 2 the order of q 1 is β α = (β α 1 Inductive Cse: Suppose for some n 1 tht ord p (q n = n 1 (β α 1 By corollry 12 we lredy hve tht Then, n 1 ord p (r i 2 i ord p (q n+1 = ord p (q 1 q n ord p (r n ord p (q n+1 = ord p (q 1 q n + ord p (r n 1 ord p (r n 1 ord p (r n = ord p (q 1 q n 1 + ord p (q n + ord p (r n 1 ord p (r n 1 ord p (r n 12
13 = 2 ord p (q n + ord p (r n 1 ord p (r n Corollry 12 = 2 ord p (q n + ord p (r n 1 ord p (r n ord p (r n 1 1 Since r = rp α+1 n 1 = (β n ord p (r i α 1 ord 2 i p (r n 1 n 1 = (β n α 1 = n (β α 1 n Thus the order of q n is given y, ord p (r i 2 i ord p (r i 2 i ord p (q n = n 1 (β α 1 2n ord p (r n 2 n n 1 ord p (r i 2 i Corollry 14 If ord p ( = 0 then 6 Conclusion n 1 ord p (q n = 1 2 n 1 2 n+i 1 ord p (r i The clssicl lgorithm cn hndle irrtionl numers since since q = / where = 1 nd irrtionl Although padic numers hve n ssocited norm, there re mny rtionls tht stisfy x p = 1 eg ll rtionls of order 0 so it s difficult to pick the correct one There is lso no cler wy to define wht it mens for one to mod out y â if it s irrtionl The clssicl greedy lgorithm for egyptin frctions lwys tkes the next lrgest unit frction Therefore, if term is deleted the expnsion for the remining terms will simply e the originl expnsion with the one term deleted The sme ppers to e true for the padic
14 lgorithm, however if one defines next lrgest unit frction s the next 1/q (in the clssicl cse this corresponds to the next lrgest y solute vlue thn ll you know is tht some 1/q is less thn /, however there s no wy to test this unless one ctully crries out the lgorithm Of course, one cnnot expect perfect nlogy to lwys exist 2 n 1 ( The unit prt of q n cn e roughly pproximted y 2 n 1 â Assuming tht ord p ( = 0 nd tht p > â llows us to determine the order of q n exctly nd we hve tht the 1/q terms grow s p 2n 1 1 ( 2 n 1 2 â n 1 hence if /â p/2 we otin prticulrily lnced terms The padic lgorithm yields n expnsion with t most â terms It remins to e seen if these exmples lwys exist It would lso py to investigte the verge lengths of expnsions nd compre it to the verge length of sequences if r i is ssumed to e rndom integer mod r i 1 14
Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More information(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer
Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.
More informationMTH 505: Number Theory Spring 2017
MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c
More informationBases for Vector Spaces
Bses for Vector Spces 22625 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationMATH 573 FINAL EXAM. May 30, 2007
MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.
More informationQuadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More informationHomework Solution  Set 5 Due: Friday 10/03/08
CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution  et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte nonfinl.
More informationBridging the gap: GCSE AS Level
Bridging the gp: GCSE AS Level CONTENTS Chpter Removing rckets pge Chpter Liner equtions Chpter Simultneous equtions 8 Chpter Fctors 0 Chpter Chnge the suject of the formul Chpter 6 Solving qudrtic equtions
More informationset is not closed under matrix [ multiplication, ] and does not form a group.
Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Note 17
CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking
More informationQUADRATIC EQUATIONS OBJECTIVE PROBLEMS
QUADRATIC EQUATIONS OBJECTIVE PROBLEMS +. The solution of the eqution will e (), () 0,, 5, 5. The roots of the given eqution ( p q) ( q r) ( r p) 0 + + re p q r p (), r p p q, q r p q (), (d), q r p q.
More information2.4 Linear Inequalities and Interval Notation
.4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or
More informationThe graphs of Rational Functions
Lecture 4 5A: The its of Rtionl Functions s x nd s x + The grphs of Rtionl Functions The grphs of rtionl functions hve severl differences compred to power functions. One of the differences is the behvior
More informationUniversitaireWiskundeCompetitie. Problem 2005/4A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that
Problemen/UWC NAW 5/7 nr juni 006 47 Problemen/UWC UniversitireWiskundeCompetitie Edition 005/4 For Session 005/4 we received submissions from Peter Vndendriessche, Vldislv Frnk, Arne Smeets, Jn vn de
More informationDiscrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17
EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,
More informationImproper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:
Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl
More informationLecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)
Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationNatural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring
More generlly, we define ring to be nonempty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),
More information1 Sets Functions and Relations Mathematical Induction Equivalence of Sets and Countability The Real Numbers...
Contents 1 Sets 1 1.1 Functions nd Reltions....................... 3 1.2 Mthemticl Induction....................... 5 1.3 Equivlence of Sets nd Countbility................ 6 1.4 The Rel Numbers..........................
More informationMath 61CM  Solutions to homework 9
Mth 61CM  Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ
More informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for contextfree grmmrs
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More information1B40 Practical Skills
B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
More informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2 elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationPARTIAL FRACTION DECOMPOSITION
PARTIAL FRACTION DECOMPOSITION LARRY SUSANKA 1. Fcts bout Polynomils nd Nottion We must ssemble some tools nd nottion to prove the existence of the stndrd prtil frction decomposition, used s n integrtion
More informationCS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 2 1. Prove ((( p q) q) p) is tutology () (3pts) y truth tle. p q p q
More information5.2 Exponent Properties Involving Quotients
5. Eponent Properties Involving Quotients Lerning Objectives Use the quotient of powers property. Use the power of quotient property. Simplify epressions involving quotient properties of eponents. Use
More informationIntegral points on the rational curve
Integrl points on the rtionl curve y x bx c x ;, b, c integers. Konstntine Zeltor Mthemtics University of Wisconsin  Mrinette 750 W. Byshore Street Mrinette, WI 5443453 Also: Konstntine Zeltor P.O. Box
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More informationDuality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.
Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we
More informationMath 4310 Solutions to homework 1 Due 9/1/16
Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationMAA 4212 Improper Integrals
Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly welldefined, is too restrictive for mny purposes; there re functions which
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
More informationDuke Math Meet
Duke Mth Meet 0114 Power Round Qudrtic Residues nd Prime Numers For integers nd, we write to indicte tht evenly divides, nd to indicte tht does not divide For exmle, 4 nd 4 Let e rime numer An integer
More informationBernoulli Numbers Jeff Morton
Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f
More informationAdvanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004
Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when
More informationNumber systems: the Real Number System
Numer systems: the Rel Numer System syllusref eferenceence Core topic: Rel nd complex numer systems In this ch chpter A Clssifiction of numers B Recurring decimls C Rel nd complex numers D Surds: suset
More informationSUMMER KNOWHOW STUDY AND LEARNING CENTRE
SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18
More informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
More information1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.
1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the
More information5. (±±) Λ = fw j w is string of even lengthg [ 00 = f11,00g 7. (11 [ 00)± Λ = fw j w egins with either 11 or 00g 8. (0 [ ffl)1 Λ = 01 Λ [ 1 Λ 9.
Regulr Expressions, Pumping Lemm, Right Liner Grmmrs Ling 106 Mrch 25, 2002 1 Regulr Expressions A regulr expression descries or genertes lnguge: it is kind of shorthnd for listing the memers of lnguge.
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationThe area under the graph of f and above the xaxis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the xxis etween nd is denoted y f(x) dx nd clled the
More informationSurface maps into free groups
Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The
More informationThe HenstockKurzweil integral
fculteit Wiskunde en Ntuurwetenschppen The HenstockKurzweil integrl Bchelorthesis Mthemtics June 2014 Student: E. vn Dijk First supervisor: Dr. A.E. Sterk Second supervisor: Prof. dr. A. vn der Schft
More informationProblem Set 9. Figure 1: Diagram. This picture is a rough sketch of the 4 parabolas that give us the area that we need to find. The equations are:
(x + y ) = y + (x + y ) = x + Problem Set 9 Discussion: Nov., Nov. 8, Nov. (on probbility nd binomil coefficients) The nme fter the problem is the designted writer of the solution of tht problem. (No one
More informationLecture 2: Fields, Formally
Mth 08 Lecture 2: Fields, Formlly Professor: Pdric Brtlett Week UCSB 203 In our first lecture, we studied R, the rel numbers. In prticulr, we exmined how the rel numbers intercted with the opertions of
More informationARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac
REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b
More informationSeptember 13 Homework Solutions
College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are
More informationBefore we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!!
Nme: Algebr II Honors PreChpter Homework Before we cn begin Ch on Rdicls, we need to be fmilir with perfect squres, cubes, etc Try nd do s mny s you cn without clcultor!!! n The nth root of n n Be ble
More informationOn Error Sum Functions Formed by Convergents of Real Numbers
3 47 6 3 Journl of Integer Sequences, Vol. 4 (), Article.8.6 On Error Sum Functions Formed by Convergents of Rel Numbers Crsten Elsner nd Mrtin Stein Fchhochschule für die Wirtschft Hnnover Freundllee
More informationMath 426: Probability Final Exam Practice
Mth 46: Probbility Finl Exm Prctice. Computtionl problems 4. Let T k (n) denote the number of prtitions of the set {,..., n} into k nonempty subsets, where k n. Argue tht T k (n) kt k (n ) + T k (n ) by
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationChapter 1: Logarithmic functions and indices
Chpter : Logrithmic functions nd indices. You cn simplify epressions y using rules of indices m n m n m n m n ( m ) n mn m m m m n m m n Emple Simplify these epressions: 5 r r c 4 4 d 6 5 e ( ) f ( ) 4
More informationLet S be a numerical semigroup generated by a generalized arithmetic sequence,
Abstrct We give closed form for the ctenry degree of ny element in numericl monoid generted by generlized rithmetic sequence in embedding dimension three. While it is known in generl tht the lrgest nd
More informationVyacheslav Telnin. Search for New Numbers.
Vycheslv Telnin Serch for New Numbers. 1 CHAPTER I 2 I.1 Introduction. In 1984, in the first issue for tht yer of the Science nd Life mgzine, I red the rticle "NonStndrd Anlysis" by V. Uspensky, in which
More informationPRIMES AND QUADRATIC RECIPROCITY
PRIMES AND QUADRATIC RECIPROCITY ANGELICA WONG Abstrct We discuss number theory with the ultimte gol of understnding udrtic recirocity We begin by discussing Fermt s Little Theorem, the Chinese Reminder
More informationLesson 2.4 Exercises, pages
Lesson. Exercises, pges A. Expnd nd simplify. ) + b) ( ) () 0  ( ) () 0 c) 7 + d) (7) ( ) 7  + 8 () ( 8). Expnd nd simplify. ) b)  7  + 7 7( ) ( ) ( ) 7( 7) 8 (7) P DO NOT COPY.. Multiplying nd Dividing
More informationLecture 2 : Propositions DRAFT
CS/Mth 240: Introduction to Discrete Mthemtics 1/20/2010 Lecture 2 : Propositions Instructor: Dieter vn Melkeeek Scrie: Dlior Zelený DRAFT Lst time we nlyzed vrious mze solving lgorithms in order to illustrte
More informationConvergence of Fourier Series and Fejer s Theorem. Lee Ricketson
Convergence of Fourier Series nd Fejer s Theorem Lee Ricketson My, 006 Abstrct This pper will ddress the Fourier Series of functions with rbitrry period. We will derive forms of the Dirichlet nd Fejer
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationMath 360: A primitive integral and elementary functions
Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:
More informationSection 6.1 Definite Integral
Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined
More informationSuppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = 2.
Mth 43 Section 6. Section 6.: Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot
More informationState Minimization for DFAs
Stte Minimiztion for DFAs Red K & S 2.7 Do Homework 10. Consider: Stte Minimiztion 4 5 Is this miniml mchine? Step (1): Get rid of unrechle sttes. Stte Minimiztion 6, Stte is unrechle. Step (2): Get rid
More informationVectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3dimensional vectors:
Vectors 1232018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2dimensionl vectors: (2, 3), ( )
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationList all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.
Mth Anlysis CP WS 4.X Section 4.4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether  is root of 0. Show
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
More informationTHE EXISTENCEUNIQUENESS THEOREM FOR FIRSTORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCEUNIQUENESS THEOREM FOR FIRSTORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrdlindeloftheorem/ This document is proof of the existenceuniqueness theorem
More informationChapter 1: Fundamentals
Chpter 1: Fundmentls 1.1 Rel Numbers Types of Rel Numbers: Nturl Numbers: {1, 2, 3,...}; These re the counting numbers. Integers: {... 3, 2, 1, 0, 1, 2, 3,...}; These re ll the nturl numbers, their negtives,
More informationapproaches as n becomes larger and larger. Since e > 1, the graph of the natural exponential function is as below
. Eponentil nd rithmic functions.1 Eponentil Functions A function of the form f() =, > 0, 1 is clled n eponentil function. Its domin is the set of ll rel f ( 1) numbers. For n eponentil function f we hve.
More informationLinear Inequalities. Work Sheet 1
Work Sheet 1 Liner Inequlities RentHep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend
More informationQUADRATIC RESIDUES MATH 372. FALL INSTRUCTOR: PROFESSOR AITKEN
QUADRATIC RESIDUES MATH 37 FALL 005 INSTRUCTOR: PROFESSOR AITKEN When is n integer sure modulo? When does udrtic eution hve roots modulo? These re the uestions tht will concern us in this hndout 1 The
More informationAQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system
Complex Numbers Section 1: Introduction to Complex Numbers Notes nd Exmples These notes contin subsections on The number system Adding nd subtrcting complex numbers Multiplying complex numbers Complex
More information7. Indefinite Integrals
7. Indefinite Integrls These lecture notes present my interprettion of Ruth Lwrence s lecture notes (in Herew) 7. Prolem sttement By the fundmentl theorem of clculus, to clculte n integrl we need to find
More informationThe Dirichlet Problem in a Two Dimensional Rectangle. Section 13.5
The Dirichlet Prolem in Two Dimensionl Rectngle Section 13.5 1 Dirichlet Prolem in Rectngle In these notes we will pply the method of seprtion of vriles to otin solutions to elliptic prolems in rectngle
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
More informationSelfsimilarity and symmetries of Pascal s triangles and simplices mod p
Sn Jose Stte University SJSU ScholrWorks Fculty Publictions Mthemtics nd Sttistics Februry 2004 Selfsimilrity nd symmetries of Pscl s tringles nd simplices mod p Richrd P. Kubelk Sn Jose Stte University,
More informationODE: Existence and Uniqueness of a Solution
Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =
More informationTorsion in Groups of Integral Triangles
Advnces in Pure Mthemtics, 01,, 11610 http://dxdoiorg/1046/pm011015 Pulished Online Jnury 01 (http://wwwscirporg/journl/pm) Torsion in Groups of Integrl Tringles Will Murry Deprtment of Mthemtics nd Sttistics,
More informationLinear Systems with Constant Coefficients
Liner Systems with Constnt Coefficients 4305 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system
More informationLecture 2: January 27
CS 684: Algorithmic Gme Theory Spring 217 Lecturer: Év Trdos Lecture 2: Jnury 27 Scrie: Alert Julius Liu 2.1 Logistics Scrie notes must e sumitted within 24 hours of the corresponding lecture for full
More informationMathematics Number: Logarithms
plce of mind F A C U L T Y O F E D U C A T I O N Deprtment of Curriculum nd Pedgogy Mthemtics Numer: Logrithms Science nd Mthemtics Eduction Reserch Group Supported y UBC Teching nd Lerning Enhncement
More information#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z
#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z Kurt Girstmir Institut für Mthemtik, Universität Innsruck, Innsruck, Austri kurt.girstmir@uik.c.t Received: 10/4/16, Accepted: 7/3/17, Pulished:
More informationIntroduction to Mathematical Reasoning, Saylor 111
Frction versus rtionl number. Wht s the difference? It s not n esy question. In fct, the difference is somewht like the difference between set of words on one hnd nd sentence on the other. A symbol is
More informationExam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH1105 Instructor: Attila Máté 1
Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixedpoint itertion to converge when solving the eqution
More informationCS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 9 1. (4pts) ((p q) (q r)) (p r), prove tutology using truth tles. p
More informationMath 154B Elementary Algebra2 nd Half Spring 2015
Mth 154B Elementry Alger nd Hlf Spring 015 Study Guide for Exm 4, Chpter 9 Exm 4 is scheduled for Thursdy, April rd. You my use " x 5" note crd (oth sides) nd scientific clcultor. You re expected to know
More informationFrobenius numbers of generalized Fibonacci semigroups
Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 296340975, USA gmtthe@clemson.edu Received:, Accepted:, Published:
More informationChapter 6 Techniques of Integration
MA Techniques of Integrtion Asst.Prof.Dr.Suprnee Liswdi Chpter 6 Techniques of Integrtion Recll: Some importnt integrls tht we hve lernt so fr. Tle of Integrls n+ n d = + C n + e d = e + C ( n ) d = ln
More informationIs there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them!
PUSHING PYTHAGORAS 009 Jmes Tnton A triple of integers ( bc,, ) is clled Pythgoren triple if exmple, some clssic triples re ( 3,4,5 ), ( 5,1,13 ), ( ) fond of ( 0,1,9 ) nd ( 119,10,169 ). + b = c. For
More informationPolynomials and Division Theory
Higher Checklist (Unit ) Higher Checklist (Unit ) Polynomils nd Division Theory Skill Achieved? Know tht polynomil (expression) is of the form: n x + n x n + n x n + + n x + x + 0 where the i R re the
More informationAPPENDIX. Precalculus Review D.1. Real Numbers and the Real Number Line
APPENDIX D Preclculus Review APPENDIX D.1 Rel Numers n the Rel Numer Line Rel Numers n the Rel Numer Line Orer n Inequlities Asolute Vlue n Distnce Rel Numers n the Rel Numer Line Rel numers cn e represente
More informationMath Solutions to homework 1
Mth 75  Solutions to homework Cédric De Groote October 5, 07 Problem, prt : This problem explores the reltionship between norms nd inner products Let X be rel vector spce ) Suppose tht is norm on X tht
More information