An unexpected limit of expected values
|
|
- Edgar Booker
- 5 years ago
- Views:
Transcription
1 Expo. Math. ( ) An unexpected limit of expected values Branko Ćurgus, Robert I. Jewett Department of Mathematics, Western Washington University, 56 High Street, Bellingham, WA 98225, USA Received 4 October 25 Abstract Let t. Select numbers randomly from the interval [, ] until the sum is greater than t. Let α(t) be the expected number of selections. We prove that α(t) = e t for t. Moreover, lim t + (α(t) 2t) = 2 3. This limit is a special case of our asymptotic results for solutions of the delay differential equation f (t) = f(t) f(t ) for t>. We also consider four other solutions of this equation that are related to the above selection process. 26 Elsevier GmbH. All rights reserved. MSC 2: Primary 34K6; 6G5; 34K6 Keywords: Linear delay differential equations; Asymptotic behavior; Sums of independent random variables; Random walks. Introduction Consider the following question: Select numbers randomly from the interval I =[, ] until the sum is greater than. What is the expected number of selections? The unexpected expected value is e. This question appeared as a Putnam examination problem in 958 [, Part I, Problem 3]. It has attracted considerable attention, so that solutions appear in [ 5]. The question is also mentioned by John Derbyshire [6, p. 366]. We first learned about this question in a talk given by Erol Peköz [7]. Corresponding author. Tel.: ; fax: address: curgus@cc.wwu.edu (B. Ćurgus) /$ - see front matter 26 Elsevier GmbH. All rights reserved. doi:.6/j.exmath.26..4
2 2 B.Ćurgus, R.I. Jewett / Expo. Math. ( ) / Fig.. α(t) and 2t In this article we consider a more general question: Let t. Select numbers randomly from the interval I until the sum is greater than t. What is the expected number α(t) of selections? That more general question can be answered using a formula derived by James Uspensky [8, Example 3, p. 278]. Also, see [5]. Uspensky attributes that formula to Laplace. We use a different method. It turns out that α(t) = e t for t. The answer for t> is more complicated. In this article we investigate the function α. It turns out that α satisfies a delay differential equation f (t) = f(t) f(t ), t >. This leads to an explicit formula for α. Surprisingly, the formula for α does not reveal its asymptotic behavior. Since the average value of a selection from I is 2, one might reasonably guess that α(t) is approximately 2t for large values of t. But is this guess correct? The graph of α in Fig. and its values in Table strongly suggest that, in fact, lim t + (α(t) 2t) = 2 3. (.) In addition to α we study the function β, where β(t) is the expected value of the last selected number. We thought that β(t) 2 as t +. Then we discovered the following relation between α and β: β(t) = t + α(t) 2 for t. (.2)
3 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) 3 Table Exact and approximate values of α n α(n) Approximate values e e 2 e ( ) 3 2 2e 3 4e 2 + e ( ) 4 6 6e 4 8e 3 + 2e 2 e ( ) e 5 96e 4 + 8e 3 32e 2 + e ( ) e 6 6 e e 4 54 e e 2 e From (.) and (.2), lim β(t) = 2 t + 3, which is the unexpected limit in the title of this article. Notice that the value β()=2 e/2.64 is surprisingly close to 2 3. Our proofs of asymptotic properties of α and β are based on the fact that they belong to a class of functions which we call delay functions; see Definition 4.. Sections 4 7 discuss the existence, uniqueness, asymptotic behavior, and oscillations of delay functions. In Sections 8 and 9 we prove that α and β are delay functions. As a consequence, we obtain the results about α and β stated above. In Section, we briefly discuss three more delay functions related to the process under consideration. We conclude the article with a heuristic argument for the asymptotic behavior of all five delay functions. Apparently, asymptotic properties of α have not been considered in the literature, and β has not been studied at all. An even more general question is as follows: let a>. Select numbers randomly from the interval [,a] until the sum is greater than t. What is the expected number α a (t) of selections? This question can easily be reduced to the second question above: α a (t) = α(t/a). This paragraph concerns the book [9] by Diekmann et al. It gives a general treatment of delay differential equations, using methods of functional analysis. In particular see Exercise 3.5 and Example 5.3, both in Chapter IV. The formula at the top of page 9 can be used to derive the linear function 2t which appears in (.). Sections 2 7 in this article use undergraduate mathematics only. In Sections 8 and 9 we integrate on the Hilbert cube. We use R for the set of all real numbers and N for the set of all positive integers. As mentioned above, I stands for the closed interval [, ]. In this article we deal only with real numbers.
4 4 B.Ćurgus, R.I. Jewett / Expo. Math. ( ) 2. A partial solution We first prove that α() = e. Let n N. Let R n be n-dimensional Euclidean space. Consider two subsets of R n : C n = { (x,...,x n ) I n : x + +x n }, D n = { (y,...,y n ) I n } : y y n. Let p := and p n := Vol (C n ), n N. That is, p n is the n-dimensional volume of C n. Notice that p n is the probability that the sum of n randomly selected numbers from I does not exceed. To evaluate p n, define L n : R n R n to be the linear transformation given by L n (x,...,x n ) = (x,x + x 2,...,x + x 2 + +x n ). The determinant of its matrix is and L n (C n )=D n. Therefore the volumes of C n and D n are equal. From any given set of n distinct numbers in I, we can form n! distinct n-tuples, only one of which is in increasing order. Therefore, the volume of D n is /n!. Thus, p n = /n! for all n N. Since {p n } is a nonincreasing sequence that converges to, the definition of expected value gives + α() = n (p n p n ). (2.) n= Notice that if {v n } is a sequence of numbers and k N, then k n (v n v n ) = n= ( k ) v n kv k. (2.2) n= By (2.), (2.2) and the fact that kp k ask +, + α() = n! = e. n= To determine α(t) in general, for n N and t, we define the sets and let and C n,t = { (x,...,x n ) I n : x + +x n t } (2.3) p n,t := Vol (C n,t ) for n N (2.4) p,t :=.
5 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) 5 Notice that p n,t is the probability that the sum of n randomly selected numbers from I does not exceed t. Clearly p n,t is nonincreasing in n and nondecreasing in t. Let n N, t>, and let M n,t : R n R n be the linear transformation of scalar multiplication by t. Then n M n,t (C n ) = (x,...,x n ) [,t] n : x j t. j= Since the determinant of M n,t is t n, we conclude that Vol ( M n,t (C n ) ) = t n p n = t n /n!. If <t, then M n,t (C n ) I n, and therefore M n,t (C n ) = C n,t. Consequently, p n,t = tn for <t, n N. (2.5) n! For t>wehavec n,t M n,t (C n ) and therefore p n,t < tn for <t, n N. (2.6) n! Since + n= tn /n!=e t,wehave + n= + n= p n,t = e t p n,t <e t for <t, for t>. The value of α(t) for t>is now calculated using (2.2) in the same way as before, + α(t) = n ( ) + p n,t p n,t = p n,t. n= n= Thus, α(t) = e t for t I, α(t)<e t for t>. (2.7) It is clear from Definition (2.4) that the functions t p n,t are continuous for each n N. Inequalities (2.5), (2.6), and the Weierstrass M-test, imply that α is continuous on [,t] for each t>. Thus α is continuous on [, + ). 3. The delay differential equation For t>, calculating p n,t is complicated. Therefore, we derive a differential equation for α(t) to evaluate it. On average, it will take α(t) selections to reach t>. Given that the first
6 6 B.Ćurgus, R.I. Jewett / Expo. Math. ( ) selection is u I, the expected number of additional selections to exceed t>isα(t u). It is plausible to surmise that α(t) equals plus the average of α(t u) as u varies over I. That is, α(t) = + α(t u) du for t>. (3.) A rigorous derivation of this equation is given in Section 8. Eq. (3.) can be rewritten as α(t) = + t α(s) ds for t>. (3.2) Since α is continuous on [, + ), (3.2) implies that α is differentiable on (, + ). Therefore, to find α we have to solve the equation α (t) = α(t) α(t ) for t> (3.3) with α(t) = e t for t I. Eq. (3.3) is an example of a delay differential equation. It can be used to find an explicit recursive formula for α. Multiplying by the integrating factor e t, we find that Eq. (3.3) is equivalent to d ( e t α(t) ) = e t α(t ) dt for t>. (3.4) Starting with α(t) = e t, t [, ], Eq. (3.4) simplifies to (d/dt) ( e t α(t) ) = /e on (, 2]. Hence, ( )) t α(t) = e ( t +, t [, 2]. (3.5) e Proceeding successively on intervals [2, 3] and [3, 4] we find that the continuous solution of (3.4) is ( ) t α(t) = e ( t + + ( ) ) 2 t 2, t [2, 3], e 2 e and ( t α(t) = e ( t + e ) + 2 ( 2 t e ) 2 + ( 3 t 6 e ) ) 3, t [3, 4]. The pattern is now clear; for t we define A(t) := t k= k! ( ) k t k. e
7 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) Fig. 2. α(t) (2t ). -. Here t denotes the largest integer which does not exceed t. It is easy to show that A is continuous on [, + ) and A(t)= for t I. Differentiation of A for t> and t/ N gives A (t) = e = e t k= t j= (k )! j! ( k t e ) k ( j (t ) e ) j = A(t ). e This formula and the continuity of A imply that A is differentiable on (, + ). Notice that A is not differentiable at. For t>wenowhave d ( e t A(t) ) = e t A(t) + e t A (t) = e t A(t) e t A(t ). dt Thus, the function t e t A(t), t, satisfies (2.7) and (3.3). Assuming uniqueness, which is dealt with in Theorem 5.2, α(t) = e t A(t). However, this formula does not even suggest anything about the asymptotic behavior of α. But, the asymptotic behavior of α given in the Introduction is strongly suggested by the graph in Fig. and the approximate values in Table. Furthermore, Figs. and 2 and Table suggest that the function α(t) oscillates about the line 2t We consider oscillations in Section 7. Table also appears in [5].
8 8 B.Ćurgus, R.I. Jewett / Expo. Math. ( ) The reasoning used to derive (3.3) can also be used on the interval (, ) to obtain an alternative argument for (2.7). Although this reasoning is not rigorous, we find it useful for understanding α. To make it rigorous one would use the method of Sections 8 and 9. Let <t<. The first selection exceeds t with probability t and the first selection does not exceed t with probability t. Given that the first selection u belongs to [,t], the expected number of additional selections to exceed t is α(t u). Thus, the average number of selections for which the first selected number belongs to [,t] is + α(t u) du = + t t Therefore it is plausible that ( α(t) = ( t) + t + t α(s) ds. ) α(s) ds = + α(s) ds, <t<. Consequently, α (t) = α(t) for <t<. In Section 2 we proved that α is continuous. Since by definition α() =, we obtain α(t) = e t for t [, ). 4. Delay functions The delay differential equation (3.3) is the motivation for the following definition. Definition 4.. A function f defined on [, + ) will be called a delay function if: (i) f is continuous on [, + ), (ii) f is differentiable on (, + ), (iii) f (t) = f(t) f(t ) for all t>. The following proposition is easy to prove. Proposition 4.2. A linear combination of delay functions is a delay function. If f is a delay function and c>, then the function g(t) = f(t + c), t, is a delay function. Theorem 4.3. Let f be a continuous function on [, + ). Set a = f() f(s)ds and b = The following four statements are equivalent: sf (s) ds. (a) at + (b a) = ( u)f (t u) du for t. (b) f(t)= a + f(t u) du for t. (c) f(t)= at + b + uf (t u) du for t. (d) f is a delay function.
9 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) 9 Proof. First, we set the notation for the functions that appear in the first three statements. For t weput η(t) = φ(t) = f(t) ψ(t) = f(t) ( u)f (t u) du, f(t u) du, A straightforward calculation gives uf (t u) du. (4.) η() = b, φ() = a, ψ() = a + b. The change of variable t u = s in (4.) yields η(t) = ( + s t)f(s)ds for t. t Then, for t>, Thus, η (t) = ( + t t)f(t) ( + t t)f(t ) + = f(t) = f(t) t f(s)ds f(t u) du. η = φ and ψ η = φ, t ( )f (s) ds the second equation being a straightforward consequence of the definitions. We proceed by proving the following equivalences: (a) (b), (b) (c), and (b) (d). Assume (a). Then a = η = φ. Hence (b) holds. Assume (b). Then (a) follows from η = φ and η() = b. Now assume (c): ψ(t) = at + b. Then φ(t) = at + b η(t). Differentiating, we get φ = a η = a φ. Also, φ() = a. Therefore φ = a. This proves (b). Assume (b) again. This implies (a). Therefore ψ(t)=η(t)+φ(t)=at+(b a)+a=at+b. This proves (c).
10 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) Now assume (d). The equation in Definition 4.(iii) implies that f is continuous on (, + ) and the one-sided limit at exists. Therefore for t>we calculate: f(t)= f() + f (s) ds = f() + = f() + = f() = a + f(s)ds f(s)ds f(s)ds + f(t u) du. t f(s ) ds f(s)ds f(s)ds This proves (b). To finish the proof assume (b) again. A change of variable in (b) leads to f(t)= a + f(s)ds t for t. Since f is continuous, it follows that f is differentiable on (, + ). The differentiation yields (iii) in Definition 4.. Thus f is a delay function. Definition 4.4. By F(a, b) we denote the set of all delay functions f which satisfy the equivalent conditions of Theorem 4.3. A straightforward calculation proves the following lemma. Lemma 4.5. Any linear function l(t) = mt + k is in F(a, b), where a = m/2 and b = k/2 + m/3. The most importation example of a delay function in this article is the function α. We proved that α is continuous on [, + ) in Section 2. The proof that α is a delay function will be completed in Section 8 with the rigorous proof of (3.3). Then, using (2.7), one easily verifies that α F(, ). We close this section with a lemma which combines the three equations of Theorem 4.3 in a single statement about linear functions. For convenience, we change the interval of integration from [, ] to [t,t]. Lemma 4.6. Let f be a delay function in F(a, b) and let l be a linear function, with l(t) = mt + k. If t, then t l(s)f (s) ds = l(t )f (t) + (mb ka).
11 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) Proof. Let t and f F(a, b). By Theorem 4.3, t l(s)f (s) ds = = = (mt + k) l(t u)f (t u) du (mt mu + k) f(t u) du f(t u) du m uf (t u) du = (mt + k)(f(t) a) m (f(t) (at + b)) = (m(t ) + k) f(t)+ (mb ka) = l(t )f (t) + (mb ka). 5. Existence and uniqueness of delay functions Lemma 5.. Let f be a delay function and let c. If f = on [c,c], then f = on [, + ). Proof. Assume that c and f = on[c,c]. By Definition 4.(iii) f = f on (c, c + ]. Since f(c)=, this implies that f(t)= for all c<t c +. By induction, f(t)= for all t c. Let d c be an integer. Since f(t)=f (t)= for t>d, (iii) in Definition 4. implies = f(t ) for d <t<d. Thus, f(t)=for d 2 <t<d. By induction we conclude that f(t)=for <t<c. Since f is continuous, this proves the lemma. Theorem 5.2. If is a continuous function on I, then there exists a unique delay function f such that f = on I. Proof. Existence can be proved using an inductive argument starting with and proceeding as we did for α using (3.4). For uniqueness, let f and g be delay functions such that f(t)= g(t) = (t) for all t I. Then h = f g is a delay function such that h(t) = for all t I. By Lemma 5., h(t) = for all t. Thus f = g.
12 2 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) 6. Asymptotic properties of delay functions Lemma 6.. Let w be a nonnegative continuous function on I such that w(u) du =. Let g be a continuous function on [, + ) such that Let g(t) = w(u)g(t u) du for t. (6.) m = min g(s) and M = max g(s). s I s I Then m g(t) M for t. Proof. We prove g(t) M for t by contradiction. Suppose g(t )>M for some t >. Set t := min {t [, + ) : g(t) = g(t )}. Clearly t > and g(t)<g(t ) for t <t. By (6.) we have g(t ) = w(u)g(t u) du< w(u)g(t ) du = g(t ) which is a contradiction. The proof of g(t) m for t is analogous. Lemma 6.2. Suppose that f F(, ). Set m = min { e s f(s): s I } and M = max { e s f(s): s I }. w(u) du = g(t ), Then me t f(t) Me t for t. Proof. By Theorem 4.3(c) for t wehave f(t)= uf (t u) du. Define g(t) = e t f(t), t. Then g(t) = e t ue (t u) g(t u) du = Since ueu du =, Lemma 6. implies that m g(t) M for t. This proves the lemma. ue u g(t u) du for t.
13 Theorem 6.3. If f F(a, b), then lim t + (f(t) 2at) = 2b 4 3 a. ARTICLE IN PRESS B. Ćurgus, R.I. Jewett / Expo. Math. ( ) 3 Proof. Set g(t) = 2at 2b + 4a/3. By Lemma 4.5, g F(a, b). Set h = f g. The linearity property of integration yields that h F(, ). The theorem now follows since h(t) ast + by Lemma 6.2. Proposition 6.4. Let f F(a, b). Then f is bounded if and only if a =. A bounded delay function reaches its minimum and its maximum on I. Proof. The first claim is an immediate consequence of Theorem 6.3. The second claim follows from Lemma 6. since, by Theorem 4.3(b), f(t)= f(t u) du for t. 7. Oscillations of delay functions Definition 7.. Let f be a real function defined on an open interval J. We say that f changes sign at least once in J if it takes on both positive and negative values. We say that f changes sign at least twice in J if there exist t,t 2,t 3 J such that t <t 2 <t 3 and the numbers f(t ), f (t 2 ), f (t 3 ) are nonzero and alternate in sign. Lemma 7.2. Let f be a nonzero function in F(, ). For each c, f changes sign at least twice in (c,c). Proof. Let c. Set A = {x [c,c]:f(x)<} and B = {x [c,c]:f(x)>}. If l is linear, then by Lemma 4.6, c c l(s)f (s) ds = l(c )f (c). First, let l(t) = t (c ). Then l>on(c,c), and c c l(s)f (s) ds =.
14 4 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) Hence, f changes sign at least once in (c,c). That is, A and B are nonempty (and clearly disjoint). Second, assume that f does not change sign at least twice in (c,c). Then there exists d (c,c) such that d separates A and B. We assume that A is to the left of d. If not, consider f. Let l(t) = t d. Then lf on[c,c] and c c l(s)f (s) ds = l(c )f (c) = (c d)f(c). Thus lf = on[c,c] and that is a contradiction. Theorem 7.3. Let f be a nonlinear function in F(a, b). For each c, the nonzero function t f(t) (2at + 2b 43 ) a (7.) changes sign at least twice in (c,c). Proof. The linearity of integration and Lemma 4.5 imply that the function in (7.) is a nonlinear function in F(, ). Now the theorem follows from Lemma The function α The function α is defined in the Introduction. For t, we considered a process of selecting numbers randomly from the interval I until the sum is greater than t and defined α(t) to be the expected number of selections. Instead, in the rest of this article we assume that the selection process goes on forever. The associated sequence of partial sums is nondecreasing. The mathematical framework for this is provided by the probability space I N, which consists of all sequences in I. This is the Hilbert cube. The following definition is analogous to (2.3). For n N and t we put and B n,t = B,t = I N. { x I N : x + +x n t } = C n,t I N Clearly B n,t is closed and its measure in I N is equal to Vol(C n,t ). Let B I N be the set of all sequences in I for which the corresponding series converges. That is, + + B = B n,k. k= n= By (2.5) and (2.6), the measure of B in I N is. Theorem 8.. The function α is a delay function in F(, ) and lim t + (α(t) 2t) = 2 3. (8.)
15 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) 5 Proof. Let t. Define the random variable F t : I N N {+ } by F t (x) := min {n N : x + +x n >t}. Here we adopt the convention that min =+. Since B has measure and + Ft ({+ }) = B n,t B, n= F t is finite almost everywhere on I N.Forn N we have F t ({n}) = B n,t \B n,t. Therefore, F t : I N N {+ } is a Borel function. By definition, α is the expected value of F t : α(t) = F t(x) dx. I N The following property of F t, which is the key to the proof that α is a delay function, is an immediate consequence of its definition. If t and x = (x,x 2,x 3,...)= (u, v,v 2,...)= (u; v) I N, (8.2) then 2 F t (x) + and F t (x) = F t (u; v) = + F t u (v). (8.3) Using Fubini s Theorem [, Theorem 4.9] first, and than (8.3), we get α(t) = F t(x) dx I N ( ) = F t(u; v)dv du I N ( ) = + F t u(v) dv du I N = + α(t u) du. Hence, (3.) is proved. Since in Section 2 we proved that α is continuous, by Theorem 4.3, α is a delay function. Moreover, α F(, ), as is easily verified using the fact that α(t) = e t on I, which is proved in Section 2. Finally, equality (8.) is a consequence of Theorem 6.3. The asymptotic behavior of α suggested in Table and Fig. is now proved. To explain the oscillations, let g(t)= 2t and recall Theorem 7.3. Then for c the function f g changes sign at least twice in the interval (c,c), as suggested by Table and Figs. and 2.
16 6 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) 9. The function β The function β is defined in the Introduction. Here, β(t) is the expected value of the first selection for which the partial sum exceeds t. ( ) Theorem 9.. The function β is a delay function in F, 3. Moreover, and β(t) = t + α(t) 2 for t (9.) lim β(t) = 2 t + 3. (9.2) Proof. Let t. Define the random variable G t : I N \B I by G t (x) := x F t (x), x IN \B. Since B is of measure, G t is defined almost everywhere on I N. In other words, G t (x) is the first selected number for which the corresponding partial sum exceeds t. Equivalently, G t (x) = x n if and only if x B n,t \ ( B n,t B ). Hence, the restriction of G t to each Borel set B n,t \ ( B n,t B ), n N, is a continuous function. Since the union of these Borel sets coincides with the domain of G t, it follows that G t is a Borel function. By definition, β(t) is the expected value of G t : β(t) = G t(x) dx. I N Let x I N \B. Then F t (x) N and G t (x) I. Let, in addition, s<t and compare G t (x) G s (x) with F t (x) F s (x). Clearly, G t (x) G s (x) and F t (x) F s (x) N {}. Since by definition F t (x) F s (x) = implies G t (x) = G s (x), we conclude that G t (x) G s (x) F t (x) F s (x). Therefore, β(t) β(s) = G t(x) dx G s(x) dx I N I N G t(x) G s (x) dx I N (F t(x) F s (x)) dx I N = α(t) α(s). Since α is continuous, the last inequality implies that β is continuous as well.
17 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) 7 The following property of G t, which is the key to the rest of the proof that β is a delay function, is a consequence of the definitions of F t and G t.fort and x given by (8.2) we have { u for t <u, G t (x) = G t (u; v) = G t u (v) for u t. (9.3) We first consider β on I. For <t<, Fubini s theorem and (9.3) imply that β(t) = = = = ( ) G t(u; v)dv du I ( N ) G t u(v) dv du + I N β(t u) du + 2 t2 2 β(s) ds + 2 t2 2. t u du Since β is continuous, differentiating the last equality leads to β (t) = β(t) t for <t<. In addition, by definition of β we have β() = 2. Therefore β(t) = t + e t /2 for t I. A straightforward calculation yields β() β(s) ds = and sβ(s) ds = 3. (9.4) For t>, applying again Fubini s theorem and (9.3) we find ( ) β(t) = G t u(v) dv du = β(t u) du. I N ( ) Thus, by Theorem 4.3, β is a delay function and β F, 3 by (9.4). As a linear combination of delay functions, the function g(t) = t + α(t)/2, t, is a delay function by Proposition 4.2 and Lemma 4.5. Since β and g coincide on I, Theorem 5.2 implies (9.). Equality (9.2) is a consequence of Theorem 8.. Theorem 7.3 implies that for each c the function β 2 3 changes sign at least twice in the interval (c,c).
18 8 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) ln (2) ln (2) 2 Fig. 3. The function β. By Proposition 6.4 the function β reaches its maximum and its minimum on I; see Fig. 3. It is easy to check that min β = β() = 2, max β = β (ln 2) = ln 2.. Three other delay functions. For t, let γ(t) be the expected value of the first partial sum that exceeds t. The method used in Sections 8 and 9 could be used here, but we shall give a different treatment. Recall that p n,t is the probability that the nth partial sum does not exceed t. Hence, p n,t is the contribution to α(t) of the nth selection. Therefore, + α(t) = p n,t. n= This formula was derived in Section 2 in a different way. Since the expected value of the nth selection is 2, + γ(t) = n= 2 p n,t = 2 α(t). Thus, γ is a delay function, γ F ( 2, 2 ) and lim (γ(t) t) = t For t, let δ(t) be the expected value of the last partial sum that does not exceed t. We set δ() =. Clearly δ + β = γ.
19 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) 9 Thus δ is a delay function and ( ) δ(t) = α(t) (t + ), δ F 2, 6, lim (δ(t) t) = t For t, let ε(t) be the expected number of partial sums in the interval (t, t + ]. In particular ε() = e. Clearly, ε(t) = α(t + ) α(t). By Proposition 4.2, ε is a delay function. If t I, then by (2.7) and (3.5) we have ε(t) = e t+ + e t ( t) e t = (e t)e t. A simple computation shows that ε F(, ) and lim ε(t) = 2. t + Notice that ε(t) = α (t + ) if t>.. A heuristic argument Here it is convenient to write f(t) g(t) to mean that lim (f(t) g(t)) =. t + After proving that α(t) 2t + 2 3, we looked for a heuristic argument for that result and this is what we found. The expected value of any selection is 2. It is plausible that ε(t) 2. The following statement is well known and easy to prove: For the random selection of two numbers from I, the expected value of the minimum is 3 and the expected value of the maximum is 2 3. This statement suggests, but does not imply, that γ(t) t + 3 and δ(t) (t ) = t 3. Since β = γ δ, wehave β(t) 2 3. It is also plausible that α(t) 2γ(t).Ifso, α(t) 2t
20 2 B. Ćurgus, R.I. Jewett / Expo. Math. ( ) References [] Bush LE. The William Putnam mathematical competition. Amer Math Monthly 96;68:8 33. [2] Shultz HS. An expected value problem. Two-Year College Math J 979;:79. [3] MacKinnon N. Another surprising appearence of e. Math Gazete 99;74:67 9. [4] Schwartzman S. An unexpected expected value. Math Teacher 993; 8 2. [5] Weisstein EW. Uniform sum distribution. From MathWorld A Wolfram Web Resource. [6] Derbyshire J. Prime obsession: Bernhard Riemann and the greatest unsolved problem in mathematics. Joseph Henry Press; 23. [7] Peköz EA. Probability, paradoxes, and games. Talk given at Department of Mathematics, Western Washington University, March, 998. [8] Uspensky JV. Introduction to Mathematical Probability. New York: McGraw-Hill; 937. [9] Diekmann O, van Gils SA, Verduyn Lunel SM, Walther H. Delay equations: functional-, complex-, and nonlinear analysis. Applied mathematical sciences, vol.. Berlin: Springer; 995. [] Royden HL. Real analysis, 3rd ed., New York: MacMillan; 988.
Nonlinear Analysis 71 (2009) Contents lists available at ScienceDirect. Nonlinear Analysis. journal homepage:
Nonlinear Analysis 71 2009 2744 2752 Contents lists available at ScienceDirect Nonlinear Analysis journal homepage: www.elsevier.com/locate/na A nonlinear inequality and applications N.S. Hoang A.G. Ramm
More informationd n dt n ( Laplace transform of Definition of the Laplace transform
e t t m) Objectives. Recall the definition and some basic properties of the Laplace transform. Calculate the the following function (n < m): ( e t t ). m dt n Requirements. Integration by parts, change
More informationGENERALIZATION OF GRONWALL S INEQUALITY AND ITS APPLICATIONS IN FUNCTIONAL DIFFERENTIAL EQUATIONS
Communications in Applied Analysis 19 (215), 679 688 GENERALIZATION OF GRONWALL S INEQUALITY AND ITS APPLICATIONS IN FUNCTIONAL DIFFERENTIAL EQUATIONS TINGXIU WANG Department of Mathematics, Texas A&M
More informationNormed Vector Spaces and Double Duals
Normed Vector Spaces and Double Duals Mathematics 481/525 In this note we look at a number of infinite-dimensional R-vector spaces that arise in analysis, and we consider their dual and double dual spaces
More informationThe Laplace Transform
C H A P T E R 6 The Laplace Transform Many practical engineering problems involve mechanical or electrical systems acted on by discontinuous or impulsive forcing terms. For such problems the methods described
More informationNONLINEAR DIFFERENTIAL INEQUALITY. 1. Introduction. In this paper the following nonlinear differential inequality
M athematical Inequalities & Applications [2407] First Galley Proofs NONLINEAR DIFFERENTIAL INEQUALITY N. S. HOANG AND A. G. RAMM Abstract. A nonlinear differential inequality is formulated in the paper.
More informationSPACES ENDOWED WITH A GRAPH AND APPLICATIONS. Mina Dinarvand. 1. Introduction
MATEMATIČKI VESNIK MATEMATIQKI VESNIK 69, 1 (2017), 23 38 March 2017 research paper originalni nauqni rad FIXED POINT RESULTS FOR (ϕ, ψ)-contractions IN METRIC SPACES ENDOWED WITH A GRAPH AND APPLICATIONS
More informationSeunghee Ye Ma 8: Week 2 Oct 6
Week 2 Summary This week, we will learn about sequences and real numbers. We first define what we mean by a sequence and discuss several properties of sequences. Then, we will talk about what it means
More informationNotes on uniform convergence
Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean
More information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More information11.8 Power Series. Recall the geometric series. (1) x n = 1+x+x 2 + +x n +
11.8 1 11.8 Power Series Recall the geometric series (1) x n 1+x+x 2 + +x n + n As we saw in section 11.2, the series (1) diverges if the common ratio x > 1 and converges if x < 1. In fact, for all x (
More informationBest proximity points for generalized α η ψ-geraghty proximal contraction mappings
Mathematica Moravica Vol. 1, No. (017), 85 10 Best proximity points for generalized α η ψ-geraghty proximal contraction mappings K.K.M. Sarma and Yohannes Gebru Abstract. In this paper, we introduce the
More informationMath 180C, Spring Supplement on the Renewal Equation
Math 18C Spring 218 Supplement on the Renewal Equation. These remarks supplement our text and set down some of the material discussed in my lectures. Unexplained notation is as in the text or in lecture.
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationFormal Groups. Niki Myrto Mavraki
Formal Groups Niki Myrto Mavraki Contents 1. Introduction 1 2. Some preliminaries 2 3. Formal Groups (1 dimensional) 2 4. Groups associated to formal groups 9 5. The Invariant Differential 11 6. The Formal
More informationA Concise Course on Stochastic Partial Differential Equations
A Concise Course on Stochastic Partial Differential Equations Michael Röckner Reference: C. Prevot, M. Röckner: Springer LN in Math. 1905, Berlin (2007) And see the references therein for the original
More information1 Directional Derivatives and Differentiability
Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationExponential stability of families of linear delay systems
Exponential stability of families of linear delay systems F. Wirth Zentrum für Technomathematik Universität Bremen 28334 Bremen, Germany fabian@math.uni-bremen.de Keywords: Abstract Stability, delay systems,
More informationLecture Notes in Mathematics. Arkansas Tech University Department of Mathematics
Lecture Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Ordinary Differential Equations for Physical Sciences and Engineering Marcel B. Finan c All Rights
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationStability of solutions to abstract evolution equations with delay
Stability of solutions to abstract evolution equations with delay A.G. Ramm Department of Mathematics Kansas State University, Manhattan, KS 66506-2602, USA ramm@math.ksu.edu Abstract An equation u = A(t)u+B(t)F
More informationA TWO PARAMETERS AMBROSETTI PRODI PROBLEM*
PORTUGALIAE MATHEMATICA Vol. 53 Fasc. 3 1996 A TWO PARAMETERS AMBROSETTI PRODI PROBLEM* C. De Coster** and P. Habets 1 Introduction The study of the Ambrosetti Prodi problem has started with the paper
More informationConvex Analysis and Economic Theory AY Elementary properties of convex functions
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory AY 2018 2019 Topic 6: Convex functions I 6.1 Elementary properties of convex functions We may occasionally
More informationMath 353 Lecture Notes Week 6 Laplace Transform: Fundamentals
Math 353 Lecture Notes Week 6 Laplace Transform: Fundamentals J. Wong (Fall 217) October 7, 217 What did we cover this week? Introduction to the Laplace transform Basic theory Domain and range of L Key
More informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More informationApplied Mathematics Letters
Applied Mathematics Letters 24 (211) 219 223 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Laplace transform and fractional differential
More informationThe Navier-Stokes Equations with Time Delay. Werner Varnhorn. Faculty of Mathematics University of Kassel, Germany
The Navier-Stokes Equations with Time Delay Werner Varnhorn Faculty of Mathematics University of Kassel, Germany AMS: 35 (A 35, D 5, K 55, Q 1), 65 M 1, 76 D 5 Abstract In the present paper we use a time
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationf(t)e st dt. (4.1) Note that the integral defining the Laplace transform converges for s s 0 provided f(t) Ke s 0t for some constant K.
4 Laplace transforms 4. Definition and basic properties The Laplace transform is a useful tool for solving differential equations, in particular initial value problems. It also provides an example of integral
More informationSolutions for Homework Assignment 2
Solutions for Homework Assignment 2 Problem 1. If a,b R, then a+b a + b. This fact is called the Triangle Inequality. By using the Triangle Inequality, prove that a b a b for all a,b R. Solution. To prove
More informationTHE ANALYSIS OF SOLUTION OF NONLINEAR SECOND ORDER ORDINARY DIFFERENTIAL EQUATIONS
THE ANALYSIS OF SOLUTION OF NONLINEAR SECOND ORDER ORDINARY DIFFERENTIAL EQUATIONS FANIRAN TAYE SAMUEL Assistant Lecturer, Department of Computer Science, Lead City University, Ibadan, Nigeria. Email :
More informationSOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL VALUES GUY KATRIEL PREPRINT NO /4
SOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL VALUES GUY KATRIEL PREPRINT NO. 2 2003/4 1 SOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL
More informationLecture 10. Riemann-Stieltjes Integration
Lecture 10 Riemann-Stieltjes Integration In this section we will develop the basic definitions and some of the properties of the Riemann-Stieltjes Integral. The development will follow that of the Darboux
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationExistence of global solutions of some ordinary differential equations
J. Math. Anal. Appl. 340 (2008) 739 745 www.elsevier.com/locate/jmaa Existence of global solutions of some ordinary differential equations U. Elias Department of Mathematics, Technion IIT, Haifa 32000,
More information13. Examples of measure-preserving tranformations: rotations of a torus, the doubling map
3. Examples of measure-preserving tranformations: rotations of a torus, the doubling map 3. Rotations of a torus, the doubling map In this lecture we give two methods by which one can show that a given
More informationI forgot to mention last time: in the Ito formula for two standard processes, putting
I forgot to mention last time: in the Ito formula for two standard processes, putting dx t = a t dt + b t db t dy t = α t dt + β t db t, and taking f(x, y = xy, one has f x = y, f y = x, and f xx = f yy
More informationIntroduction. Chapter 1. Contents. EECS 600 Function Space Methods in System Theory Lecture Notes J. Fessler 1.1
Chapter 1 Introduction Contents Motivation........................................................ 1.2 Applications (of optimization).............................................. 1.2 Main principles.....................................................
More informationA connection between the stochastic heat equation and fractional Brownian motion, and a simple proof of a result of Talagrand
A connection between the stochastic heat equation and fractional Brownian motion, and a simple proof of a result of Talagrand Carl Mueller 1 and Zhixin Wu Abstract We give a new representation of fractional
More information2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1
Lectures - Week 11 General First Order ODEs & Numerical Methods for IVPs In general, nonlinear problems are much more difficult to solve than linear ones. Unfortunately many phenomena exhibit nonlinear
More informationFIXED POINTS AND CYCLIC CONTRACTION MAPPINGS UNDER IMPLICIT RELATIONS AND APPLICATIONS TO INTEGRAL EQUATIONS
SARAJEVO JOURNAL OF MATHEMATICS Vol.1 (23) (214), 257 27 DOI: 1.5644/SJM.1.2.11 FIXED POINTS AND CYCLIC CONTRACTION MAPPINGS UNDER IMPLICIT RELATIONS AND APPLICATIONS TO INTEGRAL EQUATIONS HEMANT KUMAR
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationON THE ERDOS-STONE THEOREM
ON THE ERDOS-STONE THEOREM V. CHVATAL AND E. SZEMEREDI In 1946, Erdos and Stone [3] proved that every graph with n vertices and at least edges contains a large K d+l (t), a complete (d + l)-partite graph
More informationDefinition 3 (Continuity). A function f is continuous at c if lim x c f(x) = f(c).
Functions of Several Variables A function of several variables is just what it sounds like. It may be viewed in at least three different ways. We will use a function of two variables as an example. z =
More information. As the binomial coefficients are integers we have that. 2 n(n 1).
Math 580 Homework. 1. Divisibility. Definition 1. Let a, b be integers with a 0. Then b divides b iff there is an integer k such that b = ka. In the case we write a b. In this case we also say a is a factor
More informationTwo dimensional exterior mixed problem for semilinear damped wave equations
J. Math. Anal. Appl. 31 (25) 366 377 www.elsevier.com/locate/jmaa Two dimensional exterior mixed problem for semilinear damped wave equations Ryo Ikehata 1 Department of Mathematics, Graduate School of
More informationJumping Sequences. Steve Butler Department of Mathematics University of California, Los Angeles Los Angeles, CA
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 11 (2008), Article 08.4.5 Jumping Sequences Steve Butler Department of Mathematics University of California, Los Angeles Los Angeles, CA 90095 butler@math.ucla.edu
More informationIowa State University. Instructor: Alex Roitershtein Summer Exam #1. Solutions. x u = 2 x v
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 Exam #1 Solutions This is a take-home examination. The exam includes 8 questions.
More informationOn a general definition of transition waves and their properties
On a general definition of transition waves and their properties Henri Berestycki a and François Hamel b a EHESS, CAMS, 54 Boulevard Raspail, F-75006 Paris, France b Université Aix-Marseille III, LATP,
More informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
More informationChapter 2 Metric Spaces
Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics
More informationHalf of Final Exam Name: Practice Problems October 28, 2014
Math 54. Treibergs Half of Final Exam Name: Practice Problems October 28, 24 Half of the final will be over material since the last midterm exam, such as the practice problems given here. The other half
More informationWhere is matrix multiplication locally open?
Linear Algebra and its Applications 517 (2017) 167 176 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Where is matrix multiplication locally open?
More informationPrinciples of Real Analysis I Fall I. The Real Number System
21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous
More informationMath 2C03 - Differential Equations. Slides shown in class - Winter Laplace Transforms. March 4, 5, 9, 11, 12, 16,
Math 2C03 - Differential Equations Slides shown in class - Winter 2015 Laplace Transforms March 4, 5, 9, 11, 12, 16, 18... 2015 Laplace Transform used to solve linear ODEs and systems of linear ODEs with
More informationCHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.
1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function
More informationFirst-Return Integrals
First-Return ntegrals Marianna Csörnyei, Udayan B. Darji, Michael J. Evans, Paul D. Humke Abstract Properties of first-return integrals of real functions defined on the unit interval are explored. n particular,
More informationUpper and lower solution method for fourth-order four-point boundary value problems
Journal of Computational and Applied Mathematics 196 (26) 387 393 www.elsevier.com/locate/cam Upper and lower solution method for fourth-order four-point boundary value problems Qin Zhang a, Shihua Chen
More informationSingular boundary value problems
Department of Mathematics, Faculty of Science, Palacký University, 17. listopadu 12, 771 46 Olomouc, Czech Republic, e-mail: irena.rachunkova@upol.cz Malá Morávka, May 2012 Overview of our common research
More informationOn separated solutions of logistic population equation with harvesting
On separated solutions of logistic population equation with harvesting Philip Korman Department of Mathematical Sciences University of Cincinnati Cincinnati Ohio 4522-25 Abstract We provide a surprising
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 15 Heat with a source So far we considered homogeneous wave and heat equations and the associated initial value problems on the whole line, as
More informationOn zero-sum partitions and anti-magic trees
Discrete Mathematics 09 (009) 010 014 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc On zero-sum partitions and anti-magic trees Gil Kaplan,
More informationarxiv: v1 [math.mg] 15 Jul 2013
INVERSE BERNSTEIN INEQUALITIES AND MIN-MAX-MIN PROBLEMS ON THE UNIT CIRCLE arxiv:1307.4056v1 [math.mg] 15 Jul 013 TAMÁS ERDÉLYI, DOUGLAS P. HARDIN, AND EDWARD B. SAFF Abstract. We give a short and elementary
More informationLecture 4: Numerical solution of ordinary differential equations
Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor
More informationALMOST PERIODIC SOLUTIONS OF HIGHER ORDER DIFFERENTIAL EQUATIONS ON HILBERT SPACES
Electronic Journal of Differential Equations, Vol. 21(21, No. 72, pp. 1 12. ISSN: 172-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu ALMOST PERIODIC SOLUTIONS
More informationA Surprising Application of Non-Euclidean Geometry
A Surprising Application of Non-Euclidean Geometry Nicholas Reichert June 4, 2004 Contents 1 Introduction 2 2 Geometry 2 2.1 Arclength... 3 2.2 Central Projection.......................... 3 2.3 SidesofaTriangle...
More informationOn Controllability of Linear Systems 1
On Controllability of Linear Systems 1 M.T.Nair Department of Mathematics, IIT Madras Abstract In this article we discuss some issues related to the observability and controllability of linear systems.
More informationHigher Order Linear Equations
C H A P T E R 4 Higher Order Linear Equations 4.1 1. The differential equation is in standard form. Its coefficients, as well as the function g(t) = t, are continuous everywhere. Hence solutions are valid
More informationOn the Infinitude of Twin-Primes Bao Qi Feng
On the Infinitude of Twin-Primes Bao Qi Feng Department of Mathematical Sciences, Kent State University at Tuscarawas 330 University Dr. NE, New Philadelphia, OH 44663, USA. Abstract In this article, we
More information1 The Observability Canonical Form
NONLINEAR OBSERVERS AND SEPARATION PRINCIPLE 1 The Observability Canonical Form In this Chapter we discuss the design of observers for nonlinear systems modelled by equations of the form ẋ = f(x, u) (1)
More informationLax Solution Part 4. October 27, 2016
Lax Solution Part 4 www.mathtuition88.com October 27, 2016 Textbook: Functional Analysis by Peter D. Lax Exercises: Ch 16: Q2 4. Ch 21: Q1, 2, 9, 10. Ch 28: 1, 5, 9, 10. 1 Chapter 16 Exercise 2 Let h =
More informationViscosity Iterative Approximating the Common Fixed Points of Non-expansive Semigroups in Banach Spaces
Viscosity Iterative Approximating the Common Fixed Points of Non-expansive Semigroups in Banach Spaces YUAN-HENG WANG Zhejiang Normal University Department of Mathematics Yingbing Road 688, 321004 Jinhua
More informationHW2 Solutions. MATH 20D Fall 2013 Prof: Sun Hui TA: Zezhou Zhang (David) October 14, Checklist: Section 2.6: 1, 3, 6, 8, 10, 15, [20, 22]
HW2 Solutions MATH 20D Fall 2013 Prof: Sun Hui TA: Zezhou Zhang (David) October 14, 2013 Checklist: Section 2.6: 1, 3, 6, 8, 10, 15, [20, 22] Section 3.1: 1, 2, 3, 9, 16, 18, 20, 23 Section 3.2: 1, 2,
More informationHarmonic Polynomials and Dirichlet-Type Problems. 1. Derivatives of x 2 n
Harmonic Polynomials and Dirichlet-Type Problems Sheldon Axler and Wade Ramey 30 May 1995 Abstract. We take a new approach to harmonic polynomials via differentiation. Surprisingly powerful results about
More informationConway s RATS Sequences in Base 3
3 47 6 3 Journal of Integer Sequences, Vol. 5 (0), Article.9. Conway s RATS Sequences in Base 3 Johann Thiel Department of Mathematical Sciences United States Military Academy West Point, NY 0996 USA johann.thiel@usma.edu
More informationAN EFFECTIVE METRIC ON C(H, K) WITH NORMAL STRUCTURE. Mona Nabiei (Received 23 June, 2015)
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 46 (2016), 53-64 AN EFFECTIVE METRIC ON C(H, K) WITH NORMAL STRUCTURE Mona Nabiei (Received 23 June, 2015) Abstract. This study first defines a new metric with
More informationThe Heine-Borel and Arzela-Ascoli Theorems
The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them
More informationMATH 6337: Homework 8 Solutions
6.1. MATH 6337: Homework 8 Solutions (a) Let be a measurable subset of 2 such that for almost every x, {y : (x, y) } has -measure zero. Show that has measure zero and that for almost every y, {x : (x,
More informationChapter 2 Vector-matrix Differential Equation and Numerical Inversion of Laplace Transform
Chapter 2 Vector-matrix Differential Equation and Numerical Inversion of Laplace Transform 2.1 Vector-matrix Differential Equation A differential equation and a set of differential (simultaneous linear
More information1 Lyapunov theory of stability
M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability
More informationMulti-Term Linear Fractional Nabla Difference Equations with Constant Coefficients
International Journal of Difference Equations ISSN 0973-6069, Volume 0, Number, pp. 9 06 205 http://campus.mst.edu/ijde Multi-Term Linear Fractional Nabla Difference Equations with Constant Coefficients
More informationA NOTE ON ALMOST PERIODIC VARIATIONAL EQUATIONS
A NOTE ON ALMOST PERIODIC VARIATIONAL EQUATIONS PETER GIESL AND MARTIN RASMUSSEN Abstract. The variational equation of a nonautonomous differential equation ẋ = F t, x) along a solution µ is given by ẋ
More information1. Introduction Interest in this project began with curiosity about the Laplace transform of the Digamma function, e as ψ(s + 1)ds,
ON THE LAPLACE TRANSFORM OF THE PSI FUNCTION M. LAWRENCE GLASSER AND DANTE MANNA Abstract. Guided by numerical experimentation, we have been able to prove that Z 8 / x x + ln dx = γ + ln) [cosx)] and to
More informationSurprising Sinc Sums and Integrals
David Borwein University of Western Ontario Peter Borwein Conference May 12-16, 28 1 Motivation and preliminaries. This talk is based on material in a paper to appear shortly in MAA MONTHLY with the above
More information#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES
#A69 INTEGERS 3 (203) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES William D. Banks Department of Mathematics, University of Missouri, Columbia, Missouri bankswd@missouri.edu Greg Martin Department of
More informationONLINE APPENDIX TO: NONPARAMETRIC IDENTIFICATION OF THE MIXED HAZARD MODEL USING MARTINGALE-BASED MOMENTS
ONLINE APPENDIX TO: NONPARAMETRIC IDENTIFICATION OF THE MIXED HAZARD MODEL USING MARTINGALE-BASED MOMENTS JOHANNES RUF AND JAMES LEWIS WOLTER Appendix B. The Proofs of Theorem. and Proposition.3 The proof
More informationThe heat equation in time dependent domains with Neumann boundary conditions
The heat equation in time dependent domains with Neumann boundary conditions Chris Burdzy Zhen-Qing Chen John Sylvester Abstract We study the heat equation in domains in R n with insulated fast moving
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationMath 321 Final Examination April 1995 Notation used in this exam: N. (1) S N (f,x) = f(t)e int dt e inx.
Math 321 Final Examination April 1995 Notation used in this exam: N 1 π (1) S N (f,x) = f(t)e int dt e inx. 2π n= N π (2) C(X, R) is the space of bounded real-valued functions on the metric space X, equipped
More informationNontrivial Solutions for Boundary Value Problems of Nonlinear Differential Equation
Advances in Dynamical Systems and Applications ISSN 973-532, Volume 6, Number 2, pp. 24 254 (2 http://campus.mst.edu/adsa Nontrivial Solutions for Boundary Value Problems of Nonlinear Differential Equation
More informationOld Math 330 Exams. David M. McClendon. Department of Mathematics Ferris State University
Old Math 330 Exams David M. McClendon Department of Mathematics Ferris State University Last updated to include exams from Fall 07 Contents Contents General information about these exams 3 Exams from Fall
More informationh(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote
Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function
More information10 Transfer Matrix Models
MIT EECS 6.241 (FALL 26) LECTURE NOTES BY A. MEGRETSKI 1 Transfer Matrix Models So far, transfer matrices were introduced for finite order state space LTI models, in which case they serve as an important
More informationCOUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF
COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF NATHAN KAPLAN Abstract. The genus of a numerical semigroup is the size of its complement. In this paper we will prove some results
More informationEcon Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n
Econ 204 2011 Lecture 3 Outline 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n 1 Metric Spaces and Metrics Generalize distance and length notions
More informationMathematics for Engineers II. lectures. Differential Equations
Differential Equations Examples for differential equations Newton s second law for a point mass Consider a particle of mass m subject to net force a F. Newton s second law states that the vector acceleration
More informationDIFFERENTIAL CRITERIA FOR POSITIVE DEFINITENESS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume, Number, Pages S -9939(XX)- DIFFERENTIAL CRITERIA FOR POSITIVE DEFINITENESS J. A. PALMER Abstract. We show how the Mellin transform can be used to
More informationStandard forms for writing numbers
Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,
More information