ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
|
|
- Eustace Briggs
- 5 years ago
- Views:
Transcription
1 ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an Dirichlet convolution exhibits many nontrivial properties. In this paper, we elineate an prove several of these properties, an consier ways to quantify the behavior of certain functions. Contents 1. Introuction 1 2. The Space of Arithmetic Functions 2 3. A is an Integral Domain 3 4. Möbius Inversion an Relate Results 5 5. Polynomials in A 8 6. The Growth of Arithmetic Functions 13 References Introuction Consier a function ϱ : N N given by the recursive efinition ϱ(n = 1, if n = 1; ϱ(, if n > 1. n,<n This function, efine on the natural numbers, is an example of an arithmetic function. It exhibits erratic behavior in many ways: for example, for values of n with few prime factors it remains small, but it quickly grows arbitrarily large if n has many prime factors. However, using the techniques of analytic number theory, the behavior of this an relate functions can be quantitatively stuie. In this paper, we examine the properties of various important arithmetic functions an consier the space of such functions, equippe with the operations of aition, multiplication, an Dirichlet convolution. We also euce several facts about the existence an properties of roots of polynomials with arithmetic functions as coefficients. 1
2 2 MARK SCHACHNER 2. The Space of Arithmetic Functions In this section we introuce the concept of an arithmetic function, an efine a space of arithmetic functions with several operations. We then isolate a few specific functions which will be of use later. Definition 2.1. An arithmetic function is a complex-value function which is efine on the natural numbers, i.e., a function of the form f : N C. These functions are also known as number-theoretic functions, which is inicative of their interpretation as encoings of specific properties of the natural numbers. Definition 2.2. In this paper, we enote the set of arithmetic functions as A. We also equip A with the operation + : A A A given by, for f, g A, (f + g(n = f(n + g(n for all n N. Throughout this paper, we will enote arbitrary arithmetic functions by f, g, h, as well as A k for k N. Later, we will efine polynomial functions from A to itself, which will commonly be enote F, G, H. We also efine one other binary operation on A, which is important enough to merit its own efinition. Definition 2.3. Let f, g A. The Dirichlet convolution (or simply convolution of f, g, enote f g, is the function given by, for each n N, (f g(n = ( n f(g, n or, equivalently, (f g(n = f(ag(b. These two efinitions are equivalent via the substitution a =, b = n a = n. The following elements of A are important in the stuy of arithmetic functions: Definition 2.4. (i The ientity function ε A is given by, for each n N, { 1, if n = 1, ε(n = 0, otherwise. (ii The constant functions 0, 1 A are given by 1(n = 1 an 0(n = 0 for each n N. (iii The ivisor function σ i A, efine for each i C, is given by σ i (n = n i. for each n N. In this paper we enote σ 0 by τ an σ 1 by σ. Note that, while convolution will play a role similar to multiplication in this paper, the function 1 is not the ientity with respect to convolution.
3 ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS 3 3. A is an Integral Domain First, we evelop arithmetic on A an prove several statements regaring its algebraic structure. Lemma 3.1. The operation is commutative, associative, an istributive over aition. Proof. First, we show that convolution is commutative. To observe this, we use the secon efinition from Definition 2.3: (f g(n = f(ag(b = g(af(b = (g f(n. To show that convolution is associative, we again use the secon efinition: (f (g h(n = f(a (g h(b = ( f(a g(ch( c=b = ac=n = e=n ac=e f(ag(ch( f(ag(ch( = ((f g h(n. Lastly, we show that convolution istributes over aition: (f (g + h(n = f(a (g + h(b = f(ag(b + f(ah(b = f(ag(b + f(ah(b = (f g(n + (f h(n. We next prove an important result about the role of ε with respect to Dirichlet convolution: Lemma 3.2. The function ε A is the ientity element with respect to Dirichlet convolution, i.e., ε f = f ε = f for all f A. Proof. Fix some f A, an observe that, for all n N, (f ε(n = ( n f( ε n = f(nε(1 + ( n f( ε = f(n, n,<n
4 4 MARK SCHACHNER since ε ( n = 0 when < n. That ε f = f ε = f follows from Lemma 3.1. We can now make the following important statement about A: Theorem 3.3. The set A, along with the operations + an, forms a commutative ring. Proof. Pointwise aition is trivially commutative an associative, an has the ientity element 0 A, where 0(n = 0 for all n N. Furthermore, for any f A we efine f as the function such that ( f(n = (f(n for each n N; this represents the aitive inverse of the element f. From Lemma 3.1 an Lemma 3.2, we have that convolution is commutative, associative, an has an ientity element ε A. Lastly, from Lemma 3.1, we have that convolution istributes over aition. There, is, however, aitional algebraic structure on A with respect to convolution as emonstrate by the following lemma: Lemma 3.4. Suppose f A.Then there exists f 1 A such that f f 1 = ε if an only if f(1 0. Proof. To show the forwar irection, let f A an suppose that there exists f 1 A such that f f 1 = ε. Observe that f(1f 1 (1 = (f f 1 (1 = ε(1 = 1, so f 1 (1 = 1 f(1. Hence f(1 0. To show the backwar irection, fix f A such that f(1 0. We will show that g(n can be uniquely efine such that (f g(n = ε(n, proceeing by inuction on n : Base Case. Let n = 1 an g(1 = 1 f(1. Since f(1 0, we have g(1 is wellefine, an this efinition satisfies (f g(1 = f(1g(1 = 1 = ε(1. 1 Furthermore, any value of g(1 which satisfies the above must equal f(1, so this g(1 is efine uniquely. Inuctive Step. Fix n N an suppose that for each k < n we have that g(k is well-efine an unique. We now efine g(n as follows: g(n = 1 f(1 n,>1 f(g ( n. Observe that g(n is well-efine for each n N, since f(1 0 an n N, n < n, so g ( n is uniquely efine by the inuctive hypothesis for each n, > 1. Now, we show f g = ε. We have two cases: n = 1 an n > 1. If n = 1, then as before (f g(n = f(1g(1 = ε(n. If n > 1, then (f g(n = ( n f(g n = f(1g(n + ( n f(g n,>1 = f(1g(n f(1g(n = 0 = ε(n.
5 ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS 5 Thus g is the unique arithmetic function such that f g = ε, so for each f A where f(1 0, we can let f 1 = g so that f f 1 = ε. Again, that f 1 f = ε follows from the commutativity of Dirichlet convolution. Motivate by Lemma 3.4, we make the following efinition: Definition 3.5. A function f A is calle invertible if f(1 0. Using this property we can euce aitional algebraic structure on A : Theorem 3.6. The set A has no zero ivisors, i.e., if f, g A an f g = 0, then at least one of f = 0, g = 0 hols. Proof. We prove the contrapositive, that is, if f, g 0 then f g 0. Suppose f, g 0; we have that the sets M = {n N f(n 0} an N = {n N g(n 0} are nonempty. Let m, n be the least elements of M, N respectively, an consier the evaluation of f g at mn : (f g(mn = f(ag(b. ab=mn Now, each term on the right is of the form f(ag(b where ab = mn. For each of these terms, we have either a = m an b = n, in which case f(ag(b = f(mg(n 0, or one of a < m, b < n, in which case f(ag(b = 0 since we assume m, n were the least elements of M, N. Thus there is exactly one nonzero term on the right sie, so the right sie is nonzero; hence the left sie must also be nonzero, so f g 0. The combination of Theorems 3.3 an 3.6 gives the following result: Theorem 3.7. The set A, along with the operations of pointwise aition an Dirichlet convolution, forms an integral omain. Note that, since the conition that f(1 0 is weaker than the conition that f 0, Theorem 3.7 an Lemma 3.4 o not imply that A is a fiel. Inee, the existence of elements in A without inverses uner convolution will have consequences when we consier roots of polynomials in A. 4. Möbius Inversion an Relate Results In this section, we efine an arithmetic function introuce by Möbius in 1832, an prove several results regaring its relationship with other arithmetic functions. Definition 4.1. The Möbius function µ A is given by, for each n N, 1 if n is a prouct of an o number of istinct primes; µ(n = 1 if n is a prouct of an even number of istinct primes; 0 otherwise. Equivalently, if n is ivisible by the square of a prime number, then µ(n = 0; otherwise, µ(n = ( 1 ω(n, where ω(n enotes the number of prime factors of n. To iscuss the following results more concisely, we nee the following lemma, which soliifies the connection between ivisor sums an convolution: Lemma 4.2. For any f A, (f 1(n = n f(.
6 6 MARK SCHACHNER Proof. By efinition, (f 1(n = n f(1 ( n. Since 1(n = 1 for all n N, the lemma follows. Some results which follow from Lemma 4.2 are: (i 1 1 = τ (see Definition 2.4 (ii 1 } 1 {{ 1 } = τ n (see Definition 6.3 n times (iii 1 N = σ, where N(n = n for all n N Since µ is invertible, it is natural to ask what its inverse is uner Dirichlet convolution. The below theorem gives the surprising answer: Theorem 4.3. µ 1 = ε. The following lemma will prove useful to prove Theorem 4.3: Lemma 4.4. Let S be a finite nonempty set. Then the sets {S S : S is even} an {S S : S o} have the same carinality. Proof. We have two cases: S is o an S is even. If S is o, then we construct a bijection as follows: Fix some subset of S S. Trivially, S + S \ S = S, an, since S is o, this implies that S an S \ S have opposite parity. Thus each subset of S correspons to exactly one other subset of S such that every evensize subset correspons to an o-size subset, an vice versa. Hence we have a bijection between the set of even-size subsets of S an o-size subsets of S. If S is even, then we first fix some element p S. We construct a function f from the power set of S to itself as follows: for any subset S of S, p f(s if an only if p S, an for each element k S \ {p}, we have k f(s if an only if k S. Now, f is a bijection an has the property that if S has n elements, then f(s has either ( S + 1 n or ( S 1 n elements, epening on whether p S. However, since S is even, both S +1 an S 1 are o, so S + f(s is o for each S S. Similarly to the above, this implies that S an f(s have opposite parity; hence we again have a bijection between the even- an o-size subsets of S. Thus the lemma is prove. Now, we move on to the proof of Theorem 4.3. Proof of Theorem 4.3. If n = 1, then (µ 1(n = µ(1 = 1 = ε(n as require, so suppose n > 1. By Lemma 4.2, 1 µ = n µ(, so we nee to show that the sum of µ( across all of the ivisors of n is equal to ε(n. Since µ(n = 0 unless n is squarefree, we nee only consier the sum across all squarefree ivisors of n. Consier the set P n = {p 1, p 2,..., p m } of istinct prime factors of n; choosing a squarefree ivisor of n is equivalent to choosing some subset of P n. Observe that, for any subset A of P n, the value of µ at the squarefree ivisor which A represents is 1 if A is even an 1 if A is o. Since n > 1 we have P n is nonempty, so by Lemma 4.4 P n has an equal number of even- an o-size subsets. Thus each positive 1 in the sum is cancele by a -1 an the sum of µ across all subsets of P n is zero. The theorem follows. Since Theorem 4.3 states that the Möbius function is the inverse of the constant function 1 uner Dirichlet convolution, it is often calle Möbius inversion, although the name is also given to the following corollary:
7 ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS 7 Corollary 4.5 (Möbius Inversion. Let f, g A such that for any n N we have (4.6 f(n = n Then (4.7 g(n = n g(. ( n f(µ. Proof. By Lemma 4.2, (4.6 is equivalent to f = g 1. Convolving on both sies by µ, we obtain f µ = g 1 µ = g by Theorem 4.3. By efinition this is equivalent to eq. (4.7. As an application of Dirichlet convolution an Möbius inversion, we return to our function ϱ from Section 1. We have, for all n, ϱ(n = ε(n + ϱ(. So n,<n 2ϱ(n = ε(n + n ϱ( Thus we have = ε(n + (ϱ 1(n. (4.8 2ϱ = ε + ϱ 1 (2ϱ µ = ε µ + ϱ 1 µ 2(ϱ µ = µ + ϱ ϱ(n = µ(n + ( 2ϱ(n + ϱ(n = µ(n + n,>1 n,>1 ( 2µ(ϱ ( n ( 2µ(ϱ ( n. By evaluating eq. (4.8 at n an substituting for ϱ ( n, we obtain ϱ(n = µ(n + 1 n, 1>1 + ( n ( 2µ( 1 µ 1 n, 1>1 2 n, 1 2> m=n 1, 2,..., m 1>1 1 ( n ( 2 2 µ( 1 µ( 2 ϱ 1 2 Repeating this process of substitution, we arrive at ϱ(n = µ(n + ( 2 ( m n µ( i µ m which is a non-recursive efinition for ϱ. In general, for each k C we can efine a function ϱ k A which satisfies the functional equation i m kϱ k = (k 1ε + ϱ k 1,.,
8 8 MARK SCHACHNER where the factor (k 1 is inclue so ϱ k (1 = 1 for all k C. By a similar argument to the above, the solution to this functional equation is given by ( m k ( n ϱ k (n = µ(n + µ( i µ, 1 k m m=n 1, 2,..., m 1>1 a fact which has as a corollary ϱ 0 = µ. Thus Möbius inversion can be useful in etermining solutions to functional equations involving Dirichlet convolution. i m 5. Polynomials in A In this section, we evelop the theory of polynomials in A, an euce several results about the existence an properties of their roots. We begin with several efinitions. Definition 5.1. Let f A. We enote the repeate convolution f f f by }{{} n times f n, an set f 0 = ε. Definition 5.2. (i A polynomial in A is an expression of the form n A i X i = A 0 + A 1 X + A 2 X A n X n, i=0 where A 0, A 1,..., A n A such that A n 0 an X is an ineterminate. (ii The natural number n is calle the egree of the polynomial. (iii The elements A 0, A 1,..., A n are calle the coefficients or coefficient functions of the polynomial, with A n specifically calle the leaing coefficient. (iv If F is a polynomial in A an F(g = 0 for some g A, we call g a root of F. We enote the set of polynomials in A by A[X]. Since A is a ring, A[X] inherits the operations of aition, pointwise multiplication an Dirichlet convolution efine over A, so for any polynomials F, G A[X] we let (F + G(X = F(X + G(X an (F G(X = F(X G(X. Theorem 5.3. Let A 0, A 1 A such that A 1 is invertible. Then the polynomial F(X = A 0 + A 1 X has a single unique root. Proof. Since A 1 is invertible, there exists a unique arithmetic function A 1 1 such that A 1 A 1 1 = ε. Let g = A 0 A 1 1. Now F(g = 0. Also, this root is unique because any root g of F must satisfy A 0 A 1 1 = g, an the inverse of A 1 is unique by Lemma 3.4. There is also an analog to the quaratic formula for polynomials in A with all coefficients invertible. To prove this, we first nee the following lemma: Lemma 5.4. Let f A be invertible. g 1, g 2 A such that g 1 g 1 = g 2 g 2 = f. Then there exist exactly two functions Proof. For each natural number n, let L(n enote the sum of the exponents in the prime factorization of n. (For instance, since 288 = , we have L(288 = 5+2 = 7. We will show that we can always uniquely efine g 1 (n, g 2 (n by inuction on L(n.
9 ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS 9 Base Case. Let L(n = 0, so n = 1. If we efine g 1 (1 as the principal square root of f(1 an g 2 (1 as the negative square root of f(1, then we have that (g 1 g 1 (1 = f(1 = (g 2 g 2 (1. Moreover, any function h which satisfies (h h(1 = f(1 must satisfy h(1 2 = f(1, so g 1, g 2 are both well-efine an the only functions which satisfy the require property if L(n = 0. Inuctive Step. Suppose that for some n N we have that if L(s n then g 1 (s, g 2 (s are uniquely well-efine. Fix some m N such that L(m = n + 1 an let (5.5 (5.6 g 1 (m = 1 2g 1 (1 g 2 (m = 1 2g 2 (1 f(m m 1<<m f(m m 1<<m ( m g 1 (g 1, ( m g 2 (g 2 We first show that the above efinitions are well-efine. We have efine g 1 (1, g 2 (1 to be the principal an negative square roots of f(1; since f(1 0 by hypothesis, we thus have that 2g 1 (1, 2g 2 (1 0. Next, observe that for all m such that 1 < < m we have L(, L( m < L(m = n + 1, so by our inuctive hypothesis the above expressions are well-efine. Furthermore, since a rearrangement of the above yiels f(m = ( m g i (g i = (g i g i (m, m for i = 1, 2, any function h A which satisfies h h = f must satisfy one of (5.5,(5.6. Thus g 1 an g 2 are uniquely well-efine for any k N such that (k = n + 1. Hence the inuctive proof is complete. As the above lemma shows, for an invertible function f A, the principal Dirichlet square root (written g 1 above is well-efine; going forwar we enote this by f 1/2. This square root has many of the same properties as the usual square root; in particular, f 1/2 g 1/2 is a square root of f g for all invertible f, g A. It is also important to note that, while Lemma 5.4 states that all invertible functions have square roots uner convolution, there exist non-invertible functions both with an without square roots. As an example of a non-invertible function with a square root, consier the class of functions δ k given by, for each n, k N, { 1 if n = k, δ k (n = 0 otherwise. Then the function δ k 2, which is only invertible if k = 1, has δ k as a square root uner convolution. As an example of a non-invertible function without a square root, consier the function 1 ε, which evaluates to 0 if n = 1 an 1 otherwise. Suppose for contraiction that this function has a square root s A. Since s(1s(1 = (s s(1 = (1 ε(1 = 0, we must have s(1 = 0. But this implies 1 = (1 ε(2 = (s s(2 = s(1s(2 + s(2s(1 = 0, a contraiction. Hence s cannot exist.
10 10 MARK SCHACHNER Theorem 5.7 (Quaratic Formula. Let A, B, C A such that A an B 2 4A C are invertible. Then there exist exactly two roots f 1, f 2 A of the polynomial (5.8 A X 2 + B X + C, an these functions are given by f 1 = ( B + (B 2 4A C 1/2 (2A 1, f 2 = ( B (B 2 4A C 1/2 (2A 1. Proof. The majority of the proof is completely analogous to the usual erivation of the quaratic formula, rearranging (5.8 to obtain (5.9 (f B (2A 1 2 = (B 2 4A C (4A 2 1. Since the right sie is invertible, so is the left sie, so by Lemma 5.4 we can take the Dirichlet square root of both sies, an arrive at the formula specifie by the theorem. We now turn to proving the general case, a partial analog of the Funamental Theorem of Algebra for A. Definition Let F A[X] be given by n F(X = A i X i = A 0 + A 1 x + + A n X n. i=0 The formal erivative of F is enote F an given by n F (X = ia i X n 1 = A 1 + 2A 2 X + + na n X n 1. i=1 Definition Let F A[X]. The base polynomial of F, enote P F, is the polynomial over C whose coefficients are the coefficient functions of F evaluate at 1, i.e., if F(X = A 0 + A 1 X + + A n X n, then P F (x = A 0 (1 + A 1 (1x + + A n (1x n. The formal erivative an base polynomial of a polynomial over A interact in the following important way: Lemma Let F A[X]. Then P F = (P F, where the prime on the right-han sie enotes the erivative in the usual sense. Proof. Suppose F(X = A 0 + A 1 X + + A n X n. The coefficients of F are then A 1, 2A 2, 3A 3,..., na n, so we have (5.13 P F (x = A 1 (1 + 2A 2 (1x + + na n (x n 1. Also, since P F (x = A 0 (1 + A 1 (1x + + A n (1x n, taking the erivative as usual yiels P F(x = A 1 (1 + 2A 2 (1x + + na n (1x n 1, which is ientical to eq. (5.13. Given this fact, we make the following statement, the main theorem of this section: Theorem Let F A[X] be a polynomial over A of egree at least 1 such that P F has a root in C of multiplicity 1. Then F has a root g A.
11 ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS 11 Proof. The proof runs similarly to those of Lemmas 3.4 an 5.4, in that we will show that for any n N we can well-efine g(n such that F(g(n = 0, inucting on L(n. Base Case. Let L(n = 0, so n = 1. By hypothesis P F has a simple root r C; let g(1 = r. Now, we have F(g(1 = A 0 (1 + A 1 (1g(1 + + A n (1g(1 n = P F (g(1 = 0. Inuctive Step. Suppose that for some n N we have that if L(s n then g(s is well-efine. Fix some m N such that L(m = n + 1 an let (5.15 (( 1 n g(m = F A j (mg(1 j (g(1 j=0 ( n+1=m 1, 2,..., n+1 m A 0 ( 1 g( n+1 τ n (m/ 1 + A 1( 1 g( 2 g( 3... n+1 τ n 1 (m/( A 0( 1 g( 2 g( 3...g( n+1 τ 1 (1, where τ k (n counts the number of ways to write n as a prouct of k natural numbers. We first justify that this lengthy efinition is well-efine. By Lemma 5.12, F (g(1 = P F (g(1 = (P F (g(1. Since g(1 is a root of P F of multiplicity 1, we can not have that (P F (g(1 = 0. Next, observe that, in the secon summation, g is always evaluate at a proper ivisor of m; since L( < L(m for all proper ivisors of m, by our inuctive hypothesis g is well-efine wherever it is evaluate in eq. (5.15. Lastly, since τ k (n > 0 for all n, k N, each of the fractions in the secon summation is well efine. Thus g(m exists an is uniquely efine for each m N. We now show that, uner the efinition provie by eq. (5.15, F(g(m = 0 for all m N. We begin by multiplying both sies of eq. (5.15 by F (g(1 an aing g(m F (g(1 to both sies. This yiels
12 12 MARK SCHACHNER ( n n ( = ia i (1g(1 i 1 g(m + A j (mg(1 j + i= n+1=m 1, 2,..., n+1 m A 0 ( 1 g( n+1 τ n (m/ 1 j=0 + + A 0( 1 g( 2 g( 3...g( n+1 τ 1 (1 Now, by using the fact that τ k (n counts the number of ways to write n as a prouct of k natural numbers, we can represent the thir sum by 1 2=m 1, 2 m A 1 ( 1 g( =m 1, 2, 3 m + + A 1 ( 1 g( 2 g( n+1=m 1,..., n+1 m A 1 ( 1 g( 2...g( n+1. Lastly, observe that each of the terms in the first an secon summations of eq. (5.16 correspons to exactly one of the factorizations 1, 2,..., n+1 where k = m for some 1 k n + 1; that is, the first an secon sums are exactly the extra terms we exclue when we specifie that 1, 2,... n+1 m. Combining these facts, we can rewrite eq. (5.16 as ( ( 0 = A 0 (m + A 1 ( 1 g( 2 + A 1 ( 1 g( 2 g( 3 1 2=m =m n+1=m. A 1 ( 1 g( 2...g( n+1 = A 0 (m + (A 1 g(m + (A 2 g 2 (m + + (A n g n (m, which is our esire result. By repeate application of Theorem 5.14, we also have the following corollary: Corollary Let F A[X] such that P F has n simple roots. Then F has at least n roots, counte with multiplicity. Note that we have shown that the existence of a simple root of P F is a sufficient conition for F to have a root, but this conition is by no means necessary. The complexity in fining a necessary an sufficient conition for F to have a root stems largely from the existence of non-invertible arithmetic functions, as we state in Section 3.
13 ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS The Growth of Arithmetic Functions Having examine the elements of A algebraically, we now consier them analytically, an explore several techniques for quantifying their behavior. We begin with a efinition which will form the core of this section: Definition 6.1. Let f, g A. We say f is an average orer of g if f(n lim x g(n = 1. Average orers allow one to smooth out the erratic behavior of an arithmetic function, in the sense that arithmetic functions with unpreictable growth often have average orers with preictable growth. As a classical example, we present the following proof of an average orer of τ, the ivisor-counting function: Theorem 6.2. The function log(n is an average orer of τ. Proof. We wish to fin a function f A which satisfies the asymptotic formula τ(n. f(n Since τ(n = 1, this can be rewritten as f(n ab x We will follow Dirichlet s proof, a metho now commonly calle the Dirichlet hyperbola metho. Observe that the right-han sie can be interprete as counting the number of lattice points uner the hyperbola ab = x (See Fig. 1. In orer to enumerate these points, we ivie the figure into three overlapping sectors: where a x, where b x, an where a, b x. We then subtract off the overlap to obtain the formula: 1 Since x log x = τ(n = ab x = a x b x a = x + a a x a x 1. b x a x b b x = 2x 1 x 2 a = O(x log x. log x, we obtain that lim x log(x τ(n = 1. a,b x x b x 2 1
14 14 MARK SCHACHNER Figure 1. The sum of τ(n over all n x can be interprete as counting the lattice points uner the hyperbola ab = x. Here x = 12 an the number of points is 35. Hence log n is an average orer for τ. The above argument is in fact generalizable to a class of arithmetic functions which we now efine: Definition 6.3. The k-th Piltz function τ k, efine for each k N, counts the number of ways to express n as an orere prouct of k natural numbers. For example, τ 3 (6 = 9 because 6 = = = = = = = = = (To justify the reuse of notation, observe that τ as efine in Definition 2.4(iii is equal to τ 2. Aitionally, for each k N, the k-th ivisor summatory function
15 ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS 15 is enote D k an given by the sum D k (x = τ k (n. By consiering the sum as an enumeration of the number of k-imensional lattice points in R k uner the hyperbolic surface a 1 a 2...a k = x, it can be shown that D k (x = xp k (log x + k (x, where P k is a polynomial of egree k 1 an k is an error term. Thus (log n k 1 is an average orer for τ k. One can use similar techniques to boun the values of arithmetic functions, as emonstrate by the following analysis of the behavior of ϱ: Theorem 6.4. (i For all x > 3, ϱ(n (x 1 log 2 (x. (ii For all x N, ϱ(n x(log x 1. Proof. (i For x N, let P (x = ϱ(n. First, observe that since ϱ(n = n <n = 1 n ϱ( ϱ( <n 2< 1 =... =... 1 n 1, 2 1 1<n 2< 1 s 1 s s 1< s we may characterize ϱ combinatorially as the number of orere factorizations of n. Thus, P (x counts the number of orere tuples of natural numbers (excluing 1 in each tuple an incluing the empty tuple {Ø} whose prouct oes not excee x. Since the maximum length of such a tuple is log 2 (x (as long as x 4 an each natural number in such a tuple must be less than or equal to x, we may thus boun P (x above by (x 1 log 2 (x. (ii As above, we will use the combinatorial interpretation of ϱ an P. Fix x N. Of length 0, there is one tuple whose prouct is at most x, an of length 1 there are x 1 tuples whose prouct is at most x. Also, for each n x, there are x n 1 tuples of length 2 whose prouct is at most x. Summing these
16 16 MARK SCHACHNER three terms together, we obtain that P (x 1 + (x 1 + x n ( x 1 n = x x n x log x x = x(log x 1. While these are loose bouns, this example emonstrates the basic methos which can be use to treat arithmetic functions analytically. Acknowlegments. I am very grateful to my mentors, Billy Lee an Karl Schaefer, for their help an for encouraging my pursuit of these topics. I also want to thank Daniil Ruenko for a thoroughly engaging Apprentice curriculum, as well as for his input on the combinatorial sie of my research. References [1] Apostol, T. M. (2010. Introuction to analytic number theory. New York: Springer. [2] Tenenbaum, G. (2015. Introuction to analytic an probabilistic number theory. Provience: American Mathematical Society. [3] Snellman, J. (2002. The ring of arithmetical functions with unitary convolution: Divisorial an topological properties. Research Reports in Mathematics, 4. [4] Huxley, M. N. (2003. Exponential sums an lattice points III. Proceeings of the Lonon Mathematical Society, 87(3, [5] Hary, G. H. (1917. On Dirichlet s ivisor problem. Proceeings of the Lonon Mathematical Society, 2(1, 1-25.
Zachary Scherr Math 503 HW 5 Due Friday, Feb 26
Zachary Scherr Math 503 HW 5 Due Friay, Feb 26 1 Reaing 1. Rea Chapter 9 of Dummit an Foote 2 Problems 1. 9.1.13 Solution: We alreay know that if R is any commutative ring, then R[x]/(x r = R for any r
More informationOn the enumeration of partitions with summands in arithmetic progression
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8 (003), Pages 149 159 On the enumeration of partitions with summans in arithmetic progression M. A. Nyblom C. Evans Department of Mathematics an Statistics
More informationChapter 5. Factorization of Integers
Chapter 5 Factorization of Integers 51 Definition: For a, b Z we say that a ivies b (or that a is a factor of b, or that b is a multiple of a, an we write a b, when b = ak for some k Z 52 Theorem: (Basic
More informationWitt#5: Around the integrality criterion 9.93 [version 1.1 (21 April 2013), not completed, not proofread]
Witt vectors. Part 1 Michiel Hazewinkel Sienotes by Darij Grinberg Witt#5: Aroun the integrality criterion 9.93 [version 1.1 21 April 2013, not complete, not proofrea In [1, section 9.93, Hazewinkel states
More informationLEGENDRE TYPE FORMULA FOR PRIMES GENERATED BY QUADRATIC POLYNOMIALS
Ann. Sci. Math. Québec 33 (2009), no 2, 115 123 LEGENDRE TYPE FORMULA FOR PRIMES GENERATED BY QUADRATIC POLYNOMIALS TAKASHI AGOH Deicate to Paulo Ribenboim on the occasion of his 80th birthay. RÉSUMÉ.
More informationRelatively Prime Uniform Partitions
Gen. Math. Notes, Vol. 13, No., December, 01, pp.1-1 ISSN 19-7184; Copyright c ICSRS Publication, 01 www.i-csrs.org Available free online at http://www.geman.in Relatively Prime Uniform Partitions A. Davi
More informationPure Further Mathematics 1. Revision Notes
Pure Further Mathematics Revision Notes June 20 2 FP JUNE 20 SDB Further Pure Complex Numbers... 3 Definitions an arithmetical operations... 3 Complex conjugate... 3 Properties... 3 Complex number plane,
More informationCHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold
CHAPTER 1 : DIFFERENTIABLE MANIFOLDS 1.1 The efinition of a ifferentiable manifol Let M be a topological space. This means that we have a family Ω of open sets efine on M. These satisfy (1), M Ω (2) the
More informationNOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,
NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which
More informationTwo formulas for the Euler ϕ-function
Two formulas for the Euler ϕ-function Robert Frieman A multiplication formula for ϕ(n) The first formula we want to prove is the following: Theorem 1. If n 1 an n 2 are relatively prime positive integers,
More informationZachary Scherr Math 503 HW 3 Due Friday, Feb 12
Zachary Scherr Math 503 HW 3 Due Friay, Feb 1 1 Reaing 1. Rea sections 7.5, 7.6, 8.1 of Dummit an Foote Problems 1. DF 7.5. Solution: This problem is trivial knowing how to work with universal properties.
More informationON THE DISTANCE BETWEEN SMOOTH NUMBERS
#A25 INTEGERS (20) ON THE DISTANCE BETWEEN SMOOTH NUMBERS Jean-Marie De Koninc Département e mathématiques et e statistique, Université Laval, Québec, Québec, Canaa jm@mat.ulaval.ca Nicolas Doyon Département
More informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More informationLINEAR DIFFERENTIAL EQUATIONS OF ORDER 1. where a(x) and b(x) are functions. Observe that this class of equations includes equations of the form
LINEAR DIFFERENTIAL EQUATIONS OF ORDER 1 We consier ifferential equations of the form y + a()y = b(), (1) y( 0 ) = y 0, where a() an b() are functions. Observe that this class of equations inclues equations
More informationIterated Point-Line Configurations Grow Doubly-Exponentially
Iterate Point-Line Configurations Grow Doubly-Exponentially Joshua Cooper an Mark Walters July 9, 008 Abstract Begin with a set of four points in the real plane in general position. A to this collection
More informationEuler equations for multiple integrals
Euler equations for multiple integrals January 22, 2013 Contents 1 Reminer of multivariable calculus 2 1.1 Vector ifferentiation......................... 2 1.2 Matrix ifferentiation........................
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationMath 115 Section 018 Course Note
Course Note 1 General Functions Definition 1.1. A function is a rule that takes certain numbers as inputs an assigns to each a efinite output number. The set of all input numbers is calle the omain of
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationPermanent vs. Determinant
Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an
More information7. Localization. (d 1, m 1 ) (d 2, m 2 ) d 3 D : d 3 d 1 m 2 = d 3 d 2 m 1. (ii) If (d 1, m 1 ) (d 1, m 1 ) and (d 2, m 2 ) (d 2, m 2 ) then
7. Localization To prove Theorem 6.1 it becomes necessary to be able to a enominators to rings (an to moules), even when the rings have zero-ivisors. It is a tool use all the time in commutative algebra,
More informationWEIGHTED SELBERG ORTHOGONALITY AND UNIQUENESS OF FACTORIZATION OF AUTOMORPHIC L-FUNCTIONS
WEIGHTED SELBERG ORTHOGONALITY AND UNIQUENESS OF FACTORIZATION OF AUTOMORPHIC L-FUNCTIONS JIANYA LIU AND YANGBO YE 3 Abstract. We prove a weighte version of Selberg s orthogonality conjecture for automorphic
More informationNEERAJ KUMAR AND K. SENTHIL KUMAR. 1. Introduction. Theorem 1 motivate us to ask the following:
NOTE ON VANISHING POWER SUMS OF ROOTS OF UNITY NEERAJ KUMAR AND K. SENTHIL KUMAR Abstract. For xe positive integers m an l, we give a complete list of integers n for which their exist mth complex roots
More informationREVERSIBILITY FOR DIFFUSIONS VIA QUASI-INVARIANCE. 1. Introduction We look at the problem of reversibility for operators of the form
REVERSIBILITY FOR DIFFUSIONS VIA QUASI-INVARIANCE OMAR RIVASPLATA, JAN RYCHTÁŘ, AND BYRON SCHMULAND Abstract. Why is the rift coefficient b associate with a reversible iffusion on R given by a graient?
More informationInternational Journal of Pure and Applied Mathematics Volume 35 No , ON PYTHAGOREAN QUADRUPLES Edray Goins 1, Alain Togbé 2
International Journal of Pure an Applie Mathematics Volume 35 No. 3 007, 365-374 ON PYTHAGOREAN QUADRUPLES Eray Goins 1, Alain Togbé 1 Department of Mathematics Purue University 150 North University Street,
More informationCalculus of Variations
Calculus of Variations Lagrangian formalism is the main tool of theoretical classical mechanics. Calculus of Variations is a part of Mathematics which Lagrangian formalism is base on. In this section,
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationarxiv: v1 [physics.flu-dyn] 8 May 2014
Energetics of a flui uner the Boussinesq approximation arxiv:1405.1921v1 [physics.flu-yn] 8 May 2014 Kiyoshi Maruyama Department of Earth an Ocean Sciences, National Defense Acaemy, Yokosuka, Kanagawa
More informationIntroduction to the Vlasov-Poisson system
Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its
More informationStable Polynomials over Finite Fields
Rev. Mat. Iberoam., 1 14 c European Mathematical Society Stable Polynomials over Finite Fiels Domingo Gómez-Pérez, Alejanro P. Nicolás, Alina Ostafe an Daniel Saornil Abstract. We use the theory of resultants
More informationAssignment 1. g i (x 1,..., x n ) dx i = 0. i=1
Assignment 1 Golstein 1.4 The equations of motion for the rolling isk are special cases of general linear ifferential equations of constraint of the form g i (x 1,..., x n x i = 0. i=1 A constraint conition
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More informationSimilar Operators and a Functional Calculus for the First-Order Linear Differential Operator
Avances in Applie Mathematics, 9 47 999 Article ID aama.998.067, available online at http: www.iealibrary.com on Similar Operators an a Functional Calculus for the First-Orer Linear Differential Operator
More informationOn the minimum distance of elliptic curve codes
On the minimum istance of elliptic curve coes Jiyou Li Department of Mathematics Shanghai Jiao Tong University Shanghai PRChina Email: lijiyou@sjtueucn Daqing Wan Department of Mathematics University of
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More information2Algebraic ONLINE PAGE PROOFS. foundations
Algebraic founations. Kick off with CAS. Algebraic skills.3 Pascal s triangle an binomial expansions.4 The binomial theorem.5 Sets of real numbers.6 Surs.7 Review . Kick off with CAS Playing lotto Using
More informationThe Exact Form and General Integrating Factors
7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily
More informationHomotopy colimits in model categories. Marc Stephan
Homotopy colimits in moel categories Marc Stephan July 13, 2009 1 Introuction In [1], Dwyer an Spalinski construct the so-calle homotopy pushout functor, motivate by the following observation. In the category
More informationMake graph of g by adding c to the y-values. on the graph of f by c. multiplying the y-values. even-degree polynomial. graph goes up on both sides
Reference 1: Transformations of Graphs an En Behavior of Polynomial Graphs Transformations of graphs aitive constant constant on the outsie g(x) = + c Make graph of g by aing c to the y-values on the graph
More informationSchrödinger s equation.
Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of
More informationThe derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)
Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)
More informationA FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS
A FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS TODD COCHRANE, JEREMY COFFELT, AND CHRISTOPHER PINNER 1. Introuction For a prime p, integer Laurent polynomial (1.1) f(x) = a 1 x k 1 + + a r
More informationCharacterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
Characterizing Real-Value Multivariate Complex Polynomials an Their Symmetric Tensor Representations Bo JIANG Zhening LI Shuzhong ZHANG December 31, 2014 Abstract In this paper we stuy multivariate polynomial
More informationSelection principles and the Minimal Tower problem
Note i Matematica 22, n. 2, 2003, 53 81. Selection principles an the Minimal Tower problem Boaz Tsaban i Department of Mathematics an Computer Science, Bar-Ilan University, Ramat-Gan 52900, Israel tsaban@macs.biu.ac.il,
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More informationLecture 6: Calculus. In Song Kim. September 7, 2011
Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear
More informationMath 1271 Solutions for Fall 2005 Final Exam
Math 7 Solutions for Fall 5 Final Eam ) Since the equation + y = e y cannot be rearrange algebraically in orer to write y as an eplicit function of, we must instea ifferentiate this relation implicitly
More informationDECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS
DECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS ARNAUD BODIN Abstract. We state a kin of Eucliian ivision theorem: given a polynomial P (x) an a ivisor of the egree of P, there exist polynomials h(x),
More informationGeneralized Tractability for Multivariate Problems
Generalize Tractability for Multivariate Problems Part II: Linear Tensor Prouct Problems, Linear Information, an Unrestricte Tractability Michael Gnewuch Department of Computer Science, University of Kiel,
More information19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control
19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior
More informationNotes on Lie Groups, Lie algebras, and the Exponentiation Map Mitchell Faulk
Notes on Lie Groups, Lie algebras, an the Exponentiation Map Mitchell Faulk 1. Preliminaries. In these notes, we concern ourselves with special objects calle matrix Lie groups an their corresponing Lie
More informationSINGULAR PERTURBATION AND STATIONARY SOLUTIONS OF PARABOLIC EQUATIONS IN GAUSS-SOBOLEV SPACES
Communications on Stochastic Analysis Vol. 2, No. 2 (28) 289-36 Serials Publications www.serialspublications.com SINGULAR PERTURBATION AND STATIONARY SOLUTIONS OF PARABOLIC EQUATIONS IN GAUSS-SOBOLEV SPACES
More informationFinal Exam Study Guide and Practice Problems Solutions
Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making
More informationTractability results for weighted Banach spaces of smooth functions
Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March
More informationSELBERG S ORTHOGONALITY CONJECTURE FOR AUTOMORPHIC L-FUNCTIONS
SELBERG S ORTHOGONALITY CONJECTURE FOR AUTOMORPHIC L-FUNCTIONS JIANYA LIU 1 AND YANGBO YE 2 Abstract. Let π an π be automorphic irreucible unitary cuspial representations of GL m (Q A ) an GL m (Q A ),
More informationSturm-Liouville Theory
LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory
More informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
More informationA New Vulnerable Class of Exponents in RSA
A ew Vulnerable Class of Exponents in RSA Aberrahmane itaj Laboratoire e Mathématiues icolas Oresme Campus II, Boulevar u Maréchal Juin BP 586, 4032 Caen Ceex, France. nitaj@math.unicaen.fr http://www.math.unicaen.fr/~nitaj
More informationDiagonalization of Matrices Dr. E. Jacobs
Diagonalization of Matrices Dr. E. Jacobs One of the very interesting lessons in this course is how certain algebraic techniques can be use to solve ifferential equations. The purpose of these notes is
More informationConservation Laws. Chapter Conservation of Energy
20 Chapter 3 Conservation Laws In orer to check the physical consistency of the above set of equations governing Maxwell-Lorentz electroynamics [(2.10) an (2.12) or (1.65) an (1.68)], we examine the action
More informationOn colour-blind distinguishing colour pallets in regular graphs
J Comb Optim (2014 28:348 357 DOI 10.1007/s10878-012-9556-x On colour-blin istinguishing colour pallets in regular graphs Jakub Przybyło Publishe online: 25 October 2012 The Author(s 2012. This article
More informationMultiplicative properties of sets of residues
Multiplicative properties of sets of resiues C. Pomerance Hanover an A. Schinzel Warszawa Abstract: We conjecture that for each natural number n, every set of resiues mo n of carinality at least n/2 contains
More informationRobustness and Perturbations of Minimal Bases
Robustness an Perturbations of Minimal Bases Paul Van Dooren an Froilán M Dopico December 9, 2016 Abstract Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important
More informationd dx But have you ever seen a derivation of these results? We ll prove the first result below. cos h 1
Lecture 5 Some ifferentiation rules Trigonometric functions (Relevant section from Stewart, Seventh Eition: Section 3.3) You all know that sin = cos cos = sin. () But have you ever seen a erivation of
More informationA Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential
Avances in Applie Mathematics an Mechanics Av. Appl. Math. Mech. Vol. 1 No. 4 pp. 573-580 DOI: 10.4208/aamm.09-m0946 August 2009 A Note on Exact Solutions to Linear Differential Equations by the Matrix
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationOn the multivariable generalization of Anderson-Apostol sums
arxiv:1811060v1 [mathnt] 14 Nov 018 On the multivariable generalization of Anerson-Apostol sums Isao Kiuchi, Frierich Pillichshammer an Sumaia Saa Ein Abstract In this paper, we give various ientities
More informationJournal of Algebra. A class of projectively full ideals in two-dimensional Muhly local domains
Journal of Algebra 32 2009 903 9 Contents lists available at ScienceDirect Journal of Algebra wwwelseviercom/locate/jalgebra A class of projectively full ieals in two-imensional Muhly local omains aymon
More informationQF101: Quantitative Finance September 5, Week 3: Derivatives. Facilitator: Christopher Ting AY 2017/2018. f ( x + ) f(x) f(x) = lim
QF101: Quantitative Finance September 5, 2017 Week 3: Derivatives Facilitator: Christopher Ting AY 2017/2018 I recoil with ismay an horror at this lamentable plague of functions which o not have erivatives.
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationTopic 7: Convergence of Random Variables
Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information
More informationUnit #6 - Families of Functions, Taylor Polynomials, l Hopital s Rule
Unit # - Families of Functions, Taylor Polynomials, l Hopital s Rule Some problems an solutions selecte or aapte from Hughes-Hallett Calculus. Critical Points. Consier the function f) = 54 +. b) a) Fin
More informationEquilibrium in Queues Under Unknown Service Times and Service Value
University of Pennsylvania ScholarlyCommons Finance Papers Wharton Faculty Research 1-2014 Equilibrium in Queues Uner Unknown Service Times an Service Value Laurens Debo Senthil K. Veeraraghavan University
More informationMultiplicative properties of sets of residues
Multiplicative properties of sets of resiues C. Pomerance Hanover an A. Schinzel Warszawa Abstract: Given a natural number n, we ask whether every set of resiues mo n of carinality at least n/2 contains
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationTransmission Line Matrix (TLM) network analogues of reversible trapping processes Part B: scaling and consistency
Transmission Line Matrix (TLM network analogues of reversible trapping processes Part B: scaling an consistency Donar e Cogan * ANC Eucation, 308-310.A. De Mel Mawatha, Colombo 3, Sri Lanka * onarecogan@gmail.com
More informationII. First variation of functionals
II. First variation of functionals The erivative of a function being zero is a necessary conition for the etremum of that function in orinary calculus. Let us now tackle the question of the equivalent
More informationθ x = f ( x,t) could be written as
9. Higher orer PDEs as systems of first-orer PDEs. Hyperbolic systems. For PDEs, as for ODEs, we may reuce the orer by efining new epenent variables. For example, in the case of the wave equation, (1)
More informationA Look at the ABC Conjecture via Elliptic Curves
A Look at the ABC Conjecture via Elliptic Curves Nicole Cleary Brittany DiPietro Alexaner Hill Gerar D.Koffi Beihua Yan Abstract We stuy the connection between elliptic curves an ABC triples. Two important
More informationLie symmetry and Mei conservation law of continuum system
Chin. Phys. B Vol. 20, No. 2 20 020 Lie symmetry an Mei conservation law of continuum system Shi Shen-Yang an Fu Jing-Li Department of Physics, Zhejiang Sci-Tech University, Hangzhou 3008, China Receive
More informationDifferentiability, Computing Derivatives, Trig Review. Goals:
Secants vs. Derivatives - Unit #3 : Goals: Differentiability, Computing Derivatives, Trig Review Determine when a function is ifferentiable at a point Relate the erivative graph to the the graph of an
More informationArithmetic Distributions of Convergents Arising from Jacobi-Perron Algorithm
Arithmetic Distributions of Convergents Arising from Jacobi-Perron Algorithm Valerie Berthe, H Nakaa, R Natsui To cite this version: Valerie Berthe, H Nakaa, R Natsui Arithmetic Distributions of Convergents
More informationApplications of the Wronskian to ordinary linear differential equations
Physics 116C Fall 2011 Applications of the Wronskian to orinary linear ifferential equations Consier a of n continuous functions y i (x) [i = 1,2,3,...,n], each of which is ifferentiable at least n times.
More informationPhysics 5153 Classical Mechanics. The Virial Theorem and The Poisson Bracket-1
Physics 5153 Classical Mechanics The Virial Theorem an The Poisson Bracket 1 Introuction In this lecture we will consier two applications of the Hamiltonian. The first, the Virial Theorem, applies to systems
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationStep 1. Analytic Properties of the Riemann zeta function [2 lectures]
Step. Analytic Properties of the Riemann zeta function [2 lectures] The Riemann zeta function is the infinite sum of terms /, n. For each n, the / is a continuous function of s, i.e. lim s s 0 n = s n,
More information3.7 Implicit Differentiation -- A Brief Introduction -- Student Notes
Fin these erivatives of these functions: y.7 Implicit Differentiation -- A Brief Introuction -- Stuent Notes tan y sin tan = sin y e = e = Write the inverses of these functions: y tan y sin How woul we
More informationMultiplicative properties of sets of residues
Multiplicative properties of sets of resiues C. Pomerance Hanover an A. Schinzel Warszawa Abstract: We conjecture that for each natural number n, every set of resiues mo n of carinality at least n/2 contains
More informationLIAISON OF MONOMIAL IDEALS
LIAISON OF MONOMIAL IDEALS CRAIG HUNEKE AND BERND ULRICH Abstract. We give a simple algorithm to ecie whether a monomial ieal of nite colength in a polynomial ring is licci, i.e., in the linkage class
More informationThe Principle of Least Action
Chapter 7. The Principle of Least Action 7.1 Force Methos vs. Energy Methos We have so far stuie two istinct ways of analyzing physics problems: force methos, basically consisting of the application of
More informationInterconnected Systems of Fliess Operators
Interconnecte Systems of Fliess Operators W. Steven Gray Yaqin Li Department of Electrical an Computer Engineering Ol Dominion University Norfolk, Virginia 23529 USA Abstract Given two analytic nonlinear
More informationCalculus of Variations
16.323 Lecture 5 Calculus of Variations Calculus of Variations Most books cover this material well, but Kirk Chapter 4 oes a particularly nice job. x(t) x* x*+ αδx (1) x*- αδx (1) αδx (1) αδx (1) t f t
More informationFirst Order Linear Differential Equations
LECTURE 6 First Orer Linear Differential Equations A linear first orer orinary ifferential equation is a ifferential equation of the form ( a(xy + b(xy = c(x. Here y represents the unknown function, y
More informationELEC3114 Control Systems 1
ELEC34 Control Systems Linear Systems - Moelling - Some Issues Session 2, 2007 Introuction Linear systems may be represente in a number of ifferent ways. Figure shows the relationship between various representations.
More information