Square-Congruence Modulo n
|
|
- Blake Griffin
- 5 years ago
- Views:
Transcription
1 Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet Modulo if they are related to each other by the differece of squares relatio S o defied as as b if a b Sice S is a equivalece relatio o, the equivalece classes of S iduce a partitio of Defie to be that partitio. ={equivalece classes iduced by S } The Discrete Math exercises that started this ivestigatio were to fid the partitio for various values of. As a istructor, I wated to keep the problems maageable. I did t wat the umber of equivalece classes to be too great. So, I eeded a way to "predict" the umber of equivalece classes for ay. I eeded to kow the followig fuctio. Defiitio The fuctio u is : ( ) the umber of equivalece classes iduced by the size of the set Our motivatig task became to determie the values of first few values of. We did't otice a patter util 5 ad 6. S. Table 1 shows a summary for the Figure shows how for 5 the umbers that relate to 1 are all 1 less or 1 greater tha every multiple of 5. Ad the umbers that relate to are all less or greater tha every multiple of 5. Figure 3 shows a similar arragemet for 6. From Figures ad 3, two thigs are immediately apparet. The diagrams are periodic with period ad they are evely symmetric about. Because of these properties, to cout the equivalece classes you eed oly cosider the first few bracketed umbers that establish the First Half Cycle. 1
2 Accordig the patter established by Figures ad 3, the value of Half Cycle. This suggests that the sequece of values for But 4 does't fit the patter. is the size of 's First would be 1, odd 1,,,3,3,4,4,... 1, eve 4 is equal to istead of 3. We wodered if 4 was special because it's square or perhaps because it's a power of. But it turs out 4 is special for a more subtle reaso. Table ,0,1,,3,4,5, ,0,,4,6, ,1,3,5,7, ,0,3,6,9, ,1,,4,5,7,8, ,0,,4,6, ,1,3,5,7, ,0,5,10,15, ,1,4,6,9,......,,3,7,8, ,0,6,1,18, ,1,5,7,11,......,,4,8,10, ,3,9,15,1,... Figure Figure 3 It was clear that we eeded more empirical evidece to guide our cojectures. We made a catalog of the diagrams from 1 to 40. Table 4 shows the First Half Cycles for each. The First Half Cycles correspod to the bracketed umbers from Figures ad 3. The First Full Cycles are show i Table 5 for referece. Oe thig to otice right away is that if d is divisible by 4, its period is cut i half. This is the subtle reaso why 4 eds up beig special.
3 If has a First Half Cycle where every bar is touchig the diagoal, the cotais its maximum umber of equivalet classes. I that case we call complete. But ot all the Half Cycles are like that. Some Half Cycles have dropouts. A dropout is where the bar does ot reach the diagoal. Every dropout elimiates oe possible equivalece class ad reduces the size of by oe. I other words, the size of 's half cycle the umber of dropouts for the umber of bars that touch the diagoal Table 4 - Half Cycles Table 5 - Full Cycles 3
4 Now the challege becomes to fid patters amog the dropouts. If the dropouts have reliable patters, we may get a reliable way to compute. For example, it appears that all the prime umbers are complete ad have o dropouts. However, the primes are ot the oly complete umbers. Is there a overall patter for the complete umbers? Take a momet ad look for other patters. Please visit our website at to see the diagrams up closer. Part II - A Diagram Fuctio ad a Cap o If you take ay diagram ad fully exted it left ad right, you'll see what appears to be the graph of a eve, periodic fuctio o. This is the fuctio that takes each iteger to its equivalece class uder S where each equivalece class is represeted by its smallest oegative member o the vertical axis. We ca write this fuctio as Defiitio For the relatio S, the fuctio is :, ( a ) the smallest o egative iteger related to a Let's set up a few covetios before we go o. We defie the atural umbers to iclude 0,1,,3,... 1,,3,... for the positive zero,. Whe we wat to exclude zero, we ll use itegers. All throughout this paper ad ab, eve if ot explicitly stated. Theorem 1 - The fuctio (i) [ a] [ a] (ii) a is the smallest o egative member of (iii) [ a ] represets [ ] (iv) a b if ad oly if [ a] [ b] (v) (vi) sizeimg (i) Follows by defiitio sice a relates to a. a uiquely by its smallest o-egative member. a. (ii) Follows sice a is the set of all itegers related to a. (iii) Follows because the smallest o-egative member of a set of itegers is uique. 4
5 (iv) Assume [ a] [ b]. The a ad the same set. Hece, they must be the same. Coversely, if a b the a b, ad so by (i) [ a ] [ b ]. (v) We must show a a. Sice a a, by (ii) egative member of a. But by (i) [ ] [ ] a a. So a is the smallest o egative member of a which by (ii) is a. Hece a a. (vi) Defie the fuctio zeta : img, c c. We claim is bijective. Let cd, img such that c d. Sice c ad d are i the image of, by (v) c c ad d d. So, by (iv), we have c d ad is oe-to-oe. Now let c. The by (i), c c ad is oto. Therefore, is bijective ad we have size img size b are both the smallest o-egative member of a is the smallest o The ext theorem establishes the symmetric ad periodic properties of the diagrams that we observed previously. To prove the theorem, we'll rely o this lemma from Theorem 1 (iii). lemma a b Theorem - Properties of (i) (ii) (i) Sice if ad oly if asb. is eve: a a. is periodic with period : a a. has period a a (iii) If is divisible by 4, the a a 0 ad 0 established. (ii) Sice, ( a ) a a a a a we have that a a ( a ).. Hece as a ad (i) is we have that ( a ) a. Hece ( a ) S a ad (ii) is established. (iii) Let be such that 4, k k. We must show ( a ) S a. Sice 5
6 ( a ) a ( a k) a a 4k 4k a k k k k k we have that ( a ) a. Hece ( a ) S a ad (iii) is established. Sice divisible by 4 is special, we make these defiitios. Defiitio A eve umber divisible by 4 is called double-eve. A eve umber ot divisible by 4 is called sigle-eve. Furthermore, let E = {all sigle-eve umbers} S We offer these observatios without proof: (i) If is double eve, the is the product of two eves. (ii) All itegers belog i oe of three classes: odd {k1, k}, sigle-eve E {4k, k}, or double-eve {4 k, k}. s (iii) Sice all odd umbers are already the product of two odds, we do t defie double-odd. (iv) A sigle-eve umber caot be expressed as the product of two eves or two odds. Theorem ca ow be summarized as (i) is eve (ii) (iii) has period has period whe is double-eve Now we re ready to state the theorem that provides a upper boud for boud is simply the size of the First Half Cycle of.. This upper Theorem 3 - Cap o ( 1) /, odd ( ) +1, sigle eve 4 +1, double eve Sice is periodic o with period, it is oto the image of ay set of cosecutive itegers. For eve, choose the set of cosecutive itegers 1,...,0,...,. For 6
7 odd, choose the set 1,...,0,..., 1 of cosecutive itegers. Sice is a eve fuctio, we ca fold these sets across zero ad coclude that is oto the image of 0,..., if is eve ad is oto the image of 0,..., 1 whe is odd. If is double-eve, the has period. By the same argumet used for eve, we coclude that is oto the image of 0,..., 4 whe is double-eve. From Theorem 1 we kow that size img. Sice is a fuctio from to, the image of a fiite set uder must be the same size or smaller tha the set itself. So, for eve size img size 0,..., size 0,..., 1, for odd sizeimg size 0,..., 1 size 0,..., ad for double-eve size img size 0,..., 4 size 0,..., Part III - Completeess ad Dropouts The cap o i Theorem 8 tells us a lot about value is oe less tha the cap.. Let s defie a ew fuctio whose Defiitio ( 1) /, odd :, ( ), sigle eve 4, double eve Theorem 3 says that which meas that ( ) ( ) 1 max size of ( ) 1 Furthermore, the proof of Theorem 3 shows how the equivalece classes i amog the values of a 0,1,,...,. a o its First Half Cycle are foud Defiitio 7
8 We say that is complete if ( ) ( ) 1. If is complete, the all the bars i its First Half Cycle touch the diagoal. If is ot complete, the has dropouts where bars do ot touch the diagoal. We defie such bars as dropouts whe they occur i the First Half Cycle. Defiitio has a [a]-dropout if 0 a a. We say that has a dropout at a. a drops out to a ad that If has a [a]-dropout the the bar at a "drops out" to the height a. Ofte we oly eed to kow if has a dropout at a without eedig to kow what value it drops out to. For this, we have The Dropout Test. Theorem 4 - The Dropout Test has a [a]-dropout if ad oly if b a ad 0 b a for some umber b. The forward implicatio is clear from the defiitio. Cosider the coverse. Sice b is related to a, by the defiitio of we have 0 a b. Therefore 0 a a ad we have a [a]-dropout. We ow list some of the cosequeces of completeess. Theorem 5 - Completeess Whe is complete, (i) has the maximum umber of equivalece classes allowed by Theorem 3. (ii) { [0], [1], [],..., [ ( )] }. (iii) has o dropouts. Needs a little proof use Theorems 1 ad 3. By defiitio, if is complete, we kow how to compute. So, what umbers are complete? The previous cojecture that primes are complete is fairly easy to prove. Theorem 6 - p is complete If p is prime, the p is complete. 8
9 Evidetly, is complete. Let p be prime. Assume there is a dropout at a. We must show a cotradictio. By The Dropout Test, for some b we have p 1 b a 0 b a p. Therefore 0 a b p p a b This cotradicts b ad 0 a b p ad ad p a b p a ba b a b a is ot related to b. a. We'd like to "verify" Theorem 6 by checkig it agaist the diagrams. The Dropout Tree i Table th 6 summarizes the diagrams. The row lists the values of 0 a. The row a for values are the heights of the bars i the First Half Cycle for. The dropouts show up as colors differet from earby umbers. The complete umbers appear i The Dropout Tree as rows with the cosecutive umbers 0,1,,..., ad o discotiuous colors. Verify that all the primes look complete. Verify that there are complete umbers that are ot prime. What is the patter? Ca we characterize the umbers that are complete? Take a momet to otice other patters i The Dropout Tree. Visit our website at to see The Dropout Tree up to 100. Part IV - Characterizig [0] Let's take a iterlude to look at aother area of iterest. Ca we characterize the equivalece classes themselves? We begi by lookig at the zero class 0 which cotais all itegers equivalet to zero uder the square-cogruece relatio Theorem 7 - Characterizatio of [0] The zero class [0] is the set of all multiples of the smallest positive iteger whose square is divisible by. We eed some ew defiitios ad a ew fuctio to help us talk about Theorem 7. Defiitio If is composite but has o multiple prime factors, the is simple-composite. Otherwise, if is composite with multiple prime factors, the is multi-composite. S. 9
10 All itegers are oe of three thigs: prime, simple-composite, or multi-composite. All doubleeve umbers are multi-composite. Table 6 - The Dropout Tree up to =40 Defiitio The square-root prime-factor reductio fuctio is spr:, Theorem 8 - spr fuctio (i) spr ( ) m1 m m k 1 m1 m spr( ) p p p k whe p1 p p k (ii) spr ( ) is the smallest square divisible by. (iii) spr( ) is the smallest positive iteger whose square is divisible by. (iv) a if ad oly if spr( ) a. (v) spr( ) if ad oly if is prime or simple-composite. (vi) spr( ) if ad oly if is multi-composite m k 10
11 Needs a proof. Will hige o the fact that mi m i if ad oly if mi 1. Theorem 7 ca ow be restated ad proved. Theorem 7 - Characterizatio of [0] The zero class [0] for S is the set of all multiples of spr. Needs a proof. Should be straightforward usig the properties of spr. Corollaries to Theorem 7 (i) [0] cotais oly the multiples of iff is prime or simple-composite. (ii) [0] cotais more tha the multiples of iff is multi-composite. Theorem 7 leads to our first major result cocerig patters of dropouts. By the Dropout Test of Theorem 4, we have that 0 d 0 d. has a [0]-dropout iff for some d such that Theorem 9 - The [0]-dropout Theorem has [0]-dropouts if ad oly if is oe of three thigs: (i) odd multi-composite (ii) sigle-eve multi-composite (iii) double-eve where 4 is multi-composite. Needs a proof. Use Theorems 7 ad 8. So, oly multi-composite umbers have [0]-dropouts, but ot every multi-composite umber does. You ca check that this is true o the Dropout Tree i Table 6. The first few multicomposite umbers are multi-composites 8,9,1,16,18,0,4,5,7,8,3,36,40,... Multi-composites that do ot have [0]-dropouts are accouted for by the exceptio i Theorem 9 (iii). For example, 4 3 has o [0]-dropouts sice which is ot multicomposite. Although The [0]-dropout Theorem tells us whe has [0]-dropouts, it does't tell us how may [0]-dropouts there are. Coutig the umber of dropouts is crucial to computig. This topic will be explored later. 11
Congruence Modulo a. Since,
Cogruece Modulo - 03 The [ ] equivalece classes refer to the Differece of quares relatio ab if a -b o defied as Theorem 3 - Phi is Periodic, a, [ a ] [ a] The period is Let ad a We must show ( a ) a ice,
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationThe Structure of Z p when p is Prime
LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationOn a Smarandache problem concerning the prime gaps
O a Smaradache problem cocerig the prime gaps Felice Russo Via A. Ifate 7 6705 Avezzao (Aq) Italy felice.russo@katamail.com Abstract I this paper, a problem posed i [] by Smaradache cocerig the prime gaps
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
More informationSOLVED EXAMPLES
Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as
More informationAn analog of the arithmetic triangle obtained by replacing the products by the least common multiples
arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;
More informationCardinality Homework Solutions
Cardiality Homework Solutios April 16, 014 Problem 1. I the followig problems, fid a bijectio from A to B (you eed ot prove that the fuctio you list is a bijectio): (a) A = ( 3, 3), B = (7, 1). (b) A =
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More information(I.D) THE PRIME NUMBER THEOREM
(I.D) THE PRIME NUMBER THEOREM So far, i our discussio of the distributio of the primes, we have ot directly addressed the questio of how their desity i the atural umbers chages as oe keeps coutig. But
More informationIntermediate Math Circles November 4, 2009 Counting II
Uiversity of Waterloo Faculty of Mathematics Cetre for Educatio i Mathematics ad Computig Itermediate Math Circles November 4, 009 Coutig II Last time, after lookig at the product rule ad sum rule, we
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationThe minimum value and the L 1 norm of the Dirichlet kernel
The miimum value ad the L orm of the Dirichlet kerel For each positive iteger, defie the fuctio D (θ + ( cos θ + cos θ + + cos θ e iθ + + e iθ + e iθ + e + e iθ + e iθ + + e iθ which we call the (th Dirichlet
More informationInjections, Surjections, and the Pigeonhole Principle
Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationThe Growth of Functions. Theoretical Supplement
The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More information1 Approximating Integrals using Taylor Polynomials
Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................
More informationMath 609/597: Cryptography 1
Math 609/597: Cryptography 1 The Solovay-Strasse Primality Test 12 October, 1993 Burt Roseberg Revised: 6 October, 2000 1 Itroductio We describe the Solovay-Strasse primality test. There is quite a bit
More informationThe log-behavior of n p(n) and n p(n)/n
Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More information[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]
[ 47 ] Number System 1. Itroductio Pricile : Let { T ( ) : N} be a set of statemets, oe for each atural umber. If (i), T ( a ) is true for some a N ad (ii) T ( k ) is true imlies T ( k 1) is true for all
More informationSection 5.1 The Basics of Counting
1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of
More information2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.
CHAPTER 2 The Real Numbers 2.. The Algebraic ad Order Properties of R Defiitio. A biary operatio o a set F is a fuctio B : F F! F. For the biary operatios of + ad, we replace B(a, b) by a + b ad a b, respectively.
More informationpage Suppose that S 0, 1 1, 2.
page 10 1. Suppose that S 0, 1 1,. a. What is the set of iterior poits of S? The set of iterior poits of S is 0, 1 1,. b. Give that U is the set of iterior poits of S, evaluate U. 0, 1 1, 0, 1 1, S. The
More informationMath 2784 (or 2794W) University of Connecticut
ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really
More informationIntegrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number
MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios
More informationHomework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is
Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of
More informationMATH 304: MIDTERM EXAM SOLUTIONS
MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest
More informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the
More informationLecture 1. January 8, 2018
Lecture 1 Jauary 8, 018 1 Primes A prime umber p is a positive iteger which caot be writte as ab for some positive itegers a, b > 1. A prime p also have the property that if p ab, the p a or p b. This
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More informationLecture 6: Integration and the Mean Value Theorem. slope =
Math 8 Istructor: Padraic Bartlett Lecture 6: Itegratio ad the Mea Value Theorem Week 6 Caltech 202 The Mea Value Theorem The Mea Value Theorem abbreviated MVT is the followig result: Theorem. Suppose
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More information4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3
Exam Problems (x. Give the series (, fid the values of x for which this power series coverges. Also =0 state clearly what the radius of covergece is. We start by settig up the Ratio Test: x ( x x ( x x
More informationSequences. A Sequence is a list of numbers written in order.
Sequeces A Sequece is a list of umbers writte i order. {a, a 2, a 3,... } The sequece may be ifiite. The th term of the sequece is the th umber o the list. O the list above a = st term, a 2 = 2 d term,
More informationTrial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014
Iteger Divisio Algorithm ad Cogruece Iteger Trial divisio,,, ad with itegers mod Iverses mod Multiplicatio ad GCD Iteger Christopher Koch 1 1 Departmet of Computer Sciece ad Egieerig CSE489/589 Algorithms
More informationand each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.
MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,
More informationFrequentist Inference
Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationChapter IV Integration Theory
Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationCounting Well-Formed Parenthesizations Easily
Coutig Well-Formed Parethesizatios Easily Pekka Kilpeläie Uiversity of Easter Filad School of Computig, Kuopio August 20, 2014 Abstract It is well kow that there is a oe-to-oe correspodece betwee ordered
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationOn Some Properties of Digital Roots
Advaces i Pure Mathematics, 04, 4, 95-30 Published Olie Jue 04 i SciRes. http://www.scirp.org/joural/apm http://dx.doi.org/0.436/apm.04.46039 O Some Properties of Digital Roots Ilha M. Izmirli Departmet
More information(I.C) THE DISTRIBUTION OF PRIMES
I.C) THE DISTRIBUTION OF PRIMES I the last sectio we showed via a Euclid-ispired, algebraic argumet that there are ifiitely may primes of the form p = 4 i.e. 4 + 3). I fact, this is true for primes of
More informationAlternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.
0_0905.qxd //0 :7 PM Page SECTION 9.5 Alteratig Series Sectio 9.5 Alteratig Series Use the Alteratig Series Test to determie whether a ifiite series coverges. Use the Alteratig Series Remaider to approximate
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationSummary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function
Summary: Cogrueces j whe divided by, ad determiig the additive order of a iteger mod. As described i the Prelab sectio, cogrueces ca be thought of i terms of coutig with rows, ad for some questios this
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationLecture 3 The Lebesgue Integral
Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified
More informationSeries Review. a i converges if lim. i=1. a i. lim S n = lim i=1. 2 k(k + 2) converges. k=1. k=1
Defiitio: We say that the series S = Series Review i= a i is the sum of the first terms. i= a i coverges if lim S exists ad is fiite, where The above is the defiitio of covergece for series. order to see
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More information4 A Survey of Congruent Results 1
4 A Survey of Cogruet Results 1 SECTION 4.4 ersee Numbers By the ed of this sectio you will be able to decide which ersee umbers are composite fid factors of ersee umbers How would you fid the largest
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationMachine Learning Theory Tübingen University, WS 2016/2017 Lecture 11
Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract We will itroduce the otio of reproducig kerels ad associated Reproducig Kerel Hilbert Spaces (RKHS). We will cosider couple
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty
More information1 Introduction. 1.1 Notation and Terminology
1 Itroductio You have already leared some cocepts of calculus such as limit of a sequece, limit, cotiuity, derivative, ad itegral of a fuctio etc. Real Aalysis studies them more rigorously usig a laguage
More information7 Sequences of real numbers
40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are
More informationSequences I. Chapter Introduction
Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which
More informationMeasure and Measurable Functions
3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies
More informationAlliance Partition Number in Graphs
Alliace Partitio Number i Graphs Lida Eroh Departmet of Mathematics Uiversity of Wiscosi Oshkosh, Oshkosh, WI email: eroh@uwoshedu, phoe: (90)44-7343 ad Ralucca Gera Departmet of Applied Mathematics Naval
More informationLecture 4: Unique-SAT, Parity-SAT, and Approximate Counting
Advaced Complexity Theory Sprig 206 Lecture 4: Uique-SAT, Parity-SAT, ad Approximate Coutig Prof. Daa Moshkovitz Scribe: Aoymous Studet Scribe Date: Fall 202 Overview I this lecture we begi talkig about
More information3.1 Counting Principles
3.1 Coutig Priciples Goal: Cout the umber of objects i a set. Notatio: Whe S is a set, S deotes the umber of objects i the set. This is also called S s cardiality. Additio Priciple: Whe you wat to cout
More informationLecture 6: Integration and the Mean Value Theorem
Math 8 Istructor: Padraic Bartlett Lecture 6: Itegratio ad the Mea Value Theorem Week 6 Caltech - Fall, 2011 1 Radom Questios Questio 1.1. Show that ay positive ratioal umber ca be writte as the sum of
More informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More information4. Partial Sums and the Central Limit Theorem
1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems
More informationRecursive Algorithm for Generating Partitions of an Integer. 1 Preliminary
Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the
More informationMath 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More informationMath 140A Elementary Analysis Homework Questions 3-1
Math 0A Elemetary Aalysis Homework Questios -.9 Limits Theorems for Sequeces Suppose that lim x =, lim y = 7 ad that all y are o-zero. Detarime the followig limits: (a) lim(x + y ) (b) lim y x y Let s
More information10.6 ALTERNATING SERIES
0.6 Alteratig Series Cotemporary Calculus 0.6 ALTERNATING SERIES I the last two sectios we cosidered tests for the covergece of series whose terms were all positive. I this sectio we examie series whose
More informationChapter 2. Periodic points of toral. automorphisms. 2.1 General introduction
Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad
More informationFourier Analysis, Stein and Shakarchi Chapter 8 Dirichlet s Theorem
Fourier Aalysis, Stei ad Shakarchi Chapter 8 Dirichlet s Theorem 208.05.05 Abstract Durig the course Aalysis II i NTU 208 Sprig, this solutio file is latexed by the teachig assistat Yug-Hsiag Huag with
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22
CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first
More informationn=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n
Series. Defiitios ad first properties A series is a ifiite sum a + a + a +..., deoted i short by a. The sequece of partial sums of the series a is the sequece s ) defied by s = a k = a +... + a,. k= Defiitio
More informationMathematical Induction
Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More information