The log-behavior of n p(n) and n p(n)/n

Size: px
Start display at page:

Download "The log-behavior of n p(n) and n p(n)/n"

Transcription

1 Ramauja J , The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity Tiaji 00071, P. R. Chia 1 cheyc@tju.edu.c, kezheg@aliyu.com Abstract Let p deote the partitio fuctio ad let be the differece operator respect to. I this paper, we obtai a lower boud for log 1 p 1/ 1, leadig to a proof of the cojecture of Su o the log-covexity of { p/} 60. Usig the same argumet, it ca be show that for ay real umber α, there exists a iteger α such that the sequece { p/ α } α is log-covex. Moreover, we show that lim 5 log p = π/ 4. Fially, by fidig a upper + boud of log 1 p 1, we establish a iequality o the ratio 1 p 1 p. Keywords: Partitio fuctio, Log-covex sequece, Hardy-Ramauja-Rademacher formula, Lehmer s error boud AMS Subject Classificatios: 05A0 1 Itroductio The objective of this paper is to study the log-behavior of the sequeces p ad p/, where p deotes the umber of partitios of a oegative iteger. A positive sequece {a } 0 is log-covex if it satisfies that for 1, a a 1 a +1 0, 1

2 ad it is called log-cocave if for 1, a a 1 a Let r = p/ ad let be the differece operator respect to. Su [11] cojectured that the sequece {r} 60 is log-covex. Desalvo ad Pak [5] oticed that the log-covexity of {r} 60 ca be derived from a estimate for log r 1, see [5, Fial Remark 7.7]. They also remarked that their approach to boudig log p 1 does ot seem to apply to log r 1. I this paper, we obtai a lower boud for log r 1, leadig to a proof of the log-covexity of {r} 60. Theorem 1.1 The sequece {r} 60 is log-covex. The log-covexity of {r} 60 implies the log-covexity of { p} 6, because the sequece { } 4 is log-covex [11]. It is kow that p = 1. For a lim + combiatorial proof of this fact, see Adrews [1]. Su [11] proposed the cojecture that { p} 6 is strictly decreasig, which has bee proved by Wag ad Zhu [1]. The log-covexity of { p} 6 was also cojectured by Su [11]. It is easy to see that the log-covexity of { p} 6 implies the decreasig property. It should be oted that there is a alterative way to prove the log-covexity of { p} 6. Che, Guo ad Wag [] itroduced the otio of a ratio log-covex sequece ad showed that the ratio log-covexity implies the log-covexity uder a certai iitial coditio. A sequece {a } k is called ratio log-covex if {a +1 /a } k is log-covex, or, equivaletly, for k + 1, log a + log a +1 + log a log a 1 0. Che et al. [4] showed that that for ay r 1, oe ca determie a umber r such that for > r, 1 r 1 r log p is positive. For r =, it ca be show that for 116, log p 1 > 0. Sice log p 1 = log p + log p log p log p 1, we see {p} 115 is ratio log-covex. So we are led to the followig assertio. Theorem 1. The sequece { p} 6 is log-covex. Moreover, as poited out by the referee, we may cosider the log-behavior of p/ α for ay real umber α. To this ed, we obtai the followig geeralizatio of Theorems 1.1 ad 1..

3 Theorem 1. Let α be a real umber. There exists a positive iteger α such that the sequece { p/ α } α is log-covex. We also establish the followig iequality o the ratio 1 p 1 p. Theorem 1.4 For, we have p +1 p π > 4 1 p p Desalvo ad Pak [5] have show that the limit of log p is π/ 4. boudig log p, we derive the followig limit of 5 log p: By lim 5 log p = π/ From the above relatio 1., it ca be see that the coefficet π 4 i 1.1 is the best possible. The Log-covexity of r I this sectio, we obtai a lower boud of log r 1 ad prove the log-covexity of {r} 60. First, we follow the approach of Desalvo ad Pak to give a expressio of log r 1 as a sum of B 1 ad Ẽ 1, where B 1 makes a major cotributio to log r 1 with Ẽ 1 beig the error term, that is, B 1 coverges to log r 1. The expressios for B ad E will be give later. I this settig, we derive a lower boud of B 1. By Lehmer s error boud, we give a upper boud for Ẽ 1. Combiig the lower boud for B 1 ad the upper boud for Ẽ 1, we are led to a lower boud for log r 1. By provig the positivity of this lower boud for log r 1, we reach the log-covexity of {r} 60. The strict log-covexity of {r} 60 ca be restated as the followig relatio for 61 log r log r 1 log r > 0, that is, for 61, log r 1 > 0. For 1 ad ay positive iteger N, the Hardy-Ramauja-Rademacher formula see [, 6, 7, 10] reads p = d N [ A µ k 1 k e µk k ] e µ k + R, N,.1 µ µ k=1

4 where d = π 6, µ = π 6 4 1, A k = k 1 A k, A k is a sum of 4th roots of uity with iitial values A 1 = 1 ad A = 1, R, N is the remaider. Lehmer s error boud see [8, 9] for R, N is give by [ N R, N < π N / sih µ µ N ] N.. µ Let us give a outlie of Desalvo ad Pak s approach to provig the log-cocavity of {p} >5. Settig N = i.1, they expressed p as where T = R = d [ µ d µ They have show that ad 1 1 e µ + 1 µ [ µ p = T + R,. e µ ],.4 ] e µ + R,. e µ 1 µ µ log p 1 log T 1 = log log T 1 log It follows that log they use log d µ 1 d µ 1 log-cocavity of {p} > d 1 µ µ 1 µ µ 1.5 R 1 < e π 10.6 T 1 e µ 1 < e π e µ 1 coverges to log p 1. Fially, e µ 1 to estimate log p 1, leadig to the We shall use a alterative decompositio of p. Settig N = i.1, we ca express p as p = T + R,.8 where R = T = d 1 1 e µ,.9 µ µ d [ e µ µ µ µ e µ ] e µ + R,..10 µ 4

