ON SPARSELY SCHEMMEL TOTIENT NUMBERS. Colin Defant 1 Department of Mathematics, University of Florida, Gainesville, Florida
|
|
- Gervase Parks
- 6 years ago
- Views:
Transcription
1 #A8 INTEGERS 5 (205) ON SPARSEL SCHEMMEL TOTIENT NUMBERS Colin Defant Depatment of Mathematics, Univesity of Floida, Gainesville, Floida cdefant@ufl.edu Received: 7/30/4, Revised: 2/23/4, Accepted: 4/26/5, Published: 5/8/5 Abstact Fo each positive intege, let S denote the th Schemmel totient function, a multiplicative aithmetic function defined by ( S (p 0, if p apple ; ) = p (p ), if p > fo all pimes p and positive integes. The function S is simply Eule s totient function. Masse and Shiu have established seveal fascinating esults concening spasely totient numbes, positive integes n satisfying (n) < (m) fo all integes m > n. We define a spasely Schemmel totient numbe of ode to be a positive intege n such that S (n) > 0 and S (n) < S (m) fo all m > n with S (m) > 0. We then genealize some of the esults of Masse and Shiu.. Intoduction Thoughout this pape, we will let N and P denote the set of positive integes and the set of pime numbes, espectively. Fo any pime p and positive intege n, we will let!(n) denote the numbe of distinct pime factos of n, and we will let p(n) denote the exponent of p in the pime factoization of n. Futhemoe, we will let n# denote the poduct of all the pime numbes less than o equal to n (with the convention # = ), and we will let p i denote the i th pime numbe. The Eule totient function (n) counts the numbe of positive integes less than o equal to n that ae elatively pime to n. In 869, V. Schemmel intoduced a class of functions S, now known as Schemmel totient functions, that genealize Eule s totient function. S (n) counts the numbe of positive integes k apple n such that gcd(k + j, n) = fo all j 2 {0,,..., }. Clealy, S =. It has been This wok was suppoted by National Science Foundation gant no
2 INTEGERS: 5 (205) 2 shown [6] that S is a multiplicative function that satisfies ( S (p 0, if p apple ) = p (p ), if p > fo all pimes p and positive integes. It follows easily fom this fomula that, fo any positive integes, u, v, we have S (u)s (v) apple S (uv) apple min(us (v), vs (u)). () Fo any positive intege, we will let B denote the set of positive integes whose smallest pime facto is geate than, and we will convene to let 2 B. Equivalently, B = {n 2 N: S (n) > 0}. Masse and Shiu have studied the set F of positive integes n that satisfy (n) < (m) fo all m > n [5]. These integes ae known as spasely totient numbes, and they motivate the following definition. Definition.. Let be a positive intege. A positive intege n is a spasely Schemmel totient numbe of ode if n 2 B and S (n) < S (m) fo all m 2 B with m > n. We will let F be the set of all spasely Schemmel totient numbes of ode. Remak.. Lee-Wah ip has shown that if is a positive intege, then thee c ()n exists a positive constant c () such that S (n) (log log 3n) fo all n 2 B [8]. In fact, this esult follows quite easily fom Metens s estimates. Theefoe, each set F is infinite. The aim of this pape is to modify some of the poofs that Masse and Shiu used to establish esults concening spasely totient numbes in ode to illustate how those esults genealize to esults concening spasely Schemmel totient numbes. 2. A Fundamental Constuction The fundamental esult in Masse and Shiu s pape, upon which all subsequent theoems ely, is a constuction of a cetain subset of F, so we will give a simila constuction of subsets of the sets F. Lemma. Fix some positive intege, and suppose x, x 2,..., x s, y, y 2,..., y s, X, ae eal numbes such that < x i apple y i fo all i 2 {, 2,..., s}. If
3 INTEGERS: 5 (205) 3 s s max(x, x 2,..., x s ) and X x i < y i, then i= i= s s (X ) (x i ) < ( ) (y i ). i= i= Poof. The poof is by induction on s, so we will assume that s lemma is tue if we eplace s with s. Note that 2 and that the s s (x i ) apple ( ) (y i ), i= so the poof is simple if X < y s. Theefoe, we will assume that X y s. If we s s wite the inequality X x i < y i as Xx s s s x i < y i, then the induction y i= i= s i= i= hypothesis tells us that i= Xxs y s s s (x i ) < ( ) (y i ). (2) i= i= Multiplying each side of (2) by y s, we see that it su ces to show, in ode to complete the induction step, that Xxs (y s ) (X )(x s ). (3) y s Xxs We may ewite (3) as X x s y s + y s apple (X + x s ), o, equivalently, y s x s apple y s. This inequality holds because X y s, so we have completed the induction step of the poof. Fo the case s =, we note again that the poof istivial if X < y, so we will assume that X y. This implies that y x apple X, which we may ewite as y + Xx apple X + x. Multiplying this last inequality by and adding y Xx + 2 to each side, we get Xx y + Xx + 2 Xx (X + x ) + 2, y Xx so (y ) y that (y )( ) > (x )(X ). x y (x )(X ). As x X < y by hypothesis, we find
4 INTEGERS: 5 (205) 4 In what follows, we will let () denote the numbe of pimes less than o equal to. Theoem. Let be a positive intege, and let ` and k be nonnegative integes such that k () + 2. Suppose d is an element of B such that d < p k+ and k d(p k+` ) < (d + )(p k ). If we set n = dp k+` p i, then n 2 F. i= ()+ k Poof. Fist, note that n 2 B. Setting u = d and v = p k+` S (n) apple d(p k+` ) k i= ()+ Using the hypothesis d(p k+` ) < (d + )(p k ), we get S (n) < (d + ) k i= ()+ i= ()+ p i in () yields (p i ). (4) (p i ), (5) fom which the hypothesis d < p k+ yields S (n) < k+ i= ()+ (p i ). (6) Now, choose some abitay m 2 B with m > n. We will show that S (m) > S (n). Thee is a unique intege t > () such that Clealy,!(m) apple t t i= ()+ t i= ()+ (), so S (m) m p i apple m < t i= ()+ t+ i= ()+ p i p i.. This implies that S (m) (p i ). If t k +, then we may use (6) to conclude that S (n) < S (m). Theefoe, let us assume that t apple k. Then!(m) apple k (). Suppose!(m) apple k () so that S k (m). Fom (4), we m p i i= ()+ have S k (n) <, so S (n) < S (m). Because m > n, we see that n n m S (n) < S (m). i= ()+ p i
5 INTEGERS: 5 (205) 5 Now, assume!(m) = k (). Then we may wite m = µ k () i= q i, whee µ is a positive intege whose pime factos ae all in the set {q, q 2,..., q k () } and, fo all i, j 2 {, 2,..., k ()} with i < j, q i is a pime and p ()+i apple q i < q j. This means that S (m) = µ S (n) < µ k i= ()+ k () i= (p i ) = µ (q i ). If µ d +, then we may use (5) to find that k () i= that µ apple d. Because m > n, we have k () i= (p ()+i ) apple S (m). Hence, we may assume q i > d µ p k+` k i= ()+ p i. (7) Fo each i 2 {, 2,..., k ()}, let x i = p ()+i, and let y i = q i. If we set s = k (), X = d µ p k+`, and = q k (), then we may use Lemma and (7) to conclude that k () i= (q i ) > Thus, because µ apple d, we have S (m) = µ k () i= d µ p k+` (p i ). i= ()+ (q i ) > (dp k+` µ) d(p k+` ) k i= ()+ (p i ). k i= ()+ Recalling (4), we have S (m) > S (n), so the poof is complete. (p i ) 3. Pime Divisos of Spasely Schemmel Totient Numbes In thei pape, Masse and Shiu casually mention that 2 is the only spasely totient pime powe [5], but thei bief poof utilizes the fact that, fo =, + is pime. We will see that if + is pime, then + is indeed the only spasely Schemmel totient numbe of ode that is a pime powe. Howeve, if + is composite, thee could easily be multiple spasely Schemmel totient numbes of ode that ae pime powes. The following esults will povide an uppe bound (in tems of ) fo the values of spasely Shemmel totient pime powes of ode.
6 INTEGERS: 5 (205) 6 Spasely Schemmel Totient Numbes of Ode 2 3, 5*, 2*, 45*, 05*, 65*, 95, 35*, 345, 525*, 585, 735*, 55*, 365*, 785*, 995*, 245, 245, 2625, 3465*, 4095*, 4305, 455, 5775*, 5985, 6825, 8085, 8925, 9555, 0395*, 505*, 9635*, 2945*, 23205, 25935, 26565*, 28875, 3395, 33495, 3395, 35805, 45045*, 47355, 49665, 50505, 58905, 65835, 75075*, 77805, 79695, 82005, 8435, , 5, 7, 35*, 55, 65, 85, 95, 75*, 245*, 385*, 455*, 595*, 665, 805, 875, 05, 085, 295, 435, 925*, 2275, 2695*, 385, 5005*, 6545*, 735*, 7735, 8855, 0465, 65, 935, 395, 4245, 5785, 6555, 6835, 8095, 8655, 8865, 25025*, 25795, 27335, 35035*, 36575, 38675, 4585, 55055*, 65065*, 85085*, 95095* 4 5, 35*, 55, 65, 85, 75*, 385*, 455*, 595*, 665, 805, 05, 085, 295, 925*, 2275, 2695*, 5005*, 6545*, 735*, 7735, 8855, 0465, 65, 935, 395, 4245, 5785, 6555, 6835, 8095, 25025*, 35035*, 36575, 38675, 4585, 55055*, 85085*, 95095* 5, 7,, 3, 77*, 9*, 9, 33, 6, 203, 27, 259, 287, 30, 539*, 00*, 309*, 463*, 547, 77, 2233, 2387, 2849, 357, 33, 369, 408, 4543, 7007*, 963, 0*, 707*, 909*, 23023*, 2487, 29029, 303, 33649, 37037, 404, 43043, 47047, 53053, 59059, 606, 67067, 707, 73073, 79079, , 77*, 9*, 9, 33, 6, 203, 27, 259, 00*, 309*, 463*, 547, 77, 2233, 2387, 2849, 357, 33, 369, 408, 7007*, 707*, 909*, 23023*, 2487, 29029, 303, 37037, 404, 43043, 47047, 53053, 59059, 606, 67067, 707, 73073, Table : This table lists all Spasely Schemmel totient numbes of ode that ae less than 0 5 fo each 2 {2, 3, 4, 5}. A table of Spasely totient numbes ( = ) is given in [5]. Those numbes constucted by Theoem ae maked with asteisks. Lemma 2. If j 2 N\{, 2, 4}, then p j+ p j apple 7 5. Poof. Piee Dusat apple[2] has shown that, fo x , thee must be at least one x pime in the inteval x, x + 25 log 2 x. Theefoe, wheneve p j > , we may p j + set x = p j + to get p j+ apple (p j + ) + 25 log 2 (p j + ) < 7 5 p j. Using Mathematica 9.0 [7], we may quickly seach though all the pimes less than to conclude the desied esult. Lemma 3. Let p be a pime, and let,, and > and p -. If p 2 F, then p 2 F. be positive integes such that Poof. Suppose, fo the sake of finding a contadiction, that p 62 F and p 2
7 INTEGERS: 5 (205) 7 F. Because p 2 F B, we know that p 2 B. Then, because p 62 F, thee must exist some m 2 B such that m > p and S (m) apple S (p ) = p 2 (p )S ( ). Howeve, this implies that pm > p and S (pm) apple ps (m) apple p (p )S ( ) = S (p ), which contadicts the fact that p 2 F. Theoem 2. If p is a pime and is a positive intege, then p 2 F if and only if < p < (p ()+ )(p ()+2 ) +. Poof. Fist, suppose < p < (p ()+ )(p ()+2 ) +, and let m be an abitay element of B that is geate than p. We will show that S (m) > p.!(m) If!(m) 2, then S (m) (p ()+i ) (p ()+ )(p ()+2 ) > p i=. Theefoe, we may assume that!(m) = so that we may wite m = q fo some pime q > and positive intege. Futhemoe, we may assume > because if =, then S (m) = q = m > p. If 62 {, 2, 3, 5}, then it is easy to see, with the help of Lemma 2, that p ()+2 < 2. Thus, if 62 {, 2, 3, 5}, then we have S (m) = q (q ) q(q ) p ()+ (p ()+ ) > (p ()+ ) > (p ()+ )(p ()+2 ) > p. If =, then the inequality p < (p ()+ )(p ()+2 ) + foces p = 2, so S (m) = q (q ) > = p. If = 2, then the inequality < p < (p ()+ )(p ()+2 ) + foces p = 3, so S (m) = q (q ) > = p. If = 3, then q 5 and eithe p = 5 o p = 7. Theefoe, S (m) = q (q ) 5(5 3) > p. Finally, if = 5, then p 2 {7,, 3} and q 7. Thus, S (m) = q (q ) 7(7 5) > p. To pove the convese, suppose p (p ()+ )(p ()+2 ) +. We wish to find some m 2 B such that m > p and S (m) apple p. We may assume that p > p ()+ p ()+2 because, othewise, we may simply set m = p ()+ p ()+2. We know that thee exists a unique intege t ()+2 such that p ()+ p t < p < p ()+ p t+. Suppose > 3 so that, with the help of Lemma 2 and some vey shot casewok, we may conclude that p ()+ apple 7 and p t+ apple 7 p t. Then, setting m = p ()+ p t+, we have S (m) = (p ()+ )(p t+ ) apple p t < p 4 ()+p t 7 2 < p ()+ p t < p. We now handle the cases in which apple 3. If =, then p is odd, so we may set m = 2p to get S (m) = S (2)S (p) = p = p. If = 2, then 3 - p, so we may set m = 3p to find S 2 (m) = S 2 (3)S 2 (p) = p 2 = p. Finally, if = 3, then we have 5p t < p < 5p t+. Set m = 5p t+. As p t+ < 5 2 p t, we have 2p t+ S 3 (m) = 2(p t+ 3) < p 3 = p. 3 < p, so
8 INTEGERS: 5 (205) 8 Theoem 3. Let be a positive intege, and let p be a pime. Then p 2 ()+ 62 F and p 3 62 F. Poof. Suppose p 2 ()+ 2 F. Then, as p ()+ p ()+2 > p 2 ()+, we must have (p ()+ )(p ()+2 ) > p ()+ (p ()+ ). Theefoe, < p ()+2 p ()+. It is easy to see that this inequality fails to hold fo all apple 0. Fo, we may use Lemma 2 to wite p ()+ < p 2 and p ()+2 < p 2p ()+. Hence, p ()+2 p ()+ < ( p p 2 )p ()+ < (2 2) <, which is a contadiction. Now, suppose p 3 2 F. Then, by Lemma 3, we know that p 2 2 F, so p > p ()+. Let t be the unique intege such that p ()+ p t < p 2 < p ()+ p t+. Then p 3 < p ()+ p t+ p and p ()+ < p < p t+. Theefoe, as p 3 2 F, we see that S (p 3 ) = p 2 (p ) < (p ()+ )(p t+ )(p ), implying that p 2 < (p t+ )(p ()+ ) < p t+ (p ()+ ). Using Betand s Postulate, we see that p t+ < 2p t and p ()+ apple 2. Theefoe, p ()+ p t < p 2 < p t+ (p ()+ ) < 2p t (p ()+ ), so 2 < p ()+. This is ou desied contadiction. Combining Lemma 3, Theoem 2, and Theoem 3, we see that any n 2 F satisfying n ((p ()+ )(p ()+2 ) + ) 2 must have at least two pime factos. Futhemoe, we ecod the following conjectue about the nonexistence of spasely Schemmel totient numbes that ae squaes of pimes. This conjectue has been checked fo all apple 6 and p apple 37. Conjectue. Fo any pime p and positive intege, p 2 62 F. We now poceed to establish asymptotic esults concening the pimes that divide and do not divide spasely Schemmel totient numbes. Fo a given 2 N and n 2 F, we will define P k (n) to be the k th lagest pime diviso of n (povided!(n) k), and we will let Q k (n) denote the k th smallest pime that is lage than and does not divide n (the functions Q k depends on, but this should not lead to confusion because we will wok with fixed values of ). We will let R(n) = n p. We will also make use of the Jacobsthal function J. Fo a positive p2p p n intege n, J(n) is defined to be the smallest positive intege a such that evey set of a consecutive integes contains an element that is elatively pime to n [4]. In paticula, fo any positive intege, J(#) is the lagest possible di eence between consecutive elements of B. This means that, fo any positive eal x, the smallest element of B that is geate than x is at most x + J(#). Fo convenience, we will wite J = J(#). The fist sixteen values of J (stating with = ) ae, 2, 4, 6, 0, 4, 22, 26, 34, 40, 46, 58, 66, 74, 90, 00. Finally, we will let k() be the unique positive eal oot of the polynomial J xk + kx (k ).
9 INTEGERS: 5 (205) 9 Lemma 4. If, n, and k ae positive integes such that k!(n) k, then Q k (n) > k ()(P k (n) ). 2, n 2 F, and Poof. Wite M = k P i (n) and N = i= k i= Q i (n). Let µ be the smallest element of B that is geate than M N. As noted above, we must have µ < M N + J. Let us put m = µn M n so that m 2 B and < m n < + J N M < + J Q k (n) k P k (n) k. n Since, is an intege that is elatively pime to N, we may use the multiplicativity M of S along with () to wite S (m) = S µn n apple µs N n n = µs (N)S apple µ S (N)S (n). M M M S (M) This implies that S (m) m apple S (N) N M S (M) S (n) n < Q k (n) Theefoe, Q k (n) S (m) < k + J P k (n) k so the fact that n 2 F implies that Q k (n) k + J P k (n) k = k i= Q k Q k Q i (n) (n) j= S (n) P k (n) n. (n) S (n) P j (n) n S (n), P k (n) >. (8) P k (n) Q k (n) k Wite x = J P k (n) k, x 2 = Q k (n), and x 3 = so that (8) becomes P k (n) (+x )( x 2 ) k ( x 3 ) k >. Because x and x 2 ae positive and 0 < x 3 <, we may invoke the inequalities +x < e x, x 2 < e x2, and ( x 3 ) x3/( < e x3) to wite e x (k )x2+kx3/( x3) >. (9) Afte a little algebaic manipulation, (9) becomes J Qk (n) P k (n) + k Q k (n) P k (n) (k ) > 0.
10 INTEGERS: 5 (205) 0 Thus, if we wite A(x) = J Qk (n) xk + kx (k ), then A P k (n) means that Q k (n) P k (n) > k(), so we ae done. Lemma 5. Fo any positive integes and n with n 2 F, P (n) < Q (n) J + J Q (n). > 0. This Poof. Fix and n, and wite P = P (n) and Q = Q (n). Suppose, fo the sake of finding a contadiction, that P Q J + J Q. Let µ be the smallest element of B that is geate than P Q. Then µ < P Q + J. Wite m = Qµ P n so that m 2 B and < m n < + J Q P apple + J Because m J + J Q. is divisible by Q and all the pime divisos of n except possibly P, we have S (m) m apple S (n) Q P n. Theefoe, apple = S (m) < Q Q Q J + J Q Q + P J J + J Q! S (n)!! J J + J Q + J + J Q S (n) + J Q Q S (n) = S (n). This is ou desied contadiction, so the poof is complete. Fo the following lemma, ecall that we defined R(n) = n p2p p n Lemma 6. Let be a positive intege, and let n 2 F. Then p. R(n) < J Q (n)(q (n) ).
11 INTEGERS: 5 (205) Poof. Fix, and n, and wite Q = Q (n) and R = R(n). Suppose R J Q(Q ). Let µ be the smallest element of B geate than R Q. Then µ < R Q + J. If we put m = Qµ R n, then m 2 B and < m n < + J Q R apple + Q. Because m is divisible by Q and all the pime divisos of n, we have S (m) m apple S (n) Q n. This implies that S (m) < + Q Q S (n) = S (n), which is a contadiction. Coollay. Let and be positive integes, and let V ( ) = J p ()+ (p ()+ ). If n 2 F and n V ( ) (V ( ) + p ()+ )#, then!(n). In paticula, fo p () # n 2 F, lim!(n) =. n! Poof. We pove the contapositive. Suppose n 2 F and!(n) <. Then Q (n) apple p ()+, so P (n) < p ()+ J + J p ()+ = V ( ) + p ()+ by Lemma 5. This implies that R(n) = n p p () # n. Lemma 6 tells us (V ( ) + p p2p ()+ )# p n that R(n) < V ( ), so n apple R(n) (V ( ) + p ()+ )# p () # < V ( ) (V ( ) + p ()+ )#. p () # Coollay 2. Let be a positive intege. Fo su ciently lage n 2 F, P (n) 4 - n.
12 INTEGERS: 5 (205) 2 Poof. Fo any intege n >, wite fo any n 2 F satisfying n >, P(n)(n) = (n). Using Lemma 6, we see that, P (n) (n) apple R(n) < J Q (n)(q (n) Because Q (n) is at most the smallest pime exceeding P (n), we may use Betand s Postulate to wite ). J Q (n)(q (n) ) apple 2 J P (n)(2p (n) ) < 4 J P (n) 2. If P (n) 4 n, then (n) 3, so P (n) < 4 J. By Coollay, we see that this is impossible fo su ciently lage n. Masse and Shiu show that P (n) 3 - n fo all spasely totient numbes n, but thei methods ae not obviously genealizable [5]. Thus, we make the following conjectue, which has been checked fo all apple 6 and n apple Conjectue 2. Fo any positive integes and n with n 2 F and n >, P (n) 3 - n. Fo small values of, we may e otlessly make small amounts of pogess towad Conjectue 2. Fo example, it is easy to use Lemma 6 to show that P (n) 4 - n fo all n 2 F 2. Indeed, if P (n) 4 n fo some n 2 F 2, then P (n) < 4 J2 = 4. This foces 2 n to be a powe of 3, but Theoem 3 tells us that thee ae no powes of 3 in F 2 except 3 itself. We ae finally eady to establish ou pomised asymptotic esults. Theoem 4. Let, K, and L be positive integes with K (a) lim sup n! (b) lim sup n! (c) lim sup n! (d) lim sup n! P (n) log n 2, Q L (n) log n =, P K (n) log n apple K(), P (n) log 2 n apple J. 2. Fo n 2 F, we have Poof. To pove (a), let us begin by choosing some intege k ()+2. Let `(k) be k the lagest intege such that p k+`(k) < 2p k. Setting n(k) = p k+`(k) p i, we i= ()+
13 INTEGERS: 5 (205) 3 see, by Theoem, that n(k) 2 F. Futhemoe, as k i= ()+ p i apple n(k) < k+ i= ()+ the Pime Numbe Theoem tells us that p k log n(k) as k!. Thus, as k!, P (n(k)) = p k+`(k) 2p k 2 log n(k). To pove (b), choose any n 2 F with n >, and let k(n) be the unique intege satisfying p i apple n < p i. Using the Pime Numbe Theoem again, k(n) k(n)+ we i= ()+ i= ()+ have Q L (n) apple p k(n)+l log n as n!. In addition, fo those n 2 F (guaanteed by Theoem ) of the fom n = k(n) i= ()+ p i, we see that Q L (n) = p k(n)+l log n. Coollay guaantees that the limit in (c) is well-defined. To pove the limit, we use Lemma 4 to find that if n 2 F and!(n) K, then P K (n) log n < K() Q K (n) + log n log n. Then the desied esult follows fom setting L = K in (b). Finally, (d) follows immediately fom Lemma 5 and fom setting L = in (b). p i, Acknowledgments The autho would like to thank the efeee fo many valuable suggestions. Refeences [] Bake, R. C. and Haman, G., Spasely totient numbes, Annales de la Faculté des Sciences de Toulouse, 5, 996, [2] Dusat, Piee. Estimates of some functions ove pimes without R.H., axiv: (200). [3] Haman G., On spasely totient numbes, Glasgow Math. J., 33, 99, [4] Jacobsthal, E., Übe sequenzen ganze Zahlen von denen keine zu n teilefemd ist, I III Noske Vidensk. Selsk. Foh. Tondheim 33 (960), [5] Masse, D. W. and Shiu, P., On spasely totient numbes. Pacific J. Math. 2 (986), no. 2, [6] Schemmel, V. Übe elative Pimzahlen, Jounal fü die eine und angewandte Mathematik, Band 70 (869), S [7] Wolfam Reseach, Inc., Mathematica, Vesion 9.0, Champaign, IL (202). [8] ip, Lee-Wah. On Camichael type poblems fo the Schemmel totients and some elated questions. Thesis (Ph.D.)Univesity of Albeta (Canada). PoQuest LLC, Ann Abo, MI, 989, pp 2.
Method for Approximating Irrational Numbers
Method fo Appoximating Iational Numbes Eic Reichwein Depatment of Physics Univesity of Califonia, Santa Cuz June 6, 0 Abstact I will put foth an algoithm fo poducing inceasingly accuate ational appoximations
More informationIntroduction Common Divisors. Discrete Mathematics Andrei Bulatov
Intoduction Common Divisos Discete Mathematics Andei Bulatov Discete Mathematics Common Divisos 3- Pevious Lectue Integes Division, popeties of divisibility The division algoithm Repesentation of numbes
More informationarxiv: v1 [math.nt] 12 May 2017
SEQUENCES OF CONSECUTIVE HAPPY NUMBERS IN NEGATIVE BASES HELEN G. GRUNDMAN AND PAMELA E. HARRIS axiv:1705.04648v1 [math.nt] 12 May 2017 ABSTRACT. Fo b 2 and e 2, let S e,b : Z Z 0 be the function taking
More informationA proof of the binomial theorem
A poof of the binomial theoem If n is a natual numbe, let n! denote the poduct of the numbes,2,3,,n. So! =, 2! = 2 = 2, 3! = 2 3 = 6, 4! = 2 3 4 = 24 and so on. We also let 0! =. If n is a non-negative
More informationOn the ratio of maximum and minimum degree in maximal intersecting families
On the atio of maximum and minimum degee in maximal intesecting families Zoltán Lóánt Nagy Lale Özkahya Balázs Patkós Máté Vize Mach 6, 013 Abstact To study how balanced o unbalanced a maximal intesecting
More informationChapter 3: Theory of Modular Arithmetic 38
Chapte 3: Theoy of Modula Aithmetic 38 Section D Chinese Remainde Theoem By the end of this section you will be able to pove the Chinese Remainde Theoem apply this theoem to solve simultaneous linea conguences
More informationarxiv: v1 [math.nt] 28 Oct 2017
ON th COEFFICIENT OF DIVISORS OF x n axiv:70049v [mathnt] 28 Oct 207 SAI TEJA SOMU Abstact Let,n be two natual numbes and let H(,n denote the maximal absolute value of th coefficient of divisos of x n
More informationOn the ratio of maximum and minimum degree in maximal intersecting families
On the atio of maximum and minimum degee in maximal intesecting families Zoltán Lóánt Nagy Lale Özkahya Balázs Patkós Máté Vize Septembe 5, 011 Abstact To study how balanced o unbalanced a maximal intesecting
More information9.1 The multiplicative group of a finite field. Theorem 9.1. The multiplicative group F of a finite field is cyclic.
Chapte 9 Pimitive Roots 9.1 The multiplicative goup of a finite fld Theoem 9.1. The multiplicative goup F of a finite fld is cyclic. Remak: In paticula, if p is a pime then (Z/p) is cyclic. In fact, this
More informationDivisibility. c = bf = (ae)f = a(ef) EXAMPLE: Since 7 56 and , the Theorem above tells us that
Divisibility DEFINITION: If a and b ae integes with a 0, we say that a divides b if thee is an intege c such that b = ac. If a divides b, we also say that a is a diviso o facto of b. NOTATION: d n means
More informationarxiv: v1 [math.co] 4 May 2017
On The Numbe Of Unlabeled Bipatite Gaphs Abdullah Atmaca and A Yavuz Ouç axiv:7050800v [mathco] 4 May 207 Abstact This pape solves a poblem that was stated by M A Haison in 973 [] This poblem, that has
More informationSolution to HW 3, Ma 1a Fall 2016
Solution to HW 3, Ma a Fall 206 Section 2. Execise 2: Let C be a subset of the eal numbes consisting of those eal numbes x having the popety that evey digit in the decimal expansion of x is, 3, 5, o 7.
More informationJournal of Inequalities in Pure and Applied Mathematics
Jounal of Inequalities in Pue and Applied Mathematics COEFFICIENT INEQUALITY FOR A FUNCTION WHOSE DERIVATIVE HAS A POSITIVE REAL PART S. ABRAMOVICH, M. KLARIČIĆ BAKULA AND S. BANIĆ Depatment of Mathematics
More informationONE-POINT CODES USING PLACES OF HIGHER DEGREE
ONE-POINT CODES USING PLACES OF HIGHER DEGREE GRETCHEN L. MATTHEWS AND TODD W. MICHEL DEPARTMENT OF MATHEMATICAL SCIENCES CLEMSON UNIVERSITY CLEMSON, SC 29634-0975 U.S.A. E-MAIL: GMATTHE@CLEMSON.EDU, TMICHEL@CLEMSON.EDU
More informationON INDEPENDENT SETS IN PURELY ATOMIC PROBABILITY SPACES WITH GEOMETRIC DISTRIBUTION. 1. Introduction. 1 r r. r k for every set E A, E \ {0},
ON INDEPENDENT SETS IN PURELY ATOMIC PROBABILITY SPACES WITH GEOMETRIC DISTRIBUTION E. J. IONASCU and A. A. STANCU Abstact. We ae inteested in constucting concete independent events in puely atomic pobability
More informationON THE INVERSE SIGNED TOTAL DOMINATION NUMBER IN GRAPHS. D.A. Mojdeh and B. Samadi
Opuscula Math. 37, no. 3 (017), 447 456 http://dx.doi.og/10.7494/opmath.017.37.3.447 Opuscula Mathematica ON THE INVERSE SIGNED TOTAL DOMINATION NUMBER IN GRAPHS D.A. Mojdeh and B. Samadi Communicated
More informationFixed Point Results for Multivalued Maps
Int. J. Contemp. Math. Sciences, Vol., 007, no. 3, 119-1136 Fixed Point Results fo Multivalued Maps Abdul Latif Depatment of Mathematics King Abdulaziz Univesity P.O. Box 8003, Jeddah 1589 Saudi Aabia
More informationA generalization of the Bernstein polynomials
A genealization of the Benstein polynomials Halil Ouç and Geoge M Phillips Mathematical Institute, Univesity of St Andews, Noth Haugh, St Andews, Fife KY16 9SS, Scotland Dedicated to Philip J Davis This
More informationSemicanonical basis generators of the cluster algebra of type A (1)
Semicanonical basis geneatos of the cluste algeba of type A (1 1 Andei Zelevinsky Depatment of Mathematics Notheasten Univesity, Boston, USA andei@neu.edu Submitted: Jul 7, 006; Accepted: Dec 3, 006; Published:
More informationSUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER
Discussiones Mathematicae Gaph Theoy 39 (019) 567 573 doi:10.7151/dmgt.096 SUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER Lutz Volkmann
More information(n 1)n(n + 1)(n + 2) + 1 = (n 1)(n + 2)n(n + 1) + 1 = ( (n 2 + n 1) 1 )( (n 2 + n 1) + 1 ) + 1 = (n 2 + n 1) 2.
Paabola Volume 5, Issue (017) Solutions 151 1540 Q151 Take any fou consecutive whole numbes, multiply them togethe and add 1. Make a conjectue and pove it! The esulting numbe can, fo instance, be expessed
More informationMath 301: The Erdős-Stone-Simonovitz Theorem and Extremal Numbers for Bipartite Graphs
Math 30: The Edős-Stone-Simonovitz Theoem and Extemal Numbes fo Bipatite Gaphs May Radcliffe The Edős-Stone-Simonovitz Theoem Recall, in class we poved Tuán s Gaph Theoem, namely Theoem Tuán s Theoem Let
More informationAsymptotically Lacunary Statistical Equivalent Sequence Spaces Defined by Ideal Convergence and an Orlicz Function
"Science Stays Tue Hee" Jounal of Mathematics and Statistical Science, 335-35 Science Signpost Publishing Asymptotically Lacunay Statistical Equivalent Sequence Spaces Defined by Ideal Convegence and an
More informationA Bijective Approach to the Permutational Power of a Priority Queue
A Bijective Appoach to the Pemutational Powe of a Pioity Queue Ia M. Gessel Kuang-Yeh Wang Depatment of Mathematics Bandeis Univesity Waltham, MA 02254-9110 Abstact A pioity queue tansfoms an input pemutation
More informationOn the Poisson Approximation to the Negative Hypergeometric Distribution
BULLETIN of the Malaysian Mathematical Sciences Society http://mathusmmy/bulletin Bull Malays Math Sci Soc (2) 34(2) (2011), 331 336 On the Poisson Appoximation to the Negative Hypegeometic Distibution
More informationSOME GENERAL NUMERICAL RADIUS INEQUALITIES FOR THE OFF-DIAGONAL PARTS OF 2 2 OPERATOR MATRICES
italian jounal of pue and applied mathematics n. 35 015 (433 44) 433 SOME GENERAL NUMERICAL RADIUS INEQUALITIES FOR THE OFF-DIAGONAL PARTS OF OPERATOR MATRICES Watheq Bani-Domi Depatment of Mathematics
More information3.1 Random variables
3 Chapte III Random Vaiables 3 Random vaiables A sample space S may be difficult to descibe if the elements of S ae not numbes discuss how we can use a ule by which an element s of S may be associated
More informationSOME SOLVABILITY THEOREMS FOR NONLINEAR EQUATIONS
Fixed Point Theoy, Volume 5, No. 1, 2004, 71-80 http://www.math.ubbcluj.o/ nodeacj/sfptcj.htm SOME SOLVABILITY THEOREMS FOR NONLINEAR EQUATIONS G. ISAC 1 AND C. AVRAMESCU 2 1 Depatment of Mathematics Royal
More informationNOTE. Some New Bounds for Cover-Free Families
Jounal of Combinatoial Theoy, Seies A 90, 224234 (2000) doi:10.1006jcta.1999.3036, available online at http:.idealibay.com on NOTE Some Ne Bounds fo Cove-Fee Families D. R. Stinson 1 and R. Wei Depatment
More informationof the contestants play as Falco, and 1 6
JHMT 05 Algeba Test Solutions 4 Febuay 05. In a Supe Smash Bothes tounament, of the contestants play as Fox, 3 of the contestants play as Falco, and 6 of the contestants play as Peach. Given that thee
More informationWhen two numbers are written as the product of their prime factors, they are in factored form.
10 1 Study Guide Pages 420 425 Factos Because 3 4 12, we say that 3 and 4 ae factos of 12. In othe wods, factos ae the numbes you multiply to get a poduct. Since 2 6 12, 2 and 6 ae also factos of 12. The
More informationOn decompositions of complete multipartite graphs into the union of two even cycles
On decompositions of complete multipatite gaphs into the union of two even cycles A. Su, J. Buchanan, R. C. Bunge, S. I. El-Zanati, E. Pelttai, G. Rasmuson, E. Spaks, S. Tagais Depatment of Mathematics
More informationEnumerating permutation polynomials
Enumeating pemutation polynomials Theodoulos Gaefalakis a,1, Giogos Kapetanakis a,, a Depatment of Mathematics and Applied Mathematics, Univesity of Cete, 70013 Heaklion, Geece Abstact We conside thoblem
More informationA NOTE ON VERY WEAK SOLUTIONS FOR A CLASS OF NONLINEAR ELLIPTIC EQUATIONS
SARAJEVO JOURNAL OF MATHEMATICS Vol3 15 2007, 41 45 A NOTE ON VERY WEAK SOLUTIONS FOR A CLASS OF NONLINEAR ELLIPTIC EQUATIONS LI JULING AND GAO HONGYA Abstact We pove a new a pioi estimate fo vey weak
More informationMiskolc Mathematical Notes HU e-issn Tribonacci numbers with indices in arithmetic progression and their sums. Nurettin Irmak and Murat Alp
Miskolc Mathematical Notes HU e-issn 8- Vol. (0), No, pp. 5- DOI 0.85/MMN.0.5 Tibonacci numbes with indices in aithmetic pogession and thei sums Nuettin Imak and Muat Alp Miskolc Mathematical Notes HU
More informationarxiv: v2 [math.ag] 4 Jul 2012
SOME EXAMPLES OF VECTOR BUNDLES IN THE BASE LOCUS OF THE GENERALIZED THETA DIVISOR axiv:0707.2326v2 [math.ag] 4 Jul 2012 SEBASTIAN CASALAINA-MARTIN, TAWANDA GWENA, AND MONTSERRAT TEIXIDOR I BIGAS Abstact.
More informationSyntactical content of nite approximations of partial algebras 1 Wiktor Bartol Inst. Matematyki, Uniw. Warszawski, Warszawa (Poland)
Syntactical content of nite appoximations of patial algebas 1 Wikto Batol Inst. Matematyki, Uniw. Waszawski, 02-097 Waszawa (Poland) batol@mimuw.edu.pl Xavie Caicedo Dep. Matematicas, Univ. de los Andes,
More informationA Multivariate Normal Law for Turing s Formulae
A Multivaiate Nomal Law fo Tuing s Fomulae Zhiyi Zhang Depatment of Mathematics and Statistics Univesity of Noth Caolina at Chalotte Chalotte, NC 28223 Abstact This pape establishes a sufficient condition
More informationVanishing lines in generalized Adams spectral sequences are generic
ISSN 364-0380 (on line) 465-3060 (pinted) 55 Geomety & Topology Volume 3 (999) 55 65 Published: 2 July 999 G G G G T T T G T T T G T G T GG TT G G G G GG T T T TT Vanishing lines in genealized Adams spectal
More informationBerkeley Math Circle AIME Preparation March 5, 2013
Algeba Toolkit Rules of Thumb. Make sue that you can pove all fomulas you use. This is even bette than memoizing the fomulas. Although it is best to memoize, as well. Stive fo elegant, economical methods.
More informationBrief summary of functional analysis APPM 5440 Fall 2014 Applied Analysis
Bief summay of functional analysis APPM 5440 Fall 014 Applied Analysis Stephen Becke, stephen.becke@coloado.edu Standad theoems. When necessay, I used Royden s and Keyzsig s books as a efeence. Vesion
More informationC/CS/Phys C191 Shor s order (period) finding algorithm and factoring 11/12/14 Fall 2014 Lecture 22
C/CS/Phys C9 Sho s ode (peiod) finding algoithm and factoing /2/4 Fall 204 Lectue 22 With a fast algoithm fo the uantum Fouie Tansfom in hand, it is clea that many useful applications should be possible.
More informationKOEBE DOMAINS FOR THE CLASSES OF FUNCTIONS WITH RANGES INCLUDED IN GIVEN SETS
Jounal of Applied Analysis Vol. 14, No. 1 2008), pp. 43 52 KOEBE DOMAINS FOR THE CLASSES OF FUNCTIONS WITH RANGES INCLUDED IN GIVEN SETS L. KOCZAN and P. ZAPRAWA Received Mach 12, 2007 and, in evised fom,
More informationLacunary I-Convergent Sequences
KYUNGPOOK Math. J. 52(2012), 473-482 http://dx.doi.og/10.5666/kmj.2012.52.4.473 Lacunay I-Convegent Sequences Binod Chanda Tipathy Mathematical Sciences Division, Institute of Advanced Study in Science
More informationResults on the Commutative Neutrix Convolution Product Involving the Logarithmic Integral li(
Intenational Jounal of Scientific and Innovative Mathematical Reseach (IJSIMR) Volume 2, Issue 8, August 2014, PP 736-741 ISSN 2347-307X (Pint) & ISSN 2347-3142 (Online) www.acjounals.og Results on the
More informationk. s k=1 Part of the significance of the Riemann zeta-function stems from Theorem 9.2. If s > 1 then 1 p s
9 Pimes in aithmetic ogession Definition 9 The Riemann zeta-function ζs) is the function which assigns to a eal numbe s > the convegent seies k s k Pat of the significance of the Riemann zeta-function
More informationThe Congestion of n-cube Layout on a Rectangular Grid S.L. Bezrukov J.D. Chavez y L.H. Harper z M. Rottger U.-P. Schroeder Abstract We consider the pr
The Congestion of n-cube Layout on a Rectangula Gid S.L. Bezukov J.D. Chavez y L.H. Hape z M. Rottge U.-P. Schoede Abstact We conside the poblem of embedding the n-dimensional cube into a ectangula gid
More informationResearch Article On Alzer and Qiu s Conjecture for Complete Elliptic Integral and Inverse Hyperbolic Tangent Function
Abstact and Applied Analysis Volume 011, Aticle ID 697547, 7 pages doi:10.1155/011/697547 Reseach Aticle On Alze and Qiu s Conjectue fo Complete Elliptic Integal and Invese Hypebolic Tangent Function Yu-Ming
More informationSTUDY OF SOLUTIONS OF LOGARITHMIC ORDER TO HIGHER ORDER LINEAR DIFFERENTIAL-DIFFERENCE EQUATIONS WITH COEFFICIENTS HAVING THE SAME LOGARITHMIC ORDER
UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA doi: 104467/20843828AM170027078 542017, 15 32 STUDY OF SOLUTIONS OF LOGARITHMIC ORDER TO HIGHER ORDER LINEAR DIFFERENTIAL-DIFFERENCE EQUATIONS WITH COEFFICIENTS
More informationMATH 220: SECOND ORDER CONSTANT COEFFICIENT PDE. We consider second order constant coefficient scalar linear PDEs on R n. These have the form
MATH 220: SECOND ORDER CONSTANT COEFFICIENT PDE ANDRAS VASY We conside second ode constant coefficient scala linea PDEs on R n. These have the fom Lu = f L = a ij xi xj + b i xi + c i whee a ij b i and
More informationTHE MAXIMUM SIZE OF A PARTIAL SPREAD II: UPPER BOUNDS
THE MAXIMUM SIZE OF A PARTIAL SPREAD II: UPPER BOUNDS ESMERALDA NĂSTASE MATHEMATICS DEPARTMENT XAVIER UNIVERSITY CINCINNATI, OHIO 4507, USA PAPA SISSOKHO MATHEMATICS DEPARTMENT ILLINOIS STATE UNIVERSITY
More informationA Short Combinatorial Proof of Derangement Identity arxiv: v1 [math.co] 13 Nov Introduction
A Shot Combinatoial Poof of Deangement Identity axiv:1711.04537v1 [math.co] 13 Nov 2017 Ivica Matinjak Faculty of Science, Univesity of Zageb Bijenička cesta 32, HR-10000 Zageb, Coatia and Dajana Stanić
More informationTHE NUMBER OF TWO CONSECUTIVE SUCCESSES IN A HOPPE-PÓLYA URN
TH NUMBR OF TWO CONSCUTIV SUCCSSS IN A HOPP-PÓLYA URN LARS HOLST Depatment of Mathematics, Royal Institute of Technology S 100 44 Stocholm, Sweden -mail: lholst@math.th.se Novembe 27, 2007 Abstact In a
More informationNew problems in universal algebraic geometry illustrated by boolean equations
New poblems in univesal algebaic geomety illustated by boolean equations axiv:1611.00152v2 [math.ra] 25 Nov 2016 Atem N. Shevlyakov Novembe 28, 2016 Abstact We discuss new poblems in univesal algebaic
More informationA POWER IDENTITY FOR SECOND-ORDER RECURRENT SEQUENCES
A OWER IDENTITY FOR SECOND-ORDER RECURRENT SEQUENCES V. E. Hoggatt,., San ose State College, San ose, Calif. and D. A. Lind, Univesity of Viginia, Chalottesville, V a. 1. INTRODUCTION The following hold
More informationStanford University CS259Q: Quantum Computing Handout 8 Luca Trevisan October 18, 2012
Stanfod Univesity CS59Q: Quantum Computing Handout 8 Luca Tevisan Octobe 8, 0 Lectue 8 In which we use the quantum Fouie tansfom to solve the peiod-finding poblem. The Peiod Finding Poblem Let f : {0,...,
More informationA THREE CRITICAL POINTS THEOREM AND ITS APPLICATIONS TO THE ORDINARY DIRICHLET PROBLEM
A THREE CRITICAL POINTS THEOREM AND ITS APPLICATIONS TO THE ORDINARY DIRICHLET PROBLEM DIEGO AVERNA AND GABRIELE BONANNO Abstact. The aim of this pape is twofold. On one hand we establish a thee citical
More informationBounds for Codimensions of Fitting Ideals
Ž. JOUNAL OF ALGEBA 194, 378 382 1997 ATICLE NO. JA966999 Bounds fo Coensions of Fitting Ideals Michał Kwiecinski* Uniwesytet Jagiellonski, Instytut Matematyki, ul. eymonta 4, 30-059, Kakow, Poland Communicated
More informationFailure Probability of 2-within-Consecutive-(2, 2)-out-of-(n, m): F System for Special Values of m
Jounal of Mathematics and Statistics 5 (): 0-4, 009 ISSN 549-3644 009 Science Publications Failue Pobability of -within-consecutive-(, )-out-of-(n, m): F System fo Special Values of m E.M.E.. Sayed Depatment
More informationf h = u, h g = v, we have u + v = f g. So, we wish
Answes to Homewok 4, Math 4111 (1) Pove that the following examples fom class ae indeed metic spaces. You only need to veify the tiangle inequality. (a) Let C be the set of continuous functions fom [0,
More informationPascal s Triangle (mod 8)
Euop. J. Combinatoics (998) 9, 45 62 Pascal s Tiangle (mod 8) JAMES G. HUARD, BLAIR K. SPEARMAN AND KENNETH S. WILLIAMS Lucas theoem gives a conguence fo a binomial coefficient modulo a pime. Davis and
More informationFall 2014 Randomized Algorithms Oct 8, Lecture 3
Fall 204 Randomized Algoithms Oct 8, 204 Lectue 3 Pof. Fiedich Eisenband Scibes: Floian Tamè In this lectue we will be concened with linea pogamming, in paticula Clakson s Las Vegas algoithm []. The main
More informationJANOWSKI STARLIKE LOG-HARMONIC UNIVALENT FUNCTIONS
Hacettepe Jounal of Mathematics and Statistics Volume 38 009, 45 49 JANOWSKI STARLIKE LOG-HARMONIC UNIVALENT FUNCTIONS Yaşa Polatoğlu and Ehan Deniz Received :0 :008 : Accepted 0 : :008 Abstact Let and
More informationOn the Quasi-inverse of a Non-square Matrix: An Infinite Solution
Applied Mathematical Sciences, Vol 11, 2017, no 27, 1337-1351 HIKARI Ltd, wwwm-hikaicom https://doiog/1012988/ams20177273 On the Quasi-invese of a Non-squae Matix: An Infinite Solution Ruben D Codeo J
More informationUsing Laplace Transform to Evaluate Improper Integrals Chii-Huei Yu
Available at https://edupediapublicationsog/jounals Volume 3 Issue 4 Febuay 216 Using Laplace Tansfom to Evaluate Impope Integals Chii-Huei Yu Depatment of Infomation Technology, Nan Jeon Univesity of
More informationarxiv: v1 [math.co] 6 Mar 2008
An uppe bound fo the numbe of pefect matchings in gaphs Shmuel Fiedland axiv:0803.0864v [math.co] 6 Ma 2008 Depatment of Mathematics, Statistics, and Compute Science, Univesity of Illinois at Chicago Chicago,
More informationThe Erdős-Hajnal conjecture for rainbow triangles
The Edős-Hajnal conjectue fo ainbow tiangles Jacob Fox Andey Ginshpun János Pach Abstact We pove that evey 3-coloing of the edges of the complete gaph on n vetices without a ainbow tiangle contains a set
More informationNumerical approximation to ζ(2n+1)
Illinois Wesleyan Univesity Fom the SelectedWoks of Tian-Xiao He 6 Numeical appoximation to ζ(n+1) Tian-Xiao He, Illinois Wesleyan Univesity Michael J. Dancs Available at: https://woks.bepess.com/tian_xiao_he/6/
More informationConnectedness of Ordered Rings of Fractions of C(X) with the m-topology
Filomat 31:18 (2017), 5685 5693 https://doi.og/10.2298/fil1718685s Published by Faculty o Sciences and Mathematics, Univesity o Niš, Sebia Available at: http://www.pm.ni.ac.s/ilomat Connectedness o Odeed
More informationCOLLAPSING WALLS THEOREM
COLLAPSING WALLS THEOREM IGOR PAK AND ROM PINCHASI Abstact. Let P R 3 be a pyamid with the base a convex polygon Q. We show that when othe faces ae collapsed (otated aound the edges onto the plane spanned
More information(received April 9, 1967) Let p denote a prime number and let k P
ON EXTREMAL OLYNOMIALS Kenneth S. Williams (eceived Apil 9, 1967) Let p denote a pime numbe and let k denote the finite field of p elements. Let f(x) E k [x] be of fixed degee d 2 2. We suppose that p
More informationA Crash Course in (2 2) Matrices
A Cash Couse in ( ) Matices Seveal weeks woth of matix algeba in an hou (Relax, we will only stuy the simplest case, that of matices) Review topics: What is a matix (pl matices)? A matix is a ectangula
More informationNew Finding on Factoring Prime Power RSA Modulus N = p r q
Jounal of Mathematical Reseach with Applications Jul., 207, Vol. 37, o. 4, pp. 404 48 DOI:0.3770/j.issn:2095-265.207.04.003 Http://jme.dlut.edu.cn ew Finding on Factoing Pime Powe RSA Modulus = p q Sadiq
More informationOn a quantity that is analogous to potential and a theorem that relates to it
Su une quantité analogue au potential et su un théoème y elatif C R Acad Sci 7 (87) 34-39 On a quantity that is analogous to potential and a theoem that elates to it By R CLAUSIUS Tanslated by D H Delphenich
More informationq i i=1 p i ln p i Another measure, which proves a useful benchmark in our analysis, is the chi squared divergence of p, q, which is defined by
CSISZÁR f DIVERGENCE, OSTROWSKI S INEQUALITY AND MUTUAL INFORMATION S. S. DRAGOMIR, V. GLUŠČEVIĆ, AND C. E. M. PEARCE Abstact. The Ostowski integal inequality fo an absolutely continuous function is used
More informationTHE CONE THEOREM JOEL A. TROPP. Abstract. We prove a fixed point theorem for functions which are positive with respect to a cone in a Banach space.
THE ONE THEOEM JOEL A. TOPP Abstact. We pove a fixed point theoem fo functions which ae positive with espect to a cone in a Banach space. 1. Definitions Definition 1. Let X be a eal Banach space. A subset
More informationOLYMON. Produced by the Canadian Mathematical Society and the Department of Mathematics of the University of Toronto. Issue 9:2.
OLYMON Poduced by the Canadian Mathematical Society and the Depatment of Mathematics of the Univesity of Toonto Please send you solution to Pofesso EJ Babeau Depatment of Mathematics Univesity of Toonto
More informationSecret Exponent Attacks on RSA-type Schemes with Moduli N = p r q
Secet Exponent Attacks on RSA-type Schemes with Moduli N = p q Alexande May Faculty of Compute Science, Electical Engineeing and Mathematics Univesity of Padebon 33102 Padebon, Gemany alexx@uni-padebon.de
More informationTHE JEU DE TAQUIN ON THE SHIFTED RIM HOOK TABLEAUX. Jaejin Lee
Koean J. Math. 23 (2015), No. 3, pp. 427 438 http://dx.doi.og/10.11568/kjm.2015.23.3.427 THE JEU DE TAQUIN ON THE SHIFTED RIM HOOK TABLEAUX Jaejin Lee Abstact. The Schensted algoithm fist descibed by Robinson
More informationCONSTRUCTION OF EQUIENERGETIC GRAPHS
MATCH Communications in Mathematical and in Compute Chemisty MATCH Commun. Math. Comput. Chem. 57 (007) 03-10 ISSN 0340-653 CONSTRUCTION OF EQUIENERGETIC GRAPHS H. S. Ramane 1, H. B. Walika * 1 Depatment
More informationMean Curvature and Shape Operator of Slant Immersions in a Sasakian Space Form
Mean Cuvatue and Shape Opeato of Slant Immesions in a Sasakian Space Fom Muck Main Tipathi, Jean-Sic Kim and Son-Be Kim Abstact Fo submanifolds, in a Sasakian space fom, which ae tangential to the stuctue
More informationProblem Set #10 Math 471 Real Analysis Assignment: Chapter 8 #2, 3, 6, 8
Poblem Set #0 Math 47 Real Analysis Assignment: Chate 8 #2, 3, 6, 8 Clayton J. Lungstum Decembe, 202 xecise 8.2 Pove the convese of Hölde s inequality fo = and =. Show also that fo eal-valued f / L ),
More informationAuchmuty High School Mathematics Department Advanced Higher Notes Teacher Version
The Binomial Theoem Factoials Auchmuty High School Mathematics Depatment The calculations,, 6 etc. often appea in mathematics. They ae called factoials and have been given the notation n!. e.g. 6! 6!!!!!
More informationMultiple Criteria Secretary Problem: A New Approach
J. Stat. Appl. Po. 3, o., 9-38 (04 9 Jounal of Statistics Applications & Pobability An Intenational Jounal http://dx.doi.og/0.785/jsap/0303 Multiple Citeia Secetay Poblem: A ew Appoach Alaka Padhye, and
More informationQIP Course 10: Quantum Factorization Algorithm (Part 3)
QIP Couse 10: Quantum Factoization Algoithm (Pat 3 Ryutaoh Matsumoto Nagoya Univesity, Japan Send you comments to yutaoh.matsumoto@nagoya-u.jp Septembe 2018 @ Tokyo Tech. Matsumoto (Nagoya U. QIP Couse
More informationFunctions Defined on Fuzzy Real Numbers According to Zadeh s Extension
Intenational Mathematical Foum, 3, 2008, no. 16, 763-776 Functions Defined on Fuzzy Real Numbes Accoding to Zadeh s Extension Oma A. AbuAaqob, Nabil T. Shawagfeh and Oma A. AbuGhneim 1 Mathematics Depatment,
More informationGROWTH ESTIMATES THROUGH SCALING FOR QUASILINEAR PARTIAL DIFFERENTIAL EQUATIONS
Annales Academiæ Scientiaum Fennicæ Mathematica Volumen 32, 2007, 595 599 GROWTH ESTIMATES THROUGH SCALING FOR QUASILINEAR PARTIAL DIFFERENTIAL EQUATIONS Teo Kilpeläinen, Henik Shahgholian and Xiao Zhong
More informationChapter Eight Notes N P U1C8S4-6
Chapte Eight Notes N P UC8S-6 Name Peiod Section 8.: Tigonometic Identities An identit is, b definition, an equation that is alwas tue thoughout its domain. B tue thoughout its domain, that is to sa that
More informationWhat Form of Gravitation Ensures Weakened Kepler s Third Law?
Bulletin of Aichi Univ. of Education, 6(Natual Sciences, pp. - 6, Mach, 03 What Fom of Gavitation Ensues Weakened Keple s Thid Law? Kenzi ODANI Depatment of Mathematics Education, Aichi Univesity of Education,
More information10/04/18. P [P(x)] 1 negl(n).
Mastemath, Sping 208 Into to Lattice lgs & Cypto Lectue 0 0/04/8 Lectues: D. Dadush, L. Ducas Scibe: K. de Boe Intoduction In this lectue, we will teat two main pats. Duing the fist pat we continue the
More informationPermutations and Combinations
Pemutations and Combinations Mach 11, 2005 1 Two Counting Pinciples Addition Pinciple Let S 1, S 2,, S m be subsets of a finite set S If S S 1 S 2 S m, then S S 1 + S 2 + + S m Multiplication Pinciple
More informationKANTOROVICH TYPE INEQUALITIES FOR THE DIFFERENCE WITH TWO NEGATIVE PARAMETERS. Received April 13, 2010; revised August 18, 2010
Scientiae Matheaticae Japonicae Online, e-200, 427 439 427 KANTOROVICH TYPE INEQUALITIES FOR THE DIFFERENCE WITH TWO NEGATIVE PARAMETERS Young Ok Ki, Jun Ichi Fujii, Masatoshi Fujii + and Yuki Seo ++ Received
More information6 Matrix Concentration Bounds
6 Matix Concentation Bounds Concentation bounds ae inequalities that bound pobabilities of deviations by a andom vaiable fom some value, often its mean. Infomally, they show the pobability that a andom
More informationarxiv: v1 [math.co] 1 Apr 2011
Weight enumeation of codes fom finite spaces Relinde Juius Octobe 23, 2018 axiv:1104.0172v1 [math.co] 1 Ap 2011 Abstact We study the genealized and extended weight enumeato of the - ay Simplex code and
More informationQuasi-Randomness and the Distribution of Copies of a Fixed Graph
Quasi-Randomness and the Distibution of Copies of a Fixed Gaph Asaf Shapia Abstact We show that if a gaph G has the popety that all subsets of vetices of size n/4 contain the coect numbe of tiangles one
More informationANA BERRIZBEITIA, LUIS A. MEDINA, ALEXANDER C. MOLL, VICTOR H. MOLL, AND LAINE NOBLE
THE p-adic VALUATION OF STIRLING NUMBERS ANA BERRIZBEITIA, LUIS A. MEDINA, ALEXANDER C. MOLL, VICTOR H. MOLL, AND LAINE NOBLE Abstact. Let p > 2 be a pime. The p-adic valuation of Stiling numbes of the
More informationConstruction and Analysis of Boolean Functions of 2t + 1 Variables with Maximum Algebraic Immunity
Constuction and Analysis of Boolean Functions of 2t + 1 Vaiables with Maximum Algebaic Immunity Na Li and Wen-Feng Qi Depatment of Applied Mathematics, Zhengzhou Infomation Engineeing Univesity, Zhengzhou,
More information6 PROBABILITY GENERATING FUNCTIONS
6 PROBABILITY GENERATING FUNCTIONS Cetain deivations pesented in this couse have been somewhat heavy on algeba. Fo example, detemining the expectation of the Binomial distibution (page 5.1 tuned out to
More informationIntegral operator defined by q-analogue of Liu-Srivastava operator
Stud. Univ. Babeş-Bolyai Math. 582013, No. 4, 529 537 Integal opeato defined by q-analogue of Liu-Sivastava opeato Huda Aldweby and Maslina Daus Abstact. In this pape, we shall give an application of q-analogues
More informationAn Application of Fuzzy Linear System of Equations in Economic Sciences
Austalian Jounal of Basic and Applied Sciences, 5(7): 7-14, 2011 ISSN 1991-8178 An Application of Fuzzy Linea System of Equations in Economic Sciences 1 S.H. Nassei, 2 M. Abdi and 3 B. Khabii 1 Depatment
More information