Decomposition of terms in Lucas sequences

Size: px
Start display at page:

Download "Decomposition of terms in Lucas sequences"

Transcription

1 Journl of Logic & Anlysis 1: ISSN Decomposition of terms in Lucs sequences ABDELMADJID BOUDAOUD Let P, Q be non-zero integers such tht D = P 4Q is different from zero. The sequences of integers defined by { Un = PU n 1 QU n ; U 0 = 0, U 1 = 1; V n = PV n 1 QV n ; V 0 =, V 1 = P. re clled the Lucs sequences ssocited to the pir P, Q [6,7]. In this pper we prove the following result: If P, Q re such tht D is strictly positive, then, for unlimited n, ech of the integers U n nd V n differs by limited integer from product of two unlimited integers. 000 Mthemtics Subject Clssifiction 11B39, 11A51, 6E35 Keywords: Lucs sequences, Fiboncci sequences, nonstndrd nlysis 1 Introduction Let N be ny lrge integer. Proceeding directly to the fctoriztion of N is not n esy tsk, even unfesible unless N belongs to prticulr fmily of integers. Then to surmount this mjor difficulty we might choose to sk bout the fctoriztion of n integer in smll neighborhood of N insted of N. This is expressed through the following question: Is there smll integer s such tht N = s + µϑ, where µ nd ϑ re two lrge integers? The fct tht the integer N s is product of two lrge integers, gives n ide of its fctoriztion. In the existing literture, the decomposition of integers is n immense problem which hs been posed in severl wys nd treted by different methods for exmple [1, 3, 8]. This ide originted in [], where we chose to work in the frmework of nonstndrd nlysis [4, 5] to be ble to give sense to the words "smll", "lrge",... nd the question hs the formultion: Is every unlimited integer the sum of limited integer nd product of two unlimited integers? To give prtil nswer we provided some exmples [] nd we devote the present work to nother exmple concerning Lucs Published: 16 April 009 doi: /jl

2 Abdelmdjid Boudoud sequences. In the finl section we give the clssicl equivlence of the result obtined nd generl remrk. We strt with brief overview of Lucs sequences ssocited to pir of integers [6]. Let P, Q be non-zero integers. Consider the polynomil p x = x Px + Q; its discriminnt is D = P 4Q nd the roots re 1 1 α = P + D, β = P D. Suppose tht P nd Q re such tht D 0. The sequences of integers U n P, Q = αn β n with U 0 P, Q = 0 nd U 1 P, Q = 1 1 α β V n P, Q = α n + β n with V 0 P, Q = nd V 1 P, Q = P re clled the Lucs sequences ssocited to the pir P, Q. We will note by U n resp. V n the element U n P, Q resp. V n P, Q. It cn be proved tht for n 1 3 U n = PU n 1 QU n ; U 0 = 0, U 1 = 1, V n = PV n 1 QV n ; V 0 =, V 1 = P. In the prticulr cse P, Q = 1, 1, the sequence U n n 0 begins 0, 1, 1,, 3, 5, 8,13... nd ws first considered by Fiboncci. The compnion sequence of the Fiboncci numbers, still with P, Q = 1, 1, is the sequence of Lucs numbers V n n 0 nd it begins, 1, 3, 4, 7, 11, We give here some known results [6, 7] 1 4 V n = V n Q n. Let p be prime integer, then 1 5 D U p = mod p for p 3, p V p = P mod p for p, where D p represents the Legendre symbol which is, ccording to the reltion between p nd D, one of the vlues 1, 0, +1. In ddition, if n, k 1, then 1 6 U n U nk for ll k, V n V nk if k is odd. Moreover 1 7 { Un P, Q = 1 n 1 U n P, Q, V n P, Q = 1 n V n P, Q. Journl of Logic & Anlysis 1:4 009

3 Decomposition of terms in Lucs sequences 3 Fermt s Little Theorem. If p is prime number nd if is n integer, then 1 8 p [p]. In prticulr, if p does not divide then p 1 1 [p]. Externl recurrence principle [4]. For ll internl or externl formul F n, we hve 1 9 [ F 0 nd st n F n = F n + 1 ] = st n F n. Nottions. Let x, y be rel numbers not necessrily integers. i x 0 resp. x + denotes tht x is infinitesiml resp. x is positive unlimited. We hve n nlogous definition for x. ii x nd y re clled infinitely close, denoted by x y, if x y 0. iii iv v vi We sy tht x is pprecible if it is neither unlimited nor infinitesiml. The inequlity x y mens tht x > y nd x y. We hve n nlogous definition for. The Greek letter φ is used for n infinitesiml strictly positive. Two occurrences of φ re not necessrily equl. P represents the set of ll prime integers. Min result Theorem.1 If P, Q re such tht D > 0, then, for unlimited n, ech of the integers U n nd V n differs by limited integer from product of two unlimited integers. Let P nd Q be such tht D > 0 nd let n +. We put λ = prove the min result we need the following lemms. P D. In order to Lemm. α β, mx α, β 1 nd b 1 If P > 0, then β α = λ 1 λ + 1. i ii α > β, 1 β α is positive infinitesiml λ +, Journl of Logic & Anlysis 1:4 009

4 4 Abdelmdjid Boudoud iii 1 + β is positive infinitesiml λ is positive infinitesiml, α β iv ±1 if nd only if λ is pprecible nd positive. α c If P < 0, i ii iii iv α < β, 1 α β is positive infinitesiml λ, 1 + α is positive infinitesiml λ is negtive infinitesiml, β α ±1 if nd only if λ is pprecible nd negtive. β Proof α β becuse α = P + D possible cses. i P > 1. In this cse α 1. nd β = P D. The following re the ii P = 1. In this cse Q must be strictly negtive nd therefore α 1. iii P = 1. In this cse Q must be strictly negtive nd therefore β 1. iv P < 1. In this cse β 1. Hence mx α, β 1. By 1.1, β α = λ 1 λ + 1. b If P > 0, then it is immedite tht α > β. Furthermore, λ > 0 nd the reminder of the proof cn be deduced from the grph of the function β α λ = λ 1 λ + 1 β which is strictly incresing from [0, + [ onto [ 1, 1[, where lim λ = 1 nd λ 0 + α β lim λ = 1. λ + α c This is similr to b. Remrk. By 1 7 we need to prove the following lemms only for P > 0 in which cse α is positive nd ccording to Lemm. α > β. Consequently α 1. Lemm.3 Ech of U n nd V n is of the form ωn, where ω is unlimited ω is not necessrily the sme in ech cse. Journl of Logic & Anlysis 1:4 009

5 Decomposition of terms in Lucs sequences 5 Proof By 1 n 1 β/α U n = α n 1 1 β/α, V n = α n 1 + β/α n. We divide the proof into three cses. A β α = 1 φ. Then 0 < β/α n < β/α < 1. Hence 1 β/α n > 1 β/α > 0. By it follows U n = α n 1 c with c > 1 nd therefore U n = ωn, where ω +. Also V n = α n d with d > 1 nd consequently V n = ωn, where ω +. B β = 1 + φ. According to Lemm., λ is positive infinitesiml. There re two α subcses. 1 n is odd. By U n = α n φ n φ = α n 1, = α n φ n φ where is pprecible nd positive. Therefore U n = ωn, where ω +. Concerning λ 1 n V n by 1 nd, V n = α 1 n +. Hence λ λ n V n = α 1 n > α n 1 1 λ + 1 λ + 1 n nd then V n > α n nλ λ + 1 n which implies V n n > λ αn λ + 1 n. Moreover λ λ + 1 n αn +, indeed replcing α by P + D λ λ + 1 n αn = we get λ D n 1 + λn λ + 1 n 1 D, n = P where P n 1 D + becuse D +. Therefore V n is of the form ωn, where ω +. Journl of Logic & Anlysis 1:4 009

6 6 Abdelmdjid Boudoud n is even. By U n = α n 1 1 β/α n 1 β/α = αn 1 n 1 β/α φ = αn 1 n 1 β/α, where = φ is pprecible. By 1, β α = λ 1 where λ is positive infinitesiml, nd since n is even, λ + 1 U n = αn 1 1 λ n 1. λ λ n From λ + 1 n > 1 1 λ n it follows tht 0 < 1 λ + 1 λ + 1 n < 1, λ + 1 hence U n > αn λ + 1 n Replcing α resp. λ by P + D α n 1 nd then U n > αn 1 U n n > αn 1 λ λ + 1 n. resp. λ λ + 1 n = P D, we get D n P n λ. nλ λ + 1 n. So Finlly, from D +, λ 0 nd is pprecible we obtin αn 1 nd it follows tht U n n +. Therefore U n = ωn, where ω +. Concerning V n, the fct tht β n V n = α 1 n + = α n φ n α λ λ + 1 n + implies V n = ωn with ω + becuse φ n > 1. C β n 1 β/α α ±1: By, U n = α n 1 1 β/α hence U n = α n 1, where β n is pprecible. Therefore U n = ωn, where ω +. V n = α 1 n + = α α n where is pprecible, therefore V n = ωn with ω +, nd the proof is complete. Journl of Logic & Anlysis 1:4 009

7 Decomposition of terms in Lucs sequences 7 Lemm.4 If n is of the form n 1 n with n 1 > 1 nd n > 1, then U n 1 n nd U n1 V n1 n re unlimited. V n1 Proof Since n +, t lest one of n 1 nd n is unlimited. By 1 U n1 n = αn1n 1 β /α n 1 n U 3 n1 α n 1 1 β /α n, 1 V n1 n = αn1n 1 + β /α n 1 n V n1 α n β /α n. 1 We hve three cses. A β β n1 n β n1 α α = 1 φ. By 3 nd the fct tht 1 > 1 > 0 we hve α U n1 n = α n 1n 1 c = α n n 1 c, U n1 where c > 1. Since n n 1 + then U n 1 n V n1 n +. Also by 3, = U n1 V n1 α n 1n 1 c = α n n 1c, where c is positive nd pprecible. From the fct tht n n 1 + we hve V n 1 n V n1 +. B β α = 1+φ. By Lemm., λ is positive infinitesiml. There re three subcses. 1 n 1 is even. Then n 1 n is even nd U n 1 n = α n 1n 1 c with c > 1 becuse U n1 β n1 n β n1 1 > 1 > 0. Hence U n 1 n +. Concerning V n we hve α α U n1 n1 n V n1 n 1 + β/α = αn1n V n1 α n β/α n 1. Since n 1 nd n 1 n re even nd 1 < β/α < 0, then V n1 n = αn1n V n1 α n c 1 = α n 1n 1 c + becuse c is positive nd pprecible nd α n 1n φ n 1 n n 1 nd n re both odd. From U n 1 n U n1 = α n 1n 1 U n1 n U n1 = α n 1n 1 = α n 1n φ n 1 n φ n φ n 1 we hve Journl of Logic & Anlysis 1:4 009

8 8 Abdelmdjid Boudoud becuse is positive nd pprecible. Also V n1 n = α n 1n φ n 1 n V n φ n φ n 1 n = α n 1n φ n 1 Since 1 1 φ n 1n > 1 1 φ n 1 > 0, then V n 1 n V n1 = α n 1n 1 c with c 1 which implies V n 1 n V n1 + becuse α n 1n n 1 is odd, n is even. Then U n 1 n = αn1n 1 1 U n1 β n1 = 1 is pprecible nd strictly positive becuse 1 < α Since λ is positive infinitesiml nd β α = λ 1 λ + 1 then Now α n 1n 1 Replcing λ by which implies 1 U n1 n U n1 P D, we get = αn1n 1 1 λ n1 n 1 + λ α n 1n 1 α n 1n 1 becuse α < D. Since D > 3, Therefore 1 1 λ 1 + λ > αn 1n 1 > αn 1n 1 n1 n. 1 β n1 n α λ n 1n n 1 n λ 1 + λ n 1n. n 1 n λ 1 + λ n 1n = n n1 n 1n P D 1 α n 1. n 1 n n 1 n λ 1 + λ n 1n n n1 n 1n P D n 1 1. n 1n n 1 n P D n 1 n n 1 1 α n 1n 1. n n 1n P. n1n 3 3 1n n 1 n λ 1 + λ n 1n n 1n P. n1n β α, where n1 < 0. Journl of Logic & Anlysis 1:4 009

9 Decomposition of terms in Lucs sequences 9 nd then U n 1 n U n1 +. Concerning V n 1 n V n1, we hve V n 1 n V n1 = α n 1n φ n 1 n 1 1 φ n 1. The fcts tht φ n 1n is pprecible, 1 1 φ n 1 ]0, 1[ nd α n 1n 1 + led to V n 1 n +. C β α ±1. The fct tht U n1 n U n1 = α n 1n 1, V n1 n V n1 α n 1n 1 +, nd b re pprecible nd positive men tht nd V n 1 n V n1 + which finishes the proof. Lemm.5 For every i, U i < U i+1 & V i < V i+1. V n1 = α n 1n 1 b, where U n1 n U n1 + Proof Let i. We hve three cses. A β α = 1 φ. By Lemm., λ + nd then α +. Now U i+1 = U i α i+1 β i+1 1 r i+1 α i β i = α 1 r i, where r = β α = 1 φ. Since 1 ri+1 > 1 r i > 0 nd α +, then U i+1 > 1. Also we hve V i r i r i+1 = α U i V i 1 + r i. Since 1 + r i is pprecible nd α +, then V i+1 +. Tht is, V i+1 > 1. V i V i B β = 1 + φ. By Lemm., λ is positive infinitesiml. Since P is supposed α positive nd λ is positive infinitesiml, we directly get Q. Therefore, from Q < 0, we obtin 0 < U < U 3 < U 4 <.... Similrly, 0 < V < V 3 < V 4 <.... C β α ±1. According to Lemm., λ is pprecible nd strictly positive. U i+1 1 r i+1 = α U i 1 r i with r = β α = λ 1, where λ is different from 1 becuse λ + 1 otherwise Q = 0. We divide the rest of the proof into the following cses. P 1 λ ]0, 1[. Then 0 < < 1 nd consequently Q < 0. Hence, s P 4Q in the cse B of this lemm, we hve 0 < U < U 3 < U 4 <... nd 0 < V < V 3 < V 4 <.... Journl of Logic & Anlysis 1:4 009

10 10 Abdelmdjid Boudoud λ > 1. Then r is pprecible nd positive nd r < 1. Since U i+1 = U i 1 r i+1 α 1 r i nd 1 r i+1 > 1 r i > 0, then U i+1 > α > 1. Concerning V i+1, U i V i P the fct tht λ = > 1 implies Q > 0 nd consequently P 3 becuse P 4Q D = P 4Q > 0. Then α nd β > 0 becuse β = P P 4Q. Therefore, α i α 1 > β i 1 β. Indeed, if 0 < β 1, then β i 1 nd 0 1 β < 1 which implies 0 β i 1 β < 1. Moreover, α i α 1 1. Hence α i α 1 > β i 1 β which is evidently verified when β > 1. V i+1 > V i nd the proof is complete. Lemm.6 If P, Q is not stndrd then V V 1 +. Proof We hve two cses. Therefore α i+1 + β i+1 > α i + β i ; i.e. A P +. We divide the proof of A further into the following cses. 1 Q stndrd. Then V = P Q +. V 1 P Q. Then V = P Q +. V 1 P 3 Q +. Suppose tht V = l with l being limited. Then P Q = l > 0 V 1 P P Q > 0 becuse D > 0. Hence P Pl = Q which implies Q = 1 P Pl. Then D = P 4Q = P P Pl = P + Pl which mens tht D < 0 nd this is contrdiction. Then V V 1 +. B P stndrd. In this cse Q nd we show esily tht V finishes the proof. V 1 +. This Lemm.7 n my be written ccording to one nd only one of the following forms. Journl of Logic & Anlysis 1:4 009

11 Decomposition of terms in Lucs sequences 11 i ii iii iv n = p + is prime. n = s p, where s 1 is limited nd p + is prime. n = n 1 n where one of n 1,n is odd greter thn or equl to 3, the other is unlimited. n = ω+1 with ω +. Proof It is well-known tht n must be written uniquely s t α 1 1 tα...tαr r, where t 1 < t <.. < t r re prime numbers, α i 1 i = 1,,..., r. Two cses rise. 1 r = 1. Either t 1 =, in which cse n is of the fourth form, or t 1 > which implies tht n is of the first form if α 1 = 1 becuse in this cse n = t 1, otherwise α 1 > 1, n = t α 1 1 = t 1 t α which shows tht n is of the third form becuse the quntities t 1 nd t α re both odd nd obviously t lest one of them is unlimited. r > 1. Here two subcses rise. t 1 =. If α 1 is limited, then we divide the proof into two further cses. 1 α = 1. If r =, then n = α 1t which shows tht t is unlimited nd consequently n is of the second form, otherwise i.e. r > the fct tht n = α 1t t α tαr r where t is odd nd α 1t α tαr r + becuse α 1t α tαr r > t nd the product t. α 1t α tαr r = n +, shows tht n is of the third form. α > 1. In this cse n is of the third form becuse n = α 1t α tα tαr r = t. α 1t α 1 t α tαr r where t is odd nd by the sme resoning s 1 bove, r > α 1t α 1 t α tαr r +. If α 1 is unlimited, then the fct tht n = α 1t α tα tαr r t is odd nd α 1t α 1 t α tαr r form. = t. α 1t α 1 t α tαr r, where + permits us to conclude tht n is of the third b t 1 >. Here lso, using the sme resoning s bove nd the fct tht n = t α 1 1 tα...tαr r = t 1 t α t α...tαr r +, we conclude tht n is of the third form. We now prove tht n cnnot be written simultneously ccording to two of the bove indicted forms. Indeed, we prove this for the second nd the third form the other cses re trivil. Suppose tht n = s p where s 1 is limited nd p + is prime nd lso n = n 1 n, where for exmple n 1 is odd greter thn or equl to 3 nd n is unlimited. Since the decomposition of n in prime fctors is unique, then n 1 = p, n = s which is contrdictory becuse n is unlimited nd cnnot be equl to s. Journl of Logic & Anlysis 1:4 009

12 1 Abdelmdjid Boudoud 3 Proof of Theorem Proof for U n. We consider the following two subcses. D I n is prime. By 1 5, U n = mod n. Then U n = u + kn, where n u { 1, 0, +1}. Since U n is, ccording to Lemm.3, of the form ωn with ω is n unlimited rel number, the integer k must be unlimited. Consequently the proof is finished for this cse. II n is composite i.e. n = n 1 n, where n 1 n > 1. By 1 6, U n = CU n1, where C is n integer which is, ccording to Lemm.4, unlimited. On the other hnd since n 1 +, then by Lemm.5, U n1 is unlimited. Thus the proof is finished for U n. 3. Proof forv n By Lemm.7, we need to consider the following four cses. I n = p + is prime. We hve two subcses to consider. P limited. By 1 5, V p = P modp; i.e.v p = P + kp. Since P is limited, k must be, ccording to Lemm.3, unlimited. b P unlimited. According to 1 6, V 1 V p ; i.e V p = V 1 N. By Lemm.5, we hve V < V 3 <... < V n <.... By Lemm.6, V V 1 + which implies from V V 1 < V p V 1 tht V p + nd V 1 then N is unlimited. Thus the proof is finished for this cse becuse V 1 = P nd P +. II n = s p, where s 1 is limited nd p + is prime. P nd Q re both limited. For s 1 define the formul A s "For n of the form s p, V n my be written s g 1 + g p where g 1 resp. g is limited resp. is n unlimited integer". We hve A 1. Indeed, let n = p; by 1 4 V n = V p = V p Q p. Journl of Logic & Anlysis 1:4 009

13 Decomposition of terms in Lucs sequences 13 Applying 1 5 nd 1 8 yields V p = P + kp Q + lp. Hence V n = V p = P + Pkp + k p Q lp = P Q + Pk + k p l p. If g 1 = P Q nd g = Pk + k p l, then g 1 is limited nd, ccording to Lemm.3, g is unlimited. Consequently, A 1. Suppose A s for s 1 limited integer nd prove A s + 1. Indeed, by 1 4 V s+1 p = V s p = V s p Q sp. From As resp. 1 8 we hve V s p = g 1 + g p, where g 1 is limited nd g is unlimited resp. Q sp = p Q s = Q s + fp with f n integer. Replcing by these vlues, we get V s+1 p = V s p Q s p = g 1 + g p = g 1 Q s + f p, Q s + fp where f = g 1 g + g p f. Since g 1, Q nd s re limited, then g 1 Qs is limited; the integer f, ccording to Lemm.3, must be unlimited. Consequently, As + 1. Then by 1 9, st s 1 A s. b P or Q is unlimited. By 1 6, V s V s p, i.e. V s p = V sc with c being n integer. By Lemm.4, c is unlimited. By Lemm.6, V + nd by Lemm.5, V < V 3 < V 4 <.... Hence V s is unlimited. This completes the proof for this cse. III n = n 1 n, where one of n 1, n is odd greter thn or equl to 3, the other is unlimited. Suppose n 1 3 is odd nd n +. Then V n1 n = V n C, where by 1 6 C is n integer which is, ccording to Lemm.4., unlimited. Since n +, then by Lemm.5 V n is unlimited. This finishes the proof for this cse. IV n = ω+1 with ω +. Q is even Q = t, t Z. By 1 4, we hve V n = V ω+1 = V. ω = V ω Qω. Journl of Logic & Anlysis 1:4 009

14 14 Abdelmdjid Boudoud Applying the fct tht ω =. ω 1 nd 1 4 yield V ω = V. ω 1 = V ω 1 Q ω 1 which, when substituted in V n = V ω Qω, gives V n = V ω+1 = V Q ω 1 Q 3 1 ω ω 1 = 4 V ω 1 mod Q ω 1. Similrly, the fct tht V ω 1 = V. ω nd 1 4 give 3 V n = V ω+1 = 8 V ω mod Q ω nd so on. Let f + be n integer such tht ω f +. The previous process permits to write 3 3 V n = V ω+1 = f +1 V ω f mod Q ω f, where V ω f is unlimited. Now, if V ω f is even then V ω+1 = γ t, where γ = min f +1, ω f + nd t is n integer. This shows tht V n = V ω+1 = γ 1 γ t, where γ 1 nd γ re two unlimited integers stisfying γ 1 + γ = γ. Otherwise i.e. V ω f is odd, we hve [ V ] f +1 V n 1 = ω f 1 + kq ω f. Since f +1 V ω f 1 is difference between squres, then [ V [ f V ] f V n 1 = ω f 1] ω f kq ω f. By the sme resoning bout the difference f V ω f 1 [ V ] [ f 1 V ] [ f 1 V ] f V n 1 = ω f 1 ω f + 1 ω f + 1 nd so on. Thus we cn write V n 1 s [ V [ f t V V n 1 = ω f 1] ω f f t [ V ] [ f 1 V f + ω f + 1 ω f + 1 [ V ] f t 1 + 1] ω f + 1 ] + kq ω f, + kq ω f +... Journl of Logic & Anlysis 1:4 009

15 Decomposition of terms in Lucs sequences 15 where t is n integer stisfying 1 t < f. Now choose t 0 + such tht t 0 < f nd t 0 + < ω f. This is possible becuse, from the fct tht min f, ω f +, we cn choose n integer s + such tht s min f, ω f nd tke therefter t 0 = s 3. Since Q ω f contins the fctor ω f nd the product [ V f t 0 t0 [ V ] f i ω f 1] ω f + 1 contins k with k t 0 +, then i=0 where N is n integer. Therefore V n 1 = t 0+ N, V n 1 = V ω+1 1 = t 1 t N, where t 1 nd t re two unlimited integers stisfying t 1 + t = t 0 +. b Q is odd Q = t +1, t Z. We put n o = ω. If Q = ±1, then by 1 4 V n = V n0 = V n0 Q n 0 = V n0 becuse n 0 is even. V n0 is, by Lemm.3, unlimited. Otherwise i.e. Q ±1 we divide the proof into the following cses. 1 P is even. By 1 3 nd the induction, we show esily tht ech V l l 0 is even. Moreover V, becuse otherwise P Q = which implies D = P 4Q = Q. The fct tht D > 0 implies tht Q > 0 i.e. Q < 0 becuse Q Z nd this contrdicts P Q =. In the sme wy V. Now, we prove tht V n is the product of two unlimited integers. Indeed, by 1 4 Then which implies V n = V ω+1 = V n0 = V n 0 Q n 0. V n = V n 0 4 Q n 0 + = V n0 V n0 + Q n V n = V n0 V n0 + Q n0/ 1 Q n0/ + 1. Becuse n 0 is divisible by, then pplying 1 4 shows tht V n0 cn be written s V n0 = V n0 / = V n 0 / Q 4 n0/ 1 which, when substituted in 3 4, gives V n = [V n0/ 4 Q n0/ Vn0 1] + Q n0/ 1 Q n0/ + 1. Journl of Logic & Anlysis 1:4 009

16 16 Abdelmdjid Boudoud Hence, 3 5 V n = V n0 / V n0 / + Vn0 + Q n 0/4 1 Q n 0/4 + 1 V n0 + Q n 0/4 1 Q n 0/4 + 1 Q n 0/ + 1. Becuse n 0 / is divisible by, then pplying 1 4 shows tht V n0 / cn be written s V n0 / = V n 0 /4 Qn 0/4 4 + = V n0/4 4 Q n0/4 1 which, when substituted in 3 5, gives V n0 = V n0 /4 V n0 /4 V + n0 / + Vn Q n0/8 1 Q n0/8 + 1 V n0 / + Vn0 + Q n0/8 1 Q n0/8 + 1 Q n0/4 + 1 V n0 + Q n0/8 1 Q n0/8 + 1 Q n0/4 + 1 Q n0/ + 1 nd so on. So the process of pplying 1 4 nd putting the difference between squres s product of two fctors, yields by induction V n = V n0 = V n0 / i 1 V n0 / i V n0 / + V n Q n 0/ i 1 Q n 0/ i + 1 V n0 / i +... V n0 / + V n0 + Q n 0/ i 1 Q n 0/ i + 1 Q n 0/ i 1 Vn0 + 1 / i V n0 + Q n 0/ i 1 Q n 0/ i + 1 Q n 0/ i Q n 0/ i Vn0 + 1 / i V n0 + Q n 0/ i 1 Q n 0/ i + 1 Q n 0/ i Q n 0/ Vn Q n 0/ i 1 Q n 0/ i + 1 Q Q n 0/ i Q n 0/ + 1 n 0 / + 1, where 1 i ω. In this formul, if we replce i by 1 we recover 3 4, by we recover 3 5, etc. Journl of Logic & Anlysis 1:4 009

17 Decomposition of terms in Lucs sequences 17 We tke i 0 + such tht n 0 i 0 1.We show tht V n is of the form i 0+1 t, where t is n integer. Indeed, ech element V n0 / j 0 j i 0 1 is even nd, ccording to Lemm.5, different from ± giving the fct tht V is different from these vlues. On the other hnd Q is odd nd different from ±1. Hence the formul 3 7 is the sum of i terms, where ech term is the product of i non-zero even integers. Therefore V n = i0+1 t = t 1 t t, where t 1 nd t re two unlimited integers stisfying t 1 +t = i 0 +1 nd t is n integer. P is odd. We prove by induction tht V l l 1 is odd. Indeed, V 1 = P Q this shows tht V is odd. Now suppose thtv l is odd with l 1. Then V l+1 = V l Q l so V l+1 is lso odd. On the other hnd V 1, otherwise P Q = 1 then the fct tht D = P 4Q = 1 Q > 0 implies tht Q < 0 nd this contrdicts P Q = 1. In the sme wy V 1. By 1 4 V n = V ω+1 = V n0 = V n 0 Q n 0 Then V n + 1 = V n Q n 0 = V n0 1 V n Q n 0 So 3 8 V n + 1 = V n0 + 1 V n0 1 + By Q n 0/ 1 + Q n 0/. V n0 + 1 = V n0 / + 1 = [V n0/ 1 + Qn 0/ ] = [V n0 / V 1 n0 / Q n 0/ ] which, when substituted in 3 8, gives V n + 1 = [V n0 / V 1 n0 / Q n 0/ ] Vn Q n 0/ 1 + Q n 0/ = V n0 / 1 V n0 / + 1 Vn Q n 0/ Vn Q n 0/ 1 + Q n 0/ Journl of Logic & Anlysis 1:4 009

18 18 Abdelmdjid Boudoud Then 3 9 V n + 1 = V n0 / 1 V n0 / + 1 Vn Q n 0/4 1 + Q n 0/4 Vn Q n 0/4 1 + Q n 0/4 1 + Q n 0/ Agin, setting n 0 =.n 0 4 nd clculting by 1 4 n expression for V n 0 / + 1 nd substituting in 3 9, we get nother formul for V n + 1, nd so on. So this process yields by induction V n + 1 = V ω = V n0 / i + 1 V n0 / i 1 V n0 / i V n0 / 1 V n Q n 0/ i Q n 0/ i+1 Vn0 / i 1 1 V n0 / i 1... V n Q n 0/ i Q n 0/ i Q n 0 / i Vn0 / i 1... V n Q n 0/ i Q n 0/ i Q n 0 / i 1 + Q n 0/ i 1 Vn0 / i V n Q n 0/ i Q n 0/ i Q n 0 / i 1 + Q n 0/ i Q n 0/ Vn Q n 0/ i Q n 0/ i Q n 0 / i 1 + Q n 0/ i Q n 0/, 3 10 where 0 i ω 1. In this formul, if we replce i by 0 we recover 3 8, by 1 we recover 3 9 etc.... We tke i 0 + such tht n 0 i 0. We show tht V n + 1 is of the form i 0+ t, where t is n integer. Indeed, ech element V n0 / j 0 j i 0 is odd nd, ccording to Lemm.5, different from ±1 giving the fct tht V is different from these vlues. On the other hnd Q is odd nd different from ±1. Hence the formul 3 10 is the sum of i 0 + terms, where ech term is the product of i 0 + non-zero even integers. From this V n + 1 = V n0 + 1 = t 1 t t, where t 1 nd t re two unlimited integers stisfying t 1 + t = i 0 + nd t is n integer. This finishes the proof of this cse nd therefore the theorem. Journl of Logic & Anlysis 1:4 009

19 Decomposition of terms in Lucs sequences 19 4 In clssicl terms In order to find the clssicl equivlence of our result we use the reduction lgorithm of externl formuls of Nelson [5]. We denote the stndrd set { P, Q Z } : P 4Q > 0 by H. Theorem.1 my be written s n P, Q st t : n t st U, V l 1, l, l 1, l st i N U n = U + l 1 l, V n = V + l 1 l & min l 1, l, l 1, l > i, where n, t, i rnge over N, P, Q rnge over H nd U, V, l 1, l, l 1, l Using ideliztion, this formul is equivlent to rnge over Z. n P, Q st t : n t st U, V stfini I l 1, l, l 1, l i I U n = U + l 1 l, V n = V + l 1 l & min l 1, l, l 1, l > i where I belongs to P f N the set of finite subsets of N. This formul is equivlent to n, P, Q st t, U, V stfini I n t l 1, l, l 1, l i I U n = U + l 1 l, V n = V + l 1 l & min l 1, l, l 1, l > i If we refer to st st in the lexicon cited in [5], the lst formul is equivlent to Ĩ fini R n, P, Q t, U, V R n t l 1, l, l 1, l i Ĩ t, U, V U n = U + l 1 l, V n = V + l 1 l & min l 1, l, l 1, l > i,,. 4 1 where Ĩ is mpping tht ssocites with ech t, U, V N Z finite subset Ĩ t, U, V N. Now we prove tht 4 1 is equivlent to Journl of Logic & Anlysis 1:4 009

20 0 Abdelmdjid Boudoud 4 Ĩ T, W N n, P, Q t, U, V [0, T] [ W, W] n t l 1, l, l 1, l i Ĩ t, U, V U n = U + l 1 l, V n = V + l 1 l & min l 1, l, l 1, l. > i Indeed, let Ĩ : N Z P f N be set-vlued mpping. Then ccording to 4 1 fini R N Z nd therefore there exist smller integers T nd W such tht R [0, T] [ W, W]. Let n, P, Q N H, by 4 1 t, U, V R [0, T] [ W, W] ; tht is, t, U, V [0, T] [ W, W]. Now if n t, then l 1, l, l 1, l i Ĩ t, U, V U n = U + l 1 l, V n = V + l 1 l l & min 1, l, l 1, l > i which shows tht For the converse one tkes, R = [0, T] [ W, W]. Hence we hve the following internl formultion of Theorem.1. Proposition 4.1 For ny set-vlued mpping Ĩ : N Z P f N there exists T, W N such tht for ll n, P, Q N H there exists t, U, V [0, T] [ W, W] such tht if n t, then U n resp. V n differs by U resp. V from product of two integers whose bsolute vlue is greter thn or equl to i for ll i Ĩ t, U, V. Below we formulte, from the proof of Theorem.1, two prticulr cses of tht result, nd give their reductions seprtely. 1 U n differs from product of two unlimited integers by n integer U with 1 U 1. If n is not of the form s p with s 0 being limited integer nd p + being prime, then V n differs from product of two unlimited integers by n integer V with V. The reductions of these prticulr cses re s follows. 1 The first is equivlent to [ st t : n t = U, l n P, Q 1, l st ] i Un P, Q = U + l 1 l : U 1 & min l 1, l i, where n, t, i N, U, l 1, l Z 3. By ideliztion nd trnsfer the previous formul trnsforms, while remining equivlent, to Journl of Logic & Anlysis 1:4 009

21 Decomposition of terms in Lucs sequences 1 fini I fini T n, P, Q t T [ ] n t = U, l 4 3 1, l i I Un P, Q = U + l 1 l : U 1 & min l 1, l i, where I nd T belong to the power set of N. 4 3 is equivlent to i N T N n, P, Q N H 4 4 [ n T = U, l 1, l U n P, Q = U + l 1 l with U 1 & min l 1, l i Indeed, let i N. Then, ccording to 4 3, fini T N. Now put T = mx t T t. Now if n, P, Q N H such tht n T, then n t, t T. Hence from 4 3 U, l 1, l with U n P, Q = U+l 1 l, U 1 nd min l 1, l i. Consequently 4 3 = 4 4. Conversely, let I be finite subset of N nd put i = mx i I i. For i there is, { T} ccording to 4 4, T N. Consider T = s finite subset of N. Now if n, P, Q N H such tht n T, then U, l 1, l with U n P, Q = U + l 1 l with U 1 nd min l 1, l i ; tht is, min l 1, l i i I. Hence 4 4 = 4 3 nd consequently we hve the following proposition. Proposition 4. For ny integer i N there exists n integer T N such tht for ll n, P, Q N H stisfying n T, the term U n P, Q differs from product of two integers whose bsolute vlue is greter thn or equl to i by n integer U with 1 U 1. The second prticulr cse is equivlent to n P, Q st t 1, t n t 1 & n / P = t V, l 1, l st i V n P, Q = V + l l 1 l with V {0, ±1, ±} nd min 1, l where n, i N, t 1, t N, V, l 1, l {0, ±1, ±} Z Z. Using ideliztion nd trnsfer the previous formul trnsforms, while remining equivlent, to fini I fini T n, P, Q t 1, t T n t 1 & n 4 5 t / P = V, l 1, l i I V n P, Q = V + l l 1 l : V {0, ±1, ±} nd min 1, l i ]., i, Journl of Logic & Anlysis 1:4 009

22 Abdelmdjid Boudoud where I resp. T belongs to the power set of N resp. N. Then 4 5 is equivlent to i N T 1, T N n, P, Q n T 1, n 4 6 i / P i = 0, 1,.., T = V, l 1, l V n P, Q = V + l l 1 l : V {0, ±1, ±} nd min 1, l Indeed, let i N. According to 4 5, fini T N. Suppose i T 1 = mx {t 1 : t 1, t T} nd T = mx {t : t 1, t T}. Let n, P, Q N H. Suppose tht n T 1 nd n i / P for i = 0, 1,.., T. Then for ll t 1, t T, n t 1 nd n t / P. Hence, ccording to 4 5, V, l 1, l V n P, Q = V + l 1 l with l V {0, ±1, ±} nd min 1, l i. Consequently Conversely, let I be finite subset of N. Put i = mx i I. i. Then for i there is, ccording to 4 6, T 1, T N. Set T = {0, 1,..., T 1 } {0, 1,..., T }, then T is finite. Let n, P, Q N H nd suppose tht for ll t 1, t T, n t 1 & n t / P. Then n T 1 nd n i / P i = 0, 1,.., T. Hence, ccording to 4 6, V, l 1, l such tht V n P, Q = V + l l 1 l with V {0, ±1, ±} nd min 1, l i ; tht l is i I min 1, l i. Hence 4 6= 4 5 nd consequently we hve the following proposition. Proposition 4.3 For ny integer i N there exists two integers T 1, T N such tht for ll n, P, Q N H stisfying n T 1 nd n i / P for i = 0, 1,.., T the term V n P, Q differs from product of two integers whose bsolute vlue is greter thn or equl to i, by n integer V with V. Generl remrk. In the clssicl literture concerning Lucs sequences, generlly the studies re concerned with the terms U k nd V k for k belonging to prticulr fmily of integers see for exmple [6, 7]. In this work we note from the previous propositions tht the min result expresses property of uniformity becuse the conclusion is vlid for ll k beyond certin rnk. Moreover, the ides used in proofs here cn lso be used to deduce stndrd results. For exmple one sees without pin tht Lemm.3 gives the size of U k nd V k wheres Lemm.5 gives the growth of U k nd V k. In ddition, the trnsltion Journl of Logic & Anlysis 1:4 009

23 Decomposition of terms in Lucs sequences 3 by the reduction lgorithm of lemms used previously, which is n opertion tht is not difficult, gives more clssicl results. But giving further detils would increse the length of this pper. Acknowledgment The uthor wishes to thnk the referees nd editor for their comments nd suggestions for improving n erlier version of this pper. References [1] A. Blog, p + without lrge prime fctors, Séminire de théorie des nombres de Bordeux, Exposé [] A. Boudoud, L conjecture de Dickson et clsses prticulières d entiers, Annles Mthémtiques Blise Pscl 13006, [3] Chen, M.J.R, On the representtion of lrge even integer s the sum of prime nd the product of t most two primes, Scienti Sinic , [4] F. Diener et G. Reeb, Anlyse Non-Stndrd, Hermnn, Éditeurs des Sciences et des Arts, [5] E. Nelson, Internl set theory: A new pproch to nonstndrd nlysis, Bull. Amer. Mth. Soc , ; doi: /s x. [6] Pulo Ribenboim, The Little Book of Big Primes, Springer-Verlg, [7] Pulo Ribenboim, My numbers my friends, Springer-Verlg 000. [8] S. Slerno - A. Vitolo, p + with few nd bounded prime fctors, Anlysis , Deprtment of Mthemtics, University of Msil, Ichbili BP Msil, Algeri boudoudb@yhoo.fr Received: 5 Mrch 008 Revised: 5 November 008 Journl of Logic & Anlysis 1:4 009

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

Lecture 1. Functional series. Pointwise and uniform convergence.

Lecture 1. Functional series. Pointwise and uniform convergence. 1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

20 MATHEMATICS POLYNOMIALS

20 MATHEMATICS POLYNOMIALS 0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of

More information

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004 Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when

More information

IN GAUSSIAN INTEGERS X 3 + Y 3 = Z 3 HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH

IN GAUSSIAN INTEGERS X 3 + Y 3 = Z 3 HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A2 IN GAUSSIAN INTEGERS X + Y = Z HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH Elis Lmpkis Lmpropoulou (Term), Kiprissi, T.K: 24500,

More information

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ

More information

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS. THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem

More information

Theoretical foundations of Gaussian quadrature

Theoretical foundations of Gaussian quadrature Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of

More information

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b

More information

Self-similarity and symmetries of Pascal s triangles and simplices mod p

Self-similarity and symmetries of Pascal s triangles and simplices mod p Sn Jose Stte University SJSU ScholrWorks Fculty Publictions Mthemtics nd Sttistics Februry 2004 Self-similrity nd symmetries of Pscl s tringles nd simplices mod p Richrd P. Kubelk Sn Jose Stte University,

More information

Frobenius numbers of generalized Fibonacci semigroups

Frobenius numbers of generalized Fibonacci semigroups Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:

More information

New Expansion and Infinite Series

New Expansion and Infinite Series Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University

More information

MAA 4212 Improper Integrals

MAA 4212 Improper Integrals Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which

More information

N 0 completions on partial matrices

N 0 completions on partial matrices N 0 completions on prtil mtrices C. Jordán C. Mendes Arújo Jun R. Torregros Instituto de Mtemátic Multidisciplinr / Centro de Mtemátic Universidd Politécnic de Vlenci / Universidde do Minho Cmino de Ver

More information

Linearly Similar Polynomials

Linearly Similar Polynomials Linerly Similr Polynomils rthur Holshouser 3600 Bullrd St. Chrlotte, NC, US Hrold Reiter Deprtment of Mthemticl Sciences University of North Crolin Chrlotte, Chrlotte, NC 28223, US hbreiter@uncc.edu stndrd

More information

Riemann is the Mann! (But Lebesgue may besgue to differ.)

Riemann is the Mann! (But Lebesgue may besgue to differ.) Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >

More information

Journal of Inequalities in Pure and Applied Mathematics

Journal of Inequalities in Pure and Applied Mathematics Journl o Inequlities in Pure nd Applied Mthemtics http://jipm.vu.edu.u/ Volume 6, Issue 4, Article 6, 2005 MROMORPHIC UNCTION THAT SHARS ON SMALL UNCTION WITH ITS DRIVATIV QINCAI ZHAN SCHOOL O INORMATION

More information

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph

More information

UNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3

UNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,

More information

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar) Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, Lecture 15: Equations for Deterministic Automata Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined

More information

Review of Calculus, cont d

Review of Calculus, cont d Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some

More information

f(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral

f(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one

More information

SUMMER KNOWHOW STUDY AND LEARNING CENTRE

SUMMER KNOWHOW STUDY AND LEARNING CENTRE SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18

More information

Math 4310 Solutions to homework 1 Due 9/1/16

Math 4310 Solutions to homework 1 Due 9/1/16 Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1

More information

USA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year

USA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year 1/1/21. Fill in the circles in the picture t right with the digits 1-8, one digit in ech circle with no digit repeted, so tht no two circles tht re connected by line segment contin consecutive digits.

More information

UniversitaireWiskundeCompetitie. Problem 2005/4-A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that

UniversitaireWiskundeCompetitie. Problem 2005/4-A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that Problemen/UWC NAW 5/7 nr juni 006 47 Problemen/UWC UniversitireWiskundeCompetitie Edition 005/4 For Session 005/4 we received submissions from Peter Vndendriessche, Vldislv Frnk, Arne Smeets, Jn vn de

More information

The final exam will take place on Friday May 11th from 8am 11am in Evans room 60.

The final exam will take place on Friday May 11th from 8am 11am in Evans room 60. Mth 104: finl informtion The finl exm will tke plce on Fridy My 11th from 8m 11m in Evns room 60. The exm will cover ll prts of the course with equl weighting. It will cover Chpters 1 5, 7 15, 17 21, 23

More information

A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE. In the study of Fourier series, several questions arise naturally, such as: c n e int

A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE. In the study of Fourier series, several questions arise naturally, such as: c n e int A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE HANS RINGSTRÖM. Questions nd exmples In the study of Fourier series, severl questions rise nturlly, such s: () (2) re there conditions on c n, n Z, which ensure

More information

Abstract inner product spaces

Abstract inner product spaces WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the

More information

Jim Lambers MAT 169 Fall Semester Lecture 4 Notes

Jim Lambers MAT 169 Fall Semester Lecture 4 Notes Jim Lmbers MAT 169 Fll Semester 2009-10 Lecture 4 Notes These notes correspond to Section 8.2 in the text. Series Wht is Series? An infinte series, usully referred to simply s series, is n sum of ll of

More information

7.2 The Definite Integral

7.2 The Definite Integral 7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where

More information

f(x)dx . Show that there 1, 0 < x 1 does not exist a differentiable function g : [ 1, 1] R such that g (x) = f(x) for all

f(x)dx . Show that there 1, 0 < x 1 does not exist a differentiable function g : [ 1, 1] R such that g (x) = f(x) for all 3 Definite Integrl 3.1 Introduction In school one comes cross the definition of the integrl of rel vlued function defined on closed nd bounded intervl [, b] between the limits nd b, i.e., f(x)dx s the

More information

Chapter 0. What is the Lebesgue integral about?

Chapter 0. What is the Lebesgue integral about? Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous

More information

Quadratic Residues. Chapter Quadratic residues

Quadratic Residues. Chapter Quadratic residues Chter 8 Qudrtic Residues 8. Qudrtic residues Let n>be given ositive integer, nd gcd, n. We sy tht Z n is qudrtic residue mod n if the congruence x mod n is solvble. Otherwise, is clled qudrtic nonresidue

More information

ON THE EXCEPTIONAL SET IN THE PROBLEM OF DIOPHANTUS AND DAVENPORT

ON THE EXCEPTIONAL SET IN THE PROBLEM OF DIOPHANTUS AND DAVENPORT ON THE EXCEPTIONAL SET IN THE PROBLEM OF DIOPHANTUS AND DAVENPORT Andrej Dujell Deprtment of Mthemtics, University of Zgreb, 10000 Zgreb, CROATIA The Greek mthemticin Diophntus of Alexndri noted tht the

More information

The Leaning Tower of Pingala

The Leaning Tower of Pingala The Lening Tower of Pingl Richrd K. Guy Deprtment of Mthemtics & Sttistics, The University of Clgry. July, 06 As Leibniz hs told us, from 0 nd we cn get everything: Multiply the previous line by nd dd

More information

ODE: Existence and Uniqueness of a Solution

ODE: Existence and Uniqueness of a Solution Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =

More information

An optimal 3-point quadrature formula of closed type and error bounds

An optimal 3-point quadrature formula of closed type and error bounds Revist Colombin de Mtemátics Volumen 8), págins 9- An optiml 3-point qudrture formul of closed type nd error bounds Un fórmul de cudrtur óptim de 3 puntos de tipo cerrdo y error de fronter Nend Ujević,

More information

Infinite Geometric Series

Infinite Geometric Series Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to

More information

HW3, Math 307. CSUF. Spring 2007.

HW3, Math 307. CSUF. Spring 2007. HW, Mth 7. CSUF. Spring 7. Nsser M. Abbsi Spring 7 Compiled on November 5, 8 t 8:8m public Contents Section.6, problem Section.6, problem Section.6, problem 5 Section.6, problem 7 6 5 Section.6, problem

More information

S. S. Dragomir. 2, we have the inequality. b a

S. S. Dragomir. 2, we have the inequality. b a Bull Koren Mth Soc 005 No pp 3 30 SOME COMPANIONS OF OSTROWSKI S INEQUALITY FOR ABSOLUTELY CONTINUOUS FUNCTIONS AND APPLICATIONS S S Drgomir Abstrct Compnions of Ostrowski s integrl ineulity for bsolutely

More information

Journal of Inequalities in Pure and Applied Mathematics

Journal of Inequalities in Pure and Applied Mathematics Journl of Inequlities in Pure nd Applied Mthemtics GENERALIZATIONS OF THE TRAPEZOID INEQUALITIES BASED ON A NEW MEAN VALUE THEOREM FOR THE REMAINDER IN TAYLOR S FORMULA volume 7, issue 3, rticle 90, 006.

More information

Integral points on the rational curve

Integral points on the rational curve Integrl points on the rtionl curve y x bx c x ;, b, c integers. Konstntine Zeltor Mthemtics University of Wisconsin - Mrinette 750 W. Byshore Street Mrinette, WI 5443-453 Also: Konstntine Zeltor P.O. Box

More information

Before we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!!

Before we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!! Nme: Algebr II Honors Pre-Chpter Homework Before we cn begin Ch on Rdicls, we need to be fmilir with perfect squres, cubes, etc Try nd do s mny s you cn without clcultor!!! n The nth root of n n Be ble

More information

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.

More information

The Riemann-Lebesgue Lemma

The Riemann-Lebesgue Lemma Physics 215 Winter 218 The Riemnn-Lebesgue Lemm The Riemnn Lebesgue Lemm is one of the most importnt results of Fourier nlysis nd symptotic nlysis. It hs mny physics pplictions, especilly in studies of

More information

Math 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008

Math 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008 Mth 520 Finl Exm Topic Outline Sections 1 3 (Xio/Dums/Liw) Spring 2008 The finl exm will be held on Tuesdy, My 13, 2-5pm in 117 McMilln Wht will be covered The finl exm will cover the mteril from ll of

More information

Variational Techniques for Sturm-Liouville Eigenvalue Problems

Variational Techniques for Sturm-Liouville Eigenvalue Problems Vritionl Techniques for Sturm-Liouville Eigenvlue Problems Vlerie Cormni Deprtment of Mthemtics nd Sttistics University of Nebrsk, Lincoln Lincoln, NE 68588 Emil: vcormni@mth.unl.edu Rolf Ryhm Deprtment

More information

Review of Riemann Integral

Review of Riemann Integral 1 Review of Riemnn Integrl In this chpter we review the definition of Riemnn integrl of bounded function f : [, b] R, nd point out its limittions so s to be convinced of the necessity of more generl integrl.

More information

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring More generlly, we define ring to be non-empty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),

More information

8 Laplace s Method and Local Limit Theorems

8 Laplace s Method and Local Limit Theorems 8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved

More information

A PROOF OF THE FUNDAMENTAL THEOREM OF CALCULUS USING HAUSDORFF MEASURES

A PROOF OF THE FUNDAMENTAL THEOREM OF CALCULUS USING HAUSDORFF MEASURES INROADS Rel Anlysis Exchnge Vol. 26(1), 2000/2001, pp. 381 390 Constntin Volintiru, Deprtment of Mthemtics, University of Buchrest, Buchrest, Romni. e-mil: cosv@mt.cs.unibuc.ro A PROOF OF THE FUNDAMENTAL

More information

Research Article Moment Inequalities and Complete Moment Convergence

Research Article Moment Inequalities and Complete Moment Convergence Hindwi Publishing Corportion Journl of Inequlities nd Applictions Volume 2009, Article ID 271265, 14 pges doi:10.1155/2009/271265 Reserch Article Moment Inequlities nd Complete Moment Convergence Soo Hk

More information

A HELLY THEOREM FOR FUNCTIONS WITH VALUES IN METRIC SPACES. 1. Introduction

A HELLY THEOREM FOR FUNCTIONS WITH VALUES IN METRIC SPACES. 1. Introduction Ttr Mt. Mth. Publ. 44 (29), 159 168 DOI: 1.2478/v1127-9-56-z t m Mthemticl Publictions A HELLY THEOREM FOR FUNCTIONS WITH VALUES IN METRIC SPACES Miloslv Duchoň Peter Mličký ABSTRACT. We present Helly

More information

On a Conjecture of Farhi

On a Conjecture of Farhi 47 6 Journl of Integer Sequences, Vol. 7 04, Article 4..8 On Conjecture of Frhi Soufine Mezroui, Abdelmlek Azizi, nd M hmmed Zine Lbortoire ACSA Dértement de Mthémtiques et Informtique Université Mohmmed

More information

1 Sets Functions and Relations Mathematical Induction Equivalence of Sets and Countability The Real Numbers...

1 Sets Functions and Relations Mathematical Induction Equivalence of Sets and Countability The Real Numbers... Contents 1 Sets 1 1.1 Functions nd Reltions....................... 3 1.2 Mthemticl Induction....................... 5 1.3 Equivlence of Sets nd Countbility................ 6 1.4 The Rel Numbers..........................

More information

Generalized Fano and non-fano networks

Generalized Fano and non-fano networks Generlized Fno nd non-fno networks Nildri Ds nd Brijesh Kumr Ri Deprtment of Electronics nd Electricl Engineering Indin Institute of Technology Guwhti, Guwhti, Assm, Indi Emil: {d.nildri, bkri}@iitg.ernet.in

More information

ON A CONVEXITY PROPERTY. 1. Introduction Most general class of convex functions is defined by the inequality

ON A CONVEXITY PROPERTY. 1. Introduction Most general class of convex functions is defined by the inequality Krgujevc Journl of Mthemtics Volume 40( (016, Pges 166 171. ON A CONVEXITY PROPERTY SLAVKO SIMIĆ Abstrct. In this rticle we proved n interesting property of the clss of continuous convex functions. This

More information

On the degree of regularity of generalized van der Waerden triples

On the degree of regularity of generalized van der Waerden triples On the degree of regulrity of generlized vn der Werden triples Jcob Fox Msschusetts Institute of Technology, Cmbridge, MA 02139, USA Rdoš Rdoičić Deprtment of Mthemtics, Rutgers, The Stte University of

More information

Polynomial Approximations for the Natural Logarithm and Arctangent Functions. Math 230

Polynomial Approximations for the Natural Logarithm and Arctangent Functions. Math 230 Polynomil Approimtions for the Nturl Logrithm nd Arctngent Functions Mth 23 You recll from first semester clculus how one cn use the derivtive to find n eqution for the tngent line to function t given

More information

The graphs of Rational Functions

The graphs of Rational Functions Lecture 4 5A: The its of Rtionl Functions s x nd s x + The grphs of Rtionl Functions The grphs of rtionl functions hve severl differences compred to power functions. One of the differences is the behvior

More information

Applicable Analysis and Discrete Mathematics available online at

Applicable Analysis and Discrete Mathematics available online at Applicble Anlysis nd Discrete Mthemtics vilble online t http://pefmth.etf.rs Appl. Anl. Discrete Mth. 4 (2010), 23 31. doi:10.2298/aadm100201012k NUMERICAL ANALYSIS MEETS NUMBER THEORY: USING ROOTFINDING

More information

A recursive construction of efficiently decodable list-disjunct matrices

A recursive construction of efficiently decodable list-disjunct matrices CSE 709: Compressed Sensing nd Group Testing. Prt I Lecturers: Hung Q. Ngo nd Atri Rudr SUNY t Bufflo, Fll 2011 Lst updte: October 13, 2011 A recursive construction of efficiently decodble list-disjunct

More information

UNIFORM CONVERGENCE MA 403: REAL ANALYSIS, INSTRUCTOR: B. V. LIMAYE

UNIFORM CONVERGENCE MA 403: REAL ANALYSIS, INSTRUCTOR: B. V. LIMAYE UNIFORM CONVERGENCE MA 403: REAL ANALYSIS, INSTRUCTOR: B. V. LIMAYE 1. Pointwise Convergence of Sequence Let E be set nd Y be metric spce. Consider functions f n : E Y for n = 1, 2,.... We sy tht the sequence

More information

Quadratic Forms. Quadratic Forms

Quadratic Forms. Quadratic Forms Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte

More information

arxiv: v1 [math.ca] 7 Mar 2012

arxiv: v1 [math.ca] 7 Mar 2012 rxiv:1203.1462v1 [mth.ca] 7 Mr 2012 A simple proof of the Fundmentl Theorem of Clculus for the Lebesgue integrl Mrch, 2012 Rodrigo López Pouso Deprtmento de Análise Mtemátic Fcultde de Mtemátics, Universidde

More information

AQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system

AQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system Complex Numbers Section 1: Introduction to Complex Numbers Notes nd Exmples These notes contin subsections on The number system Adding nd subtrcting complex numbers Multiplying complex numbers Complex

More information

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More

More information

MATH 573 FINAL EXAM. May 30, 2007

MATH 573 FINAL EXAM. May 30, 2007 MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.

More information

Properties of the Riemann Integral

Properties of the Riemann Integral Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University Februry 15, 2018 Outline 1 Some Infimum nd Supremum Properties 2

More information

Math& 152 Section Integration by Parts

Math& 152 Section Integration by Parts Mth& 5 Section 7. - Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible

More information

Lecture 2: Fields, Formally

Lecture 2: Fields, Formally Mth 08 Lecture 2: Fields, Formlly Professor: Pdric Brtlett Week UCSB 203 In our first lecture, we studied R, the rel numbers. In prticulr, we exmined how the rel numbers intercted with the opertions of

More information

II. Integration and Cauchy s Theorem

II. Integration and Cauchy s Theorem MTH6111 Complex Anlysis 2009-10 Lecture Notes c Shun Bullett QMUL 2009 II. Integrtion nd Cuchy s Theorem 1. Pths nd integrtion Wrning Different uthors hve different definitions for terms like pth nd curve.

More information

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz

More information

Chapter 1: Fundamentals

Chapter 1: Fundamentals Chpter 1: Fundmentls 1.1 Rel Numbers Types of Rel Numbers: Nturl Numbers: {1, 2, 3,...}; These re the counting numbers. Integers: {... 3, 2, 1, 0, 1, 2, 3,...}; These re ll the nturl numbers, their negtives,

More information

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

Math 360: A primitive integral and elementary functions

Math 360: A primitive integral and elementary functions Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:

More information

1 The Lagrange interpolation formula

1 The Lagrange interpolation formula Notes on Qudrture 1 The Lgrnge interpoltion formul We briefly recll the Lgrnge interpoltion formul. The strting point is collection of N + 1 rel points (x 0, y 0 ), (x 1, y 1 ),..., (x N, y N ), with x

More information

Recitation 3: More Applications of the Derivative

Recitation 3: More Applications of the Derivative Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech

More information

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct

More information

ENGI 3424 Engineering Mathematics Five Tutorial Examples of Partial Fractions

ENGI 3424 Engineering Mathematics Five Tutorial Examples of Partial Fractions ENGI 44 Engineering Mthemtics Five Tutoril Exmples o Prtil Frctions 1. Express x in prtil rctions: x 4 x 4 x 4 b x x x x Both denomintors re liner non-repeted ctors. The cover-up rule my be used: 4 4 4

More information

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below. Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we

More information

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn

More information

Physics 116C Solution of inhomogeneous ordinary differential equations using Green s functions

Physics 116C Solution of inhomogeneous ordinary differential equations using Green s functions Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner

More information

Keywords : Generalized Ostrowski s inequality, generalized midpoint inequality, Taylor s formula.

Keywords : Generalized Ostrowski s inequality, generalized midpoint inequality, Taylor s formula. Generliztions of the Ostrowski s inequlity K. S. Anstsiou Aristides I. Kechriniotis B. A. Kotsos Technologicl Eductionl Institute T.E.I.) of Lmi 3rd Km. O.N.R. Lmi-Athens Lmi 3500 Greece Abstrct Using

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

Summary: Method of Separation of Variables

Summary: Method of Separation of Variables Physics 246 Electricity nd Mgnetism I, Fll 26, Lecture 22 1 Summry: Method of Seprtion of Vribles 1. Seprtion of Vribles in Crtesin Coordintes 2. Fourier Series Suggested Reding: Griffiths: Chpter 3, Section

More information

The asymptotic behavior of the real roots of Fibonacci-like polynomials

The asymptotic behavior of the real roots of Fibonacci-like polynomials Act Acdemie Pedgogice Agriensis, Sectio Mthemtice, 4. 997) pp. 55 6 The symptotic behvior of the rel roots of Fiboncci-like polynomils FERENC MÁTYÁS Abstrct. The Fiboncci-like polynomils G n x) re defined

More information

arxiv:math/ v2 [math.ho] 16 Dec 2003

arxiv:math/ v2 [math.ho] 16 Dec 2003 rxiv:mth/0312293v2 [mth.ho] 16 Dec 2003 Clssicl Lebesgue Integrtion Theorems for the Riemnn Integrl Josh Isrlowitz 244 Ridge Rd. Rutherford, NJ 07070 jbi2@njit.edu Februry 1, 2008 Abstrct In this pper,

More information

approaches as n becomes larger and larger. Since e > 1, the graph of the natural exponential function is as below

approaches as n becomes larger and larger. Since e > 1, the graph of the natural exponential function is as below . Eponentil nd rithmic functions.1 Eponentil Functions A function of the form f() =, > 0, 1 is clled n eponentil function. Its domin is the set of ll rel f ( 1) numbers. For n eponentil function f we hve.

More information

A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007

A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007 A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus

More information

Lesson 1: Quadratic Equations

Lesson 1: Quadratic Equations Lesson 1: Qudrtic Equtions Qudrtic Eqution: The qudrtic eqution in form is. In this section, we will review 4 methods of qudrtic equtions, nd when it is most to use ech method. 1. 3.. 4. Method 1: Fctoring

More information

KRASNOSEL SKII TYPE FIXED POINT THEOREM FOR NONLINEAR EXPANSION

KRASNOSEL SKII TYPE FIXED POINT THEOREM FOR NONLINEAR EXPANSION Fixed Point Theory, 13(2012), No. 1, 285-291 http://www.mth.ubbcluj.ro/ nodecj/sfptcj.html KRASNOSEL SKII TYPE FIXED POINT THEOREM FOR NONLINEAR EXPANSION FULI WANG AND FENG WANG School of Mthemtics nd

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4

More information

ON CLOSED CONVEX HULLS AND THEIR EXTREME POINTS. S. K. Lee and S. M. Khairnar

ON CLOSED CONVEX HULLS AND THEIR EXTREME POINTS. S. K. Lee and S. M. Khairnar Kngweon-Kyungki Mth. Jour. 12 (2004), No. 2, pp. 107 115 ON CLOSED CONVE HULLS AND THEIR ETREME POINTS S. K. Lee nd S. M. Khirnr Abstrct. In this pper, the new subclss denoted by S p (α, β, ξ, γ) of p-vlent

More information