5 Based o the decompositio.8 for p, oe ca express log r 1 as follows: log r 1 = B 1 + Ẽ 1,.11 where B = 1 log T 1 log,.1 ỹ = R/ T,.1 Ẽ = 1 log1 + ỹ..14 The followig lemma will be used to derive a lower boud ad a upper boud of B 1. Lemma.1 Suppose fx has a cotiuous secod derivative for x [ 1, + 1]. The there exists c 1, + 1 such that f 1 = f f 1 f = c..15 If fx has a icreasig secod derivative, the 1 < f 1 < Coversely, if fx has a decreasig secod derivative, the + 1 < f 1 < Proof. Set ϕx = fx + 1 fx. By the mea value theorem, there exists a umber ξ 1, such that f f 1 f = ϕ ϕ 1 = ϕ ξ. Agai, applyig the mea value theorem to ϕ ξ, there exists a umber θ 0, 1 such that ϕ ξ = f ξ + 1 f ξ = ξ + θ. Let c = ξ + θ. The we get.15, which yields.16 ad.17. I order to fid a lower boud for log r 1 ad obtai the limit of 5 log p, we eed the followig lower ad upper bouds for 1 1 log T 1. 5

6 Lemma. Let 4 logµ 1 B 1 =, / 1 4 logµ B = / For 40, we have B 1 < 1 1 log T 1 < B..0 Proof. By the defiitio.9, we may write where Thus Sice 1 = log T = f 1 = µ, f = f = f 4 = log d. 1 1 log T 1 = 4 f i, i=1 log µ, logµ 1, 4 f i 1..1 i=1 π / , we see that for 1, 1 < 0. Similarly, it ca be checked that for 4, > 0, < 0, ad 4 > 0. Cosequetly, for 4, 1 ad are decreasig, whereas ad 4 are icreasig. Usig Lemma.1, for each i, we ca get a lower boud ad a upper boud for f i 1 i terms of i 1 ad i + 1. For example, < f 1 1 < 1 1. So, by.1 we fid that 1 1 log T 1 > ,. 6

7 ad where 1 1 log T 1 < ,. 1 = 4 1 / 1π 4 1 / + π, / 6 log µ 7 = ,.5 4π logµ 1 = + µ π µ π µ 14 1 /,.6 4 = log d..7 Accordig to.4, oe ca check that for, > A easy computatio shows that for, Substitutig.9 ito.6 yields that + 1 > π..8 / / µ 1 > µ..9 logµ Usig.5 ad.0, we fid that > logµ logµ Apparetly, for, > 1 1, 4 7

8 so that logµ logµ > Sice, for, logµ logµ logµ logµ logµ 1 > > 1,. utilizig.1 ad. yields, for, 4 logµ 1 1 logµ > Usig.7,.8 ad.4, we deduce that B 1 > 1 + log d 1π 1 logµ / 1 4 Let C be the right had side of.5. By., to prove B 1 < 1 1 log T 1, it is eough to show that C > 0 whe 40. Sice log x < x for x > 0, for µ < π 4 4 4,.6 we get 1 logµ µ > > 4π / Note that for, 1π 4π >..8 / / Combiig.7 ad.8, we see that for, 1 + log d + 1/48 4π C > / It is straightforward to show that the right had side of.9 is positive if 490. For , it is routie to check that C > 0, ad so C > 0 for 40. It follows from.5 that for 40, 1 1 log T 1 > B 1. 8

9 To derive the upper boud for 1 1 log T 1, we obtai the followig upper bouds which ca be verified directly. The proofs are omitted. For, 1 1 < 1[4 5], / 6 log µ < , 4π logµ 1 1 < + µ < 4π µ π µ 14 5 / 1, 1 logµ logµ + 1 +, < 0. Combiig the above upper bouds, we coclude that for 40, This completes the proof < B. The followig lemma gives a upper boud for Ẽ 1. Lemma. For 40, Ẽ 1 < 5 π e Proof. By.14, we fid that for, where Ẽ 1 = 1 1 log1 + ỹ log1 + ỹ +1 log1 + ỹ,.41 ỹ = R/ T. To boud Ẽ 1, it is ecessary to boud ỹ. For this purpose, we first cosider R, as defied by.10. Sice d < 1 ad µ >, for 1 we have [ d 1+ 1 e µ µ µ µ < 1 1+e µ µ e µ ] e µ µ

10 For N = ad 1, Lehmer s boud. reduces to R, < µ e µ. By the defiitio of R, R < e µ µ µ e µ < µ e µ..4 Recallig the defiitio.9 of T, it follows from.4 that for 1, ỹ < Observe that for, ad µ 5µ e µ + 9e µ 6 e µ..4 dµ 1 5µ e µ + 9e µ 6 < 0,.44 dµ 1 µ > Sice 5µ 40e µ40 + 9e µ40 6 < usig.44 ad.45, we deduce that for 40, 5µ e µ + 9e µ 6 < Now, it is clear from.4 ad.46 that for 40, dµ40 1, µ40 dµ µ ỹ < e µ..47 I view of.47, for 40, ỹ < e µ40 < It is kow that log1 + x < x for 0 < x < 1 ad log1 + x < x/1 + x for 1 < x < 0. Thus, for x < 1, log1 + x x 1 x,.49 10

