A Generating-Function Approach for Reciprocity Formulae of Dedekind-like Sums
|
|
- Theresa Patterson
- 6 years ago
- Views:
Transcription
1 A Generating-Function Approach for Reciprocity Formulae of Dedekind-like Sums Jordan Clark Morehouse College Stefan Klajbor University of Puerto Rico, Rio Piedras Chelsie Norton Valdosta State July 28, 202 Abstract Apostol sums and Hall-Wilson-Zagier sums are generalizations of Dedekind sums, important finite arithmetic sums introduced by Dedekind in the 880 s with applications in various fields of mathematics and computer science. These sums satisfy numerous reciprocity laws that have been the object of much research. We introduce and prove an identity which serves as a generalization of Apostol and Rademacher reciprocity for the case of Apostol sums with three variables. We do this by showing how it is implied by the Hall-Wilson-Zagier reciprocity and also show how Apostol and Rademacher follow as special cases. Introduction: Dedekind Sums, Their Reciprocity Laws and Generalizations In the 9th century, Richard Dedekind introduced Dedekind sums in his study [2] of the η-function η(z := e πiz 2 ( e 2πinz. n Bernoulli polynomials are defined to be the coefficients of the generating function e uz e z = k 0 B k (u z k. k!
2 The first few Bernoulli polynomials are: B 0 (x = B (x = x 2 B 2 (x = x 2 x + 6 B 3 (x = x x2 + 2 x. The periodized Bernoulli polynomial B n (x is obtained by evaluating the Bernoulli polynomial at the fractional part of x and defining B (x = 0 if x Z. The classic Dedekind sum is defined as follows: Definition. For a, b N with gcd(a, b =, the Dedekind sum is b ( ah s(a, b := B b h=0 ( h B. b The following well-known identity will prove useful throughout. Lemma (Raabe s Formula []. For a N, x R, ( B m x + h = a m B m (ax. a h mod a Dedekind sums appear naturally in various fields of mathematics and computer science. For example, they arise in lattice-point enumeration in combinatorics and random-number generation in computer science. Dedekind sums satisfy various reciprocity laws that have been the subject of much research for more than a century.. Reciprocity Formulae In this context, reciprocity refers to the addition of Dedekind sums with certain permutations in their arguments resulting in a relatively simple expression. Dedekind proved the following reciprocity law in [2]. Theorem (Dedekind Reciprocity. For a, b N, gcd(a, b = the following holds: s(a, b + s(b, a = ( a 2 b + b a + ab 4. Because of the simplicity of the right side of the Dedekind reciprocity law, the law is useful in computing Dedekind sums with large periods. For this purpose, we also need the following lemma, which establishes the periodicity of the Dedekind sum. 2
3 Lemma 2 (Periodicity of the Dedekind Sum. For a, b N with gcd(a, b =, s(a, b = s(a mod b, b Proof. Because B (x is periodic with period, s(a mod b, b = ( ( (a mod bh h B B b b h mod b = ( ( ah h B B b b h mod b = s(a, b. Using Theorem and Lemma 2, we can significantly reduce the steps required to compute a Dedekind sum. For example, consider the Dedekind sum s(00, 47. By Theorem, we can express it as follows: s(00, 47 = ( s(47, 00. (00(47 4 By simplifying and using Lemma 2 on the sum s(47, 00, we now have Continuing in this manner, we obtain s(00, 47 = 249 s(47, s(00, 47 = The use of Theorem and Lemma 2 in this example reduces the number of computations from 47 to only 9. In [6], Rademacher introduced a more general reciprocity law with three Dedekind sums. Theorem 2 (Rademacher Reciprocity. For pairwise relatively prime a, b, c N, the following holds: s(ab, c + s(bc, a + s(ca, b = ( a 2 bc + b ac + c ab 4. Here, the inverses denote the inverse of the integer mod the period of the corresponding sum. Dedekind s reciprocity is a special case of Rademacher s relation. setting c = and by using the identity s(a, b = s(a, b. This is seen by In [5], Pommersheim introduced a reciprocity law while studying Dedekind sums in the context of algebraic geometry. 3
4 Theorem 3 (Pommersheim Reciprocity. For a, a 2, b, b 2 Z >0 with gcd(a, a 2 = gcd(b, b 2 = and b, b 2 Z such that b b + b 2 b 2 =, let x = a 2 b 2 a b, y = a b 2 + a 2 b. Then s(a, a 2 + s(b, b 2 + s(x, y = ( a2 2 b 2 x + b 2 a 2 x + x a 2 b 2 4. Rademacher reciprocity follows from Pommersheim reciprocity: First, let a 2, b 2, y N be arbitrary yet pairwise relatively prime. Then, choose a, b such that a b 2 +a 2 b 2 = y and use the identity s(a, a 2 = s(a, a 2. In [3], Kurt Girstmair showed the relationship between the three reciprocity laws above by proving that Pommersheim reciprocity follows from Dedekind reciprocity. By his work, we see that the three reciprocity theorems are actually logically equivalent..2 Generalizations of Dedekind sums Various generalizations of the classic Dedekind sum have been introduced. These generalizations have interested researchers from various fields of mathematics and computer science. One of the more fruitful ways of generalizing Dedekind sums involves considering higher-degree periodized Bernoulli polynomials. In [], Tom Apostol introduced such a generalization by letting one of the Bernoulli polynomials in the classic Dedekind sum be arbitrary. Definition 2 (Apostol Sum. For a, b, p N with gcd(a, b =, b ( h s p (a, b := B b h=0 B p ( ah b In [], Apostol proved the following reciprocity law for the Apostol sums. Theorem 4 (Apostol Reciprocity. For a, b, p N where p is odd, s=0. (p + (ab p s p (a, b + a p bs p (b, a p+ ( p + = ( s B s s a s B p+ s b p+ s + pb p+. Here, B s represents the s th Bernoulli number obtained by evaluating the Bernoulli polynomials B s (x at x = 0. As stated by Apostol, Theorem may be written as 2(abs (a, b + bas (b, a = B 2 a 2 2B 2 ab + B 2 b 2 + B 2, from which it follows that Dedekind reciprocity is a special case of Apostol reciprocity when p =. Because of this, and because one can observe the same permutation in the arguments of the sums resulting in a relatively simple expression for these sums, 4
5 Apostol s reciprocity can be seen as a direct analogue of Dedekind s law at the level of Apostol sums. Our goal in this report is to find analogues of Rademacher and Pommersheim reciprocity at the level of Apostol sums using a generating-function approach. We seek reciprocity laws that can be reduced to the special cases of Rademacher and Pommersheim reciprocity for the case p = of Apostol sums, much like Apostol reciprocity reduces to Dedekind reciprocity when p =. It is natural to consider the more general Dedekind-like sum and use results from [4] at the generating-function level to seek patterns at the level of Apostol sums. In [4] Hall, Wilson, and Zagier introduced the HWZ sum. Definition 3 (HWZ Sum. For relatively pairwise coprime a, a 2, a 3 N and m, n N, the HWZ sum is defined by a 3 ( ( h h S m,n (a, a 2, a 3 := B m a B n a 2. a 3 a 3 h=0 Apostol sums are clearly a special case of these HWZ sums where a =, a 2 = a, a 3 = b, m =, and n = p. Hall, Wilson, and Zagier also introduced the generating function of the HWZ sum. Definition 4 (Hall-Wilson-Zagier Generating Function. For relatively pairwise coprime a, a 2, a 3 N, the generating function of the HWZ sum is defined as ( a a Ω 2 a 3 := ( m ( n y y 2 m!n! S y y2 m,n(a, a 2, a 3. The terms in the coefficient (i.e., the factorials and the a m, a n 2 are introduced by Hall, Wilson, and Zagier to ensure the following reciprocity law, also proven in [4], at the level of generating functions: Theorem 5 (HWZ Reciprocity. Letting a, a 2, a 3 N, all pairwise coprime, and let y, y 2, y 3 be nonzero variables such that y + y 2 + y 3 = 0. Then ( ( ( a a Ω 2 a 3 (a2 a + Ω 3 a a3 a + Ω a 2 = y y 2 y 2 y 3 y 3 y 4. As in the case of Theorem 4, this reciprocity law also reduces to familiar reciprocity laws. As we will show in the next section, one can obtain Theorem 2 by looking at the constant term of the generating functions. Theorem follows by setting a i = for one of the a i s and looking at the constant term of the generating function. When looking at the coefficients of higher powers of the generating function variables in HWZ reciprocity one can discover new identities (since each of these coefficients must equal 0 by Theorem 5. Our approach, described in the next section, consists of a method to systematically collect these coefficient identities and study them. In this report, we emphasize the Apostol sums contained in these identities. 5 a a 2
6 2 The Generating-Function Approach For pairwise coprime a, a 2, a 3 N, we define the following generating function: ( ( ( a a G(y, y 2 := Ω 2 a 3 (a2 a + Ω 3 a a3 a + Ω a 2 y y 2 y 2 y 3 y 3 y which depends only on y and y 2 after substituting y 3 = (y +y 2 from the condition in Theorem 5, which also implies that G(y, y 2 =. Furthermore, we introduce the 4 notation Ω(a, a 2, a 3 = A m,n y m y2 n where Ω(a 2, a 3, a = Ω(a 3, a, a 2 = B m,n y2 m y3 n C m,n y m 3 y n, A m,n = m! n! S m,n(a, a 2, a 3 a m B m,n = m! n! S m,n(a 2, a 3, a a m C m,n = m! n! S m,n(a 3, a, a 2 a m a n 2 2 a n 3 3 a n. In the next sections we show how to expand G(y, y 2 in total degrees of the variables y and y 2. Thus, we can express G as G(y, y 2 = γ 0,0 y y2 ( + ( γ,0 y2 + γ 0, y + ( γ 2,0 y y2 + γ, + γ 0,2 y y 2 (2 + ( γ 3,0 yy γ 2, y + γ,2 y 2 + γ 0,3 y y2 2 + ( γ 4,0 yy γ 3, y 2 + γ 2,2 y y 2 + γ,3 y2 2 + γ 0,4 y y2 3 (3 + where γ i,j is a sum of terms of the form A m,n, B m,n, C m,n. To be able to collect these coefficients, we require the following lemma. Lemma 3. The following identities hold for all n N: A n,0 = B 0,n B n,0 = C 0,n C n,0 = A 0,n. 6
7 Proof. Note that A n,0 = a n a 2 n! = B n (0 = a n 3 a 2 n! = B 0,n, a 3 h=0 B n ( h a 3 a n a3 n a 2 n! a ( h B n a where the second and third equalities follow by Lemma. The other two identities can be proven in an analogous manner. The following lemma allows us to consider only those terms with even total degree because it implies that all terms with odd total degree vanish. h=0 Lemma 4. For a, b, c, m, n N with m + n odd we have that S m,n (a, b, c = 0 Proof. First, consider the Fourier series expansion of B k (x evaluated at x??: B k ( x = k! e 2πimx (2πi k m k = k! (2πi k m Z\{0} m Z\{0} = ( k B k (x. e 2πimx ( m k where in the second equality we substituted m by m since the index set includes all nonzero integers. Hence, B k (x is an odd function if k is odd and an even function otherwise. Now we consider S m,n (a, b, c and note S m,n (a, b, c = k mod c = k mod c ( ak B m c ( B m ak c = ( m+n k mod c ( bk B n c ( B n bk c B m ( ak c = ( m+n S m,n (a, b, c, ( bk B n c where the second equality follows from noting that { c, 2 c,..., 0} is a complete residue system mod c and the third equality follows from the above observation on the parity of B k (x. Hence, S m,n (a, b, c = S m,n (a, b, c when m + n is odd, which implies that S m,n (a, b, c = 0, as claimed. 7
8 We proceed to show how to collect the terms in the generating function G and how some of its coefficients γ i,j correspond to identities involving Apostol sums. 2. Total Degree -2 First we look at the terms in ( with total degree 2. This restricts our terms to those where m + n = 0 in the generating function. Using the definition of our expanded generating function, the terms with total degree 0 look like A 0,0 y y 2 + B 0,0 y 2 y 3 + C 0,0 y 3 y. Using Lemma 3 and factoring, this can be written as B 0,0 (y y 2 + y 2 y 3 + y 3 y. By finding a common denominator, we get B 0,0 ( y + y 2 + y 3 y y 2 y 3 which equals 0 when we use the assumption on the generating function variables y + y 2 + y 3 = 0. Hence, γ 0,0 = Total Degree 0 Next, we work to express the terms that have total degree 0 in (2. Therefore, we will compute the terms that satisfy the condition m + n = 2. Total degree 0 is especially important because it provides us with the constant term of the generating funtion. Using the definition of our expanded generating function, the terms with total degree 0 are, A 2,0 y y2 + A, + A 0,2 y y 2 +B 2,0 y 2 y3 + B, + B 0,2 y2 y 3 +C 2,0 y 3 y + C, + C 0,2 y3 y. Using Lemma 3 and simplifying, we can write this as A 2,0 (y y 2 + y 2 y 3 + B 2,0 (y 2 y 3 + y 3 y + C 2,0 (y y 2 + y 3 y +A, + B, + C,. (4 Now, note that the condition on the generating function variables y + y 2 + y 3 = 0 implies y y3 + y 2 y3 + = 0 y 2 y + y 3 y + = 0 y y2 + y 3 y2 + = 0, 8
9 which turns (4 into A, + B, + C, A 2,0 B 2,0 C 2,0. (5 Notice that this sum is the constant term of the generating function. We know that the expansion of the entire generating function equals. Thus, we conclude the 4 identity A, + B, + C, A 2,0 B 2,0 C 2,0 = 4. (6 Since a, a 2, a 3 are pairwise relatively prime we can multiply the index of any of the sums S m,n by the inverse of any of a i modulo its denominator. Using this fact and applying Lemma to the A 2,0, B 2,0, C 2,0 terms, (6 becomes S, (a a 2,, a 3 + S, (a 2 a 3,, a + S, (a 3 a,, a 2 = 2 ( a a 2 a 3 + a 2 a a 3 + a 3 a a 2 4, which is Rademacher reciprocity. That is, the constant term of the generatingfunction identity corresponds to Rademacher reciprocity as claimed in the introduction. 2.3 Total Degree 2 Consider the terms with total degree 2. This restricts our attention to m, n Z 0 such that m + n = 4. Note that the terms with total degree 2 in (3 include the sums S,3, S 3,, which correspond to Apostol sums where p = 3. Collecting terms yields A 4,0 y 3 y 2 + A 3, y 2 + A 2,2 y y 2 + A,3 y A 0,4 y y B 4,0 y 3 2y 3 + B 3, y B 2,2 y 2 y 3 + B,3 y B 0,4 y 2 y C 4,0 y 3 3y + C 3, y C 2,2 y 3 y + C,3 y 2 + C 0,4 y 3 y 3. Using Lemma 3, we can rearrange these to obtain A 4,0 (y 3 y 2 + y 2 y B 4,0 (y 3 2y 3 + y 3 y 3 + C 4,0 (y y y 3 3y + (A 3, + C,3 y 2 + (B 3, + A,3 y (C 3, + B,3 y A 2,2 y y 2 + B 2,2 y 2 y 3 + C 2,2 y 3 y. Using the condition on the generating function variables y 3 = (y + y 2 and simplifying we obtain A 4,0 (3y 2 + 3y y 2 + y B 4,0 ( y 2 + y y 2 y 2 2 C 4,0 (3y y y 2 + y 2 + (A 3, + C,3 y 2 + (B 3, + A,3 y (C 3, + B,3 (y 2 + 2y y 2 + y A 2,2 y y 2 B 2,2 (y y y 2 C 2,2 (y 2 + y y 2. 9
10 Collecting terms, we obtain three coefficients with total degree 2 in the generating function: ( 3A 4,0 B 4,0 C 4,0 + A 3, + C,3 + B,3 + C 3, C 2,2 y 2 + ( 3A 4,0 + B 4,0 3C 4,0 + 2B,3 + 2C 3, + A 2,2 B 2,2 C 2,2 y y 2 + ( A 4,0 B 4,0 3C 4,0 + B 3, + A,3 + B,3 + C 3, B 2,2 y 2 2. Because any higher powers in the generating function have coefficient 0, each of these coefficients must equal 0, which yields three identities: A 3, + C,3 + B,3 + C 3, = 3A 4,0 + B 4,0 + C 4,0 + C 2,2 (7 2B,3 + 2C 3, = 3A 4,0 B 4,0 + 3C 4,0 A 2,2 + B 2,2 + C 2,2 (8 A,3 + B 3, + B,3 + C 3, = A 4,0 + B 4,0 + 3C 4,0 + B 2,2. (9 To interpret these identities, we apply Lemma to get A 4,0 = B 4 24 a 2 a 3 a 3 3, B 4,0 = B 4 24 a 3 a 3 a 3 2, C 4,0 = B 4 24 We can also express the following terms using Apostol sums: a. a 3 2a 3 3 A,3 = s 6a 2 3 (a a 2, a 3, A 3, = s 2 6a 2 3 (a a 2, a 3 B,3 = s 6a 2 3 (a 2 a 3, a, B 3, = s 3 6a 2 3 (a 2 a 3, a 2 C,3 = s 6a 2 3 (a 3 a, a 2, C 3, = s 6a 2 3 (a 3 a, a 2. 3 With the above, we can now express (7 as: 6a 2 s 3 (a a 2, a 3 + 6a 2 = 24 s 3 (a 3 a, a 2 + s 6a 2 3 (a 2 a 3, a + 3 ( a 2 a 3 a 3B 4 + B a 3 a B 3 a 3 a a 3 2a 3 3 6a 2 3 s 3 (a 3 a, a 2 + 4a a 3 S 2,2 (a 3, a, a 2. Observe there is a Rademacher-like permutation in the arguments of the Apostol sums in the above identity. However, the identity involves four sums instead of the three terms in Rademacher reciprocity for the classic Dedekind sum. We conjecture this identity to be a Rademacher analogue for Apostol sums with p = 3, though the sum S 2,2 in the right-hand side remains to be simplified in closed form. Furthermore, in this form, (7 can be specialized to obtain Apostol reciprocity for p = 3. For this, we set a 2 =, which yields 6a 2 s 3 (a, a 3 + s 6a 2 3 (a3 a, + 6a 2 3 = ( a a 3 3B 4 + B 24 a 3 a B 3 a a 3 0 s 3 (a 3, a + 6a 2 3 s 3 (a 3 a, + 4a a 3 S 2,2 (a 3, a,.
11 Noting that s 3 (a 3 a,, s 3 (a 3 a, = B B 3 = 0 and that S 2,2 (a 3, a, = B 2 2 and rearranging terms, we obtain 4 ( a a 3 3s 3 (a, a 3 + a 3 a 3 s 3 (a 3, a = B 4 a 4 + 6B 2 2a 2 a B 4 a B 4, which corresponds to Apostol reciprocity for p = 3. Above, we used (7, but we have two additional identities that can be used. We proceed in an analogous manner with (9. We first express it in terms of Apostol sums: 6a 2 2 s 3 (a 2 a 3, a + = 24 6a 2 2 s 3 (a a 2, a 3 + 6a 2 3 ( a 2 a a 3 B 4 + 3B a 3 a B 3 a 3 2a a 3 a 3 2 s 3 (a 2 a 3, a + 6a 2 3 s 3 (a 3 a, a 2 + 4a 2 a 3 S 2,2 (a 2, a 3, a. Setting a =, we obtain Apostol reciprocity but with the arguments of the sums permuted: 4 ( a 2 a 3 3s 3 (a 2, a 3 + a 3 2a 3 s 3 (a 3, a 2 = B 4 a B 2 2a 2 2a B 4 a B 4. The above results suggest that (8 yields the remaining cyclic permutation of Apostol reciprocity for p = 3 after setting a 3 =. This can be seen by replacing identity (8 with the linear combination (7 + (9 (8. In the following section, we discuss our planned work regarding (8 and the general case of even total degree. 2.4 Total Degree p Even Proceeding as we did to collect terms for total degree 0 and 2, we can collect terms for any even total degree p. When p = 0, 2, 4, 6, 8 we obtain the following coefficients of the y p 2 term: p = 0 : A, + C, B 0,2 + B, B 2,0 C 2,0 p = 2 : A,3 + C 3, B 0,4 + B,3 B 2,2 + B 3, B 4,0 3C 4,0 p = 4 : A,5 + C 5, B 0,6 + B,5 B 2,4 + B 3,3 B 4,2 + B 5, B 6,0 5C 6,0 p = 6 : A,7 + C 7, B 0,8 + B,7 B 2,6 + B 3,5 B 4,4 + B 5,3 B 6,2 + B 7, B 8,0 7C 8,0 p = 8 : A,9 + C 9, B 0,0 + B,9 B 2,8 + B 3,7 B 4,6 + B 5,5 B 6,4 + B 7,3 B 8,2 + B 9, B 0,0 9C 0,0. The above pattern continues for even degree which suggests the following general expression for the coefficient of y p 2 for arbitrary even p:
12 Theorem 6. For even p, the coefficient of the y p 2 variable in the generating function G(y, y 2 is A,p+ + C p+, + ( i+ B i, i (p + C,0. Also, this coefficient satisfies the identity A,p+ + C p+, + ( i+ B i, i (p + A 0, = Proof. Note that G(y, y 2 = Ω(a, a 2, a 3 + Ω(a 2, a 3, a + Ω(a 3, a, a 2 = A m,n y m y2 n + B m,n y2 m y3 n + = = = A m,n y m y n 2 + A m,n y m y n 2 + A m,n y m y n 2 + { 4 if p = 0, 0 if p > 0. C m,n y3 m y n B m,n y m 2 ( y y 2 n + n ( n B m,n ( n y2 m y n j y j 2 j j=0 + m ( m C m,n ( m y n y j y j m j 2 j=0 n ( n B m,n ( n y n j y m +j 2 j j=0 + m ( m C m,n ( m y n j j=0 C m,n ( y y 2 m y n y n +j y m j 2, where in the third equality we used the condition y 3 = y y 2 and in the fourth equality we used the Binomial Theorem. We now seek to extract the coefficient of y p 2 from the three summations corresponding to each Ω. In the first Ω, we want m = 0 m = n = p n = p + which implies that the coefficient of y p 2 in this summation is A,p+. In the second Ω, we want m + j = p n j = 0 2
13 which in turn implies that j = n m + n = p + 2. Thus, the coefficient of y p 2 in the second summation is m+n= ( n B m,n = ( p+ i B i, i = ( i+ B i, i, where the first equality follows by noting that we can include all the pairs (m, n Z 2 0 such that m + n = p + 2 with the i, p + 2 i subscripts. In the third Ω, we require which implies that m+n= m j = p n + j = 0, j = m p m + n = p + 2. We thus have the coefficient of y p 2 as ( m ( m C m,n m p = ( i i p ( i C i, i = C p+, (p + C,0 + = C p+, (p + C,0, p ( i ( i C i, i i p where the first equality follows by the same argument as in the previous case, the second equality follows by noting that p is required to be even and the last equality follows since i p < 0 for i = 0,,..., p, making ( i p = 0. Hence, collecting the terms from each of the three Ω s, we have that the coefficient of y p 2 in G(y, y 2 is A,p+ + C p+, + ( i+ B i, i (p + C,0 as claimed. The coefficient identity follows from Theorem 5. 3
14 The identity in Theorem 6 can be rearranged to obtain an identity analogous to Theorem 2 for Apostol sums. For this, we first extract the terms corresponding to i = p +, p + 2 from the summation to obtain: { p A,p+ +B p+, +C p+, + ( i+ if p = 0, 4 B i, i B,0 (p+a 0, = 0 if p > 0. Now note that the sum A,p+ + B p+, + C p+, corresponds to the sum a p 2(p +! s p+(a 2 a, a 3 + a p 2(p +! s p+(a 2 a 3, a + a p 3(p +! s p+(a 3 a 2, a 2, where we observe Apotol sums with a permutation of the arguments of the sums similar, though not identical, to that in Theorem 2. Despite the difference in the way the arguments in the sum are permuted, the rearranged identity seems to be a generalization of Theorem 2 since when p = 0, the identity reduces to Theorem 2. For this, note that when p = 0 the identity becomes Using Lemma 3, we express this as A, + B, + C, B 0,2 B 2,0 A 0,2 = 4. A, + B, + C, A 2,0 B 2,0 C 2,0 = 4, which is Theorem 2 as shown before when considering total degree 0. We recall Theorem 4, which we express as (p + 2(ab p+ s p+ (a, b + a p+ bs p+ (b, a ( p ( i+ a i b i B i B i (p + B = 0 i where B k is the the k th Bernoulli number and the theorem holds for even p > 0. Under the same condition on p we set a = c, a 2 = a, a 3 = b, multiply Theorem 6 by a p+ b p+ (p + 2! and use Lemma on the last term to express the identity from Theorem 6 as (p + 2 ( ab p+ s p+ (ac, b + a p+ bs p+ (bc, a ( p ( i+ a i b i S i, i (a, b, c c(p + B = 0, i where again B k is again the k th Bernoulli number. Hence, we can also view the identity from Theorem 6 as a generalization of Theorem 4 for three variables instead of two. It is interesting to note that the role the Bernoulli numbers play in the 4
15 summation of Theorem 4 is taken up by the HWZ sum S i, i (a, b, c in Theorem 6. In fact, setting c = reduces Theorem 6 to Theorem 4 since S i, i (a, b, = 0 B i (ahb i (bh = B i B i h=0 The above results provide evidence suggesting Theorem 6 is an analogue of Theorem 2 for Apostol sums and provide a connection between Theorems 4, 5, and 2. 3 Outlook Extensions of this research include, but are not limited to, finding another reciprocity law and corresponding generating function. We would like to find the right analogue of Pommersheim reciprocity, Theorem 3, at the level of the Apostol sums. This would allow us to use the new reciprocity to imply Theorem 6 and Pommersheim reciprocity, Theorem 3. Furthermore, we may apply this same idea at the generating function level. A new generating function of HWZ sums could then imply the new reciprocity law and the HWZ generating function, Theorem 5. References [] T. M. Apostol. Generalized Dedekind sums and transformation formulae of certain Lambert series. Duke Math. J., 7:47 57, 950. [2] Richard Dedekind. Erläuterungen zu den fragmenten xxviii. In Collected Works of Bernhard Riemann, pages [3] Kurt Girstmair. Some remarks on Rademacher s three-term relation. Arch. Math. (Basel, 73(3: , 999. [4] R. R. Hall, J. C. Wilson, and D. Zagier. Reciprocity formulae for general Dedekind-Rademacher sums. Acta Arith., 73(4: , 995. [5] James E. Pommersheim. Toric varieties, lattice points and Dedekind sums. Math. Ann., 295(: 24, 993. [6] Hans Rademacher. Generalization of the reciprocity formula for Dedekind sums. Duke Math. J., 2:39 397,
Reciprocity formulae for general Dedekind Rademacher sums
ACTA ARITHMETICA LXXIII4 1995 Reciprocity formulae for general Dedekind Rademacher sums by R R Hall York, J C Wilson York and D Zagier Bonn 1 Introduction Let B 1 x = { x [x] 1/2 x R \ Z, 0 x Z If b and
More informationEquality of Dedekind sums: experimental data and theory
Equality of Dedekind sums: experimental data and theory Challenges in 21st Century Experimental Mathematical Computation Sinai Robins Nanyang Technological University ICERM Brown University What are Dedekind
More informationProof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have
Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationCOMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635
COMP239: Mathematics for Computer Science II Prof. Chadi Assi assi@ciise.concordia.ca EV7.635 The Euclidean Algorithm The Euclidean Algorithm Finding the GCD of two numbers using prime factorization is
More informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number
More informationDIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS
DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS JEREMY LOVEJOY Abstract. We study the generating function for (n), the number of partitions of a natural number n into distinct parts. Using
More informationGeneralized Dedekind Bernoulli Sums
Generalized Dedekind Bernoulli Sums A thesis presented to the faculty of San Francisco State University In partial fulfilment of The Requirements for The Degree Master of Arts In Mathematics by Anastasia
More informationTernary Quadratic Forms and Eta Quotients
Canad. Math. Bull. Vol. 58 (4), 015 pp. 858 868 http://dx.doi.org/10.4153/cmb-015-044-3 Canadian Mathematical Society 015 Ternary Quadratic Forms and Eta Quotients Kenneth S. Williams Abstract. Let η(z)
More informationDedekind sums: a combinatorial-geometric viewpoint
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Dedekind sums: a cominatorial-geometric viewpoint Matthias Beck and Sinai Roins Astract The literature on Dedekind sums is vast In
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More informationSolutions to Problem Set 4 - Fall 2008 Due Tuesday, Oct. 7 at 1:00
Solutions to 8.78 Problem Set 4 - Fall 008 Due Tuesday, Oct. 7 at :00. (a Prove that for any arithmetic functions f, f(d = f ( n d. To show the relation, we only have to show this equality of sets: {d
More informationPrimes in arithmetic progressions
(September 26, 205) Primes in arithmetic progressions Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/mfms/notes 205-6/06 Dirichlet.pdf].
More informationHECKE OPERATORS ON CERTAIN SUBSPACES OF INTEGRAL WEIGHT MODULAR FORMS.
HECKE OPERATORS ON CERTAIN SUBSPACES OF INTEGRAL WEIGHT MODULAR FORMS. MATTHEW BOYLAN AND KENNY BROWN Abstract. Recent works of Garvan [2] and Y. Yang [7], [8] concern a certain family of half-integral
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
More informationMath 110 HW 3 solutions
Math 0 HW 3 solutions May 8, 203. For any positive real number r, prove that x r = O(e x ) as functions of x. Suppose r
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-13 Recap Divisibility Prime Number Theorem Euclid s Lemma Fundamental Theorem of Arithmetic Euclidean Algorithm Basic Notions - Section
More informationCS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II
CS 5319 Advanced Discrete Structure Lecture 9: Introduction to Number Theory II Divisibility Outline Greatest Common Divisor Fundamental Theorem of Arithmetic Modular Arithmetic Euler Phi Function RSA
More informationON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS
ARCHIVUM MATHEMATICUM (BRNO) Tomus 42 (2006), 151 158 ON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS ARTŪRAS DUBICKAS Abstract. We consider the sequence of fractional parts {ξα
More informationMath 109 September 1, 2016
Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,
More informationTHE p-adic VALUATION OF EULERIAN NUMBERS: TREES AND BERNOULLI NUMBERS
THE p-adic VALUATION OF EULERIAN NUMBERS: TREES AND BERNOULLI NUMBERS FRANCIS N. CASTRO, OSCAR E. GONZÁLEZ, AND LUIS A. MEDINA Abstract. In this work we explore the p-adic valuation of Eulerian numbers.
More informationPartial Sums of Powers of Prime Factors
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 10 (007), Article 07.1.6 Partial Sums of Powers of Prime Factors Jean-Marie De Koninck Département de Mathématiques et de Statistique Université Laval Québec
More informationModular Arithmetic Instructor: Marizza Bailey Name:
Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
More informationBURGESS INEQUALITY IN F p 2. Mei-Chu Chang
BURGESS INEQUALITY IN F p 2 Mei-Chu Chang Abstract. Let be a nontrivial multiplicative character of F p 2. We obtain the following results.. Given ε > 0, there is δ > 0 such that if ω F p 2\F p and I,
More informationElementary Algebra Chinese Remainder Theorem Euclidean Algorithm
Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm April 11, 2010 1 Algebra We start by discussing algebraic structures and their properties. This is presented in more depth than what we
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationPARITY OF THE COEFFICIENTS OF KLEIN S j-function
PARITY OF THE COEFFICIENTS OF KLEIN S j-function CLAUDIA ALFES Abstract. Klein s j-function is one of the most fundamental modular functions in number theory. However, not much is known about the parity
More informationRational Distance Problem for the Unit Square
Rational Distance Problem for the Unit Square Ameet Sharma November 18, 015 ameet_n_sharma@hotmail.com Abstract We present a proof of the non-existence of points at a rational distance from all 4 corners
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationPolynomial analogues of Ramanujan congruences for Han s hooklength formula
Polynomial analogues of Ramanujan congruences for Han s hooklength formula William J. Keith CELC, University of Lisbon Email: william.keith@gmail.com Detailed arxiv preprint: 1109.1236 Context Partition
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
More informationON DIRICHLET S CONJECTURE ON RELATIVE CLASS NUMBER ONE
ON DIRICHLET S CONJECTURE ON RELATIVE CLASS NUMBER ONE AMANDA FURNESS Abstract. We examine relative class numbers, associated to class numbers of quadratic fields Q( m) for m > 0 and square-free. The relative
More informationON MONIC BINARY QUADRATIC FORMS
ON MONIC BINARY QUADRATIC FORMS JEROME T. DIMABAYAO*, VADIM PONOMARENKO**, AND ORLAND JAMES Q. TIGAS*** Abstract. We consider the quadratic form x +mxy +ny, where m n is a prime number. Under the assumption
More informationHans Wenzl. 4f(x), 4x 3 + 4ax bx + 4c
MATH 104C NUMBER THEORY: NOTES Hans Wenzl 1. DUPLICATION FORMULA AND POINTS OF ORDER THREE We recall a number of useful formulas. If P i = (x i, y i ) are the points of intersection of a line with the
More informationSummary Slides for MATH 342 June 25, 2018
Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.
More informationOn the power-free parts of consecutive integers
ACTA ARITHMETICA XC4 (1999) On the power-free parts of consecutive integers by B M M de Weger (Krimpen aan den IJssel) and C E van de Woestijne (Leiden) 1 Introduction and main results Considering the
More informationZERO-SUM ANALOGUES OF VAN DER WAERDEN S THEOREM ON ARITHMETIC PROGRESSIONS
ZERO-SUM ANALOGUES OF VAN DER WAERDEN S THEOREM ON ARITHMETIC PROGRESSIONS Aaron Robertson Department of Mathematics, Colgate University, Hamilton, New York arobertson@colgate.edu Abstract Let r and k
More informationREPRESENTATIONS OF INTEGERS AS SUMS OF SQUARES. Ken Ono. Dedicated to the memory of Robert Rankin.
REPRESENTATIONS OF INTEGERS AS SUMS OF SQUARES Ken Ono Dedicated to the memory of Robert Rankin.. Introduction and Statement of Results. If s is a positive integer, then let rs; n denote the number of
More information(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d
The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers
More information4 Powers of an Element; Cyclic Groups
4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)
More informationArithmetic Operations. The real numbers have the following properties: In particular, putting a 1 in the Distributive Law, we get
MCA AP Calculus AB Summer Assignment The following packet is a review of many of the skills needed as we begin the study of Calculus. There two major sections to this review. Pages 2-9 are review examples
More informationEXPONENTIAL SUMS OVER THE SEQUENCES OF PRN S PRODUCED BY INVERSIVE GENERATORS
Annales Univ. Sci. Budapest. Sect. Comp. 48 018 5 3 EXPONENTIAL SUMS OVER THE SEQUENCES OF PRN S PRODUCED BY INVERSIVE GENERATORS Sergey Varbanets Odessa Ukraine Communicated by Imre Kátai Received February
More informationElementary Number Theory MARUCO. Summer, 2018
Elementary Number Theory MARUCO Summer, 2018 Problem Set #0 axiom, theorem, proof, Z, N. Axioms Make a list of axioms for the integers. Does your list adequately describe them? Can you make this list as
More informationSolution Sheet (i) q = 5, r = 15 (ii) q = 58, r = 15 (iii) q = 3, r = 7 (iv) q = 6, r = (i) gcd (97, 157) = 1 = ,
Solution Sheet 2 1. (i) q = 5, r = 15 (ii) q = 58, r = 15 (iii) q = 3, r = 7 (iv) q = 6, r = 3. 2. (i) gcd (97, 157) = 1 = 34 97 21 157, (ii) gcd (527, 697) = 17 = 4 527 3 697, (iii) gcd (2323, 1679) =
More informationSchool of Mathematics
School of Mathematics Programmes in the School of Mathematics Programmes including Mathematics Final Examination Final Examination 06 22498 MSM3P05 Level H Number Theory 06 16214 MSM4P05 Level M Number
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationREFINEMENTS OF SOME PARTITION INEQUALITIES
REFINEMENTS OF SOME PARTITION INEQUALITIES James Mc Laughlin Department of Mathematics, 25 University Avenue, West Chester University, West Chester, PA 9383 jmclaughlin2@wcupa.edu Received:, Revised:,
More informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationWilson s Theorem and Fermat s Little Theorem
Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =
More informationPrime Numbers and Irrational Numbers
Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.
More informationA FIRST COURSE IN NUMBER THEORY
A FIRST COURSE IN NUMBER THEORY ALEXANDRU BUIUM Contents 1. Introduction 2 2. The integers 4 3. Induction 6 4. Finite sets, finite sums, finite products 7 5. The rationals 8 6. Divisibility and Euclid
More informationOn Rankin-Cohen Brackets of Eigenforms
On Rankin-Cohen Brackets of Eigenforms Dominic Lanphier and Ramin Takloo-Bighash July 2, 2003 1 Introduction Let f and g be two modular forms of weights k and l on a congruence subgroup Γ. The n th Rankin-Cohen
More information1 Absolute values and discrete valuations
18.785 Number theory I Lecture #1 Fall 2015 09/10/2015 1 Absolute values and discrete valuations 1.1 Introduction At its core, number theory is the study of the ring Z and its fraction field Q. Many questions
More information1 Overview and revision
MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction
More informationCS250: Discrete Math for Computer Science
CS250: Discrete Math for Computer Science L6: Euclid s Algorithm & Multiplicative Inverses Mod m Greatest Common Divisors, GCD If d a and d b then d is a common divisor of a and b. 1, 2, 3, and 6 are common
More informationMATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST
MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST JAMES MCIVOR Today we enter Chapter 2, which is the heart of this subject. Before starting, recall that last time we saw the integers have unique factorization
More informationSuper congruences involving binomial coefficients and new series for famous constants
Tal at the 5th Pacific Rim Conf. on Math. (Stanford Univ., 2010 Super congruences involving binomial coefficients and new series for famous constants Zhi-Wei Sun Nanjing University Nanjing 210093, P. R.
More informationCONGRUENCE PROPERTIES FOR THE PARTITION FUNCTION. Department of Mathematics Department of Mathematics. Urbana, Illinois Madison, WI 53706
CONGRUENCE PROPERTIES FOR THE PARTITION FUNCTION Scott Ahlgren Ken Ono Department of Mathematics Department of Mathematics University of Illinois University of Wisconsin Urbana, Illinois 61801 Madison,
More informationPredictive criteria for the representation of primes by binary quadratic forms
ACTA ARITHMETICA LXX3 (1995) Predictive criteria for the representation of primes by binary quadratic forms by Joseph B Muskat (Ramat-Gan), Blair K Spearman (Kelowna, BC) and Kenneth S Williams (Ottawa,
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationA q-series IDENTITY AND THE ARITHMETIC OF HURWITZ ZETA FUNCTIONS
A -SERIES IDENTITY AND THE ARITHMETIC OF HURWITZ ZETA FUNCTIONS GWYNNETH H COOGAN AND KEN ONO Introduction and Statement of Results In a recent paper [?], D Zagier used a -series identity to prove that
More informationOn Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers
A tal given at the Institute of Mathematics, Academia Sinica (Taiwan (Taipei; July 6, 2011 On Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers Zhi-Wei Sun Nanjing University
More informationA Classification of Integral Apollonian Circle Packings
A Classification of Integral Apollonian Circle Pacings Tabes Bridges Warren Tai Advised by: Karol Koziol 5 July 011 Abstract We review the basic notions related to Apollonian circle pacings, in particular
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178
More informationSmith theory. Andrew Putman. Abstract
Smith theory Andrew Putman Abstract We discuss theorems of P. Smith and Floyd connecting the cohomology of a simplicial complex equipped with an action of a finite p-group to the cohomology of its fixed
More information. As the binomial coefficients are integers we have that. 2 n(n 1).
Math 580 Homework. 1. Divisibility. Definition 1. Let a, b be integers with a 0. Then b divides b iff there is an integer k such that b = ka. In the case we write a b. In this case we also say a is a factor
More informationarxiv: v1 [math.nt] 8 Sep 2014
arxiv:1409.2463v1 [math.nt] 8 Sep 2014 On the Diophantine equation X 2N +2 2α 5 2β p 2γ = Z 5 Eva G. Goedhart and Helen G. Grundman Abstract We prove that for each odd prime p, positive integer α, and
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationMath 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby
Math 8: Advanced Number Theory Samit Dasgupta and Gary Kirby April, 05 Contents Basics of Number Theory. The Fundamental Theorem of Arithmetic......................... The Euclidean Algorithm and Unique
More informationNOTES ON DIOPHANTINE APPROXIMATION
NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse January 29, 200 9 p-adic Numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationMATH 2030: MATRICES ,, a m1 a m2 a mn If the columns of A are the vectors a 1, a 2,...,a n ; A is represented as A 1. .
MATH 030: MATRICES Matrix Operations We have seen how matrices and the operations on them originated from our study of linear equations In this chapter we study matrices explicitely Definition 01 A matrix
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationMATH 152 Problem set 6 solutions
MATH 52 Problem set 6 solutions. Z[ 2] is a Euclidean domain (i.e. has a division algorithm): the idea is to approximate the quotient by an element in Z[ 2]. More precisely, let a+b 2, c+d 2 Z[ 2] (of
More informationFinite Fields: An introduction through exercises Jonathan Buss Spring 2014
Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence
More informationA CONGRUENTIAL IDENTITY AND THE 2-ADIC ORDER OF LACUNARY SUMS OF BINOMIAL COEFFICIENTS
A CONGRUENTIAL IDENTITY AND THE 2-ADIC ORDER OF LACUNARY SUMS OF BINOMIAL COEFFICIENTS Gregory Tollisen Department of Mathematics, Occidental College, 1600 Campus Road, Los Angeles, USA tollisen@oxy.edu
More informationExtend Fermats Small Theorem to r p 1 mod p 3 for divisors r of p ± 1
Extend Fermats Small Theorem to r p 1 mod p 3 for divisors r of p ± 1 Nico F. Benschop AmSpade Research, The Netherlands Abstract By (p ± 1) p p 2 ± 1 mod p 3 and by the lattice structure of Z(.) mod q
More informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
More information2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.
2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say
More informationElementary Number Theory Review. Franz Luef
Elementary Number Theory Review Principle of Induction Principle of Induction Suppose we have a sequence of mathematical statements P(1), P(2),... such that (a) P(1) is true. (b) If P(k) is true, then
More informationDiscrete Math, Second Problem Set (June 24)
Discrete Math, Second Problem Set (June 24) REU 2003 Instructor: Laszlo Babai Scribe: D Jeremy Copeland 1 Number Theory Remark 11 For an arithmetic progression, a 0, a 1 = a 0 +d, a 2 = a 0 +2d, to have
More informationEquations in Quadratic Form
Equations in Quadratic Form MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this lesson we will learn to: make substitutions that allow equations to be written
More informationApéry Numbers, Franel Numbers and Binary Quadratic Forms
A tal given at Tsinghua University (April 12, 2013) and Hong Kong University of Science and Technology (May 2, 2013) Apéry Numbers, Franel Numbers and Binary Quadratic Forms Zhi-Wei Sun Nanjing University
More informationSOME AMAZING PROPERTIES OF THE FUNCTION f(x) = x 2 * David M. Goldschmidt University of California, Berkeley U.S.A.
SOME AMAZING PROPERTIES OF THE FUNCTION f(x) = x 2 * David M. Goldschmidt University of California, Berkeley U.S.A. 1. Introduction Today we are going to have a look at one of the simplest functions in
More informationWilliam Stallings Copyright 2010
A PPENDIX E B ASIC C ONCEPTS FROM L INEAR A LGEBRA William Stallings Copyright 2010 E.1 OPERATIONS ON VECTORS AND MATRICES...2 Arithmetic...2 Determinants...4 Inverse of a Matrix...5 E.2 LINEAR ALGEBRA
More informationMath1a Set 1 Solutions
Math1a Set 1 Solutions October 15, 2018 Problem 1. (a) For all x, y, z Z we have (i) x x since x x = 0 is a multiple of 7. (ii) If x y then there is a k Z such that x y = 7k. So, y x = (x y) = 7k is also
More information1 x i. i=1 EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA
Volume, Number 2, Pages 63 78 ISSN 75-0868 ON THE EQUATION n i= = IN DISTINCT ODD OR EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA Abstract. In this paper we combine theoretical
More informationGood Integers and Applications in Coding Theory. Silpakorn University
Good Integers and in Coding Theory Somphong Jitman Silpakorn University March 1, 2017 @MUIC God made the integers, all else is the work of man. L. Kronecker 1 Good Integers 2 Good Integers P. Moree (1997)
More information