Conjectures and Results on Super Congruences
|
|
- Julianna Poole
- 6 years ago
- Views:
Transcription
1 Conjectures and Results on Suer Congruences Zhi-Wei Sun Nanjing University Nanjing , P. R. China htt://math.nju.edu.cn/ zwsun Feb. 8, 2010
2 Part A. Previous Wor by Others
3 What are suer congruences? A suer congruence is a -adic congruence which haens to hold not just modulo a rime but a higher ower of. Examle. (Wolstenholme For any rime > 3 we have =1 1 0 (mod 2 and ( 2 1 = 1 ( 2 1 (mod Remar. It is easy to see that (/2 1 = ( = =1 and ( 2 1 = 1 =1 =1 + = =1 (/2 =1 ( (mod ( 1 + =1 1 (mod 2.
4 Suer Congruences for Aéry Numbers In 1978 Aéry roved that ζ(3 = n=1 1/n3 is irrational! During his roof he used the sequence {B(n/A(n} n=1 of rational numbers to aroximate ζ(3, where A(0 = 1, A(1 = 5, B(0 = 0, B(1 = 6, and both {A(n} n 0 and {B(n} n 0 satisfy the recurrence (n u n+1 = (2n + 1(17n n + 5u n n 3 u n 1 (n = 1, 2,.... In fact, A(n = n =0 ( n 2 ( n + and these numbers are called Aéry numbers. Dedeind eta function in the theory of modular forms: 2 η(τ = q 1/24 (1 q n with q = e 2πiτ n=1 Note that q < 1 if τ H = {z C : Im(z > 0}.
5 Beuers Conjecture (1985. For any rime > 3 we have the suer congruence ( 1 A a( (mod 2, 2 where a(n (n = 1, 2, 3,... are given by η 4 (2τη 4 (4τ = q (1 q 2n 4 (1 q 4n 4 = n=1 a(nq n. n=1 S. Ahlgren and Ken Ono [J. Reine Angew. Math. 518(2000]: The Beuers conjecture is true! Outline of their roof. First show that a( can be exressed as a secial value of the Gauss hyergeometric function 4 F 3 (λ defined in terms of Jacobi sums. Then rewrite Jacobi sums in terms of Gauss sums and aly the Gross-Koblitz formula to exress Gauss sums in terms of the -adic Gamma function Γ (x. Finally use combinatorial roerties of Γ (x and some sohisticated combinatorial identities involving harmonic numbers H n = 0< n 1/.
6 Gaussian hyergeometric series The rising factorial (or Pochhammer symbol: Note that (1 n = n!. (a n = a(a + 1 (a + n 1 = Classical Gaussian hyergeometric series: Γ(a + n. Γ(a r+1f r (α 0,..., α r ; β 1,..., β r x = n=0 (α 0 n (α 1 n (α r n x n (β 1 n (β r n n!, where 0 α 0 α 1 α r < 1 and 0 β 1 β r < 1.
7 Greene s character sum analogue of hyergeometric series Let be an odd rime. For two Dirichlet characters A and B mod, define the normalized Jacobi sum ( A := B( 1 J(A, B = B( 1 A(x B(1 x. B x=0 Given Dirichlet characters A 0, A 1,..., A r and B 1,..., B r mod, Greene [Trans. AMS, 1987] defined r+1f r (A 0, A 1,..., A r ; B 1,..., B r x = ( r ( A0 χ Ai χ χ(x. 1 χ B i χ χ i=1 r+1f r (A 0, A 1,..., A r ; B 1,..., B r x = A r B r ( 1 r F r 1 (A 0, A 1,..., A r 1 ; B 1,..., B r 1 xy y=0 A r (yār B r (1 y (Greene, 1987.
8 Connections to ellitic curves over F Let ε be the trivial character with ε (x = 1 for all x 0 (mod. Let φ be the Legendre character given by φ (x = ( x. Set r+1f r (x := r+1 F r (φ, φ,..., φ ; ε,..., ε x. Consider the curve over Q defined by 2E 1 (λ : y 2 = x(x 1(x λ. If λ Q \ {0, 1}, then 2 E 1 (λ is an ellitic curve with ( 2 E 1 (λ = 16λ 2 (λ 1 2 (discriminant j( 2 E 1 (λ = 256(λ2 λ λ 2 (λ 1 2 (j invariant.
9 Connections to ellitic curves over F Suose λ(λ 1 0 (mod. Then is a rime of good reduction for 2 E 1 (λ, and we define 2a 1 (; λ := E 1 (λ where 2 E 1 (λ denotes the number of F -oints of 2 E 1 (λ including the oint at infinity. It is nown that and 2a 1 (; λ = φ (x(x 1(x λ x=0 2F 1 (λ = φ ( 1 2a 1 (; λ = ( 1 ( x(x 1(x λ. x=0
10 Conjectures of Rodriguez-Villegas In 2001 Rodriguez-Villegas conjectured 22 congruences which relate truncated hyergeometric series to the number of F -oints of some family of Calabi-Yau manifolds. Here we list some of them. ( 2 2 ( 1 16 = ( 1 (/2 (mod 2, =0 ( 2 ( 3 ( 27 (mod 2, 3 =0 ( 2 ( 4 ( 2 2 (mod 2, =0 =0 ( 6 3 =0 64 ( ( 2 3 ( 1 64 [q ]q (mod 2, (1 q 4n 6 (mod 2. n=1
11 A theorem of Stienstra and Beuers J. Stienstra and F. Beuers [Math. Ann. 27(1985]: [q ]q (1 q 4n 6 = = n=1 { 4x 2 2 if = 1 (mod 4 & = x 2 + y 2 with 2 x & 2 y, 0 if 3 (mod 4; [q ]q = (1 q n 2 (1 q 2n (1 q 4n (1 q 8n 2 n=1 { 4x 2 2 if = 1, 3 (mod 8 & = x 2 + 2y 2 with x, y Z, 0 if 5, 7 (mod 8; [q ]q (1 q 2n 3 (1 q 6n 3 n=1 { 4x 2 2 if = 1 (mod 3 & = x 2 + 3y 2 with x, y Z, 0 if 2 (mod 3.
12 Progress on Rodriguez-Villegas conjectures The congruences we list have been confirmed, see, E. Motenson, J. Number Theory 99(2003; Trans. AMS 355(2003; Proc. AMS 133(2005. Many of the 22 conjectures remain oen.
13 Ramanujan s series for 1/π Here are 5 of the 17 Ramanujan series recorded by him in 1914: =0 ( 2 3 ( 1 (4 + 1 (1/23 (1 3 = (4 + 1 ( 64 = 2 π, = ( 4 =0 =0 = (1/23 ( ( 8 (1/23 ( (1/23 (1 3 (1/2 (1/4 (3/4 (1 3 =0 ( 2 3 = ( = 4 π, =0 ( 2 3 = (6 + 1 ( 512 = 2 2 π, =0 ( 2 3 = ( = 16 π, =0 ( 4,,, = ( ( 1024 = 8 π. =0 Remar. The first one was actually roved by G. Bauer in 1859.
14 Hamme s Conjectures L. Van Hamme [1997] conjectured the -adic analogues of the above first 4 identities and W. Zudilin [JNT, 2009] obtained the -adic analogue of the last identity. (/2 =0 (/2 =0 (/2 =0 ( 2 3 (4 + 1 ( 64 ( 1 (mod 3, ( 2 3 ( 1 ( (mod 4, ( 2 3 ( 2 (6 + 1 ( 512 (mod 3, (/2 ( 2 3 ( =0 ( 4,,, ( ( 1024 =0 ( 1 5 (mod 4, ( 1 3 (mod 3.
15 Progress on Hamme s conjectures The first of the above congruence was roved by E. Mortenson [Proc. AMS 136(2008] and the second one was recently shown by Ling Long, while the last was confirmed by Zudilin via the WZ method. The third and the fourth remain oen. The -adic Gamma function lays an imortant role in Hamme s formulation of those conjectures. It is defined in the following way: Γ (n := ( 1 n (n = 1, 2, 3,... 1<<n n and Γ (x = lim n x Γ (n for any adic integer x.
16 Part B. My Results and Conjectures
17 Some Joint Wor H. Pan and Z. W. Sun [Discrete Math. 2006]. ( ( 2 d (mod (d = 0,...,, + d 3 =0 =1 ( 2 0 (mod for > 3. Sun & R. Tauraso [arxiv: , Adv. in Al. Math.]. a 1 ( ( 2 a (mod 2, 3 =0 =1 ( B 3 (mod 3 for > 3, L. L. Zhao, H. Pan and Z. W. Sun [Proc. AMS, 2010] 2 ( 3 0 (mod.
18 My own results Observe that if /2 < < then ( 2 = (2! 0 (mod (! 2 and so =0 ( 2 (/2 m =0 where m is an integer with m. ( 2 m (mod, In 2009 I [arxiv: , arxiv: , ] determined =0 ( 2 m mod 2, (/2 =0 in terms of linear recurrences. ( 2 m mod 2, =0 ( 3 m mod
19 Some articular congruences due to me =0 =0 ( 2 2 ( 1 ( 2 ( 3 3 ( 2 ( 1 =0 (/2 =0 (mod 2, (mod 2, (/2 =0 (/2 =0 ( 2 ( ( 2 ( 3 ( (1 2F 5 ( 5 (mod 2, ( 2 ( ( ( F ( 5 where {F n } n 0 is the Fibonacci sequence defined by (mod 2, (mod 2. (mod 2, F 0 = 0, F 1 = 1, F n+1 = F n + F n 1 (n = 1, 2, 3,....
20 Some articular congruences due to me =0 =0 =0 ( (( 4 5 ( 3 1 (mod, { 2 (mod if ±2 (mod 7, 7 1 (mod otherwise. ( 4 1 (mod if 1 (mod 5 & 11, 5 1/11 (mod if 2, 3 (mod 5, 9/11 (mod if 4 (mod 5. If 1 (mod 3 then =0 ( (/3 (mod.
21 My recent results on suer congruences Recall that Euler numbers E 0, E 1,... are given by E 0 = 1, ( n E n = 0 (n = 1, 2, 3, It is nown that E 1 = E 3 = E 5 = = 0 and sec x = ( 1 n x 2n ( E 2n x < π. (2n! 2 n=0 Z. W. Sun [arxiv: ]. =0 (/2 =0 ( 2 2 ( 1 (/2 2 E 3 (mod 3, ( 2 8 ( 2 + ( E 3 (mod 3..
22 My recent results on suer congruences (/2 =1 (/2 =0 (/2 =0 ( 2 (/2 2 ( ( 1 =1 1 2( 2 ( 1 (mod 2, (/2 3 8 =1 ( ( 1(+1/ (2 1 =0 + ( 1 (/2 3 (/2 32 =1 =1 ( 2 ( 2 (mod 4, (mod 4. Remar. Via some advanced tools, R. Osburn and C. Schneider [Math. Com. 78(2009] roved that (/2 ( 2 2 ( 1 (/ (/2 ( 8 2 (mod 3.
23 Conjecture 1 I have formulated over 50 conjectures on suer congruences, see Z. W. Sun, Oen Conjectures on Congruences, arxiv: Conjecture 1. For any rime > 3 we have (/2 =1 (/2 =1 (/2 =0 /2<< /2<< ( 2 ( 1 (+1/2 8 3 E 3 (mod 2, 1 2( ( 1 (/ E 3 (mod, ( ( 1 (/2 + 2 E 3 (mod 3, ( E 3 (mod 3, 2 ( E 3 (mod 3.
24 A Remar to Conjecture 1 Remar. I have roved that the first, the second and the third congruences are equivalent. Note that lim + ( = 1 π and =0 1 2( = π
25 Conjecture 2 Let > 3 be a rime. Then =0 ( { 2 3 4x 2 2 (mod 2 if ( 7 = 1 & = x 2 + 7y 2, 0 (mod 2 if ( 7 = 1. Moreover, and (/2 =0 ( 2 3 ( (mod 4 =0 ( 2 3 ( ( E 3 (mod 4. Remar. Quite recently M. Jameson and K. Ono claimed to have a roof of the first congruence via the theory of modular forms and K 3 surfaces related to Calabi-Yau manifolds.
26 Conjecture 3 Let be an odd rime. Then =0 ( 2 2 ( 3 64 { x 2 2 (mod 2 if ( 11 = 1 & 4 = x y 2 (x, y Z, 0 (mod 2 if ( 11 = 1, i.e., 2, 6, 7, 8, 10 (mod 11. Furthermore, ( =0 ( 2 2 ( (mod 4. Remar. It is well-nown that the quadratic field Q( 11 has class number one and hence for any odd rime with ( 11 = 1 we can write 4 = x y 2 with x, y Z.
27 Conjecture 4 Let > 3 be a rime. If 1 (mod 3 and = x 2 + 3y 2 with x, y Z, then =0 ( x 2 2 (mod 2 and If 2 (mod 3, then =0 ( 2 Furthermore, and (/2 = (mod 2 and =0 =0 =0 ( 2 3 ( (mod 4 (3 + 1 ( x 2 3 (mod 2. ( (mod 2. ( 2 3 ( E 3 (mod 4.
28 Conjecture 5 Let > 3 be a rime. Then =0 ( 3,, 24 =0 =0 ( 2 ( 3,, ( 27 ( 3 {( 2(/3,, ( 216 (/3 (mod 2 if 1 (mod 6, 0 (mod if 5 (mod 6. 4x 2 2 (mod 2 if 1, 4 (mod 15 & = x y 2, 20x 2 2 (mod 2 if 2, 8 (mod 15 & = 5x 2 + 3y 2, 0 (mod 2 if ( 15 = 1. = ( 27 ( 2 2 ( 3 ( 4 3 (mod 3.
29 Conjecture 6 Let > 5 be a rime. Then ( 4,,, ( 2 10 =0 4x 2 2 (mod 2 if 1, 9 (mod 20 & = x 2 + 5y 2, 2( x 2 (mod 2 if 3, 7 (mod 20 & 2 = x 2 + 5y 2, 0 (mod 2 if 11, 13, 17, 19 (mod 20. =0 ( 2 2 ( x 2 2 (mod 2 if 1, 7 (mod 24 & 4 = x 2 + 6y 2, 2x 2 2 (mod 2 if 5, 11 (mod 24 & 2 = x 2 + 6y 2, 0 (mod 2 if 13, 17, 19, 23 (mod 24. ( 2 2 ( 3 ( ( (mod 3. 3 =0
30 Conjecture 7 Let > 3 be a rime. If ( 7 = 1 and = x 2 + 7y 2 with ( x 7 = 1, then ( 2 ( 4 ( 2 ( 63 2x (mod 2 3 2x and =0 =0 ( 2 If ( 7 = 1, then =0 ( 2 ( 4 ( ( (mod and ( 2x x =0 ( 2 (mod 2. ( (mod.
31 Conjecture 8 Let be an odd rime. Then (3 + 1 ( 8 =0 ( 2 If 1 (mod 4, then =0 If 3 (mod 4, then and =0 3 ( E 3 (mod 4. ( 2 3 ( ( ( 8 0 (mod 3. =0 ( 2 3 ( 8 0 (mod 2 ( 2 2 ( ( 2 0 (mod 3.
32 Conjecture 9 Let > 5 be a rime. If 1 (mod 4, then =0 If 3 (mod 4. Then and 3( (mod 2. ( ( 2 1 ( 8 0 (mod 2, =0 2 ( ( 2 1 ( 64 0 (mod 2. =0 Remar. The last congruence is equivalent to =0 ( H 0 (mod with H = 0<j 1 j.
33 Conjecture 10 Let > 3 be a rime. If 7 (mod 12 and = x 2 + 3y 2 with y 1 (mod 4, then and =0 ( ( 2 2 ( 3 ( 16 ( 1( 3/4 4y 3y =0 If 1 (mod 12, then (mod 2 ( ( ( 16 ( 1(+1/4 y (mod 2. ( 1 =0 ( 3 ( (mod 2.
34 Recall that the Pell sequence {P n } n 0 is given by P 0 = 0, P 1 = 1, and P n+1 = 2P n + P n 1 (n = 1, 2, 3,.... Conjecture 11 Let be an odd rime. If 1, 3 (mod 8 and = x 2 + 2y 2 with x, y Z and x 1, 3 (mod 8, then =0 P ( 8 =0 ( { (mod 2 if 8 1, ( 1 ( 3/8 ( 2x 2x (mod 2 if 8 3. P ( 8 We also have =0 P ( 8 ( 1 =0 ( 2 2 ( 1(x+1/2 ( x + 2 2x P (mod 2. ( (mod if 5 (mod 8, 8 ( (mod 2 if 7 (mod 8.
35 Define the sequence {S n } n 0 is given by S 0 = 0, S 1 = 1, and S n+1 = 4S n S n 1 (n = 1, 2, 3,.... Conjecture 12. Let > 3 be a rime. If 7 (mod 12 and = x 2 + 3y 2 with y 1 (mod 4, then ( S 2 2 ( 4 ( 1 (+1/4 4y (mod 2 3y and =0 =0 S 4 We also have =0 S 4 ( 2 2 ( ( 1 ( 3/4 6y 7 3y (mod 2. ( { (mod 2 if 1 (mod 12, 0 (mod if 2 (mod 3. If ±1 (mod 12, then ( ( 1 2 ( 1 S ( 1 (/2 S (mod 3.
36 Conjecture 13. For any n Z + we have 6 (mod 25 if n 0 (mod 5, ( 1 n/5 1 n 1 ( 2 4 (mod 25 if n 1 (mod 5, (2n + 1n 2( F 2n 2+1 n 1 (mod 25 if n 2, 4 (mod 5, =0 9 (mod 25 if n 3 (mod 5. Also, if a, b Z + and a b then the sum 5 1 a 1 ( 2 5 2a F 2+1 =0 modulo 5 b only deends on b. Remar. I have roved that if 2, 5 is a rime then ( 2 ( ( F 2 ( 1 /5 1 (mod 2, 5 =0 =0 F 2+1 ( 2 ( ( 1 /5 5 (mod 2.
37 Conjecture 14. For any rime and ositive integer n we have and ( n 1 ( ( 1 ν ν (n,..., =0 ( n 1 ( ( n 1 ( 1 ν ( 1 ν (n,,..., =0 where ν (n = max{a N : a n} is the -adic order of n. Remar. I have roved that an integer > 1 is a rime if and only if ( ( 1 0 (mod.,..., =0 He also showed that if n Z + is a multile of a rime then n 1 ( ( 1 0 (mod.,..., =0
38 Conjectures 15 and 16 Conjecture 15(Sun and Tauraso [Adv. in Al. Math., in ress] Let 2, 5 be a rime and let a Z +. Then a 1 =0 ( 1 ( 2 ( a ( 1 2F 5 a ( a 5 where {F n } n 0 is the Fibonacci sequence. Remar. I have roved the congruence mod 2. (mod 3, Conjecture 16 Let be an odd rime. If 1, 2 (mod 5, then 4 5 =0 ( 1 ( 2 If 1, 3 (mod 5, then 3 5 =0 ( 1 ( 2 ( 5 ( 5 (mod 2. (mod 2.
39 Conjectures 17 and 18 Conjecture 17 Let be an odd rime and let a Z +. If 1 (mod 3 or a > 1, then 5 6 a =0 ( 2 ( 3 16 a (mod 2. Remar. The author [S09f] roved that /16 ( 3 (mod 2 for odd rime and a Z +. a a /2 =0 ( 2 Conjecture 18. For any nonnegative integer n we have ( 1 n 2 { (2n + 1 2( 2n 16 1 (mod 9 if 3 n, n 4 (mod 9 if 3 n. =0. Also, (3 1 a 1/2 ( 2 3 2a 16 ( 1a 10 (mod 27 =0 for every a = 1, 2, 3,....
40 Conjectures 19 and 20 Conjecture 19. Let be an odd rime. Then we have =1 2 ( 3 3 q 2 (2 (mod 2, where q (2 denotes the Fermat quotient (2 1/. Remar. Zhao, Pan and Sun [Proc. AMS, 2010] roved that 0 (mod for any odd rime. =1 2 ( 3 Conjecture 20. Let > 3 be a rime. Then ( 1 =0 ( 2 ( (( 1 ( 3 (3 1 (mod 3. 3 Remar. I have roved the congruence mod 2.
41 More Conjectures on Congruences For more conjectures of mine on congruences, see Z. W. Sun, Oen Conjectures on Congruences, arxiv: You are welcome to solve my conjectures!
42 Than you!
Arithmetic Properties of Combinatorial Quantities
A tal given at the National Center for Theoretical Sciences (Hsinchu, Taiwan; August 4, 2010 Arithmetic Properties of Combinatorial Quantities Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China
More informationRamanujan-type Congruences for Overpartitions Modulo 5. Nankai University, Tianjin , P. R. China
Ramanujan-type Congruences for Overpartitions Modulo 5 William Y.C. Chen a,b, Lisa H. Sun a,, Rong-Hua Wang a and Li Zhang a a Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P.
More informationIs 1 a Square Modulo p? Is 2?
Chater 21 Is 1 a Square Modulo? Is 2? In the revious chater we took various rimes and looked at the a s that were quadratic residues and the a s that were nonresidues. For examle, we made a table of squares
More informationExam 1 7 = = 49 2 ( ) = = 7 ( ) =
Exam 1 Problem 1. a) Define gcd(a, b). Using Euclid s algorithm comute gcd(889, 168). Then find x, y Z such that gcd(889, 168) = x 889 + y 168 (check your answer!). b) Let a be an integer. Prove that gcd(3a
More informationMT 430 Intro to Number Theory MIDTERM 2 PRACTICE
MT 40 Intro to Number Theory MIDTERM 2 PRACTICE Material covered Midterm 2 is comrehensive but will focus on the material of all the lectures from February 9 u to Aril 4 Please review the following toics
More informationMATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005
MATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005 Deartment of Mathematical and Statistical Sciences University of Alberta Question 1. Find integers
More informationSolutions to Exam 1. Problem 1. a) State Fermat s Little Theorem and Euler s Theorem. b) Let m, n be relatively prime positive integers.
Solutions to Exam 1 Problem 1. a) State Fermat s Little Theorem and Euler s Theorem. b) Let m, n be relatively rime ositive integers. Prove that m φ(n) + n φ(m) 1 (mod mn). c) Find the remainder of 1 008
More informationMath 124 Homework 5 Solutions
Math 12 Homework 5 Solutions by Luke Gustafson Fall 2003 1. 163 1 2 (mod 2 gives = 2 the smallest rime. 2a. First, consider = 2. We know 2 is not a uadratic residue if and only if 3, 5 (mod 8. By Dirichlet
More informationA CONJECTURE ON UNIT FRACTIONS INVOLVING PRIMES
Last update: Nov. 6, 2015. A CONJECTURE ON UNIT FRACTIONS INVOLVING PRIMES Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing 210093, People s Republic of China zwsun@nju.edu.cn http://math.nju.edu.cn/
More informationIntroduction to Number Theory 2. c Eli Biham - November 5, Introduction to Number Theory 2 (12)
Introduction to Number Theory c Eli Biham - November 5, 006 345 Introduction to Number Theory (1) Quadratic Residues Definition: The numbers 0, 1,,...,(n 1) mod n, are called uadratic residues modulo n.
More informationQuadratic Residues. Legendre symbols provide a computational tool for determining whether a quadratic congruence has a solution. = a (p 1)/2 (mod p).
Quadratic Residues 4--015 a is a quadratic residue mod m if x = a (mod m). Otherwise, a is a quadratic nonresidue. Quadratic Recirocity relates the solvability of the congruence x = (mod q) to the solvability
More informationNUMBER THEORY AMIN WITNO
NUMBER THEORY AMIN WITNO.. w w w. w i t n o. c o m Number Theory Outlines and Problem Sets Amin Witno Preface These notes are mere outlines for the course Math 313 given at Philadelphia
More informationZhanjiang , People s Republic of China
Math. Comp. 78(2009), no. 267, 1853 1866. COVERS OF THE INTEGERS WITH ODD MODULI AND THEIR APPLICATIONS TO THE FORMS x m 2 n AND x 2 F 3n /2 Ke-Jian Wu 1 and Zhi-Wei Sun 2, 1 Department of Mathematics,
More informationPRIMES IN SHIFTED SUMS OF LUCAS SEQUENCES. Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania
#A52 INTEGERS 17 (2017) PRIMES IN SHIFTED SUMS OF LUCAS SEQUENCES Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania lkjone@ship.edu Lawrence Somer Department of
More informationDedekind Sums with Arguments Near Euler s Number e
1 47 6 11 Journal of Integer Sequences, Vol. 1 (01), Article 1..8 Dedeind Sums with Arguments Near Euler s Number e Kurt Girstmair Institut für Mathemati Universität Innsbruc Technierstr. 1/7 A-600 Innsbruc
More informationOn the Fibonacci Sequence. By: Syrous Marivani LSUA. Mathematics Department. Alexandria, LA 71302
On the Fibonacci Sequence By: Syrous Marivani LSUA Mathematics Deartment Alexandria, LA 70 The so-called Fibonacci sequence {(n)} n 0 given by: (n) = (n ) + (n ), () where (0) = 0, and () =. The ollowing
More informationMTH 3527 Number Theory Quiz 10 (Some problems that might be on the quiz and some solutions.) 1. Euler φ-function. Desribe all integers n such that:
MTH 7 Number Theory Quiz 10 (Some roblems that might be on the quiz and some solutions.) 1. Euler φ-function. Desribe all integers n such that: (a) φ(n) = Solution: n = 4,, 6 since φ( ) = ( 1) =, φ() =
More information30 HWASIN PARK, JOONGSOO PARK AND DAEYEOUL KIM Lemma 1.1. Let =2 k q +1, k 2 Z +. Then the set of rimitive roots modulo is the set of quadratic non-re
J. KSIAM Vol.4, No.1, 29-38, 2000 A CRITERION ON PRIMITIVE ROOTS MODULO Hwasin Park, Joongsoo Park and Daeyeoul Kim Abstract. In this aer, we consider a criterion on rimitive roots modulo where is the
More informationCollection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02
Collection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02 Public Polynomial congruences come up constantly, even when one is dealing with much deeper problems
More informationSolutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00
18.781 Solutions to Problem Set 6 - Fall 008 Due Tuesday, Oct. 1 at 1:00 1. (Niven.8.7) If p 3 is prime, how many solutions are there to x p 1 1 (mod p)? How many solutions are there to x p 1 (mod p)?
More informationTwo congruences involving 4-cores
Two congruences involving 4-cores ABSTRACT. The goal of this paper is to prove two new congruences involving 4- cores using elementary techniques; namely, if a 4 (n) denotes the number of 4-cores of n,
More informationCongruences Modulo Small Powers of 2 and 3 for Partitions into Odd Designated Summands
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 0 (017), Article 17.4.3 Congruences Modulo Small Powers of 3 for Partitions into Odd Designated Summs B. Hemanthkumar Department of Mathematics M. S. Ramaiah
More information6. Find an inverse of a modulo m for each of these pairs of relatively prime integers using the method
Exercises Exercises 1. Show that 15 is an inverse of 7 modulo 26. 2. Show that 937 is an inverse of 13 modulo 2436. 3. By inspection (as discussed prior to Example 1), find an inverse of 4 modulo 9. 4.
More informationLUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS
LUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS DANIEL BACZKOWSKI, OLAOLU FASORANTI, AND CARRIE E. FINCH Abstract. In this paper, we show that there are infinitely many Sierpiński numbers in the sequence of
More informationLECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY
LECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY 1. Bsic roerties of qudrtic residues We now investigte residues with secil roerties of lgebric tye. Definition 1.1. (i) When (, m) 1 nd
More informationSIZE OF THE SET OF RESIDUES OF INTEGER POWERS OF FIXED EXPONENT
SIZE OF THE SET OF RESIDUES OF INTEGER POWERS OF FIXED EXPONENT RICHARD J. MATHAR Abstract. The ositive integers corime to some integer m generate the abelian grou (Z/nZ) of multilication modulo m. Admitting
More informationApplications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
More informationSOLUTIONS FOR PROBLEM SET 4
SOLUTIONS FOR PROBLEM SET 4 A. A certain integer a gives a remainder of 1 when divided by 2. What can you say about the remainder that a gives when divided by 8? SOLUTION. Let r be the remainder that a
More informationby Michael Filaseta University of South Carolina
by Michael Filaseta University of South Carolina Background: A covering of the integers is a system of congruences x a j (mod m j, j =, 2,..., r, with a j and m j integral and with m j, such that every
More informationUNIVERSITY OF MANITOBA DATE: December 7, FINAL EXAMINATION TITLE PAGE TIME: 3 hours EXAMINER: M. Davidson
TITLE PAGE FAMILY NAME: (Print in ink) GIVEN NAME(S): (Print in ink) STUDENT NUMBER: SEAT NUMBER: SIGNATURE: (in ink) (I understand that cheating is a serious offense) INSTRUCTIONS TO STUDENTS: This is
More informationTHE SEPTIC CHARACTER OF 2, 3, 5 AND 7
PACIFIC JOURNAL OF MATHEMATICS Vol. 52, No. 1, 1974 THE SEPTIC CHARACTER OF 2, 3, 5 AND 7 PHILIP A. LEONARD AND KENNETH S. WILLIAMS Necessary and sufficient conditions f 2, 3,5, and 7 to be seventh powers
More informationUniversity of British Columbia. Math 312, Midterm, 6th of June 2017
University of British Columbia Math 312, Midterm, 6th of June 2017 Name (please be legible) Signature Student number Duration: 90 minutes INSTRUCTIONS This test has 7 problems for a total of 100 points.
More informationON THE EQUATION a x x (mod b) Jam Germain
ON THE EQUATION a (mod b) Jam Germain Abstract. Recently Jimenez and Yebra [3] constructed, for any given a and b, solutions to the title equation. Moreover they showed how these can be lifted to higher
More informationCalculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand.
Midterm #2: practice MATH 311 Intro to Number Theory midterm: Thursday, Oct 20 Please print your name: Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating
More informationSOLUTIONS TO PROBLEM SET 5. Section 9.1
SOLUTIONS TO PROBLEM SET 5 Section 9.1 Exercise 2. Recall that for (a, m) = 1 we have ord m a divides φ(m). a) We have φ(11) = 10 thus ord 11 3 {1, 2, 5, 10}. We check 3 1 3 (mod 11), 3 2 9 (mod 11), 3
More informationDegree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS
Degree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS Author: MD.HASIRUL ISLAM NAZIR BASHIR Supervisor: MARCUS NILSSON Date: 2012-06-15 Subject: Mathematics and Modeling Level:
More informationRational Points On Elliptic Curves - Solutions. (i) Throughout, we ve been looking at elliptic curves in the general form. y 2 = x 3 + Ax + B
Rational Points On Elliptic Curves - Solutions (Send corrections to cbruni@uwaterloo.ca) (i) Throughout, we ve been looking at elliptic curves in the general form y 2 = x 3 + Ax + B However we did claim
More informationNon-overlapping permutation patterns
PU. M. A. Vol. 22 (2011), No.2, pp. 99 105 Non-overlapping permutation patterns Miklós Bóna Department of Mathematics University of Florida 358 Little Hall, PO Box 118105 Gainesville, FL 326118105 (USA)
More informationAn interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,
Binary exponentiation An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g., What are the last two digits of the number 2 284? In the absence
More informationMATH 118 PROBLEM SET 6
MATH 118 PROBLEM SET 6 WASEEM LUTFI, GABRIEL MATSON, AND AMY PIRCHER Section 1 #16: Show tht if is qudrtic residue modulo m, nd b 1 (mod m, then b is lso qudrtic residue Then rove tht the roduct of the
More informationBenford s Law: Tables of Logarithms, Tax Cheats, and The Leading Digit Phenomenon
Benford s Law: Tables of Logarithms, Tax Cheats, and The Leading Digit Phenomenon Michelle Manes (manes@usc.edu) USC Women in Math 24 April, 2008 History (1881) Simon Newcomb publishes Note on the frequency
More informationb) Find all positive integers smaller than 200 which leave remainder 1, 3, 4 upon division by 3, 5, 7 respectively.
Solutions to Exam 1 Problem 1. a) State Fermat s Little Theorem and Euler s Theorem. b) Let m, n be relatively prime positive integers. Prove that m φ(n) + n φ(m) 1 (mod mn). Solution: a) Fermat s Little
More informationCongruence properties of the binary partition function
Congruence properties of the binary partition function 1. Introduction. We denote by b(n) the number of binary partitions of n, that is the number of partitions of n as the sum of powers of 2. As usual,
More informationWilson s Theorem and Fermat s Theorem
Wilson s Theorem and Fermat s Theorem 7-27-2006 Wilson s theorem says that p is prime if and only if (p 1)! = 1 (mod p). Fermat s theorem says that if p is prime and p a, then a p 1 = 1 (mod p). Wilson
More informationAssignment 2. Due: Monday Oct. 15, :59pm
Introduction To Discrete Math Due: Monday Oct. 15, 2012. 11:59pm Assignment 2 Instructor: Mohamed Omar Math 6a For all problems on assignments, you are allowed to use the textbook, class notes, and other
More informationNON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday
NON-OVERLAPPING PERMUTATION PATTERNS MIKLÓS BÓNA Abstract. We show a way to compute, to a high level of precision, the probability that a randomly selected permutation of length n is nonoverlapping. As
More informationLECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI
LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI 1. Hensel Lemma for nonsingular solutions Although there is no analogue of Lagrange s Theorem for prime power moduli, there is an algorithm for determining
More informationAlternating Permutations
Alternating Permutations p. Alternating Permutations Richard P. Stanley M.I.T. Alternating Permutations p. Basic definitions A sequence a 1, a 2,..., a k of distinct integers is alternating if a 1 > a
More informationSolutions to Exercises Chapter 6: Latin squares and SDRs
Solutions to Exercises Chapter 6: Latin squares and SDRs 1 Show that the number of n n Latin squares is 1, 2, 12, 576 for n = 1, 2, 3, 4 respectively. (b) Prove that, up to permutations of the rows, columns,
More informationMAT 115: Finite Math for Computer Science Problem Set 5
MAT 115: Finite Math for Computer Science Problem Set 5 Out: 04/10/2017 Due: 04/17/2017 Instructions: I leave plenty of space on each page for your computation. If you need more sheet, please attach your
More informationTo be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2
Quadratic Reciprocity To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we need to be able to evaluate q for any prime q. The first (and most delicate) case
More informationEric Duchêne (Univ. Claude Bernard Lyon 1) Michel Rigo (University of Liège)
INVARIANT GAMES Eric Duchêne (Univ. Claude Bernard Lyon 1) Michel Rigo (University of Liège) http://www.discmath.ulg.ac.be/ Words 2009, Univ. of Salerno, 14th September 2009 COMBINATORIAL GAME THEORY FOR
More informationDiscrete Square Root. Çetin Kaya Koç Winter / 11
Discrete Square Root Çetin Kaya Koç koc@cs.ucsb.edu Çetin Kaya Koç http://koclab.cs.ucsb.edu Winter 2017 1 / 11 Discrete Square Root Problem The discrete square root problem is defined as the computation
More informationSolutions to the problems from Written assignment 2 Math 222 Winter 2015
Solutions to the problems from Written assignment 2 Math 222 Winter 2015 1. Determine if the following limits exist, and if a limit exists, find its value. x2 y (a) The limit of f(x, y) = x 4 as (x, y)
More informationConstructions of Coverings of the Integers: Exploring an Erdős Problem
Constructions of Coverings of the Integers: Exploring an Erdős Problem Kelly Bickel, Michael Firrisa, Juan Ortiz, and Kristen Pueschel August 20, 2008 Abstract In this paper, we study necessary conditions
More informationLECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.
LECTURE 3: CONGRUENCES 1. Basic properties of congruences We begin by introducing some definitions and elementary properties. Definition 1.1. Suppose that a, b Z and m N. We say that a is congruent to
More informationMath 127: Equivalence Relations
Math 127: Equivalence Relations Mary Radcliffe 1 Equivalence Relations Relations can take many forms in mathematics. In these notes, we focus especially on equivalence relations, but there are many other
More informationCombinatorics in the group of parity alternating permutations
Combinatorics in the group of parity alternating permutations Shinji Tanimoto (tanimoto@cc.kochi-wu.ac.jp) arxiv:081.1839v1 [math.co] 10 Dec 008 Department of Mathematics, Kochi Joshi University, Kochi
More informationORDER AND CHAOS. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
ORDER AND CHAOS Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Perfect shuffles Suppose you take a deck of 52 cards, cut it in half, and perfectly shuffle it (with the bottom card staying
More informationPractice Midterm 2 Solutions
Practice Midterm 2 Solutions May 30, 2013 (1) We want to show that for any odd integer a coprime to 7, a 3 is congruent to 1 or 1 mod 7. In fact, we don t need the assumption that a is odd. By Fermat s
More informationA REMARK ON A PAPER OF LUCA AND WALSH 1. Zhao-Jun Li Department of Mathematics, Anhui Normal University, Wuhu, China. Min Tang 2.
#A40 INTEGERS 11 (2011) A REMARK ON A PAPER OF LUCA AND WALSH 1 Zhao-Jun Li Department of Mathematics, Anhui Normal University, Wuhu, China Min Tang 2 Department of Mathematics, Anhui Normal University,
More informationThe Strong Finiteness of Double Mersenne Primes and the Infinity of Root Mersenne Primes and Near-square Primes of Mersenne Primes
The Strong Finiteness of Double Mersenne Primes and the Infinity of Root Mersenne Primes and Near-square Primes of Mersenne Primes Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract In this paper
More informationOpen Problems in the OEIS
Open Problems in the OEIS Neil J A Sloane Guest Lecture, Zeilberger Experimental Math Class, May 2 2016 Puzzles Strange recurrences Number theory Counting problems PUZZLES 61, 21, 82, 43, 3,? (A087409)
More informationTHE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul LXI, 2015, f.2 THE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m BY FLORIAN LUCA and AUGUSTINE O.
More informationRESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel
RESTRICTED PERMUTATIONS AND POLYGONS Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, 905 Haifa, Israel {gferro,toufik}@mathhaifaacil abstract Several authors have examined
More informationAvoiding consecutive patterns in permutations
Avoiding consecutive patterns in permutations R. E. L. Aldred M. D. Atkinson D. J. McCaughan January 3, 2009 Abstract The number of permutations that do not contain, as a factor (subword), a given set
More informationEE 418 Network Security and Cryptography Lecture #3
EE 418 Network Security and Cryptography Lecture #3 October 6, 2016 Classical cryptosystems. Lecture notes prepared by Professor Radha Poovendran. Tamara Bonaci Department of Electrical Engineering University
More informationA combinatorial proof for the enumeration of alternating permutations with given peak set
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 57 (2013), Pages 293 300 A combinatorial proof for the enumeration of alternating permutations with given peak set Alina F.Y. Zhao School of Mathematical Sciences
More informationVariations on a Theme of Sierpiński
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 10 (2007), Article 07.4.4 Variations on a Theme of Sierpiński Lenny Jones Department of Mathematics Shippensburg University Shippensburg, Pennsylvania
More informationA theorem on the cores of partitions
A theorem on the cores of partitions Jørn B. Olsson Department of Mathematical Sciences, University of Copenhagen Universitetsparken 5,DK-2100 Copenhagen Ø, Denmark August 9, 2008 Abstract: If s and t
More informationBAND SURGERY ON KNOTS AND LINKS, III
BAND SURGERY ON KNOTS AND LINKS, III TAIZO KANENOBU Abstract. We give two criteria of links concerning a band surgery: The first one is a condition on the determinants of links which are related by a band
More informationUniversity of Twente
University of Twente Faculty of Electrical Engineering, Mathematics & Comuter Science Design of an audio ower amlifier with a notch in the outut imedance Remco Twelkemeijer MSc. Thesis May 008 Suervisors:
More information14.2 Limits and Continuity
14 Partial Derivatives 14.2 Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. Let s compare the behavior of the functions Tables 1 2 show values of f(x,
More informationELEMENTS OF NUMBER THEORY & CONGRUENCES. Lagrange, Legendre and Gauss. Mth Mathematicst
ELEMENTS OF NUMBER THEORY & CONGRUENCES Lagrange, Legendre and Gauss ELEMENTS OF NUMBER THEORY & CONGRUENCES 1) If a 0, b 0 Z and a/b, b/a then 1) a=b 2) a=1 3) b=1 4) a=±b Ans : is 4 known result. If
More informationNumber Theory. Konkreetne Matemaatika
ITT9131 Number Theory Konkreetne Matemaatika Chapter Four Divisibility Primes Prime examples Factorial Factors Relative primality `MOD': the Congruence Relation Independent Residues Additional Applications
More information2.1 BASIC CONCEPTS Basic Operations on Signals Time Shifting. Figure 2.2 Time shifting of a signal. Time Reversal.
1 2.1 BASIC CONCEPTS 2.1.1 Basic Operations on Signals Time Shifting. Figure 2.2 Time shifting of a signal. Time Reversal. 2 Time Scaling. Figure 2.4 Time scaling of a signal. 2.1.2 Classification of Signals
More informationA Study of Relationship Among Goldbach Conjecture, Twin prime and Fibonacci number
A Study of Relationship Among Goldbach Conjecture, Twin and Fibonacci number Chenglian Liu Department of Computer Science, Huizhou University, China chenglianliu@gmailcom May 4, 015 Version 48 1 Abstract
More informationSensors, Signals and Noise
Sensors, Signals and Noise COURSE OUTLINE Introduction Signals and Noise Filtering Noise Sensors and associated electronics Sergio Cova SENSORS SIGNALS AND NOISE SSN04b FILTERING NOISE rv 2017/01/25 1
More informationSolutions for the Practice Questions
Solutions for the Practice Questions Question 1. Find all solutions to the congruence 13x 12 (mod 35). Also, answer the following questions about the solutions to the above congruence. Are there solutions
More informationThe covering congruences of Paul Erdős. Carl Pomerance Dartmouth College
The covering congruences of Paul Erdős Carl Pomerance Dartmouth College Conjecture (Erdős, 1950): For each number B, one can cover Z with finitely many congruences to distinct moduli all > B. Erdős (1995):
More informationIntroduction to Modular Arithmetic
1 Integers modulo n 1.1 Preliminaries Introduction to Modular Arithmetic Definition 1.1.1 (Equivalence relation). Let R be a relation on the set A. Recall that a relation R is a subset of the cartesian
More informationPRIMES 2017 final paper. NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma
PRIMES 2017 final paper NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma ABSTRACT. In this paper we study pattern-replacement
More informationp 1 MAX(a,b) + MIN(a,b) = a+b n m means that m is a an integer multiple of n. Greatest Common Divisor: We say that n divides m.
Great Theoretical Ideas In Computer Science Steven Rudich CS - Spring Lecture Feb, Carnegie Mellon University Modular Arithmetic and the RSA Cryptosystem p- p MAX(a,b) + MIN(a,b) = a+b n m means that m
More information1 = 3 2 = 3 ( ) = = = 33( ) 98 = = =
Math 115 Discrete Math Final Exam December 13, 2000 Your name It is important that you show your work. 1. Use the Euclidean algorithm to solve the decanting problem for decanters of sizes 199 and 98. In
More informationLatin Squares for Elementary and Middle Grades
Latin Squares for Elementary and Middle Grades Yul Inn Fun Math Club email: Yul.Inn@FunMathClub.com web: www.funmathclub.com Abstract: A Latin square is a simple combinatorial object that arises in many
More informationCaltech Harvey Mudd Mathematics Competition February 20, 2010
Mixer Round Solutions Caltech Harvey Mudd Mathematics Competition February 0, 00. (Ying-Ying Tran) Compute x such that 009 00 x (mod 0) and 0 x < 0. Solution: We can chec that 0 is prime. By Fermat s Little
More informationNumbers (8A) Young Won Lim 6/21/17
Numbers (8A Copyright (c 2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationSMT 2014 Advanced Topics Test Solutions February 15, 2014
1. David flips a fair coin five times. Compute the probability that the fourth coin flip is the first coin flip that lands heads. 1 Answer: 16 ( ) 1 4 Solution: David must flip three tails, then heads.
More informationNumbers (8A) Young Won Lim 5/24/17
Numbers (8A Copyright (c 2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationA Quick Introduction to Modular Arithmetic
A Quick Introduction to Modular Arithmetic Art Duval University of Texas at El Paso November 16, 2004 1 Idea Here are a few quick motivations for modular arithmetic: 1.1 Sorting integers Recall how you
More informationYet Another Triangle for the Genocchi Numbers
Europ. J. Combinatorics (2000) 21, 593 600 Article No. 10.1006/eujc.1999.0370 Available online at http://www.idealibrary.com on Yet Another Triangle for the Genocchi Numbers RICHARD EHRENBORG AND EINAR
More informationarxiv:math/ v2 [math.ho] 23 Aug 2008
arxiv:math/0507401v2 [math.ho] 23 Aug 2008 An easy method for finding many very large prime numbers Leonhard Euler 1. It suffices to explain this method with a single example of numbers contained in the
More informationPerfect Difference Families and Related Variable-Weight Optical Orthogonal Codess
Perfect Difference Families and Related Variable-Weight Optical Orthogonal Codess D. Wu, M. Cheng, Z. Chen Department of Mathematics Guangxi Normal University Guilin 541004, China Abstract Perfect (v,
More informationREVIEW SHEET FOR MIDTERM 2: ADVANCED
REVIEW SHEET FOR MIDTERM : ADVANCED MATH 195, SECTION 59 (VIPUL NAIK) To maximize efficiency, please bring a copy (print or readable electronic) of this review sheet to the review session. The document
More informationAlgorithmic Number Theory and Cryptography (CS 303)
Algorithmic Number Theory and Cryptography (CS 303) Modular Arithmetic Jeremy R. Johnson 1 Introduction Objective: To become familiar with modular arithmetic and some key algorithmic constructions that
More informationThe 99th Fibonacci Identity
The 99th Fibonacci Identity Arthur T. Benjamin, Alex K. Eustis, and Sean S. Plott Department of Mathematics Harvey Mudd College, Claremont, CA, USA benjamin@hmc.edu Submitted: Feb 7, 2007; Accepted: Jan
More informationEnumeration of Two Particular Sets of Minimal Permutations
3 47 6 3 Journal of Integer Sequences, Vol. 8 (05), Article 5.0. Enumeration of Two Particular Sets of Minimal Permutations Stefano Bilotta, Elisabetta Grazzini, and Elisa Pergola Dipartimento di Matematica
More informationSome Fine Combinatorics
Some Fine Combinatorics David P. Little Department of Mathematics Penn State University University Park, PA 16802 Email: dlittle@math.psu.edu August 3, 2009 Dedicated to George Andrews on the occasion
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 7 1 Congruence Definition 2 Congruence is an Equivalence Relation (CER) 3 Properties of Congruence (PC) 4 Example 5 Congruences
More informationModular Arithmetic. Kieran Cooney - February 18, 2016
Modular Arithmetic Kieran Cooney - kieran.cooney@hotmail.com February 18, 2016 Sums and products in modular arithmetic Almost all of elementary number theory follows from one very basic theorem: Theorem.
More information