11 see also [5], ad so it follows from.48 ad.49 that for 40, log1 + ỹ ỹ 1 ỹ 5 4 ỹ..50 Because of.41, we see that for, Ẽ log1+ỹ log1+ỹ +1 + log1+ỹ..51 Applyig.50 to.51, we obtai that for 40, Ẽ Ẽ 1 < 5 4 ỹ ỹ ỹ Pluggig.47 ito.5, we ifer that for 40, e µ 1 1 µ+1 + e µ + e..5 But 1 µ e is decreasig for 1. It follows from.5 that for 40, This proves.40. Ẽ 1 < 5 µ 1 1 e. With the aid of Lemma. ad., we are ready to prove the log-covexity of {r} 60. Proof of Theorem 1.1. To prove the strict log-covexity of {r} 60, we proceed to show that for 61, log r 1 > 0. Evidetly, for 40, By Lemma.1, that is, It follows from.1 that log 1 1 log 1 1 log > 0. > log 1, 1 log 1 > B 1 = 1 1 log T log

12 Applyig Lemma. ad.54 to the above relatio, we deduce that for 40, that is, B 1 > B 1 > B1 log , 4 log[µ 1] log / By.11 ad Lemma., we fid that for 40, log r 1 > 5 π B e It follows from.55 ad.56 that for 40, log r 1 > 4 log[µ 1] log / π e 18. Let D deote the right had side of the above relatio. Clearly, for 5505, > π > / To prove that D > 0 for 5505, we wish to show that for 5505, 4 log[µ 1] log π e 18 > Usig the fact that for x > 5504, log x < x 1/4, we deduce that for 5505, ad 4 log[µ 1] < 4 4 µ 1 < log 1 1 < π 11/4 1 < Sice e x > x 6 /70 for x > 0, we see that for, < 1 6,.59 1 / /4 1 π e 18 < 1 π 1 e 18 < < Combiig.59,.60 ad.61, we fid that for 5505, 4 log[µ 1] log π e 18 1

13 6 > 1 / / > 1 /8 1 11/4 1 > 1. This proves the iequality.58. By.58 ad.57, we obtai that D > 0 for Verifyig that log r 1 > 0 for completes the proof. Clearly, Theorem 1. is a geeralizatio as well as a uificatio of Theorem 1.1 ad 1.. I fact, it ca be proved i the same maer as the proof of Theorem Proof of Theorem 1.. Let α be a real umber. Whe α 0, it is clear that α log-covex. It follows from Theorem 1. that p/ α is log-covex for 6. We ow cosider the case α > 0. A similar argumet to the proof of Theorem 1.1 shows that for 40, log 1 p 1/ 1 α = 1 1 log T + 1 > 4 log[µ 1] / 1 1 log1 + y log 1 1 α 1 α log α 1 5 π e It is easy to check that for max {[ ] } 490 α +, 5505, α 1 5 π e 18 > ad that for max{[α + 4 ] +, 5505}, Let α > 0, 4 log[µ 1] α log 1 6 > α /8 1 > 1 11/4 1. {[ ] 490 α = max α It ca be see that for > α, } +, [α + 4 ] +, log[µ 1] α log 1 + α π e 18 >..6 1 Combig.57 ad.6, we deduce that the right had side of.6 is positive for > α. So we are led to the log-covexity of the sequece { p/ α } α. 1 is

14 A iequality o the ratio 1 p 1 p I this sectio, we employ Lemma. ad Lemma. to fid the limit of 5 log p. The we give a upper boud for log 1 p 1. This leads to the iequality 1.1. Theorem.1 Let = π/ 4. We have lim + 5 log p =..1 Proof. Usig.8, that is, the N = case of the Hardy-Ramauja-Rademacher formula for p, we fid that log p = 1 log T + 1 log1 + ỹ, where T ad y are give by.9 ad.1. By the defiitio.14 of Ẽ, we get log 1 p 1 = 1 1 log T 1 + Ẽ 1.. Applyig Lemma., we get that From Lemma., we get Usig.,. ad.4, we deduce that as required. lim log T 1 =.. lim 1 5 Ẽ 1 = lim 5 log p =, + To prove Theorem 1.4, we eed the followig upper boud for log 1 p 1. Theorem. For, log 1 p 1 < π 4 + π..5 14

15 Proof. By the upper boud of 1 1 log T 1 give i Lemma., the upper boud of Ẽ 1 give i Lemma., ad the relatio., we obtai the followig upper boud of log 1 p 1 for 40: log 1 p 1 < To prove.5, we claim that for 095, log[µ + 1] π 4 5 / e log[µ + 1] + 5 π 4 5 / e 18 < First, we show that for 60, π 4 + π π / 4 + π < For 0 < x 1, it ca be checked that 48 I the otatio = π/ 4, we have Settig x = 5 1, we have x 4.9, we fid that for 60, so that for 60, 1 1 x / < 1 + x + 8 x = / 1 / / / / < 1[4 5] π / 4 + π < 1 π / 4 + π + for 60. Applyig.8 to the right had side of [ / [ 1 / ],.10 ]..11 To prove.7, we proceed to show that the right had side of.11 is bouded by 1 1. Notig that for, 1 π / 4 + π = /, 15

