Brownian Motion and Random Prime Factorization
|
|
- Miranda Green
- 5 years ago
- Views:
Transcription
1 Brownian Motion and Random Prime Factorization Kendrick Tang June 4, 202 Contents Introduction 2 2 Brownian Motion 2 2. Develoing Brownian Motion Measure Saces and Borel Sigma-Algebras A Collection of Continuous Paths A Short Introduction to Wiener Measure Three Defining Proerties of Browning Motion A Maing From C 0 [0, T ] to C 0 [0, ] Alying the Wiener Measure Distribution of the Greatest Positive Excursion Paul Levy s Arcsine Law The Gambler s Fortune A Different Prime Counting Function 8 3. Defining the Function Primes and Probability Brownian Motion and Primes 9 4. A Very Useful Aroximation Constructing and Correcting the Path Constructing the ath Correcting the Drift Correcting the Variance Correcting the Path Polygonality Proerties of Integers using Prime Factorization Conclusion 5 Bibliograhy 6
2 2 of 6 Introduction This aer will reflect the material covered in Patrick Billingsley s Prime Numbers and Brownian Motion aer from 973 []. First I will develo some concets of Brownian motion and introduce the Wiener measure for subsets of the set of continuous functions which ma the unit interval to the real line. Afterwards I will introduce a rime-factorization counting function and some roerties. In the final section of my aer, the two seemingly searate ideas will be tied together: I will construct a random ath from the integers using the rime-factorization counting function and use tools exlained in the revious sections to modify the ath to model Brownian motion. Then using a robability limit, I will conclude several interesting roerties of the rime factorization of numbers. 2 Brownian Motion 2. Develoing Brownian Motion Brownian motion is a mathematical model of a article that dislays inherently irregular and random movements. In this aer I will only be focusing on one dimensional Brownian motion. It is in this section where I introduce and define some necessary conditions for Brownian motion and notation, as well as the Wiener measure. However, I must first begin by defining measure saces and Borel sigma algebras. 2.. Measure Saces and Borel Sigma-Algebras The following material does not need to be fully understood for the reader to understand the rest of the aer. It is, however, an introduction to measure theory and borel sigma algebras which are both deely involved in the constraints of the big theorems of this aer. This section can be skied by the reader, and used as a reference when measure theory and borel sets are mentioned in the later arts of this aer. Definition 2.. A measurable sace defined by a large samle sace Ω, a subset of Ω, B, and is couled with a measure, µ to form a measure sace. A measure sace is notated by Ω, B, µ). In this aer we will be focusing on the set of continuous functions that ma the unit interval to the real line C 0, and sigma-algebras of C 0, secifically the Borel sigma-algebra. Definition 2.2. A sigma-algebra σ-algebra) is a collection of subsets of the samle sace that contains the emty set, is closed under countable unions, and is closed under comlements [2]. The largest sigma-algebra of Ω is the owerset of Ω, and the smallest sigmaalgebra is {, Ω} [2]. For this aer we will only consider the Borel sigmaalgebra:
3 3 of 6 Definition 2.3. The Borel sigma-algebra on Ω is the smallest sigma-algebra containing all oen sets of Ω, and a Borel set is an element of the Borel sigmaalgebra [2]. The measure in a measure sace can be any kind of measure. In this aer we will only consider the Wiener measure described in 2..3), which is a robalility measure, so we refer to our measure sace as a robability sace. Thus, we can write the measure sace this aer focuses on as C 0 [0, ], A, P ) where C 0 [0, ] is the set of continuous functions on the unit interval, A is a subset of C 0 [0, ], and P the Wiener measure of Borel sets on C 0 [0, ]. However, to form a sigma algebra on C 0 [0, ] we must be able to define an oen set. Thus, we define the metric for aths in C 0 [0, ] to be df, g) = max fx) gx), f, g C 0 [0, ] the maximum vertical dislacement of two functions in C 0 [0, ]. A set S is oen if for every x in S, there is a neighborhood around x that is comletely contained in S. In other words, for each x in S, there is an ɛ greater than 0 so that all y for which dx, y) < ɛ are contained in S. Again, these Borel sets are not of great imortance to understand the material in this aer, but are imortant to kee in mind because of some constraints on the Wiener measure which will be described later in the aer A Collection of Continuous Paths Consider the function xt) : [0, T ] R that reresents the vertical osition of a article that begins at the origin: x0) = 0. At each infinitesimal time interval, the article will either take an infinitesimal ste u or down. Thus, xt) C 0 [0, T ] where C 0 [0, T ] is the set of all continuous functions that ma [0, T ] to the real line and satisfy x0) = 0. For the majority of this aer, I will only either be working with the set of functions C 0 [0, ] continuous functions maing the unit interval to the real line), or a secial maing of functions in C 0 [0, T ] to C 0 [0, ] defined later in A Short Introduction to Wiener Measure The measureable sace C 0 [0, ] is of little interest in this aer. Instead we are interested in subsets A and the robability mesaure to derive interesting roerties of A. This measure, the Wiener measure P T A), determines the robability that a function x C 0 [0, T ] is in A. For examle, if A = {xt) : xt) < 0, t [0, T ]}, is the set of functions which always have negative dislacement, then P T A) would be the robability that a function randomly icked from C 0 0, T ) will also be in A. At this oint, the reader should note that it is not always ossible to define P T A) for all subsets of C[0, T ]. However, originally roven by Norbert Wiener in 923 [], the existance of P T A) does exist for all Borel sets
4 4 of 6 see 2.3). Also note that deriving the Wiener measure of a subset A is beyond the scoe of this aer; we will only be examining the Wiener measure of three different subsets Three Defining Proerties of Browning Motion Using the Wiener measure for a secific subset of C 0, I will define two of the criteria for Brownian motion. Consider the event A = [x : α xt) β], ) the set of functions where the article travels through the vertical gate [α, β] at time t. Note that the only restriction on α, β is that α < β. The Wiener measure of this event a relationshi taken for granted in this aer) is defined in [] to be P T [x : α xt) β] = 2πt β α e u2 /2t du. 2) Note that 2) is the integral of a gaussian with mean 0 and variance t. These will be the first two defining roerties of Brownian motion. These two roerties reflect non-drift since there is an equal chance of moving u or down) and the article s tendency to wander away from the origin. We will exect anything that exhibits Brownian motion to satisfy this roerty. The third roerty of Brownian motion is indeendence. Particles in Brownian motion move randomly, which means the direction a article moves in one time interval is comletely indeendent of how the article moves in another time interval. Consider t < t < s < s. If A is the subset of functions with roerty M defined on [t, t ] and B the subset of functions with another roerty N on [s, s ] then P T A B) = P T A)P T B). 3) The robability that x is in the intersection of A and B is the roduct of the robability of x A and the robability of x B because the robability of each event haening is indeendent of each other []. This can be generalized to multile events: Lemma 2.. If A,...A n are sets of functions that satisfy roerties for t τ [0, T ] where τ i τ j = for all i, j then P T A A 2... A n ) = P T A )P T A 2 )...P T A n ). 4) Proof. Since A A 2 A 3 = A A 2 A 3 ), and by 3), Continue by induction to show 4) P T A A 2 A 3 )) = P T A )P T A 2 A 3 ) P T A A 2 A 3 ) = P T A )P T A 2 )P T A 3 ).
5 5 of 6 In this aer, a article is in Brownian motion if it satisfies the three roerties restated below for the reader s convenience: For event ), the Wiener measure must follow the distribution of a gaussian with mean zero and variance t. Events over disjoint time intervals must be indeendent of each other A Maing From C 0 [0, T ] to C 0 [0, ] In this section I define a maing C 0 [0, T ] to C 0 [0, ] which also reserves Bronian motion. Given a article s ath xt) C 0 [0, T ], seed u the argument by T and shrink the amlitude by / T : yt) = T xtt ), t [0, ]. 5) Theorem 2.2. If yt) is defined by 5) then yt) C 0 [0, ] and yt) will exhibit Brownian motion as described in 2..4) []. Proof. Since xt) describes Brownian motion, the Wiener measure of xt) through the gate [α, β] at time t will be defined by a gaussian with mean 0 and variance t. By changing the time scale, xtt ) will have a similar Wiener measure, with mean 0, but variance now tt : P T [xtt ) : α xtt ) β] = 2πt β α e u2 /2tT du. By rescaling the random variable xt) the gaussian will change as follows: the mean will change by the scaling factor, and variance by the square of the scaling factor. Thus the mean remains zero, but the variance will be reduced to t ) 2 since tt T = t. Furthermore, indeedent events will remain indeendent through the uniform time and dislacement scaling. Therefore, the maing mas C 0 [0, T ] to C 0 [0, ] and reserves Brownian motion. This maing has an interesting consequence: Theorem 2.3. For any ɛ > 0, K > 0, define A to be functions with at least one chord with sloe exceeding K. Then P A) > ɛ []. Proof. Let ɛ > 0 b First begin with xt) C 0 [0, T ]. Choose T large enough so with robability larger than ɛ, xt) will have sloe larger than. This event isn t too strange and unfathomable that given enough time, it is guaranteed that xt) will roduce this given enough time. Also make sure T is larger than K 2. Now xt) is a function with sloe at least and belongs in C 0 [0, T ], T > K 2. Now ma xt) to yt) with 5). By shrinking the time scale, the sloe is increased from to T. By shrinking the vertical scale by / T the sloe is then reduced to T/ T > K 2 /K = K.
6 6 of 6 I will now resent, but not rove, some corollaries of 2.3, which are mentioned in []: Corollary 2.4. Since ɛ and K were chosen arbitrarily, with robability a randomly icked function from C 0 [0, ] will have at least one oint of unbounded ositive or negative variation. Corollary 2.5. It follows that the chords with unbounded sloes are infinitely dense in functions from C 0 [0, ]. This means with robability, a function from C 0 [0, ] will be nowhere differentiable. 2.2 Alying the Wiener Measure In this section I will rovide some well known Wiener measures and aly them to roduce some interesting robabilities. I will come back to these measures when examining rime number factorization in the last section of this aer Distribution of the Greatest Positive Excursion Consider the set of functions A so that x A if xt), t [0, ] exceeds some α. Since x) α and x) < α are mutually exclusive events, one or the other is guaranteed to haen which means P [x : max xt) α] =P [x : max xt) α and x) α] + P [x : max xt) α and x) < α]. Since the article has no drift, after arriving at height α the article has an equal robability of continuing to increase, or to decrease. Thus, the two events are equivalent and we can combine the robabilities into one: P [x : max xt) α] = 2P [x : max xt) α and x) α]. At this oint, the second restriction on x is redundant: if x) exceeds α then the original restriction is automatically satisfied. So finally, P [x : max xt) α] = 2P [x : x) α] which is ) where t = and β =. Thus, using 2) P [x : max xt) α] = 2 e u2 /2 du 6) 2π which is the Wiener measure of all functions which exceed α at some t [0, ] Paul Levy s Arcsine Law Let xt) C 0 [0, ] and define the set S to be the set of oints t so that xt) > 0. Then the Lebesgue measure of S is written as µ L {t : xt) > 0}) the total amount of time x is ositive. Now consider the set of functions α xt) : α µ L {t : xt) > 0}) β. 7)
7 7 of 6 The Wiener measure of this subset of C 0 [0, ] is given in [] as P A) = π β α du u u). This is a u-shaed distribution, which means for a fixed β α gate, the robability is lowest for α, β near 0.5 and highest for α, β near 0 and. Also, the grah is symmetric so the robability of assing the gate [α, β] is the same as assing the gate [ β, α] The Gambler s Fortune In this section I will construct continuous Brownian motion from a discreet random walk and aly the revious Wiener measures to rovide some interesting robabilities. Consider discreet random walks in one dimension. A article begins at the origin, and at every integer time value, it takes either one ste forward or one ste backwards. If we connect the total dislacement at each integer time value with straight lines to roduce a continuous function, then this article s ath belongs in C 0 [0, T ]. This motion, satisfies the two roerties of Brownian motion described in 2..4: at each ste the mean is and the variance )0.5) + )0.5) = 0 ) 2 0.5) + ) 2 0.5) = and the dislacement at each ste is surely indeendent. Let yt) be the olygonal ath defined by the random walk. The linearity of the aths between each integer time interval is not something we want in Brownian motion so to remove the olygonal blemish in yt) and reserve the roerties we want, take T to infinty and aly 5). Since we are contracting the time intervals by /T, as T the time intevals become infinitesimal, and we aroach continuous Brownian motion. Now consider a Gambler who s net fortune is maed in this random walk. At each hand or game he can win or lose one dollar. By alying 5) to a random walk and take T to infinity, the robability measure aroaches the Wiener measure []: Corollary 2.6. If yt) is defined by random walk, xt) the result of alying 5) to yt), and A any subset of C 0 [0, ] then P robabilityxt) A) P A) as T. Consider A = [x : α x) β]. If x) = h then yt ) = h/ T by 5). So by corollary 2.6 and 2) [ Probability α yt ) ] β β e u2 /2 as T. T 2π The following three examles are alications of the various Wiener measures alied to a Gambler who lays 00 hands: α
8 8 of 6 Consider ) and let α = β = 0.9, the Wiener measure evaluates to about 0.6. If the Gambler lays 00 hands T = 00) then the Gambler has a 60% chance of ending within = 9 dollars of what the Gambler started with. Now consider 6). The history of the Gambler s fortune belongs in A if at any oint during the night the Gambler s net winnings was larger than α T. If α =.7, the Wiener measure is about 0. and again if we set T = 00 then the Gambler will have a 0% chance that at some oint during the Gambler s 00 hands the Gambler will have 7 dollars more than what the Gambler started with. Now consider 7). We can estimate the robability that the Gambler s net fortune will be ositive for a certain ercentage of time. If α = 0.45, β = 0.55 then the Wiener measure is about 6% the Gambler has a 6% chance of being ositive for around half the night). Again, noting the interesting feature of Paul Levy s Arcsine Law, if α = 0.9, β = then the Wiener measure is near 20%. By the symmetry of the arcsine curve, the same is true for α = 0, β = 0.. Thus, the Gambler has a 20% chance of being ositive for 90% of the night, but also only for 0% of the night meaning he has a 20% chance of being negative for 90% of the very same night). While for the three A s above, the robability limit converges to the Wiener measure, this is not always the case. The roof is beyond the scoe of this aer, but it is imortant to note that the convergence is only the case for every Borel set see 2.3) A where for the boundary of A, denoted by A, satisfies P A) = 0 []. 3 A Different Prime Counting Function 3. Defining the Function Definition 3.. I will say that n divides m if m/n is zero and denote this with n m. Otherwise, n does not divide m, which we will be denote with n m. Let and define δ n) = fn) = { n 0 n rime δ n). In other words, f counts the number of distinct rimes in the factorization of n. This function increases very very slowly. In fact, f equals 2 first at n = 6, 3 at n = 30 and 4 at n = 20. Desite its growth rate, there are infinitely many rimes so f must eventually aroach infinity.
9 9 of Primes and Probability We can define P N S) = N ν{n : n [, N] and n S} where ν measures the number of integers in a set. This means P N S) is the ratio of integers in [, N] that are also in S. For examle, if S is the set of even numbers, P 0 S) = 5/0 = /2. Now consider P N n : α fn) β). This is the robability that a andomly icked integer between and N will have between α and β rimes in its factorization. The number of multiles of u to N is N/. For examle, if N = 50 and = 7 then there are exactly 50/7 = 7 numbers between and 50 that have 7 in its factorization. Thus, the robability that n, or that δ n) =, is P N [n : n] = N for large N[]. 8) N This aroximation is good for very large N since N/ N/ < and as N the difference between the floor of the quotient and regular division gets roortionally small. Now consider two relatively rime numbers a and b they share no rime factors). Then a n and b n if and only if ab n. Since two rime numbers are automatically relatively rime, we can deduce with 8) that P N n : n and q n) = P N n : q n) = N N q q Since P Nn : n) and q P Nn : q n) it is clear that rime factorization between two rimes are aroximately indeendent: P N n : n and q n) P N n : n)p N n : q n) 9) This theorem generalizes as follows: Theorem 3.. If,... k are k distinct rimes, then P N n : n, 2 n,... and k n) = P N n : n)...p N n : k n). Proof. If,... k are k distinct rimes then is relatively rime to Π k j=2 j which, by induction roduces the theorem. 4 Brownian Motion and Primes How can we relate the rime counting function described in the revious section and Brownian motion? First I will introduce a useful aroximation and then outline how the random dislacement will take be defined. The outut of this will satisfy indeendence due to Theorem 3. but due to the rareness of rimes and the slow growth rate of fn) there will be drift and variance roblems involved.
10 0 of 6 4. A Very Useful Aroximation Theorem 4.. The aroximation: If q rimes then for large enough, q log log. 0) q Proof. This roof is outline in [3], and is reroduced below: We first need four inequalities. Lemma 4.2. n k= k 2 < 5/3 Proof. The sum converges to π 2 /6 which is less than 5/3. Lemma x < e x for all x > 0. Proof. When x = both sides are equal to, and e x grows much faster than x. Lemma 4.4. logn + ) < Proof. The log term can be written as n+ dx x which can then be slit into a sum of integrals n i+ dx i= x. Since /x is a decreasing function, /i is the maximum value for each interval which means the sum of integrals is less than n i= i. Lemma 4.5. n i= n i= i. i + ) n k 2 n k= Proof. Each integer can be written as a roduct of a square free integer and an integer, that is i = k 2 or i = k 2, where i, k, R and i. Also + because each term on the right side is larger than. So logn + ) n + ) n k= k 2 n ex )) 5 3 = ex 5 3 n which means that log[logn + )3/5] n,
11 of 6 or that log logn + ) log5/3) This can be rearranged to be log logn + ) n+ n+ n +. log 5 3 n + and as n goes to infinity, the difference is bounded and retty small, so for large enough n this is a good aroximation. The time assed at rime is given by q /q and current height given by q δ qn) /q). By the aroximation 0) we can say that the time assed is about log log and the height about q δ qn) log log ). 4.2 Constructing and Correcting the Path 4.2. Constructing the ath Let N be given. Randomly choose n from [, N] and begin the ath at 0. At each rime starting at = 2), if n then move u one ste, else move one ste down. Then roceed to the next rime and reeat. While it seems like this ath will be redetermined once n has been icked, there is an inherent randomness in choosing n. It is from this randomness the Brownian motion will be derived. Imagine laying this game with a mysterious heler who icks the n and does not immediately reveal the number. It is only at each rime ste whether or not n and which way to move is revealed. With the hel of the mysterious layer, it is clear that the that will truly be random. A roblem arises from the fact that most rimes will not divide the number. Thus, there will be an intense drift in the negative direction since there will be many negative stes between each ositive ste. In fact, by 8) as goes to infinity, / goes to 0 which means the chances of dividing n goes to Correcting the Drift To correct the drift we change the magnitude of the stes. Everytime we move in the ositive direction, move forward by, and everytime we move in the negative direction, move backwards by. These changes in the stes taken will reduce the mean to be closer to 0 and damen the drift. Proof. ) P N n : n) + ) P N n : n) = ) ) ) = 0. + ) ) ) ) )
12 2 of Correcting the Variance With the mean fixed, there is now a roblem with the variance: ) 2 P N n : n) + ) 2 P N n : n) = = = ) 2 ) + ) 2 + ) 2 ) ) ) 2 ) + 2 ) 3 2 ) 3 As gets large, the variance goes to / which gets very very small. This is a roblem because this imlies that the Brownian motion will have very little vertical dislacement over each ste after a large enough amount of stes. To resolve this roblem, we need to change the amount of time sent at each ste. The correct thing to do is to send only / time units at each rime. Proof. Since the vertical variance at each rime is about /, and we are sending / time at each ste, the total vertical variance is aroximately q,q rime /q, which is the same as the variance of time. Thus, horizontal and vertical variances are roortional and we can say that the variance is aroximately t Correcting the Path Polygonality If we are checking numbers from [, N], at the last rime N the total amount of time sent will be q N /q log log N. Let T = log log N. At this oint we are faced with the same roblem we had with the random walk: the stes are too olygonal! To correct this, we do the same stes as before: send T to infinity and aly 5). After rescaling, the ath is now art of C 0 [0, ], has mean 0, variance t and event indeendence. Sending T to infinity will correct the olygonal shae of the ath, allowing the ath to aroach continuous Brownian motion. After transforming the ath, time t will transform to time log log / log log N and the vertical scale will be contracted to q δ qn) log log ). log log N 4.3 Proerties of Integers using Prime Factorization In this section I will make use of a useful aroximation and the aths constructed in the revious section to conclude some interesting roerties of n. These aths, denoted by ath N n) since they are deendent on both N and
13 3 of 6 n, are in C 0 [0, ]. The robability that ath N n) A where A is a subset of C 0 [0, ] is P N [n : ath N n) A] and, similarly to corollary 2.6: Theorem 4.6. [] If A is a Borel subset of C 0 [0, ] satisfying P A) = 0 then P N [n : ath N n) A] P A) as N ) The roof of this theorem goes beyond my ability... But, like the aroximations with the Gambler s fortune, we can determine some robabilitistic roerties of n. I will now use this limit to consider the following three sets of x C 0 so that a. the final value of x lies between α and β, so that P = 2π β b. the max value of x is greater than α, so that α e u2 /2 du; P = 2 e u2 /2 du; 2π c. and where the time with which x is ositive is between α and β, so that P = π β α α du u u). Examle 4.. Consider a). If α = β = 0.9 and N = 0 70 so log log N 5, then the robability that the ath is in the set aroaches the Wiener measure, which evaluates to 0.6. Thus, about 60% of n 0 70 have 3 to 7 rime factors. Examle 4.2. Definition 4.. The aarent comositeness of n u to a rime is δ q n) log log. q The larger this is, the more comosite n seems to be at a rime and the smaller this is, the more rime-like n seems to be. So the max aarent comositeness of n is max N δ q n) log log = q [ ] log max ath Nn) log N. N If we consider b) and let α =.7, N = 0 70 then the robability that P ath N n) has max value larger than.7 aroaches the Wiener measure in b), which evaluates to 0.. This means about 0% of n less than 0 70 has a max aarent comositeness of about 3.8.
14 4 of 6 Examle 4.3. Definition 4.2. A number n is excessive at a rime if δ q n) > log log. q That is, the number n is more comosite than the average number u to. It follows from the definition that a number n is excessive at if ath N n) > 0 at a. The total amount of time with which ath N n) is ositive is log log N : N and δ q n) > log log. q The first quotient is the factor time is scaled by when correcting the ath. Since we send / of unscaled time at each rime, and are considering only the where n is excessive at, the second art of the roduct is the sum of / where n is excessive at. If we comare this to c), again with N = 0 70, we can observe that 20% of n < N are excessive more than 90% of the time [], by the same symmetry discussed in 2.2.3) 20% of n < N are excessive less than only 0% of the time [], and only about 6% of n < N are excessive from 45% to 55% []. These three roerties indicate that very few integers are undecidedly comosite, that is, if a number is highly comosite at some or very rime-like), it is very likely that the number will be highly comosite or very rime-like) for most other. If we consider ϕ N n) = # : N and δ q n) > log log, q so that ϕ N n) is the number of rimes u to N where n is excessive, and the ratio of ϕ. The ratio of ϕ N n) and the regular rime counting function πn) is defined in [] as: Definition 4.3. R N n) = ϕ N n) πn) is the ratio of rimes where n is excessive over the total number of rimes. This is the number of where n is excessive, normalized by the number of rimes) Theorem 4.7. [] Let P R > α) be the robability that the ratio R is larger than α, α >. The given an ɛ > 0, there exists a K so when N is greater than K, P R < ɛ) /2 ɛ and P R > ɛ) /2 < ɛ.
15 5 of 6 This theorem follows from the fact that most integers are either excessive at most rimes, or not excessive at most rimes. Taking N large enough, and normalizing by the rime counting function roduces the theorem. In other words for large enough N, for about 50% of the time the ratio is at 0, and the rest of the time the ratio will be at. This means, almost exlicitly, that all integers are either excessive at all rimes or at none []. 5 Conclusion While this aer doesn t go into the details of find Wiener measures or the rigorous mathematics behind Brownian motion, I am still able to comute some interesting quantities, using only simle algebra, number theory and robability. These quantities are deely related to roerties of the integers and their relationshi with the rimes.
16 6 of 6 References [] Patrick Billingsley. Prime numbers and brownian motion. The American Mathematical Monthly, 800 Dec.)):099 5, 973. [2] Maya R. Guta. A measure theory tutorial measure theory for dummies). Technical Reort UWEETR , May [3] Wikiedia. Divergence of the sum of the recirocals of the rimes Wikiedia, the free encycloedia, 202. [Online; accessed -June-202].
MATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More informationA CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract
A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS CASEY BRUCK 1. Abstract The goal of this aer is to rovide a concise way for undergraduate mathematics students to learn about how rime numbers behave
More informationTowards understanding the Lorenz curve using the Uniform distribution. Chris J. Stephens. Newcastle City Council, Newcastle upon Tyne, UK
Towards understanding the Lorenz curve using the Uniform distribution Chris J. Stehens Newcastle City Council, Newcastle uon Tyne, UK (For the Gini-Lorenz Conference, University of Siena, Italy, May 2005)
More informationSets of Real Numbers
Chater 4 Sets of Real Numbers 4. The Integers Z and their Proerties In our revious discussions about sets and functions the set of integers Z served as a key examle. Its ubiquitousness comes from the fact
More informationSums of independent random variables
3 Sums of indeendent random variables This lecture collects a number of estimates for sums of indeendent random variables with values in a Banach sace E. We concentrate on sums of the form N γ nx n, where
More information1 Gambler s Ruin Problem
Coyright c 2017 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins
More informationHENSEL S LEMMA KEITH CONRAD
HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar
More informationp-adic Measures and Bernoulli Numbers
-Adic Measures and Bernoulli Numbers Adam Bowers Introduction The constants B k in the Taylor series exansion t e t = t k B k k! k=0 are known as the Bernoulli numbers. The first few are,, 6, 0, 30, 0,
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationAnalysis of some entrance probabilities for killed birth-death processes
Analysis of some entrance robabilities for killed birth-death rocesses Master s Thesis O.J.G. van der Velde Suervisor: Dr. F.M. Sieksma July 5, 207 Mathematical Institute, Leiden University Contents Introduction
More informationElementary theory of L p spaces
CHAPTER 3 Elementary theory of L saces 3.1 Convexity. Jensen, Hölder, Minkowski inequality. We begin with two definitions. A set A R d is said to be convex if, for any x 0, x 1 2 A x = x 0 + (x 1 x 0 )
More informationRANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES
RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES AARON ZWIEBACH Abstract. In this aer we will analyze research that has been recently done in the field of discrete
More informationCERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education
CERIAS Tech Reort 2010-01 The eriod of the Bell numbers modulo a rime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education and Research Information Assurance and Security Purdue University,
More information1 1 c (a) 1 (b) 1 Figure 1: (a) First ath followed by salesman in the stris method. (b) Alternative ath. 4. D = distance travelled closing the loo. Th
18.415/6.854 Advanced Algorithms ovember 7, 1996 Euclidean TSP (art I) Lecturer: Michel X. Goemans MIT These notes are based on scribe notes by Marios Paaefthymiou and Mike Klugerman. 1 Euclidean TSP Consider
More information#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS
#A47 INTEGERS 15 (015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS Mihai Ciu Simion Stoilow Institute of Mathematics of the Romanian Academy, Research Unit No. 5,
More informationANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM
ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM JOHN BINDER Abstract. In this aer, we rove Dirichlet s theorem that, given any air h, k with h, k) =, there are infinitely many rime numbers congruent to
More information8 STOCHASTIC PROCESSES
8 STOCHASTIC PROCESSES The word stochastic is derived from the Greek στoχαστικoς, meaning to aim at a target. Stochastic rocesses involve state which changes in a random way. A Markov rocess is a articular
More informationMultiplicative group law on the folium of Descartes
Multilicative grou law on the folium of Descartes Steluţa Pricoie and Constantin Udrişte Abstract. The folium of Descartes is still studied and understood today. Not only did it rovide for the roof of
More informationMath 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,
MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write
More informationB8.1 Martingales Through Measure Theory. Concept of independence
B8.1 Martingales Through Measure Theory Concet of indeendence Motivated by the notion of indeendent events in relims robability, we have generalized the concet of indeendence to families of σ-algebras.
More informationarxiv: v1 [math.nt] 4 Nov 2015
Wall s Conjecture and the ABC Conjecture George Grell, Wayne Peng August 0, 018 arxiv:1511.0110v1 [math.nt] 4 Nov 015 Abstract We show that the abc conjecture of Masser-Oesterlé-Sziro for number fields
More informationApplications to stochastic PDE
15 Alications to stochastic PE In this final lecture we resent some alications of the theory develoed in this course to stochastic artial differential equations. We concentrate on two secific examles:
More informationMATH 250: THE DISTRIBUTION OF PRIMES. ζ(s) = n s,
MATH 50: THE DISTRIBUTION OF PRIMES ROBERT J. LEMKE OLIVER For s R, define the function ζs) by. Euler s work on rimes ζs) = which converges if s > and diverges if s. In fact, though we will not exloit
More informationFeedback-error control
Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller
More informationTopic 7: Using identity types
Toic 7: Using identity tyes June 10, 2014 Now we would like to learn how to use identity tyes and how to do some actual mathematics with them. By now we have essentially introduced all inference rules
More informationApplicable Analysis and Discrete Mathematics available online at HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS
Alicable Analysis and Discrete Mathematics available online at htt://efmath.etf.rs Al. Anal. Discrete Math. 4 (010), 3 44. doi:10.98/aadm1000009m HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS Zerzaihi
More informationChapter 1: PROBABILITY BASICS
Charles Boncelet, obability, Statistics, and Random Signals," Oxford University ess, 0. ISBN: 978-0-9-0005-0 Chater : PROBABILITY BASICS Sections. What Is obability?. Exeriments, Outcomes, and Events.
More informationMATH 361: NUMBER THEORY EIGHTH LECTURE
MATH 361: NUMBER THEORY EIGHTH LECTURE 1. Quadratic Recirocity: Introduction Quadratic recirocity is the first result of modern number theory. Lagrange conjectured it in the late 1700 s, but it was first
More informationVarious Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems
Int. J. Oen Problems Comt. Math., Vol. 3, No. 2, June 2010 ISSN 1998-6262; Coyright c ICSRS Publication, 2010 www.i-csrs.org Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various
More informationMersenne and Fermat Numbers
NUMBER THEORY CHARLES LEYTEM Mersenne and Fermat Numbers CONTENTS 1. The Little Fermat theorem 2 2. Mersenne numbers 2 3. Fermat numbers 4 4. An IMO roblem 5 1 2 CHARLES LEYTEM 1. THE LITTLE FERMAT THEOREM
More informationExtension of Minimax to Infinite Matrices
Extension of Minimax to Infinite Matrices Chris Calabro June 21, 2004 Abstract Von Neumann s minimax theorem is tyically alied to a finite ayoff matrix A R m n. Here we show that (i) if m, n are both inite,
More information2 Asymptotic density and Dirichlet density
8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime
More information2 Asymptotic density and Dirichlet density
8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime
More informationTHE ERDÖS - MORDELL THEOREM IN THE EXTERIOR DOMAIN
INTERNATIONAL JOURNAL OF GEOMETRY Vol. 5 (2016), No. 1, 31-38 THE ERDÖS - MORDELL THEOREM IN THE EXTERIOR DOMAIN PETER WALKER Abstract. We show that in the Erd½os-Mordell theorem, the art of the region
More informationMAS 4203 Number Theory. M. Yotov
MAS 4203 Number Theory M. Yotov June 15, 2017 These Notes were comiled by the author with the intent to be used by his students as a main text for the course MAS 4203 Number Theory taught at the Deartment
More informationOn Wald-Type Optimal Stopping for Brownian Motion
J Al Probab Vol 34, No 1, 1997, (66-73) Prerint Ser No 1, 1994, Math Inst Aarhus On Wald-Tye Otimal Stoing for Brownian Motion S RAVRSN and PSKIR The solution is resented to all otimal stoing roblems of
More informationReal Analysis 1 Fall Homework 3. a n.
eal Analysis Fall 06 Homework 3. Let and consider the measure sace N, P, µ, where µ is counting measure. That is, if N, then µ equals the number of elements in if is finite; µ = otherwise. One usually
More informationDIFFERENTIAL GEOMETRY. LECTURES 9-10,
DIFFERENTIAL GEOMETRY. LECTURES 9-10, 23-26.06.08 Let us rovide some more details to the definintion of the de Rham differential. Let V, W be two vector bundles and assume we want to define an oerator
More informationOn the irreducibility of a polynomial associated with the Strong Factorial Conjecture
On the irreducibility of a olynomial associated with the Strong Factorial Conecture Michael Filaseta Mathematics Deartment University of South Carolina Columbia, SC 29208 USA E-mail: filaseta@math.sc.edu
More informationMobius Functions, Legendre Symbols, and Discriminants
Mobius Functions, Legendre Symbols, and Discriminants 1 Introduction Zev Chonoles, Erick Knight, Tim Kunisky Over the integers, there are two key number-theoretic functions that take on values of 1, 1,
More informationON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS
#A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,
More informationA FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE
International Journal of Mathematics & Alications Vol 4, No 1, (June 2011), 77-86 A FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE ARPAN SAHA AND KARTHIK C S ABSTRACT: In this aer, we rove a few lemmas
More informationThe Fekete Szegő theorem with splitting conditions: Part I
ACTA ARITHMETICA XCIII.2 (2000) The Fekete Szegő theorem with slitting conditions: Part I by Robert Rumely (Athens, GA) A classical theorem of Fekete and Szegő [4] says that if E is a comact set in the
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers:,2,..., These are constructed using Peano axioms. We will not get into the hilosohical questions related to this and simly assume the
More informationBy Evan Chen OTIS, Internal Use
Solutions Notes for DNY-NTCONSTRUCT Evan Chen January 17, 018 1 Solution Notes to TSTST 015/5 Let ϕ(n) denote the number of ositive integers less than n that are relatively rime to n. Prove that there
More informationMath 104B: Number Theory II (Winter 2012)
Math 104B: Number Theory II (Winter 01) Alina Bucur Contents 1 Review 11 Prime numbers 1 Euclidean algorithm 13 Multilicative functions 14 Linear diohantine equations 3 15 Congruences 3 Primes as sums
More informationCharacteristics of Fibonacci-type Sequences
Characteristics of Fibonacci-tye Sequences Yarden Blausa May 018 Abstract This aer resents an exloration of the Fibonacci sequence, as well as multi-nacci sequences and the Lucas sequence. We comare and
More informationTopic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar
15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider
More information3 Properties of Dedekind domains
18.785 Number theory I Fall 2016 Lecture #3 09/15/2016 3 Proerties of Dedekind domains In the revious lecture we defined a Dedekind domain as a noetherian domain A that satisfies either of the following
More informationWhy Proofs? Proof Techniques. Theorems. Other True Things. Proper Proof Technique. How To Construct A Proof. By Chuck Cusack
Proof Techniques By Chuck Cusack Why Proofs? Writing roofs is not most student s favorite activity. To make matters worse, most students do not understand why it is imortant to rove things. Here are just
More information6 Stationary Distributions
6 Stationary Distributions 6. Definition and Examles Definition 6.. Let {X n } be a Markov chain on S with transition robability matrix P. A distribution π on S is called stationary (or invariant) if π
More informationPell's Equation and Fundamental Units Pell's equation was first introduced to me in the number theory class at Caltech that I never comleted. It was r
Pell's Equation and Fundamental Units Kaisa Taiale University of Minnesota Summer 000 1 Pell's Equation and Fundamental Units Pell's equation was first introduced to me in the number theory class at Caltech
More informationMATH342 Practice Exam
MATH342 Practice Exam This exam is intended to be in a similar style to the examination in May/June 2012. It is not imlied that all questions on the real examination will follow the content of the ractice
More informationCombining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)
Combining Logistic Regression with Kriging for Maing the Risk of Occurrence of Unexloded Ordnance (UXO) H. Saito (), P. Goovaerts (), S. A. McKenna (2) Environmental and Water Resources Engineering, Deartment
More informationElements of Asymptotic Theory. James L. Powell Department of Economics University of California, Berkeley
Elements of Asymtotic Theory James L. Powell Deartment of Economics University of California, Berkeley Objectives of Asymtotic Theory While exact results are available for, say, the distribution of the
More informationElements of Asymptotic Theory. James L. Powell Department of Economics University of California, Berkeley
Elements of Asymtotic Theory James L. Powell Deartment of Economics University of California, Berkeley Objectives of Asymtotic Theory While exact results are available for, say, the distribution of the
More informationProof: We follow thearoach develoed in [4]. We adot a useful but non-intuitive notion of time; a bin with z balls at time t receives its next ball at
A Scaling Result for Exlosive Processes M. Mitzenmacher Λ J. Sencer We consider the following balls and bins model, as described in [, 4]. Balls are sequentially thrown into bins so that the robability
More informationHomework Solution 4 for APPM4/5560 Markov Processes
Homework Solution 4 for APPM4/556 Markov Processes 9.Reflecting random walk on the line. Consider the oints,,, 4 to be marked on a straight line. Let X n be a Markov chain that moves to the right with
More informationUniversity of North Carolina-Charlotte Department of Electrical and Computer Engineering ECGR 4143/5195 Electrical Machinery Fall 2009
University of North Carolina-Charlotte Deartment of Electrical and Comuter Engineering ECG 4143/5195 Electrical Machinery Fall 9 Problem Set 5 Part Due: Friday October 3 Problem 3: Modeling the exerimental
More informationAsymptotically Optimal Simulation Allocation under Dependent Sampling
Asymtotically Otimal Simulation Allocation under Deendent Samling Xiaoing Xiong The Robert H. Smith School of Business, University of Maryland, College Park, MD 20742-1815, USA, xiaoingx@yahoo.com Sandee
More informationThe Euler Phi Function
The Euler Phi Function 7-3-2006 An arithmetic function takes ositive integers as inuts and roduces real or comlex numbers as oututs. If f is an arithmetic function, the divisor sum Dfn) is the sum of the
More information01. Simplest example phenomena
(March, 20) 0. Simlest examle henomena Paul Garrett garrett@math.umn.edu htt://www.math.umn.edu/ garrett/ There are three tyes of objects in lay: rimitive/rimordial (integers, rimes, lattice oints,...)
More informationPretest (Optional) Use as an additional pacing tool to guide instruction. August 21
Trimester 1 Pretest (Otional) Use as an additional acing tool to guide instruction. August 21 Beyond the Basic Facts In Trimester 1, Grade 8 focus on multilication. Daily Unit 1: Rational vs. Irrational
More informationStrong Matching of Points with Geometric Shapes
Strong Matching of Points with Geometric Shaes Ahmad Biniaz Anil Maheshwari Michiel Smid School of Comuter Science, Carleton University, Ottawa, Canada December 9, 05 In memory of Ferran Hurtado. Abstract
More informationAP Calculus Testbank (Chapter 10) (Mr. Surowski)
AP Calculus Testbank (Chater 1) (Mr. Surowski) Part I. Multile-Choice Questions 1. The grah in the xy-lane reresented by x = 3 sin t and y = cost is (A) a circle (B) an ellise (C) a hyerbola (D) a arabola
More informationUniform Law on the Unit Sphere of a Banach Space
Uniform Law on the Unit Shere of a Banach Sace by Bernard Beauzamy Société de Calcul Mathématique SA Faubourg Saint Honoré 75008 Paris France Setember 008 Abstract We investigate the construction of a
More informationPositive decomposition of transfer functions with multiple poles
Positive decomosition of transfer functions with multile oles Béla Nagy 1, Máté Matolcsi 2, and Márta Szilvási 1 Deartment of Analysis, Technical University of Budaest (BME), H-1111, Budaest, Egry J. u.
More information7.2 Inference for comparing means of two populations where the samples are independent
Objectives 7.2 Inference for comaring means of two oulations where the samles are indeendent Two-samle t significance test (we give three examles) Two-samle t confidence interval htt://onlinestatbook.com/2/tests_of_means/difference_means.ht
More informationA Note on Guaranteed Sparse Recovery via l 1 -Minimization
A Note on Guaranteed Sarse Recovery via l -Minimization Simon Foucart, Université Pierre et Marie Curie Abstract It is roved that every s-sarse vector x C N can be recovered from the measurement vector
More informationA Curious Property of the Decimal Expansion of Reciprocals of Primes
A Curious Proerty of the Decimal Exansion of Recirocals of Primes Amitabha Triathi January 6, 205 Abstract For rime 2, 5, the decimal exansion of / is urely eriodic. For those rime for which the length
More informationExamples from Elements of Theory of Computation. Abstract. Introduction
Examles from Elements of Theory of Comutation Mostafa Ghandehari Samee Ullah Khan Deartment of Comuter Science and Engineering University of Texas at Arlington, TX-7609, USA Tel: +(87)7-5688, Fax: +(87)7-784
More informationLecture 6. 2 Recurrence/transience, harmonic functions and martingales
Lecture 6 Classification of states We have shown that all states of an irreducible countable state Markov chain must of the same tye. This gives rise to the following classification. Definition. [Classification
More informationStochastic integration II: the Itô integral
13 Stochastic integration II: the Itô integral We have seen in Lecture 6 how to integrate functions Φ : (, ) L (H, E) with resect to an H-cylindrical Brownian motion W H. In this lecture we address the
More informationMath 121: Calculus 1 - Fall 2012/2013 Review of Precalculus Concepts
Introduction Math : Calculus - Fall 0/0 Review of Precalculus Concets Welcome to Math - Calculus, Fall 0/0! This roblems in this acket are designed to hel you review the toics from Algebra and Precalculus
More informationJournal of Mathematical Analysis and Applications
J. Math. Anal. Al. 44 (3) 3 38 Contents lists available at SciVerse ScienceDirect Journal of Mathematical Analysis and Alications journal homeage: www.elsevier.com/locate/jmaa Maximal surface area of a
More informationIntrinsic Approximation on Cantor-like Sets, a Problem of Mahler
Intrinsic Aroximation on Cantor-like Sets, a Problem of Mahler Ryan Broderick, Lior Fishman, Asaf Reich and Barak Weiss July 200 Abstract In 984, Kurt Mahler osed the following fundamental question: How
More informationOn the Toppling of a Sand Pile
Discrete Mathematics and Theoretical Comuter Science Proceedings AA (DM-CCG), 2001, 275 286 On the Toling of a Sand Pile Jean-Christohe Novelli 1 and Dominique Rossin 2 1 CNRS, LIFL, Bâtiment M3, Université
More informationALGEBRAIC TOPOLOGY MASTERMATH (FALL 2014) Written exam, 21/01/2015, 3 hours Outline of solutions
ALGERAIC TOPOLOGY MASTERMATH FALL 014) Written exam, 1/01/015, 3 hours Outline of solutions Exercise 1. i) There are various definitions in the literature. ased on the discussion on. 5 of Lecture 3, as
More informationSupplementary Materials for Robust Estimation of the False Discovery Rate
Sulementary Materials for Robust Estimation of the False Discovery Rate Stan Pounds and Cheng Cheng This sulemental contains roofs regarding theoretical roerties of the roosed method (Section S1), rovides
More informationCHAPTER 2: SMOOTH MAPS. 1. Introduction In this chapter we introduce smooth maps between manifolds, and some important
CHAPTER 2: SMOOTH MAPS DAVID GLICKENSTEIN 1. Introduction In this chater we introduce smooth mas between manifolds, and some imortant concets. De nition 1. A function f : M! R k is a smooth function if
More information0.6 Factoring 73. As always, the reader is encouraged to multiply out (3
0.6 Factoring 7 5. The G.C.F. of the terms in 81 16t is just 1 so there is nothing of substance to factor out from both terms. With just a difference of two terms, we are limited to fitting this olynomial
More informationGENERICITY OF INFINITE-ORDER ELEMENTS IN HYPERBOLIC GROUPS
GENERICITY OF INFINITE-ORDER ELEMENTS IN HYPERBOLIC GROUPS PALLAVI DANI 1. Introduction Let Γ be a finitely generated grou and let S be a finite set of generators for Γ. This determines a word metric on
More informationECE 534 Information Theory - Midterm 2
ECE 534 Information Theory - Midterm Nov.4, 009. 3:30-4:45 in LH03. You will be given the full class time: 75 minutes. Use it wisely! Many of the roblems have short answers; try to find shortcuts. You
More informationA note on the random greedy triangle-packing algorithm
A note on the random greedy triangle-acking algorithm Tom Bohman Alan Frieze Eyal Lubetzky Abstract The random greedy algorithm for constructing a large artial Steiner-Trile-System is defined as follows.
More informationAn Analysis of Reliable Classifiers through ROC Isometrics
An Analysis of Reliable Classifiers through ROC Isometrics Stijn Vanderlooy s.vanderlooy@cs.unimaas.nl Ida G. Srinkhuizen-Kuyer kuyer@cs.unimaas.nl Evgueni N. Smirnov smirnov@cs.unimaas.nl MICC-IKAT, Universiteit
More informationSolution: (Course X071570: Stochastic Processes)
Solution I (Course X071570: Stochastic Processes) October 24, 2013 Exercise 1.1: Find all functions f from the integers to the real numbers satisfying f(n) = 1 2 f(n + 1) + 1 f(n 1) 1. 2 A secial solution
More informationOutline. Markov Chains and Markov Models. Outline. Markov Chains. Markov Chains Definitions Huizhen Yu
and Markov Models Huizhen Yu janey.yu@cs.helsinki.fi Det. Comuter Science, Univ. of Helsinki Some Proerties of Probabilistic Models, Sring, 200 Huizhen Yu (U.H.) and Markov Models Jan. 2 / 32 Huizhen Yu
More informationUniformly best wavenumber approximations by spatial central difference operators: An initial investigation
Uniformly best wavenumber aroximations by satial central difference oerators: An initial investigation Vitor Linders and Jan Nordström Abstract A characterisation theorem for best uniform wavenumber aroximations
More informationOn the Chvatál-Complexity of Knapsack Problems
R u t c o r Research R e o r t On the Chvatál-Comlexity of Knasack Problems Gergely Kovács a Béla Vizvári b RRR 5-08, October 008 RUTCOR Rutgers Center for Oerations Research Rutgers University 640 Bartholomew
More informationMath 99 Review for Exam 3
age 1 1. Simlify each of the following eressions. (a) ab a b + 1 b 1 a 1 b + 1 Solution: We will factor both numerator and denominator and then cancel. The numerator can be factored by grouing ab {z a
More informationThe non-stochastic multi-armed bandit problem
Submitted for journal ublication. The non-stochastic multi-armed bandit roblem Peter Auer Institute for Theoretical Comuter Science Graz University of Technology A-8010 Graz (Austria) auer@igi.tu-graz.ac.at
More informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem on Arithmetic Progressions Thai Pham Massachusetts Institute of Technology May 2, 202 Abstract In this aer, we derive a roof of Dirichlet s theorem on rimes in arithmetic rogressions.
More informationarxiv:math/ v4 [math.gn] 25 Nov 2006
arxiv:math/0607751v4 [math.gn] 25 Nov 2006 On the uniqueness of the coincidence index on orientable differentiable manifolds P. Christoher Staecker October 12, 2006 Abstract The fixed oint index of toological
More informationIntroduction to Banach Spaces
CHAPTER 8 Introduction to Banach Saces 1. Uniform and Absolute Convergence As a rearation we begin by reviewing some familiar roerties of Cauchy sequences and uniform limits in the setting of metric saces.
More informationMA3H1 TOPICS IN NUMBER THEORY PART III
MA3H1 TOPICS IN NUMBER THEORY PART III SAMIR SIKSEK 1. Congruences Modulo m In quadratic recirocity we studied congruences of the form x 2 a (mod ). We now turn our attention to situations where is relaced
More informationNUMERICAL AND THEORETICAL INVESTIGATIONS ON DETONATION- INERT CONFINEMENT INTERACTIONS
NUMERICAL AND THEORETICAL INVESTIGATIONS ON DETONATION- INERT CONFINEMENT INTERACTIONS Tariq D. Aslam and John B. Bdzil Los Alamos National Laboratory Los Alamos, NM 87545 hone: 1-55-667-1367, fax: 1-55-667-6372
More informationMATH 361: NUMBER THEORY THIRD LECTURE
MATH 36: NUMBER THEORY THIRD LECTURE. Introduction The toic of this lecture is arithmetic functions and Dirichlet series. By way of introduction, consider Euclid s roof that there exist infinitely many
More informationNotes on Instrumental Variables Methods
Notes on Instrumental Variables Methods Michele Pellizzari IGIER-Bocconi, IZA and frdb 1 The Instrumental Variable Estimator Instrumental variable estimation is the classical solution to the roblem of
More information2016-r1 Physics 220: Worksheet 02 Name
06-r Physics 0: Worksheet 0 Name Concets: Electric Field, lines of force, charge density, diole moment, electric diole () An equilateral triangle with each side of length 0.0 m has identical charges of
More information