q-binomial coefficient congruences
|
|
- Jonah Webb
- 5 years ago
- Views:
Transcription
1 CARMA Analysis and Number Theory Seminar University of Newcastle August 23, 2011 Tulane University, New Orleans 1 / 35
2 Our first -analogs The natural number n has the -analog: [n] = n 1 1 = n 1 In the limit 1 a -analog reduces to the classical object. 2 / 35
3 Our first -analogs The natural number n has the -analog: [n] = n 1 1 = n 1 In the limit 1 a -analog reduces to the classical object. The -factorial: [n]! = [n] [n 1] [1] The -binomial coefficient: ( ) n = k ( ) [n]! n [k]! [n k]! = n k D1 2 / 35
4 A -binomial coefficient Example (6 ) 2 = ( )( ) 1 + = (1 + 2 ) ( ) ( ) }{{}}{{} =[3] =[5] Let us understand the first term a bit better! 3 / 35
5 Cyclotomic polynomials The nth cyclotomic polynomial: Φ n () = ( ζ k ) where ζ = e 2πi/n 1 k<n (k,n)=1 This is an irreducible polynomial with integer coefficients. irreducibility due to Gauss nontrivial 4 / 35
6 Cyclotomic polynomials The nth cyclotomic polynomial: Φ n () = ( ζ k ) where ζ = e 2πi/n 1 k<n (k,n)=1 This is an irreducible polynomial with integer coefficients. irreducibility due to Gauss nontrivial [n] = n 1 1 = Φ d () 1<d n d n For primes: [p] = Φ p() 4 / 35
7 Cyclotomic polynomials The nth cyclotomic polynomial: Φ n () = ( ζ k ) where ζ = e 2πi/n 1 k<n (k,n)=1 This is an irreducible polynomial with integer coefficients. irreducibility due to Gauss nontrivial [n] = n 1 1 = Φ d () 1<d n d n For primes: [p] = Φ p() An irreducible monic integral polynomial is cyclotomic if and only if its Mahler measure max( α, 1) is 1. 4 / 35
8 Some cyclotomic polynomials exhibited Example Φ mn () = Φ n ( m ) if m n Φ 2n () = Φ n ( ) for odd n > 1 Φ 2 () = + 1 Φ n () is palindromic Φ 3 () = Φ 6 () = Φ 9 () = Φ 21 () = Φ 102 () = / 35
9 Some cyclotomic polynomials exhibited Example Φ mn () = Φ n ( m ) if m n Φ 2n () = Φ n ( ) for odd n > 1 Φ 2 () = + 1 Φ n () is palindromic Φ 3 () = Φ 6 () = Φ 9 () = Φ 21 () = Φ 105 () = / 35
10 Back to -binomials [n] = n 1 1 = 1<d n d n Φ d () ( ) n = [n] [n 1] [n k + 1] k [k] [k 1] [1] How often does Φ d () appear in this? It appears n d n k d k d times 6 / 35
11 Back to -binomials [n] = n 1 1 = 1<d n d n Φ d () ( ) n = [n] [n 1] [n k + 1] k [k] [k 1] [1] How often does Φ d () appear in this? n n k k It appears times d d d Obviously nonnegative: the -binomials are indeed polynomials Also ( ) at most one: suare-free n always contains Φ n () if 0 < k < n. k Good way to compute -binomials and even get them factorized for free 6 / 35
12 The coefficients of -binomial coefficients Here s some -binomials in expanded form: Example ( ) 6 = ( ) 9 = All coefficients are positive! What is the degree of the -binomial? 7 / 35
13 The coefficients of -binomial coefficients Here s some -binomials in expanded form: Example ( ) 6 = ( ) 9 = All coefficients are positive! What is the degree of the -binomial? It is (n k)k. 7 / 35
14 The coefficients of -binomial coefficients Here s some -binomials in expanded form: Example ( ) 6 = ( ) 9 = All coefficients are positive! What is the degree of the -binomial? It is (n k)k. In fact, the coefficients are unimodal. Sylvester, / 35
15 -binomials: Pascal s triangle Define the -binomials via the -Pascal rule: ( ) ( ) ( ) n n 1 n 1 = + k k k 1 k D2 8 / 35
16 -binomials: Pascal s triangle Define the -binomials via the -Pascal rule: ( ) ( ) ( ) n n 1 n 1 = + k k k 1 k D (1 + ) (1 + ) / 35
17 -binomials: Pascal s triangle Define the -binomials via the -Pascal rule: ( ) ( ) ( ) n n 1 n 1 = + k k k 1 k D (1 + ) (1 + ) Example ( ) 4 = ( ) = / 35
18 -binomials: combinatorial ( ) n = w(s) where w(s) = k S ( n j k) s j j w(s) = normalized sum of S D3 Example {1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4} ( ) 4 = / 35
19 -binomials: combinatorial ( ) n = w(s) where w(s) = k S ( n j k) s j j w(s) = normalized sum of S D3 Example {1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4} ( ) 4 = ( ) n The coefficient of m in counts the number of k k-element subsets of n whose normalized sum is m 9 / 35
20 -binomials: combinatorial ( ) n = w(s) where w(s) = k S ( n j k) s j j w(s) = normalized sum of S D3 Example {1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4} ( ) 4 = ( ) n The coefficient of m in counts the number of k k-element subsets of n whose normalized sum is m words made from k ones and n k twos which have m inversions 9 / 35
21 -binomials: combinatorial ( ) n = w(s) where w(s) = k S ( n j k) s j j w(s) = normalized sum of S D3 Example {1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4} ( ) 4 = ( ) n The coefficient of m in counts the number of k k-element subsets of n whose normalized sum is m words made from k ones and n k twos which have m inversions partitions λ of m whose Ferrer s diagram fits in a k (n k) box 9 / 35
22 -Chu-Vandermonde Different representations make different properties apparent! Chu-Vandermonde: ( ) m + n = k j ( )( m n ) j k j 10 / 35
23 -Chu-Vandermonde Different representations make different properties apparent! ( ) m + n Chu-Vandermonde: = ( )( ) m n k j k j j Purely from the combinatorial representation: ( ) m + n = S k(k+1)/2 k S ( m+n k ) 10 / 35
24 -Chu-Vandermonde Different representations make different properties apparent! ( ) m + n Chu-Vandermonde: = ( )( ) m n k j k j j Purely from the combinatorial representation: ( ) m + n = S k(k+1)/2 k S ( m+n k ) = j S 1 ( m j ) S 2 ( n k j) S 1 + S 2 +(k j)m k(k+1)/2 10 / 35
25 -Chu-Vandermonde Different representations make different properties apparent! ( ) m + n Chu-Vandermonde: = ( )( ) m n k j k j j Purely from the combinatorial representation: ( ) m + n = S k(k+1)/2 k S ( m+n k ) = j = j S 1 ( m j ) S 2 ( k j) n ( ) ( ) m n j k j S 1 + S 2 +(k j)m k(k+1)/2 (m j)(k j) 10 / 35
26 Automatic proving of -identities In[1]:= " docs math mathematica packages Zeil.m"; -Zeilberger Package by Axel Riese RISC Linz V 2.42 (02/18/05) In[2]:= Out[2]= Zeil Binomial m, j, Binomial n, k j, ^ m j k j, j, 0, m n, k, k m n SUM 1 k SUM k 1 k P. Paule and A. Riese A Mathematica -Analogue of Zeilberger s Algorithm Based on an Algebraically Motivated Approach to -Hypergeometric Telescoping Fields Inst. Commun., Vol. 14, / 35
27 Automatic proving of -identities In[1]:= " docs math mathematica packages Zeil.m"; -Zeilberger Package by Axel Riese RISC Linz V 2.42 (02/18/05) In[2]:= Out[2]= Zeil Binomial m, j, Binomial n, k j, ^ m j k j, j, 0, m n, k, k m n SUM 1 k SUM k 1 k Encoded implementation in Mathematica at risk of bit rot? last version of Zeil by Alex Riese from 2005 many examples don t work in MMA7 anymore... Sage as a solution? P. Paule and A. Riese A Mathematica -Analogue of Zeilberger s Algorithm Based on an Algebraically Motivated Approach to -Hypergeometric Telescoping Fields Inst. Commun., Vol. 14, / 35
28 -binomials: algebraic Let be a prime power. ( ) n k = number of k-dim. subspaces of F n D4 12 / 35
29 -binomials: algebraic Let be a prime power. ( ) n = number of k-dim. subspaces of F n k D4 Number of ways to choose k linearly independent vectors in F n : ( n 1)( n ) ( n k 1 ) 12 / 35
30 -binomials: algebraic Let be a prime power. ( ) n = number of k-dim. subspaces of F n k D4 Number of ways to choose k linearly independent vectors in F n : ( n 1)( n ) ( n k 1 ) Hence the number of k-dim. subspaces of F n is: ( n 1)( n ) ( n k 1 ) ( k 1)( k ) ( k k 1 ) = ( ) n k 12 / 35
31 -binomials: noncommuting variables Suppose yx = xy where commutes with x, y. Then: (x + y) n = n j=0 ( ) n x j y n j j D5 13 / 35
32 -binomials: noncommuting variables Suppose yx = xy where commutes with x, y. Then: (x + y) n = n j=0 ( ) n x j y n j j D5 Example ( ) 4 x 2 y 2 = xxyy + xyxy + xyyx + yxxy + yxyx + yyxx 2 = ( )x 2 y 2 13 / 35
33 -binomials: noncommuting variables Suppose yx = xy where commutes with x, y. Then: (x + y) n = n j=0 ( ) n x j y n j j D5 Example ( ) 4 x 2 y 2 = xxyy + xyxy + xyyx + yxxy + yxyx + yyxx 2 = ( )x 2 y 2 Let X f(x) = xf(x) and Q f(x) = f(x). Then: QX f(x) = xf(x) = XQ f(x) 13 / 35
34 -calculus It all starts with the -derivative: D f(x) = f(x) f(x) x x 14 / 35
35 -calculus It all starts with the -derivative: D f(x) = f(x) f(x) x x Example D x s = (x)s x s x x = s 1 1 xs 1 = [s] x s 1 14 / 35
36 -calculus It all starts with the -derivative: D f(x) = f(x) f(x) x x Example D x s = (x)s x s x x = s 1 1 xs 1 = [s] x s 1 Define e x = n=0 x n [n]! D e x = e x e x e y e x+y unless yx = xy e x e x 1/ = 1 14 / 35
37 -calculus It all starts with the -derivative: D f(x) = f(x) f(x) x x Example D x s = (x)s x s x x = s 1 1 xs 1 = [s] x s 1 Define e x = n=0 x n [n]! Homework: Define cos (x), sin (x),... and develop some -trigonometry. D e x = e x e x e y e x+y unless yx = xy e x e x 1/ = 1 14 / 35
38 -calculus: the -integral Formally inverting D F (x) = f(x) gives: F (x) = x 0 f(x)d x := (1 ) n xf( n x) n=0 15 / 35
39 -calculus: the -integral Formally inverting D F (x) = f(x) gives: F (x) = x 0 f(x)d x := (1 ) n xf( n x) n=0 Theorem (Fundamental theorem of -calculus) Let 0 < < 1. Then D F (x) = f(x). F (x) is the uniue such function continuous at 0 with F (0) = 0. Fineprint: one needs for instance that f(x)x α is bounded on some (0, a]. 15 / 35
40 -calculus: special functions Define the -gamma function as Γ (s) = 0 x s 1 e x 1/ d x Γ (s + 1) = [s] Γ (s) Γ (n + 1) = [n]! 16 / 35
41 -calculus: special functions Define the -gamma function as -beta function: B (t, s) = Γ (s) = x s 1 e x 1/ d x x t 1 (1 x) s 1 d x D6 Γ (s + 1) = [s] Γ (s) Γ (n + 1) = [n]! B (t, s) = Γ (t)γ (s) Γ (t + s) B (t, s) = B (s, t) Here, (x a) n is defined by: f(x) = (D n f)(a) (x a)n [n] n 0! Explicitly: (x a) n = (x a)(x a) (x n 1 a) 16 / 35
42 Summary: the -binomial coefficient The -binomial coefficient: ( ) n = k Via a -version of Pascal s rule [n]! [k]! [n k]! Combinatorially, as the generating function of the element sums of k-subsets of an n-set Algebraically, as the number of k-dimensional subspaces of F n Via a binomial theorem for noncommuting variables Analytically, via -integral representations We have not touched: uantum groups arising in representation theory and physics 17 / 35
43 Classical binomial congruences John Wilson (1773, Lagrange): (p 1)! 1 mod p Charles Babbage (1819): Joseph Wolstenholme (1862): James W.L. Glaisher (1900): Wilhelm Ljunggren (1952): ( ) 2p 1 1 p 1 mod p 2 ( ) 2p 1 1 p 1 mod p 3 ( ) mp 1 1 p 1 mod p 3 ( ) ( ) ap a bp b mod p 3 18 / 35
44 Wilson s congruence Wilson s congruence (Lagrange, 1773) (p 1)! 1 mod p known to Ibn al-haytham, ca AD This congruence holds if and only if p is a prime. Not great as a practical primality test though... The problem of distinguishing prime numbers from composite numbers... is known to be one of the most important and useful in arithmetic.... The dignity of the science itself seems to reuire that every possible means be explored for the solution of a problem so elegant and so celebrated. C. F. Gauss, Disuisitiones Arithmeticae, / 35
45 Babbage s congruence (n 1)! + 1 is divisible by n if and only if n is a prime number In attempting to discover some analogous expression which should be divisible by n 2, whenever n is a prime, but not divisible if n is a composite number... Charles Babbage is led to: Theorem (Babbage, 1819) For primes p 3: ( ) 2p 1 1 mod p 2 p 1 20 / 35
46 Babbage s congruence (n 1)! + 1 is divisible by n if and only if n is a prime number In attempting to discover some analogous expression which should be divisible by n 2, whenever n is a prime, but not divisible if n is a composite number... Charles Babbage is led to: Theorem (Babbage, 1819) For primes p 3: ( ) 2p 1 1 mod p 2 p 1 ( ) 2n 1 (n + 1)(n + 2) (2n 1) = n (n 1) 20 / 35
47 Babbage s congruence (n 1)! + 1 is divisible by n if and only if n is a prime number In attempting to discover some analogous expression which should be divisible by n 2, whenever n is a prime, but not divisible if n is a composite number... Charles Babbage is led to: Theorem (Babbage, 1819) For primes p 3: ( ) 2p 1 1 mod p 2 p 1 ( ) 2n 1 (n + 1)(n + 2) (2n 1) = n (n 1) Does not uite characterize primes! n = / 35
48 A simple combinatorial proof We have ( ) 2p = p k ( )( p p ) k p k Note that p divides ( ) p unless k = 0 or k = p. k 21 / 35
49 A simple combinatorial proof We have Note that p divides ( ) 2p = p k ( )( p p ) k p k mod p 2 ( ) p unless k = 0 or k = p. k 21 / 35
50 A simple combinatorial proof We have ( ) 2p = p k ( )( p p ) k p k mod p 2 ( ) p Note that p divides unless k = 0 or k = p. k ( ) 2p 1 = 1 ( ) 2p which is only trouble when p = 2 p 1 2 p 21 / 35
51 A -analog of Babbage s congruence Using -Chu-Vandermonde ( ) 2p = ( ) ( ) p p (p k)2 p k k p k Again, [p] divides p2 + 1 ( ) p unless k = 0 or k = p. k mod [p] 2 22 / 35
52 A -analog of Babbage s congruence Using -Chu-Vandermonde ( ) 2p = ( ) ( ) p p (p k)2 p k k p k Again, [p] divides p2 + 1 ( ) p unless k = 0 or k = p. k mod [p] 2 Theorem ( ) 2p [2] p p 2 mod [p]2 22 / 35
53 Extending the -analog Actually, the same argument shows: Theorem (W. Edwin Clark, 1995) ( ) ( ) ap a mod [p] 2 bp b p2 23 / 35
54 Extending the -analog Actually, the same argument shows: Theorem (W. Edwin Clark, 1995) ( ) ( ) ap a mod [p] 2 bp b p2 Sketch of the corresponding classical congruence: ( ) ap ( ) ( ) p p = bp k 1 k a k k a=bp ( ) a b mod p 2 We get a contribution whenever b of the a many k s are p. 23 / 35
55 Extending the -analog Actually, the same argument shows: Theorem (W. Edwin Clark, 1995) ( ) ( ) ap a mod [p] 2 bp b p2 No restriction on p the argument is combinatorial. Sketch of the corresponding classical congruence: ( ) ap ( ) ( ) p p = bp k 1 k a k k a=bp ( ) a b mod p 2 We get a contribution whenever b of the a many k s are p. 23 / 35
56 Extending the -analog Actually, the same argument shows: Theorem (W. Edwin Clark, 1995) ( ) ( ) ap a mod [p] 2 bp b p2 No restriction on p the argument is combinatorial. Similar Sketchresults of the by corresponding Andrews; e.g.: classical congruence: (( )) ap ( ) ( ) ap ap p = (a b)b(p 2) mod [p] 2 bp bp k 1 k b a k k a=bp p ( ) George Andrews a b -analogs of the binomial coefficient congruences of Babbage, Wolstenholme and Glaisher Discrete Mathematics 204, 1999 mod p 2 We get a contribution whenever b of the a many k s are p. 23 / 35
57 Wolstenholme and Ljunggren Amazingly, the congruences hold modulo p 3! Theorem (Wolstenholme, 1862) ( ) 2p 1 For primes p 5: 1 mod p 3 p 1... for several cases, in testing numerically a result of certain investigations, and after some trouble succeeded in proving it to hold universally / 35
58 Wolstenholme and Ljunggren Amazingly, the congruences hold modulo p 3! Theorem (Wolstenholme, 1862) ( ) 2p 1 For primes p 5: 1 mod p 3 p 1... for several cases, in testing numerically a result of certain investigations, and after some trouble succeeded in proving it to hold universally... Theorem (Ljunggren, 1952) ( ) ap For primes p 5: bp ( ) a b mod p 3 Note the restriction on p proofs are algebraic. 24 / 35
59 Proof of Wolstenholme s congruence ( ) 2p 1 (2p 1)(2p 2) (p + 1) = p (p 1) ) p 1 = ( 1) p 1 k=1 ( 1 2p k 25 / 35
60 Proof of Wolstenholme s congruence ( ) 2p 1 (2p 1)(2p 2) (p + 1) = p (p 1) ) p 1 = ( 1) p 1 k=1 1 2p 0<i<p ( 1 2p k 1 i + 4p2 0<i<j<p 1 ij mod p 3 25 / 35
61 Proof of Wolstenholme s congruence ( ) 2p 1 (2p 1)(2p 2) (p + 1) = p (p 1) ) p 1 = ( 1) p 1 k=1 1 2p 0<i<p = 1 2p 0<i<p ( 1 2p k 1 i + 4p2 1 i + 2p2 0<i<j<p 0<i<p 1 ij 1 i 2 mod p 3 2p 2 0<i<p 1 i 2 25 / 35
62 Proof of Wolstenholme s congruence ( ) 2p 1 (2p 1)(2p 2) (p + 1) = p (p 1) ) p 1 = ( 1) p 1 k=1 1 2p 0<i<p = 1 2p 0<i<p ( 1 2p k 1 i + 4p2 1 i + 2p2 0<i<j<p 0<i<p 1 ij 1 i 2 = = mod p 3 2p 2 p 1 k=1 p 1 k=1 0<i<p p + (p k) p k ( 1 + p ) k 1 i 2 25 / 35
63 Proof of Wolstenholme s congruence II Wolstenholme s congruence therefore follows from the fractional congruences p 1 i=1 p 1 i=1 1 i 0 mod p2, (1) 1 i 2 0 mod p 26 / 35
64 Proof of Wolstenholme s congruence II Wolstenholme s congruence therefore follows from the fractional congruences p 1 i=1 p 1 i=1 1 i 0 mod p2, (1) 1 i 2 0 mod p If n is not a multiple of p 1 then, using a primitive root g, i n (gi) n g n i n 0 mod p 0<i<p 0<i<p 0<i<p 26 / 35
65 Proof of Wolstenholme s congruence II Wolstenholme s congruence therefore follows from the fractional congruences p 1 i=1 p 1 i=1 1 i 0 mod p2, (1) 1 i 2 0 mod p If n is not a multiple of p 1 then, using a primitive root g, i n (gi) n g n i n 0 mod p 0<i<p 0<i<p 0<i<p Comparing the p 3 residues on the previous slide now shows (1). 26 / 35
66 Congruences for -harmonic numbers Theorem (Shi-Pan, 2007) p 1 i=1 p 1 i=1 1 p 1 [i] 2 ( 1) + p ( 1)2 [p] mod [p] 2 1 [i] 2 (p 1)(p 5) ( 1) 2 mod [p] / 35
67 Congruences for -harmonic numbers Theorem (Shi-Pan, 2007) p 1 i=1 p 1 i=1 1 p 1 [i] 2 ( 1) + p ( 1)2 [p] mod [p] 2 1 [i] 2 (p 1)(p 5) ( 1) 2 mod [p] 12 Example (p = 5) ( ) ( ) [i] 2 = i=1 ( + 1) 2 ( 2 + 1) 2 ( ) 2 27 / 35
68 Congruences for -harmonic numbers Theorem (Shi-Pan, 2007) p 1 i=1 p 1 i=1 1 p 1 [i] 2 ( 1) + p ( 1)2 [p] mod [p] 2 1 [i] 2 (p 1)(p 5) ( 1) 2 mod [p] 12 Example (p = 5) ( ) ( ) [i] 2 = i=1 ( + 1) 2 ( 2 + 1) 2 ( ) 2 Euivalent congruences can be given for This choice actually appears a bit more natural p 1 i=1 i [i] n 27 / 35
69 An exemplatory proof We wish to prove p 1 i=1 i [i] 2 p (1 )2 mod [p] Ling-Ling Shi and Hao Pan A -Analogue of Wolstenholme s Harmonic Series Congruence The American Mathematical Monthly, 144(6), / 35
70 An exemplatory proof We wish to prove Write: p 1 i=1 i [i] 2 p (1 )2 mod [p] p 1 i=1 i [i] 2 p 1 = (1 ) 2 i=1 i (1 i ) 2 } {{ } =:G() Ling-Ling Shi and Hao Pan A -Analogue of Wolstenholme s Harmonic Series Congruence The American Mathematical Monthly, 144(6), / 35
71 An exemplatory proof [p] = We wish to prove Write: p 1 p 1 i=1 ( ζ m ) m=1 i [i] 2 p (1 )2 mod [p] p 1 i=1 i [i] 2 p 1 = (1 ) 2 i=1 Hence we need to prove: G(ζ m ) = p i (1 i ) 2 } {{ } =:G() for m = 1, 2,..., p 1 Ling-Ling Shi and Hao Pan A -Analogue of Wolstenholme s Harmonic Series Congruence The American Mathematical Monthly, 144(6), / 35
72 An exemplatory proof [p] = We wish to prove Write: p 1 p 1 i=1 ( ζ m ) m=1 i=1 i [i] 2 p (1 )2 mod [p] p 1 i=1 i [i] 2 p 1 = (1 ) 2 i=1 i (1 i ) 2 } {{ } =:G() Hence we need to prove: G(ζ m ) = p2 1 for m = 1, 2,..., p 1 12 p 1 G(ζ m ζ mj p 1 ) = (1 ζ mj ) 2 = ζ j (1 ζ j ) 2 = G(ζ) i=1 Ling-Ling Shi and Hao Pan A -Analogue of Wolstenholme s Harmonic Series Congruence The American Mathematical Monthly, 144(6), / 35
73 An exemplatory proof II Define G(, z) = p 1 i=1 i (1 i z) 2 We need G(ζ, 1) = p / 35
74 An exemplatory proof II Define G(, z) = p 1 i=1 i (1 i z) 2 We need G(ζ, 1) = p p 1 G(ζ, z) = ζ i ζ ki (k + 1)z k i=1 k=0 29 / 35
75 An exemplatory proof II Define G(, z) = p 1 i=1 i (1 i z) 2 We need G(ζ, 1) = p p 1 G(ζ, z) = ζ i ζ ki (k + 1)z k = i=1 k=0 p 1 kz k 1 ζ ki k=1 i=1 29 / 35
76 An exemplatory proof II Define G(, z) = p 1 i=1 i (1 i z) 2 We need G(ζ, 1) = p p 1 G(ζ, z) = ζ i ζ ki (k + 1)z k = i=1 k=0 p 1 kz k 1 ζ ki k=1 k=1 i=1 = p pkz k 1 k=1 kz k 1 p 1 ζ ki = i=1 { p 1 1 if p k otherwise 29 / 35
77 An exemplatory proof II Define G(, z) = p 1 i=1 i (1 i z) 2 We need G(ζ, 1) = p p 1 G(ζ, z) = ζ i ζ ki (k + 1)z k = i=1 k=0 p 1 kz k 1 ζ ki k=1 k=1 i=1 = p pkz k 1 k=1 = p2 z p 1 (1 z p ) 2 1 (1 z) 2 kz k 1 p 1 ζ ki = i=1 { p 1 1 if p k otherwise 29 / 35
78 An exemplatory proof II Define G(, z) = p 1 i=1 i (1 i z) 2 We need G(ζ, 1) = p p 1 G(ζ, z) = ζ i ζ ki (k + 1)z k = i=1 k=0 p 1 kz k 1 ζ ki k=1 k=1 i=1 = p pkz k 1 k=1 kz k 1 p 1 ζ ki = i=1 { p 1 1 if p k otherwise = p2 z p 1 (1 z p ) 2 1 as z 1 (1 z) 2 p / 35
79 An exemplatory proof II Define G(, z) = p 1 i=1 i (1 i z) 2 We need G(ζ, 1) = p p 1 G(ζ, z) = ζ i ζ ki (k + 1)z k i=1 k=0 This is beautifully generalized in: p 1 = kz k 1 ζ ki Karl Dilcher Determinant expressions for -harmonic k=1 k=1 i=1 = p pkz k 1 k=1 kz k 1 p 1 ζ ki = i=1 { p 1 1 congruences and degenerate Bernoulli numbers Electronic Journal of Combinatorics 15, 2008 if p k otherwise = p2 z p 1 (1 z p ) 2 1 as z 1 (1 z) 2 p / 35
80 A -analog of Ljunggren s congruence Theorem (S, 2010) For primes p 5: ( ) ( ) ap a bp b p2 ( a b + 1 )( b ) p (p 1) 2 mod [p] 3 30 / 35
81 A -analog of Ljunggren s congruence Theorem (S, 2010) For primes p 5: ( ) ( ) ap a bp b p2 ( a b + 1 )( b ) p (p 1) 2 mod [p] 3 Example Choosing p = 13, a = 2, and b = 1, we have ( ) 26 = ( 13 1) 2 + ( ) 3 f() 13 where f() = is an irreducible polynomial with integer coefficients. 30 / 35
82 A -analog of Ljunggren s congruence Theorem (S, 2010) For primes p 5: ( ) ( ) ap a bp b p ( )( ) a b + 1 p 2 1 b (p 1) 2 mod [p] Example Choosing p = 13, a = 2, and b = 1, we have ( ) 26 = ( 13 1) 2 + ( ) 3 f() where f() = is an irreducible polynomial with integer coefficients / 35
83 Just coincidence? ( ) ap bp ( ) ( a a b b + 1 p2 )( b ) p (p 1) 2 mod [p] 3 Ernst Jacobsthal (1952) proved that Ljunggren s classical congruence holds modulo p 3+r where r is the p-adic valuation of ( ) ( )( ) a a b + 1 ab(a b) = 2a. b b It would be interesting to see if this generalization has a nice analog in the -world. 31 / 35
84 What happens for composite numbers? ( ) ap bp ( ) ( a a b b + 1 p2 )( b ) p (p 1) 2 mod [p] 3 Example (n = 12, a = 2, b = 1) ( ) 24 = (12 1) ( ) 3 f() }{{} Φ 12 () where f() = is an irreducible polynomial with integer coefficients. 32 / 35
85 What happens for composite numbers? ( ) ap bp ( ) ( a a b b + 1 p2 )( b ) p (p 1) 2 mod [p] 3 Example (n = 12, a = 2, b = 1) ( ) 24 = (12 1) ( ) 3 f() }{{} Φ 12 () where f() = is an irreducible polynomial with integer coefficients. Ljunggren s -congruence holds modulo Φ n () 3 if (n, 6) = 1 over integer coefficient polynomials! otherwise we get rational coefficients 32 / 35
86 Can we do better than modulo p 3? Are there primes p such that ( ) 2p 1 1 mod p 4? p 1 Such primes are called Wolstenholme primes. The only two known are and McIntosh, 1995: up to 10 9 C. Helou and G. Terjanian On Wolstenholme s theorem and its converse Journal of Number Theory 128, / 35
87 Can we do better than modulo p 3? Are there primes p such that ( ) 2p 1 1 mod p 4? p 1 Such primes are called Wolstenholme primes. The only two known are and McIntosh, 1995: up to 10 9 Infinitely many Wolstenholme primes are conjectured to exist. However, no primes are conjectured to exist for modulo p 5. C. Helou and G. Terjanian On Wolstenholme s theorem and its converse Journal of Number Theory 128, / 35
88 Can we do better than modulo p 3? Are there primes p such that ( ) 2p 1 1 mod p 4? p 1 Such primes are called Wolstenholme primes. The only two known are and McIntosh, 1995: up to 10 9 Infinitely many Wolstenholme primes are conjectured to exist. However, no primes are conjectured to exist for modulo p 5. Conjecturally, Wolstenholme s congruence characterizes primes: ( ) 2n 1 1 mod n 3 n is prime n 1 C. Helou and G. Terjanian On Wolstenholme s theorem and its converse Journal of Number Theory 128, / 35
89 Some open problems Extension to Jacobsthal s result? Extension to ( ) ap bp ( ) ] a [1 ab(a b) p3 b 3 B p 3 mod p 4, and insight into Wolstenholme primes? Is there a nice -analog for Gauss congruence? ( ) (p 1)/2 2a mod p (p 1)/4 where p = a 2 + b 2 and a 1 mod 4. Generalized to p 2 and p 3 by Chowla-Dwork-Evans (1986) and by Cosgrave-Dilcher (2010) 34 / 35
90 THANK YOU! Slides for this talk will be available from my website: Victor Kac and Pokman Cheung Quantum Calculus Springer, 2002 A -analog of Ljunggren s binomial congruence Proceedings of FPSAC, / 35
Supercongruences for Apéry-like numbers
Supercongruences for Apéry-lie numbers npr 2 seminar NIE, Singapore August 13, 2014 University of Illinois at Urbana Champaign A(n) = n ( n ) 2 ( n + =0 1, 5, 73, 1445, 33001, 819005, 21460825,... ) 2
More informationA mod p 3 analogue of a theorem of Gauss on binomial coefficients
A mod p 3 analogue of a theorem of Gauss on binomial coefficients Dalhousie University, Halifax, Canada ELAZ, Schloß Schney, August 16, 01 Joint work with John B. Cosgrave Dublin, Ireland We begin with
More informationA Generalization of Wilson s Theorem
A Generalization of Wilson s Theorem R. Andrew Ohana June 3, 2009 Contents 1 Introduction 2 2 Background Algebra 2 2.1 Groups................................. 2 2.2 Rings.................................
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 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 informationBinomial coefficients and k-regular sequences
Binomial coefficients and k-regular sequences Eric Rowland Hofstra University New York Combinatorics Seminar CUNY Graduate Center, 2017 12 22 Eric Rowland Binomial coefficients and k-regular sequences
More informationSupercongruences for Apéry-like numbers
Supercongruences for Apéry-like numbers AKLS seminar on Automorphic Forms Universität zu Köln March, 205 University of Illinois at Urbana-Champaign A(n) = n k=0 ( ) n 2 ( n + k k k ) 2, 5, 73, 445, 3300,
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 informationGaussian binomial coefficients with negative arguments
Gaussian binomial coefficients with negative arguments Sam Formichella and Armin Straub arxiv:1802.02684v1 [math.co] 8 Feb 2018 Department of Mathematics and Statistics University of South Alabama February
More informationA talk given at University of Wisconsin at Madison (April 6, 2006). Zhi-Wei Sun
A tal given at University of Wisconsin at Madison April 6, 2006. RECENT PROGRESS ON CONGRUENCES INVOLVING BINOMIAL COEFFICIENTS Zhi-Wei Sun Department of Mathematics Nanjing University Nanjing 210093,
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 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 informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
More informationFermat s Last Theorem for Regular Primes
Fermat s Last Theorem for Regular Primes S. M.-C. 22 September 2015 Abstract Fermat famously claimed in the margin of a book that a certain family of Diophantine equations have no solutions in integers.
More informationOn integral representations of q-gamma and q beta functions
On integral representations of -gamma and beta functions arxiv:math/3232v [math.qa] 4 Feb 23 Alberto De Sole, Victor G. Kac Department of Mathematics, MIT 77 Massachusetts Avenue, Cambridge, MA 239, USA
More informationCYCLOTOMIC POLYNOMIALS
CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where
More informationClassification of Finite Fields
Classification of Finite Fields In these notes we use the properties of the polynomial x pd x to classify finite fields. The importance of this polynomial is explained by the following basic proposition.
More informationCYCLOTOMIC POLYNOMIALS
CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationON DIVISIBILITY OF SOME POWER SUMS. Tamás Lengyel Department of Mathematics, Occidental College, 1600 Campus Road, Los Angeles, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (007, #A4 ON DIVISIBILITY OF SOME POWER SUMS Tamás Lengyel Department of Mathematics, Occidental College, 600 Campus Road, Los Angeles, USA
More informationUNCORRECTED SAMPLE PAGES. Extension 1. The binomial expansion and. Digital resources for this chapter
15 Pascal s In Chapter 10 we discussed the factoring of a polynomial into irreducible factors, so that it could be written in a form such as P(x) = (x 4) 2 (x + 1) 3 (x 2 + x + 1). In this chapter we will
More informationTewodros Amdeberhan, Dante Manna and Victor H. Moll Department of Mathematics, Tulane University New Orleans, LA 70118
The -adic valuation of Stirling numbers Tewodros Amdeberhan, Dante Manna and Victor H. Moll Department of Mathematics, Tulane University New Orleans, LA 7011 Abstract We analyze properties of the -adic
More informationMATH CSE20 Homework 5 Due Monday November 4
MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of
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 informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationAlgebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001
Algebra Review Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor June 15, 2001 1 Groups Definition 1.1 A semigroup (G, ) is a set G with a binary operation such that: Axiom 1 ( a,
More informationarxiv: v1 [math.nt] 22 Jan 2019
Factors of some truncated basic hypergeometric series Victor J W Guo School of Mathematical Sciences, Huaiyin Normal University, Huai an 223300, Jiangsu People s Republic of China jwguo@hytceducn arxiv:190107908v1
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #5 09/19/2013
18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #5 09/19/2013 5.1 The field of p-adic numbers Definition 5.1. The field of p-adic numbers Q p is the fraction field of Z p. As a fraction field,
More informationThe p-adic Numbers. Akhil Mathew
The p-adic Numbers Akhil Mathew ABSTRACT These are notes for the presentation I am giving today, which itself is intended to conclude the independent study on algebraic number theory I took with Professor
More informationHMMT February 2018 February 10, 2018
HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18
More informationTEST CODE: MMA (Objective type) 2015 SYLLABUS
TEST CODE: MMA (Objective type) 2015 SYLLABUS Analytical Reasoning Algebra Arithmetic, geometric and harmonic progression. Continued fractions. Elementary combinatorics: Permutations and combinations,
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
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 informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
More informationFourier Analysis. 1 Fourier basics. 1.1 Examples. 1.2 Characters form an orthonormal basis
Fourier Analysis Topics in Finite Fields (Fall 203) Rutgers University Swastik Kopparty Last modified: Friday 8 th October, 203 Fourier basics Let G be a finite abelian group. A character of G is simply
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationThe p-adic Numbers. Akhil Mathew. 4 May Math 155, Professor Alan Candiotti
The p-adic Numbers Akhil Mathew Math 155, Professor Alan Candiotti 4 May 2009 Akhil Mathew (Math 155, Professor Alan Candiotti) The p-adic Numbers 4 May 2009 1 / 17 The standard absolute value on R: A
More informationarxiv: v1 [math.nt] 29 Jul 2014
A PRIMALITY CRITERION BASED ON A LUCAS CONGRUENCE ROMEO MEŠTROVIĆ arxiv:407.7894v [math.nt] 29 Jul 204 ABSTRACT. Let p be a prime. In 878 É. Lucas proved that the congruence ( ) p ( ) (mod p) holds for
More informationSome Questions Concerning Computer-Generated Proofs of a Binomial Double-Sum Identity
J. Symbolic Computation (1994 11, 1 7 Some Questions Concerning Computer-Generated Proofs of a Binomial Double-Sum Identity GEORGE E. ANDREWS AND PETER PAULE Department of Mathematics, Pennsylvania State
More informationA MATRIX GENERALIZATION OF A THEOREM OF FINE
A MATRIX GENERALIZATION OF A THEOREM OF FINE ERIC ROWLAND To Jeff Shallit on his 60th birthday! Abstract. In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients ( n, for m
More informationCHMC: Finite Fields 9/23/17
CHMC: Finite Fields 9/23/17 1 Introduction This worksheet is an introduction to the fascinating subject of finite fields. Finite fields have many important applications in coding theory and cryptography,
More informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationINFINITELY MANY CONGRUENCES FOR BROKEN 2 DIAMOND PARTITIONS MODULO 3
INFINITELY MANY CONGRUENCES FOR BROKEN 2 DIAMOND PARTITIONS MODULO 3 SILVIU RADU AND JAMES A. SELLERS Abstract. In 2007, Andrews and Paule introduced the family of functions k n) which enumerate the number
More informationCHARACTERIZING THE NUMBER OF m ARY PARTITIONS MODULO m Mathematics Subject Classification: 05A17, 11P83
CHARACTERIZING THE NUMBER OF m ARY PARTITIONS MODULO m GEORGE E. ANDREWS, AVIEZRI S. FRAENKEL, AND JAMES A. SELLERS Abstract. Motivated by a recent conjecture of the second author related to the ternary
More informationGeneralized Lucas Sequences Part II
Introduction Generalized Lucas Sequences Part II Daryl DeFord Washington State University February 4, 2013 Introduction Èdouard Lucas: The theory of recurrent sequences is an inexhaustible mine which contains
More informationCongruences for algebraic sequences
Congruences for algebraic sequences Eric Rowland 1 Reem Yassawi 2 1 Université du Québec à Montréal 2 Trent University 2013 September 27 Eric Rowland (UQAM) Congruences for algebraic sequences 2013 September
More informationCongruences for combinatorial sequences
Congruences for combinatorial sequences Eric Rowland Reem Yassawi 2014 February 12 Eric Rowland Congruences for combinatorial sequences 2014 February 12 1 / 36 Outline 1 Algebraic sequences 2 Automatic
More informationLucas Congruences. A(n) = Pure Mathematics Seminar University of South Alabama. Armin Straub Oct 16, 2015 University of South Alabama.
Pure Mathematics Seminar University of South Alabama Oct 6, 205 University of South Alabama A(n) = n k=0 ( ) n 2 ( n + k k k ) 2, 5, 73, 445, 3300, 89005, 2460825,... Arian Daneshvar Amita Malik Zhefan
More informationCONGRUENCES MODULO SQUARES OF PRIMES FOR FU S k DOTS BRACELET PARTITIONS
CONGRUENCES MODULO SQUARES OF PRIMES FOR FU S k DOTS BRACELET PARTITIONS CRISTIAN-SILVIU RADU AND JAMES A SELLERS Dedicated to George Andrews on the occasion of his 75th birthday Abstract In 2007, Andrews
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationAn Additive Characterization of Fibers of Characters on F p
An Additive Characterization of Fibers of Characters on F p Chris Monico Texas Tech University Lubbock, TX c.monico@ttu.edu Michele Elia Politecnico di Torino Torino, Italy elia@polito.it January 30, 2009
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationq xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation.
Math 880 Alternative Challenge Problems Fall 2016 A1. Given, n 1, show that: m1 m 2 m = ( ) n+ 1 2 1, where the sum ranges over all positive integer solutions (m 1,..., m ) of m 1 + + m = n. Give both
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 informationMahler s Polynomials and the Roots of Unity
Mahler s Polynomials and the Roots of Unity James Pedersen 1 Introduction In their paper [4] "Mahler Polynomials and the Roots of Unity", Karl Dilcher and Larry Ericksen introduce the reader to the relationships
More informationRings. EE 387, Notes 7, Handout #10
Rings EE 387, Notes 7, Handout #10 Definition: A ring is a set R with binary operations, + and, that satisfy the following axioms: 1. (R, +) is a commutative group (five axioms) 2. Associative law for
More informationCoding Theory ( Mathematical Background I)
N.L.Manev, Lectures on Coding Theory (Maths I) p. 1/18 Coding Theory ( Mathematical Background I) Lector: Nikolai L. Manev Institute of Mathematics and Informatics, Sofia, Bulgaria N.L.Manev, Lectures
More informationSome sophisticated congruences involving Fibonacci numbers
A tal given at the National Center for Theoretical Sciences (Hsinchu, Taiwan; July 20, 2011 and Shanghai Jiaotong University (Nov. 4, 2011 Some sohisticated congruences involving Fibonacci numbers Zhi-Wei
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationMath 312/ AMS 351 (Fall 17) Sample Questions for Final
Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply
More information8. Dirichlet s Theorem and Farey Fractions
8 Dirichlet s Theorem and Farey Fractions We are concerned here with the approximation of real numbers by rational numbers, generalizations of this concept and various applications to problems in number
More informationUniversity of Rochester Topology Seminar. Doug Ravenel
Beyond elliptic cohomology and TMF: where number theory and stable homotopy theory meet in mortal combat. University of Rochester Topology Seminar Doug Ravenel March 10, 2006 1 2 1. Introduction This talk
More information1. Let r, s, t, v be the homogeneous relations defined on the set M = {2, 3, 4, 5, 6} by
Seminar 1 1. Which ones of the usual symbols of addition, subtraction, multiplication and division define an operation (composition law) on the numerical sets N, Z, Q, R, C? 2. Let A = {a 1, a 2, a 3 }.
More informationCourse MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography
Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups
More informationGalois Theory TCU Graduate Student Seminar George Gilbert October 2015
Galois Theory TCU Graduate Student Seminar George Gilbert October 201 The coefficients of a polynomial are symmetric functions of the roots {α i }: fx) = x n s 1 x n 1 + s 2 x n 2 + + 1) n s n, where s
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 informationCongruence Properties of Partition Function
CHAPTER H Congruence Properties of Partition Function Congruence properties of p(n), the number of partitions of n, were first discovered by Ramanujan on examining the table of the first 200 values of
More informationMath 370 Homework 2, Fall 2009
Math 370 Homework 2, Fall 2009 (1a) Prove that every natural number N is congurent to the sum of its decimal digits mod 9. PROOF: Let the decimal representation of N be n d n d 1... n 1 n 0 so that N =
More informationHankel determinants, continued fractions, orthgonal polynomials, and hypergeometric series
Hankel determinants, continued fractions, orthgonal polynomials, and hypergeometric series Ira M. Gessel with Jiang Zeng and Guoce Xin LaBRI June 8, 2007 Continued fractions and Hankel determinants There
More informationCYCLOTOMIC EXTENSIONS
CYCLOTOMIC EXTENSIONS KEITH CONRAD 1. Introduction For a positive integer n, an nth root of unity in a field is a solution to z n = 1, or equivalently is a root of T n 1. There are at most n different
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM
q-hypergeometric PROOFS OF POLYNOMIAL ANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM S OLE WARNAAR Abstract We present alternative, q-hypergeometric
More informationx 3 2x = (x 2) (x 2 2x + 1) + (x 2) x 2 2x + 1 = (x 4) (x + 2) + 9 (x + 2) = ( 1 9 x ) (9) + 0
1. (a) i. State and prove Wilson's Theorem. ii. Show that, if p is a prime number congruent to 1 modulo 4, then there exists a solution to the congruence x 2 1 mod p. (b) i. Let p(x), q(x) be polynomials
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 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
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 informationINFINITE FAMILIES OF STRANGE PARTITION CONGRUENCES FOR BROKEN 2-DIAMONDS
December 1, 2009 INFINITE FAMILIES OF STRANGE PARTITION CONGRUENCES FOR BROKEN 2-DIAMONDS PETER PAULE AND SILVIU RADU Dedicated to our friend George E. Andrews on the occasion of his 70th birthday Abstract.
More information18.S34 linear algebra problems (2007)
18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction
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 informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationOn Wolstenholme s theorem and its converse
Journal of Number Theory 8 008 475 499 www.elsevier.com/locate/jnt On Wolstenholme s theorem and its converse Charles Helou a,, Guy Terjanian b a Pennsylvania State University, 5 Yearsley Mill Road, Media,
More informationRegular Sequences. Eric Rowland. School of Computer Science University of Waterloo, Ontario, Canada. September 5 & 8, 2011
Regular Sequences Eric Rowland School of Computer Science University of Waterloo, Ontario, Canada September 5 & 8, 2011 Eric Rowland (University of Waterloo) Regular Sequences September 5 & 8, 2011 1 /
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationAlgebraic function fields
Algebraic function fields 1 Places Definition An algebraic function field F/K of one variable over K is an extension field F K such that F is a finite algebraic extension of K(x) for some element x F which
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 informationPARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND (2k + 1) CORES
PARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND 2k + CORES SILVIU RADU AND JAMES A. SELLERS Abstract. In this paper we prove several new parity results for broken k-diamond partitions introduced in
More informationChapter Generating Functions
Chapter 8.1.1-8.1.2. Generating Functions Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 8. Generating Functions Math 184A / Fall 2017 1 / 63 Ordinary Generating Functions (OGF) Let a n (n = 0, 1,...)
More informationQuadratic reciprocity (after Weil) 1. Standard set-up and Poisson summation
(December 19, 010 Quadratic reciprocity (after Weil Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ I show that over global fields k (characteristic not the quadratic norm residue symbol
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 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 informationThe Rule of Three for commutation relations
The Rule of Three for commutation relations Jonah Blasiak Drexel University joint work with Sergey Fomin (University of Michigan) May 2016 Symmetric functions The ring of symmetric functions Λ(x) = Λ(x
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 informationDepartment of Mathematics, Nanjing University Nanjing , People s Republic of China
Proc Amer Math Soc 1382010, no 1, 37 46 SOME CONGRUENCES FOR THE SECOND-ORDER CATALAN NUMBERS Li-Lu Zhao, Hao Pan Zhi-Wei Sun Department of Mathematics, Naning University Naning 210093, People s Republic
More informationA WEAK VERSION OF ROLLE S THEOREM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3147 3153 S 0002-9939(97)03910-5 A WEAK VERSION OF ROLLE S THEOREM THOMAS C. CRAVEN (Communicated by Wolmer
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 informationTest Codes : MIA (Objective Type) and MIB (Short Answer Type) 2007
Test Codes : MIA (Objective Type) and MIB (Short Answer Type) 007 Questions will be set on the following and related topics. Algebra: Sets, operations on sets. Prime numbers, factorisation of integers
More informationIRREDUCIBILITY TESTS IN Q[T ]
IRREDUCIBILITY TESTS IN Q[T ] KEITH CONRAD 1. Introduction For a general field F there is no simple way to determine if an arbitrary polynomial in F [T ] is irreducible. Here we will focus on the case
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 informationInteger Partitions and Why Counting Them is Hard
Portland State University PDXScholar University Honors Theses University Honors College 3-3-207 Integer Partitions and Why Counting Them is Hard Jose A. Ortiz Portland State University Let us know how
More information