16 ad usig the fact + > 1, together with / > 1 /, we deduce that 1 / π 4 + π < Applyig.1 to.11, we obtai that for 60, 1[4 5] / π 4 + π < [ 1 + 7/ / 1 7/ ]..1 Sice 75 < ad 5 1 < for, it follows from.1 that for 60, / 1[4 5] π / 4 + π Usig the fact that <, we see that < 1 7/ / / < 6 1 7/ For 60, it is easily checked that the right had side of.14 is bouded by 1 1. This cofirms.7. To prove the claim.6, it is eough to show that for 095, 1 4 log[µ + 1] 5 < π e From.61 it ca be see that for 095, 5 π e 18 < Sice 4 log[µ + 1] > 18 for 095, it follows from.16 that for 095, 4 log[µ + 1] π e 18 > > 1 1. So we obtai.15. Combiig.15 ad??, we arrive at.6. For 094, the iequality.5 ca be easily checked. This completes the proof. 16

17 We are ow i a positio to complete the proof of Theorem 1.4. Proof of Theorem 1.4. It is kow that for x > 0, so that for 1, x 1 + x < log1 + x, π π < log π +. 4 I light of the above relatio, Theorem. implies that for, log 1 π p 1 < log 1 +, 4 that is, +1 p p 1 < π 1 + p, 4 as required. We remark that = π/ 4 is the smallest possible umber for the iequality i Theorem 1.4. Suppose that 0 < γ <. By Theorem.1, there exists a iteger N such that for > N, log 1 p 1 > γ. It follows that log 1 p 1 > which implies that for > N, p +1 p + 1 γ > log 1 + γ, 1 + γ < 1 p 1. p Ackowledgmets. We wish to thak the referee for helpful commets. Refereces [1] G.E. Adrews, Combiatorial proof of a partitio fuctio limit, Amer. Math. Mothly., , [] G.E. Adrews, The Theory of Partitios, Cambridge Uiversity Press, Cambridge, [] W.Y.C. Che, J.J.F. Guo ad L.X.W. Wag, Ifiitely log-mootoic combiatorial sequeces. Adv. Appl. Math., 5 014,

18 [4] W.Y.C. Che, L.X.W. Wag ad G.Y.B. Xie, Fiite differeces of the logarithm of the partitio fuctio. Math. Comp., , [5] S. Desalvo ad I. Pak, Log-cocavity of the partitio fuctio, Ramauja J., 8 016, [6] G.H. Hardy, Twelve Lectures o Subjects Suggested by His Life ad Work, Cambridge Uiversity Press, Cambridge, [7] G.H. Hardy ad S. Ramauja, Asymptotic formulae i combiatory aalysis, Proc. Lodo Math. Soc., , [8] D.H. Lehmer, O the series for the partitio fuctio, Tras. Amer. Math. Soc., 4 198, [9] D.H. Lehmer, O the remaiders ad covergece of the series for the partitio fuctio, Tras. Amer. Math. Soc., , 6 7. [10] H. Rademacher, A coverget series for the partitio fuctio p, Proc. Nat. Acad. Sci, 197, [11] Z.-W. Su, O a sequece ivolvig sums of primes, Bull. Aust. Math. Soc , [1] Y. Wag, B.-X. Zhu, Proofs of some cojectures o mootoicity of umbertheoretic ad combiatorial sequeces, Sci. Chia Math ,

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES Publ. Math. Debrece 8504, o. 3-4, 85 95. ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES QING-HU HOU*, ZHI-WEI SUN** AND HAOMIN WEN Abstract. We cofirm Su s cojecture that F / F 4 is strictly decreasig

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences. MATH 301 Itroductio to Aalysis Chapter Four Sequeces Topics 1. Defiitio of covergece of sequeces. 2. Fidig ad provig the limit of sequeces. 3. Bouded covergece theorem: Theorem 4.1.8. 4. Theorems 4.1.13

More information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios

More information

University of Manitoba, Mathletics 2009

University of Manitoba, Mathletics 2009 Uiversity of Maitoba, Mathletics 009 Sessio 5: Iequalities Facts ad defiitios AM-GM iequality: For a, a,, a 0, a + a + + a (a a a ) /, with equality iff all a i s are equal Cauchy s iequality: For reals

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak

More information

Self-normalized deviation inequalities with application to t-statistic

Self-normalized deviation inequalities with application to t-statistic Self-ormalized deviatio iequalities with applicatio to t-statistic Xiequa Fa Ceter for Applied Mathematics, Tiaji Uiversity, 30007 Tiaji, Chia Abstract Let ξ i i 1 be a sequece of idepedet ad symmetric

More information

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n = 60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece

More information

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Definition An infinite sequence of numbers is an ordered set of real numbers.

Definition An infinite sequence of numbers is an ordered set of real numbers. Ifiite sequeces (Sect. 0. Today s Lecture: Review: Ifiite sequeces. The Cotiuous Fuctio Theorem for sequeces. Usig L Hôpital s rule o sequeces. Table of useful its. Bouded ad mootoic sequeces. Previous

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction Acta Math. Uiv. Comeiaae Vol. LXXXVI, 2 (2017), pp. 279 286 279 k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c N. IRMAK ad M. ALP Abstract. The k-geeralized Fiboacci sequece { F (k)

More information

Lecture 3 The Lebesgue Integral

Lecture 3 The Lebesgue Integral Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified

More information

4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3

4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3 Exam Problems (x. Give the series (, fid the values of x for which this power series coverges. Also =0 state clearly what the radius of covergece is. We start by settig up the Ratio Test: x ( x x ( x x

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES 11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS

More information

Real Analysis Fall 2004 Take Home Test 1 SOLUTIONS. < ε. Hence lim

Real Analysis Fall 2004 Take Home Test 1 SOLUTIONS. < ε. Hence lim Real Aalysis Fall 004 Take Home Test SOLUTIONS. Use the defiitio of a limit to show that (a) lim si = 0 (b) Proof. Let ε > 0 be give. Defie N >, where N is a positive iteger. The for ε > N, si 0 < si

More information

SOME SEQUENCE SPACES DEFINED BY ORLICZ FUNCTIONS

SOME SEQUENCE SPACES DEFINED BY ORLICZ FUNCTIONS ARCHIVU ATHEATICU BRNO Tomus 40 2004, 33 40 SOE SEQUENCE SPACES DEFINED BY ORLICZ FUNCTIONS E. SAVAŞ AND R. SAVAŞ Abstract. I this paper we itroduce a ew cocept of λ-strog covergece with respect to a Orlicz

More information

2.4.2 A Theorem About Absolutely Convergent Series

2.4.2 A Theorem About Absolutely Convergent Series 0 Versio of August 27, 200 CHAPTER 2. INFINITE SERIES Add these two series: + 3 2 + 5 + 7 4 + 9 + 6 +... = 3 l 2. (2.20) 2 Sice the reciprocal of each iteger occurs exactly oce i the last series, we would

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

More information

MIDTERM 3 CALCULUS 2. Monday, December 3, :15 PM to 6:45 PM. Name PRACTICE EXAM SOLUTIONS

MIDTERM 3 CALCULUS 2. Monday, December 3, :15 PM to 6:45 PM. Name PRACTICE EXAM SOLUTIONS MIDTERM 3 CALCULUS MATH 300 FALL 08 Moday, December 3, 08 5:5 PM to 6:45 PM Name PRACTICE EXAM S Please aswer all of the questios, ad show your work. You must explai your aswers to get credit. You will

More information

Solutions to Tutorial 3 (Week 4)

Solutions to Tutorial 3 (Week 4) The Uiversity of Sydey School of Mathematics ad Statistics Solutios to Tutorial Week 4 MATH2962: Real ad Complex Aalysis Advaced Semester 1, 2017 Web Page: http://www.maths.usyd.edu.au/u/ug/im/math2962/

More information

Assignment 5: Solutions

Assignment 5: Solutions McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece

More information

Math 341 Lecture #31 6.5: Power Series

Math 341 Lecture #31 6.5: Power Series Math 341 Lecture #31 6.5: Power Series We ow tur our attetio to a particular kid of series of fuctios, amely, power series, f(x = a x = a 0 + a 1 x + a 2 x 2 + where a R for all N. I terms of a series

More information

ON STATISTICAL CONVERGENCE AND STATISTICAL MONOTONICITY

ON STATISTICAL CONVERGENCE AND STATISTICAL MONOTONICITY Aales Uiv. Sci. Budapest., Sect. Comp. 39 (203) 257 270 ON STATISTICAL CONVERGENCE AND STATISTICAL MONOTONICITY E. Kaya (Mersi, Turkey) M. Kucukasla (Mersi, Turkey) R. Wager (Paderbor, Germay) Dedicated

More information

Supplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate

Supplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate Supplemetary Material for Fast Stochastic AUC Maximizatio with O/-Covergece Rate Migrui Liu Xiaoxua Zhag Zaiyi Che Xiaoyu Wag 3 iabao Yag echical Lemmas ized versio of Hoeffdig s iequality, ote that We

More information

SHARP INEQUALITIES INVOLVING THE CONSTANT e AND THE SEQUENCE (1 + 1/n) n

SHARP INEQUALITIES INVOLVING THE CONSTANT e AND THE SEQUENCE (1 + 1/n) n SHARP INEQUALITIES INVOLVING THE CONSTANT e AND THE SEQUENCE + / NECDET BATIR Abstract. Several ew ad sharp iequalities ivolvig the costat e ad the sequece + / are proved.. INTRODUCTION The costat e or

More information

MONOTONICITY OF SEQUENCES INVOLVING GEOMETRIC MEANS OF POSITIVE SEQUENCES WITH LOGARITHMICAL CONVEXITY

MONOTONICITY OF SEQUENCES INVOLVING GEOMETRIC MEANS OF POSITIVE SEQUENCES WITH LOGARITHMICAL CONVEXITY MONOTONICITY OF SEQUENCES INVOLVING GEOMETRIC MEANS OF POSITIVE SEQUENCES WITH LOGARITHMICAL CONVEXITY FENG QI AND BAI-NI GUO Abstract. Let f be a positive fuctio such that x [ f(x + )/f(x) ] is icreasig

More information

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS H. W. Gould Departmet of Mathematics, West Virgiia Uiversity, Morgatow, WV

More information

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1. Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6

More information

s = and t = with C ij = A i B j F. (i) Note that cs = M and so ca i µ(a i ) I E (cs) = = c a i µ(a i ) = ci E (s). (ii) Note that s + t = M and so

s = and t = with C ij = A i B j F. (i) Note that cs = M and so ca i µ(a i ) I E (cs) = = c a i µ(a i ) = ci E (s). (ii) Note that s + t = M and so 3 From the otes we see that the parts of Theorem 4. that cocer us are: Let s ad t be two simple o-egative F-measurable fuctios o X, F, µ ad E, F F. The i I E cs ci E s for all c R, ii I E s + t I E s +

More information

Section 11.8: Power Series

Section 11.8: Power Series Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i

More information

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f. Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,

More information

THE INTEGRAL TEST AND ESTIMATES OF SUMS

THE INTEGRAL TEST AND ESTIMATES OF SUMS THE INTEGRAL TEST AND ESTIMATES OF SUMS. Itroductio Determiig the exact sum of a series is i geeral ot a easy task. I the case of the geometric series ad the telescoig series it was ossible to fid a simle

More information

Sequences. A Sequence is a list of numbers written in order.

Sequences. A Sequence is a list of numbers written in order. Sequeces A Sequece is a list of umbers writte i order. {a, a 2, a 3,... } The sequece may be ifiite. The th term of the sequece is the th umber o the list. O the list above a = st term, a 2 = 2 d term,

More information

Council for Innovative Research

Council for Innovative Research ABSTRACT ON ABEL CONVERGENT SERIES OF FUNCTIONS ERDAL GÜL AND MEHMET ALBAYRAK Yildiz Techical Uiversity, Departmet of Mathematics, 34210 Eseler, Istabul egul34@gmail.com mehmetalbayrak12@gmail.com I this

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x

More information

Some Tauberian theorems for weighted means of bounded double sequences

Some Tauberian theorems for weighted means of bounded double sequences A. Ştiiţ. Uiv. Al. I. Cuza Iaşi. Mat. N.S. Tomul LXIII, 207, f. Some Tauberia theorems for weighted meas of bouded double sequeces Cemal Bele Received: 22.XII.202 / Revised: 24.VII.203/ Accepted: 3.VII.203

More information

1+x 1 + α+x. x = 2(α x2 ) 1+x

1+x 1 + α+x. x = 2(α x2 ) 1+x Math 2030 Homework 6 Solutios # [Problem 5] For coveiece we let α lim sup a ad β lim sup b. Without loss of geerality let us assume that α β. If α the by assumptio β < so i this case α + β. By Theorem

More information

lim za n n = z lim a n n.

lim za n n = z lim a n n. Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget

More information

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1 MATH 2: HOMEWORK 6 SOLUTIONS CA PRO JIRADILOK Problem. If s = 2, ad Problem : Rudi, Chapter 3, Problem 3. s + = 2 + s ( =, 2, 3,... ), prove that {s } coverges, ad that s < 2 for =, 2, 3,.... Proof. The

More information

Ma 530 Introduction to Power Series

Ma 530 Introduction to Power Series Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power

More information

LECTURE SERIES WITH NONNEGATIVE TERMS (II). SERIES WITH ARBITRARY TERMS

LECTURE SERIES WITH NONNEGATIVE TERMS (II). SERIES WITH ARBITRARY TERMS LECTURE 4 SERIES WITH NONNEGATIVE TERMS II). SERIES WITH ARBITRARY TERMS Series with oegative terms II) Theorem 4.1 Kummer s Test) Let x be a series with positive terms. 1 If c ) N i 0, + ), r > 0 ad 0

More information

A Proof of Birkhoff s Ergodic Theorem

A Proof of Birkhoff s Ergodic Theorem A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 3 9//203 Large deviatios Theory. Cramér s Theorem Cotet.. Cramér s Theorem. 2. Rate fuctio ad properties. 3. Chage of measure techique.

More information

d) If the sequence of partial sums converges to a limit L, we say that the series converges and its

d) If the sequence of partial sums converges to a limit L, we say that the series converges and its Ifiite Series. Defiitios & covergece Defiitio... Let {a } be a sequece of real umbers. a) A expressio of the form a + a +... + a +... is called a ifiite series. b) The umber a is called as the th term

More information

Sequence A sequence is a function whose domain of definition is the set of natural numbers.

Sequence A sequence is a function whose domain of definition is the set of natural numbers. Chapter Sequeces Course Title: Real Aalysis Course Code: MTH3 Course istructor: Dr Atiq ur Rehma Class: MSc-I Course URL: wwwmathcityorg/atiq/fa8-mth3 Sequeces form a importat compoet of Mathematical Aalysis

More information

Tauberian theorems for the product of Borel and Hölder summability methods

Tauberian theorems for the product of Borel and Hölder summability methods A. Ştiiţ. Uiv. Al. I. Cuza Iaşi. Mat. (N.S.) Tomul LXIII, 2017, f. 1 Tauberia theorems for the product of Borel ad Hölder summability methods İbrahim Çaak Received: Received: 17.X.2012 / Revised: 5.XI.2012

More information

On Summability Factors for N, p n k

On Summability Factors for N, p n k Advaces i Dyamical Systems ad Applicatios. ISSN 0973-532 Volume Number 2006, pp. 79 89 c Research Idia Publicatios http://www.ripublicatio.com/adsa.htm O Summability Factors for N, p B.E. Rhoades Departmet

More information

MA131 - Analysis 1. Workbook 9 Series III

MA131 - Analysis 1. Workbook 9 Series III MA3 - Aalysis Workbook 9 Series III Autum 004 Cotets 4.4 Series with Positive ad Negative Terms.............. 4.5 Alteratig Series.......................... 4.6 Geeral Series.............................

More information

The value of Banach limits on a certain sequence of all rational numbers in the interval (0,1) Bao Qi Feng

The value of Banach limits on a certain sequence of all rational numbers in the interval (0,1) Bao Qi Feng The value of Baach limits o a certai sequece of all ratioal umbers i the iterval 0, Bao Qi Feg Departmet of Mathematical Scieces, Ket State Uiversity, Tuscarawas, 330 Uiversity Dr. NE, New Philadelphia,

More information

MA541 : Real Analysis. Tutorial and Practice Problems - 1 Hints and Solutions

MA541 : Real Analysis. Tutorial and Practice Problems - 1 Hints and Solutions MA54 : Real Aalysis Tutorial ad Practice Problems - Hits ad Solutios. Suppose that S is a oempty subset of real umbers that is bouded (i.e. bouded above as well as below). Prove that if S sup S. What ca

More information

Exponential Functions and Taylor Series

Exponential Functions and Taylor Series MATH 4530: Aalysis Oe Expoetial Fuctios ad Taylor Series James K. Peterso Departmet of Biological Scieces ad Departmet of Mathematical Scieces Clemso Uiversity March 29, 2017 MATH 4530: Aalysis Oe Outlie

More information

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the

More information

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

More information

Rademacher Complexity

Rademacher Complexity EECS 598: Statistical Learig Theory, Witer 204 Topic 0 Rademacher Complexity Lecturer: Clayto Scott Scribe: Ya Deg, Kevi Moo Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved for

More information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term. 0. Sequeces A sequece is a list of umbers writte i a defiite order: a, a,, a, a is called the first term, a is the secod term, ad i geeral eclusively with ifiite sequeces ad so each term Notatio: the sequece

More information

Harmonic Number Identities Via Euler s Transform

Harmonic Number Identities Via Euler s Transform 1 2 3 47 6 23 11 Joural of Iteger Sequeces, Vol. 12 2009), Article 09.6.1 Harmoic Number Idetities Via Euler s Trasform Khristo N. Boyadzhiev Departmet of Mathematics Ohio Norther Uiversity Ada, Ohio 45810

More information

On Divisibility concerning Binomial Coefficients

On Divisibility concerning Binomial Coefficients A talk give at the Natioal Chiao Tug Uiversity (Hsichu, Taiwa; August 5, 2010 O Divisibility cocerig Biomial Coefficiets Zhi-Wei Su Najig Uiversity Najig 210093, P. R. Chia zwsu@ju.edu.c http://math.ju.edu.c/

More information

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

More information

Dirichlet s Theorem on Arithmetic Progressions

Dirichlet s Theorem on Arithmetic Progressions Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty

More information

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

DANIELL AND RIEMANN INTEGRABILITY

DANIELL AND RIEMANN INTEGRABILITY DANIELL AND RIEMANN INTEGRABILITY ILEANA BUCUR We itroduce the otio of Riema itegrable fuctio with respect to a Daiell itegral ad prove the approximatio theorem of such fuctios by a mootoe sequece of Jorda

More information

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial. Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable

More information

2 Banach spaces and Hilbert spaces

2 Banach spaces and Hilbert spaces 2 Baach spaces ad Hilbert spaces Tryig to do aalysis i the ratioal umbers is difficult for example cosider the set {x Q : x 2 2}. This set is o-empty ad bouded above but does ot have a least upper boud

More information

A Simplified Binet Formula for k-generalized Fibonacci Numbers

A Simplified Binet Formula for k-generalized Fibonacci Numbers A Simplified Biet Formula for k-geeralized Fiboacci Numbers Gregory P. B. Dresde Departmet of Mathematics Washigto ad Lee Uiversity Lexigto, VA 440 dresdeg@wlu.edu Zhaohui Du Shaghai, Chia zhao.hui.du@gmail.com

More information

Proof of a conjecture of Amdeberhan and Moll on a divisibility property of binomial coefficients

Proof of a conjecture of Amdeberhan and Moll on a divisibility property of binomial coefficients Proof of a cojecture of Amdeberha ad Moll o a divisibility property of biomial coefficiets Qua-Hui Yag School of Mathematics ad Statistics Najig Uiversity of Iformatio Sciece ad Techology Najig, PR Chia

More information

f(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim

f(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim Math 3, Sectio 2. (25 poits) Why we defie f(x) dx as we do. (a) Show that the improper itegral diverges. Hece the improper itegral x 2 + x 2 + b also diverges. Solutio: We compute x 2 + = lim b x 2 + =

More information

Square-Congruence Modulo n

Square-Congruence Modulo n Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet

More information

Factors of sums and alternating sums involving binomial coefficients and powers of integers

Factors of sums and alternating sums involving binomial coefficients and powers of integers Factors of sums ad alteratig sums ivolvig biomial coefficiets ad powers of itegers Victor J. W. Guo 1 ad Jiag Zeg 2 1 Departmet of Mathematics East Chia Normal Uiversity Shaghai 200062 People s Republic

More information

Math 113, Calculus II Winter 2007 Final Exam Solutions

Math 113, Calculus II Winter 2007 Final Exam Solutions Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this

More information

Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan

Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan Arkasas Tech Uiversity MATH 94: Calculus II Dr Marcel B Fia 85 Power Series Let {a } =0 be a sequece of umbers The a power series about x = a is a series of the form a (x a) = a 0 + a (x a) + a (x a) +

More information

Supplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate

Supplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate Supplemetary Material for Fast Stochastic AUC Maximizatio with O/-Covergece Rate Migrui Liu Xiaoxua Zhag Zaiyi Che Xiaoyu Wag 3 iabao Yag echical Lemmas ized versio of Hoeffdig s iequality, ote that We

More information

SOLUTIONS TO EXAM 3. Solution: Note that this defines two convergent geometric series with respective radii r 1 = 2/5 < 1 and r 2 = 1/5 < 1.

SOLUTIONS TO EXAM 3. Solution: Note that this defines two convergent geometric series with respective radii r 1 = 2/5 < 1 and r 2 = 1/5 < 1. SOLUTIONS TO EXAM 3 Problem Fid the sum of the followig series 2 + ( ) 5 5 2 5 3 25 2 2 This series diverges Solutio: Note that this defies two coverget geometric series with respective radii r 2/5 < ad

More information

Riemann Sums y = f (x)

Riemann Sums y = f (x) Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, o-egative fuctio o the closed iterval [a, b] Fid

More information

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

More information

Oscillation and Property B for Third Order Difference Equations with Advanced Arguments

Oscillation and Property B for Third Order Difference Equations with Advanced Arguments Iter atioal Joural of Pure ad Applied Mathematics Volume 3 No. 0 207, 352 360 ISSN: 3-8080 (prited versio); ISSN: 34-3395 (o-lie versio) url: http://www.ijpam.eu ijpam.eu Oscillatio ad Property B for Third

More information

On some properties of digamma and polygamma functions

On some properties of digamma and polygamma functions J. Math. Aal. Appl. 328 2007 452 465 www.elsevier.com/locate/jmaa O some properties of digamma ad polygamma fuctios Necdet Batir Departmet of Mathematics, Faculty of Arts ad Scieces, Yuzucu Yil Uiversity,

More information

BIRKHOFF ERGODIC THEOREM

BIRKHOFF ERGODIC THEOREM BIRKHOFF ERGODIC THEOREM Abstract. We will give a proof of the poitwise ergodic theorem, which was first proved by Birkhoff. May improvemets have bee made sice Birkhoff s orgial proof. The versio we give

More information

Classes of Uniformly Convex and Uniformly Starlike Functions as Dual Sets

Classes of Uniformly Convex and Uniformly Starlike Functions as Dual Sets JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 16, 4047 1997 ARTICLE NO. AY975640 Classes of Uiformly Covex ad Uiformly Starlike Fuctios as Dual Sets I. R. Nezhmetdiov Faculty of Mechaics ad Mathematics,

More information

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai

More information

Concavity of weighted arithmetic means with applications

Concavity of weighted arithmetic means with applications Arch. Math. 69 (1997) 120±126 0003-889X/97/020120-07 $ 2.90/0 Birkhäuser Verlag, Basel, 1997 Archiv der Mathematik Cocavity of weighted arithmetic meas with applicatios By ARKADY BERENSTEIN ad ALEK VAINSHTEIN*)

More information

1 Convergence in Probability and the Weak Law of Large Numbers

1 Convergence in Probability and the Weak Law of Large Numbers 36-752 Advaced Probability Overview Sprig 2018 8. Covergece Cocepts: i Probability, i L p ad Almost Surely Istructor: Alessadro Rialdo Associated readig: Sec 2.4, 2.5, ad 4.11 of Ash ad Doléas-Dade; Sec

More information

A Fixed Point Result Using a Function of 5-Variables

A Fixed Point Result Using a Function of 5-Variables Joural of Physical Scieces, Vol., 2007, 57-6 Fixed Poit Result Usig a Fuctio of 5-Variables P. N. Dutta ad Biayak S. Choudhury Departmet of Mathematics Begal Egieerig ad Sciece Uiversity, Shibpur P.O.:

More information

1 Lecture 2: Sequence, Series and power series (8/14/2012)

1 Lecture 2: Sequence, Series and power series (8/14/2012) Summer Jump-Start Program for Aalysis, 202 Sog-Yig Li Lecture 2: Sequece, Series ad power series (8/4/202). More o sequeces Example.. Let {x } ad {y } be two bouded sequeces. Show lim sup (x + y ) lim

More information

Sequences, Series, and All That

Sequences, Series, and All That Chapter Te Sequeces, Series, ad All That. Itroductio Suppose we wat to compute a approximatio of the umber e by usig the Taylor polyomial p for f ( x) = e x at a =. This polyomial is easily see to be 3

More information

ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS

ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS EDUARD KONTOROVICH Abstract. I this work we uify ad geeralize some results about chaos ad sesitivity. Date: March 1, 005. 1 1. Symbolic Dyamics Defiitio

More information

5 Sequences and Series

5 Sequences and Series Bria E. Veitch 5 Sequeces ad Series 5. Sequeces A sequece is a list of umbers i a defiite order. a is the first term a 2 is the secod term a is the -th term The sequece {a, a 2, a 3,..., a,..., } is a

More information

2.4 Sequences, Sequences of Sets

2.4 Sequences, Sequences of Sets 72 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.4 Sequeces, Sequeces of Sets 2.4.1 Sequeces Defiitio 2.4.1 (sequece Let S R. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For each

More information

Formulas for the number of gridlines

Formulas for the number of gridlines This is the authors versio of the paper. The fial publicatio has appeared i Moatsh. Math. 164 (011), 157 170. Formulas for the umber of gridlies Ae-Maria Ervall-Hytöe Kaisa Matomäki Petti Haukkae Jorma

More information

The Ratio Test. THEOREM 9.17 Ratio Test Let a n be a series with nonzero terms. 1. a. n converges absolutely if lim. n 1

The Ratio Test. THEOREM 9.17 Ratio Test Let a n be a series with nonzero terms. 1. a. n converges absolutely if lim. n 1 460_0906.qxd //04 :8 PM Page 69 SECTION 9.6 The Ratio ad Root Tests 69 Sectio 9.6 EXPLORATION Writig a Series Oe of the followig coditios guaratees that a series will diverge, two coditios guaratee that

More information