Cool theorems proved by undergraduates
|
|
- Sharyl Fox
- 6 years ago
- Views:
Transcription
1 Cool theorems proved by undergraduates Ken Ono Emory University
2 Child s play...
3 Child s play... Thanks to the,
4 Child s play... Thanks to the, undergrads and I play by...
5 Child s play... Thanks to the, undergrads and I play by...shooting off
6 Child s play... Thanks to the, undergrads and I play by...shooting off and getting in trouble,
7 Child s play... Thanks to the, undergrads and I play by...shooting off and getting in trouble,...and by proving theorems in number theory.
8 Child s play... Our toys include...
9 Child s play... Our toys include... (Prime numbers)
10 Child s play... Our toys include... (Prime numbers) (Partitions)
11 Child s play... Our toys include... (Prime numbers) (Partitions) (Numbers and Number Fields)
12 Prime Numbers Some theorems on primes
13 Prime Numbers Some theorems on primes Theorem (Euclid) There are infinitely many prime numbers.
14 Prime Numbers Some theorems on primes Theorem (Euclid) There are infinitely many prime numbers. Theorem (Prime Number Theorem) If π(x) := #{p x : prime}, then π(x) x ln x.
15 Prime Numbers
16 Prime Numbers Theorem (Dirichlet) If 0 r < t are integers for which gcd(r, t) = 1, then let π r,t (x) := #{p x : prime and p r (mod t)}.
17 Prime Numbers Theorem (Dirichlet) If 0 r < t are integers for which gcd(r, t) = 1, then let π r,t (x) := #{p x : prime and p r (mod t)}. Then in terms of Euler s phi-function, we have π r,t (x) 1 φ(t) x ln x.
18 Prime Numbers Theorem (Dirichlet) If 0 r < t are integers for which gcd(r, t) = 1, then let π r,t (x) := #{p x : prime and p r (mod t)}. Then in terms of Euler s phi-function, we have π r,t (x) 1 φ(t) x ln x. Example (Half of the primes are of the following forms:) 3n + 1, 3n + 2 4n + 1, 4n + 3 6n + 1, 6n + 5
19 Prime Numbers Arithmetic progressions of primes
20 Prime Numbers Arithmetic progressions of primes Theorem (van der Corput (1939)) There are ly many length 3 arithmetic progressions of primes.
21 Prime Numbers Arithmetic progressions of primes Theorem (van der Corput (1939)) There are ly many length 3 arithmetic progressions of primes. Example Here are examples of arithmetic progressions of length 3: (3, 3 + 2, ) = (3, 5, 7), (5, , ) = (5, 47, 89), (43, , ) = (43, 73, 103).
22 Prime Numbers How long can these get?
23 Prime Numbers How long can these get? Theorem (Green-Tao (2000s)) For every k there are ly many length k AP of primes.
24 Prime Numbers How long can these get? Theorem (Green-Tao (2000s)) For every k there are ly many length k AP of primes. Example Length 10 example: 199, 409, 619, 829, 1039, 1249, 1459, 1669, 1879, 2089.
25 Prime Numbers Different problem Question Can you find k consecutive primes which end with the digit 1?
26 Prime Numbers Different problem Question Can you find k consecutive primes which end with the digit 1? Example We have the following consecutive primes 181, 191, 241, 251,. 4831, 4861, 4871.
27 Prime Numbers A great theorem...
28 Prime Numbers A great theorem... Theorem (Shiu (2000)) Let p 1 = 2, p 2 = 3,... be the primes in order. If gcd(r, t) = 1, then for every positive integer k there is an n for which p n p n+1 p n+2 p n+k r (mod t).
29 Prime Numbers A cool theorem... Theorem (Monks, Peluse, Ye) Special sets of primes have arbitrarily long sequences of primes in any arithmetic progression.
30 Prime Numbers A cool theorem... Theorem (Monks, Peluse, Ye) Special sets of primes have arbitrarily long sequences of primes in any arithmetic progression. Corollary Define the sequence of integers N π := { π, 2π, 3π,... }.
31 Prime Numbers A cool theorem... Theorem (Monks, Peluse, Ye) Special sets of primes have arbitrarily long sequences of primes in any arithmetic progression. Corollary Define the sequence of integers N π := { π, 2π, 3π,... }. Let p π (n) be the nth prime in this sequence, and so p π (1) = 3, p π (2) = 31, p π (3) = 37,....
32 Prime Numbers A cool theorem... Theorem (Monks, Peluse, Ye) Special sets of primes have arbitrarily long sequences of primes in any arithmetic progression. Corollary Define the sequence of integers N π := { π, 2π, 3π,... }. Let p π (n) be the nth prime in this sequence, and so p π (1) = 3, p π (2) = 31, p π (3) = 37,.... Then for every gcd(r, t) = 1 and every k there exists an n for which
33 Prime Numbers A cool theorem... Theorem (Monks, Peluse, Ye) Special sets of primes have arbitrarily long sequences of primes in any arithmetic progression. Corollary Define the sequence of integers N π := { π, 2π, 3π,... }. Let p π (n) be the nth prime in this sequence, and so p π (1) = 3, p π (2) = 31, p π (3) = 37,.... Then for every gcd(r, t) = 1 and every k there exists an n for which p π (n) p π (n + 1) p π (n + 2) p π (n + k) r (mod t).
34 Prime Numbers More on strings of prime
35 Prime Numbers More on strings of prime Example The first 6 consecutive primes 5 (mod 7) in N π is , , , , ,
36 Prime Numbers More on strings of prime Example The first 6 consecutive primes 5 (mod 7) in N π is , , , , , Remark Special sets includes primes in the sets N α := { α, 2α, 3α,... } α irrational real alg. int., N := { n log log n : n = 1, 2, 3,... }.
37 Prime Numbers
38 Recurrence sequences The Fibonacci Sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377
39 Recurrence sequences The Fibonacci Sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377
40 Recurrence sequences The Fibonacci Sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377 Conjecture (Folklore) These are the only perfect powers!
41 Recurrence sequences Perfect Powers in the Fibonacci Sequence Theorem (Siksek, Bugeaud, Mignotte, Annals of Math 2006) F 0 = 0 p, F 1 = 1 p, F 6 = 2 3, and F 12 = 12 2 are the only perfect powers in the Fibonacci sequence.
42 Recurrence sequences Perfect Powers in the Fibonacci Sequence Theorem (Siksek, Bugeaud, Mignotte, Annals of Math 2006) F 0 = 0 p, F 1 = 1 p, F 6 = 2 3, and F 12 = 12 2 are the only perfect powers in the Fibonacci sequence. Proof. Modularity of elliptic curves :-)
43 Recurrence sequences Lucas Sequences Definition (Lucas Sequence) A Lucas sequence u n is a nondegenerate integral linear binary recurrence relation defined by with u 0 = 0 and u 1 = 1. u n+2 = bu n+1 + cu n
44 Recurrence sequences Lucas Sequences Definition (Lucas Sequence) A Lucas sequence u n is a nondegenerate integral linear binary recurrence relation defined by with u 0 = 0 and u 1 = 1. u n+2 = bu n+1 + cu n Definition (Companion Sequence) The companion sequence v n is defined by v n+2 = bv n+1 + cv n with v 0 = 2 and v 1 = b.
45 Recurrence sequences Lucas Sequences A Lucas sequence (b, c) has characteristic polynomial and roots g(z) = z 2 bz c, α, β = b ± b 2 + 4c. 2
46 Recurrence sequences Lucas Sequences A Lucas sequence (b, c) has characteristic polynomial and roots g(z) = z 2 bz c, α, β = b ± b 2 + 4c. 2 Fact 1. u n = αn β n α β v n = α n + β n 2. u 2k = u k v k 3. (b 2 + 4c)u 2 n = v 2 n 4( c) n
47 Recurrence sequences Specific Examples Theorem (Silliman, Vogt) For the following values of b and c: (b, c) = (3, 2), (5, 6), (7, 12), (17, 72), (9, 20) the Lucas sequence u n has no nontrivial pth powers, except u 2 = 3 2 in (9, 20).
48 Recurrence sequences General Bound Conjecture (Frey-Mazur) Let E, E be two elliptic curves defined over Q. If E[p] = E [p] for some p > 17, then E and E are isogenous.
49 Recurrence sequences General Bound Conjecture (Frey-Mazur) Let E, E be two elliptic curves defined over Q. If E[p] = E [p] for some p > 17, then E and E are isogenous. Theorem (Silliman, Vogt) Assume the Frey Mazur conjecture. Then a pth power u n = y p satisfies p Ψ(b, c). where Ψ(b, c) is an explicit constant.
50 Recurrence sequences More Examples Example The sequence (3, 1): 0, 1, 3, 10, 33, 109, 360, 1189, 3927, 12970, 42837, , We haven t found any nontrivial perfect powers...
51 Recurrence sequences More Examples Example The sequence (3, 1): 0, 1, 3, 10, 33, 109, 360, 1189, 3927, 12970, 42837, , We haven t found any nontrivial perfect powers... Theorem (Silliman, Vogt) Assume the Frey-Mazur Conjecture. There are no nontrivial powers in the sequences (b, c) = (3, 1), (5, 1), and (7, 1).
52 Recurrence sequences
53 Partitions Beautiful identities
54 Partitions Beautiful identities Euler proved that q (1 q 24n ) = q q 25 q 49 + q q 169 q 289. n=1
55 Partitions Beautiful identities Euler proved that q (1 q 24n ) = q q 25 q 49 + q q 169 q 289. n=1 Jacobi proved that q (1 q 8n ) 3 = q 3q 9 + 5q 25 7q q 81 11q n=1
56 Partitions Beautiful identities Euler proved that q (1 q 24n ) = q q 25 q 49 + q q 169 q 289. n=1 Jacobi proved that q (1 q 8n ) 3 = q 3q 9 + 5q 25 7q q 81 11q n=1 Gauss proved that q n=1 (1 q 16n ) 2 (1 q 8n ) = q+q 9 +q 25 +q 49 +q 81 +q 121 +q 169 +q 225 +
57 Partitions Such rare identities have been discovered by:
58 Partitions Such rare identities have been discovered by: Crazy combinatorial manipulation of power series. Higher identities such as Jacobi s n=1(1 q 2n )(1 + z 2 q 2n 1 )(1 + z 2 q 2n 1 ) = m Z z 2m q m2. Modular forms.
59 Partitions Nekrasov-Okounkov Theory
60 Partitions Nekrasov-Okounkov Theory Deeper structure for such identities.
61 Partitions Nekrasov-Okounkov Theory Deeper structure for such identities. One doesn t have to multiply out and combine terms.
62 Nekrasov-Okounkov Partitions Definition A nonincreasing sequence of positive integers summing to n is a partition of n.
63 Nekrasov-Okounkov Partitions Definition A nonincreasing sequence of positive integers summing to n is a partition of n. p(n) := # {partitions of n}.
64 Nekrasov-Okounkov Partitions Definition A nonincreasing sequence of positive integers summing to n is a partition of n. p(n) := # {partitions of n}. Example {Partitions of 4} = {4, 3 + 1, 2 + 2, , }
65 Nekrasov-Okounkov Partitions Definition A nonincreasing sequence of positive integers summing to n is a partition of n. p(n) := # {partitions of n}. Example {Partitions of 4} = {4, 3 + 1, 2 + 2, , } = p(4) = 5.
66 Nekrasov-Okounkov Generating function for p(n)
67 Nekrasov-Okounkov Generating function for p(n) Lemma We have that p(n)q n 1 = 1 q n. n=0 n=1
68 Nekrasov-Okounkov Wishful thinking
69 Nekrasov-Okounkov Wishful thinking Question Is there a combinatorial theory of infinite products where coefficient of q n = formula in partitions of n?
70 Nekrasov-Okounkov Hooklengths of partitions
71 Nekrasov-Okounkov Hooklengths of partitions Definition Hooks are the maximal. in the Ferrers board of λ.
72 Nekrasov-Okounkov Hooklengths of partitions Definition Hooks are the maximal. in the Ferrers board of λ. Hooklengths are their lengths, and H(λ) = { multiset of hooklengths of λ}
73 Nekrasov-Okounkov An example Example (λ = )
74 Nekrasov-Okounkov An example Example (λ = ) An so H(λ) = {1, 1, 1, 2, 2, 3, 4, 4, 6, 7}.
75 Nekrasov-Okounkov Nekrasov-Okounkov q-series Definition For z C, let O z (q) := λ q λ h H(λ) (1 z h 2 ).
76 Nekrasov-Okounkov Example (λ = )
77 Nekrasov-Okounkov Example (λ = ) The λ-contribution to O z (q) is q 10 (1 z ) h 2 h H(λ) = q 10 (1 z) 3 ( 1 z 4 ) 2 ( 1 z ) ( 1 z ) 2 ( 1 z ) ( 1 z )
78 Nekrasov-Okounkov A famous identity revisited
79 Nekrasov-Okounkov A famous identity revisited Letting z = 4, we consider O 4 (q) = λ q λ h H(λ) (1 4h 2 ).
80 Nekrasov-Okounkov A famous identity revisited Letting z = 4, we consider O 4 (q) = λ q λ h H(λ) (1 4h 2 ). We only need λ where every hook h 2.
81 Nekrasov-Okounkov A famous identity revisited Letting z = 4, we consider O 4 (q) = λ q λ h H(λ) (1 4h 2 ). We only need λ where every hook h 2. = {Triangular partitions k}
82 Nekrasov-Okounkov A famous identity revisited.
83 Nekrasov-Okounkov A famous identity revisited. λ 8 λ + 1 H(λ) (1 4/h 2 ) 0 1 φ {1} {1, 1, 3} {1,..., 5} 7
84 Nekrasov-Okounkov A famous identity revisited. λ 8 λ + 1 H(λ) (1 4/h 2 ) 0 1 φ {1} {1, 1, 3} {1,..., 5} 7 And so we have = qo 4 (q 8 ) = q 3q 9 + 5q 25 7q 49 +
85 Nekrasov-Okounkov A famous identity revisited. λ 8 λ + 1 H(λ) (1 4/h 2 ) 0 1 φ {1} {1, 1, 3} {1,..., 5} 7 And so we have = qo 4 (q 8 ) = q 3q 9 + 5q 25 7q 49 + Jacobi? = q (1 q 8n ) 3 n=1
86 Nekrasov-Okounkov Big Identity
87 Nekrasov-Okounkov Big Identity Theorem (Nekrasov-Okounkov) If z is complex, then O z (q) := q λ (1 z ) h 2 = (1 q n ) z 1. λ n=1 h H(λ)
88 Nekrasov-Okounkov Big Identity Theorem (Nekrasov-Okounkov) If z is complex, then O z (q) := λ q λ (1 z ) h 2 = (1 q n ) z 1. h H(λ) n=1 Remark Letting z = 0 gives the generating function for p(n).
89 Nekrasov-Okounkov Euler, Gauss, and Jacobi-type identities
90 Nekrasov-Okounkov Euler, Gauss, and Jacobi-type identities Question 1 When do the sums below vanish? A(a, b; n) := λ =n h H a(λ) ( 1 ab ) h 2.
91 Nekrasov-Okounkov Euler, Gauss, and Jacobi-type identities Question 1 When do the sums below vanish? A(a, b; n) := λ =n h H a(λ) ( 1 ab ) h 2. 2 Are there more identities of Euler, Gauss and Jacobi-type?
92 Nekrasov-Okounkov Euler, Gauss, and Jacobi-type identities Question 1 When do the sums below vanish? A(a, b; n) := λ =n h H a(λ) ( 1 ab ) h 2. 2 Are there more identities of Euler, Gauss and Jacobi-type? 3 If so, find them all.
93 Nekrasov-Okounkov A cool theorem
94 Nekrasov-Okounkov A cool theorem Theorem (Clader, Kemper, Wage) The list of all pairs (a, b) for which almost all the A(a, b; n) vanish are (1, 2), (1, 3), (1, 4), (1, 5), (1, 7), (1, 9), (1, 11), (1, 15), (1, 27), (2, 2), (2, 3), (2, 5), (2, 7), (3, 3), (3, 5), (3, 9), (4, 5), (4, 7), (7, 9), (7, 15).
95 Nekrasov-Okounkov A cool theorem Theorem (Clader, Kemper, Wage) The list of all pairs (a, b) for which almost all the A(a, b; n) vanish are (1, 2), (1, 3), (1, 4), (1, 5), (1, 7), (1, 9), (1, 11), (1, 15), (1, 27), (2, 2), (2, 3), (2, 5), (2, 7), (3, 3), (3, 5), (3, 9), (4, 5), (4, 7), (7, 9), (7, 15). Remark These pairs are the Euler, Gauss and Jacobi identities for A(a, b; n)q n := n=1 (1 q an ) b (1 q n ).
96 Nekrasov-Okounkov
97 Number Fields Number fields Wrong Definition This is a number field.
98 Number Fields Number fields Wrong Definition This is a number field..
99 Number Fields Number fields Wrong Definition This is a number field.. Definition A finite dimensional field extension of Q is called a number field.
100 Number Fields An invariant Remark The discriminant K Z \ {0} of a number field K does:
101 Number Fields An invariant Remark The discriminant K Z \ {0} of a number field K does: Measures the volume of algebraic integers.
102 Number Fields An invariant Remark The discriminant K Z \ {0} of a number field K does: Measures the volume of algebraic integers. Controls some properties of primes (ramification).
103 Number Fields Quadratic fields If D is square-free and K := Q( D), then { D if D 1 (mod 4), K := 4D otherwise.
104 Number Fields Quadratic fields If D is square-free and K := Q( D), then { D if D 1 (mod 4), K := 4D otherwise. Example For example, we have Q(i) = = 4 Q( 2) = = 8.
105 Number Fields Distribution of quadratic fields Notation. Let N 2 (X ) := #{quad fields with X }.
106 Number Fields Distribution of quadratic fields Notation. Let N 2 (X ) := #{quad fields with X }. X N 2 (X ) N 2 (X )/X
107 Number Fields Distribution of quadratic fields Notation. Let N 2 (X ) := #{quad fields with X }. X N 2 (X ) N 2 (X )/X Theorem (Easy) We have that N 2 (X ) lim = 6 X + X π 2 =
108 Number Fields General Number Fields Conjecture (Linnik) If we let N n (X ) := #{degree n fields with X }, then N n (X ) c n X.
109 Number Fields General Number Fields Conjecture (Linnik) If we let N n (X ) := #{degree n fields with X }, then N n (X ) c n X. Theorem (Easy, Davenport-Heilbronn (70s), Bhargava (2000s)) Linnik s Conjecture is true for n = 2, 3, 4, 5.
110 Number Fields General results
111 Number Fields General results Theorem (Schmidt (1995), Ellenberg-Venkatesh (2006)) We have that X n+2 4 if 6 n 84393, N n (X ) n X exp(c log n) if n >
112 Number Fields Related Functions Notation. If G is a finite group, then let N n (G; X ) := number of deg n fields with X whose Galois closure has Galois group G
113 Number Fields Related Functions Notation. If G is a finite group, then let N n (G; X ) := number of deg n fields with X whose Galois closure has Galois group G Remark Estimating N n (G; X ) is easy only for n = 2 and G = Z/2Z.
114 Number Fields Prime cyclic cases Theorem (Wright (1989)) If p is an odd prime, then there is a constant c(p) for which N p (Z/pZ; X ) = c(p) X 1 p 1 + O(X 1/p ).
115 Number Fields Prime cyclic cases Theorem (Wright (1989)) If p is an odd prime, then there is a constant c(p) for which N p (Z/pZ; X ) = c(p) X 1 p 1 + O(X 1/p ). Conjecture (Cohen, Diaz y Diaz, Olivier (2006)) We have that N 3 (Z/3Z; X ) = c(3) X O(X 1/6 ).
116 Number Fields A cool theorem...
117 Number Fields A cool theorem... Theorem (Lee-Oh) Assuming the GRH, if p is an odd prime, then N p (Z/pZ; X ) = c(p) X 1 p 1 + X 1 3(p 1) R p (log X ) + O(X 1 4(p 1) ), where R p (x) is a polynomial of degree p(p 2)/3 1.
118 Number Fields A cool theorem... Theorem (Lee-Oh) Assuming the GRH, if p is an odd prime, then N p (Z/pZ; X ) = c(p) X 1 p 1 + X 1 3(p 1) R p (log X ) + O(X 1 4(p 1) ), where R p (x) is a polynomial of degree p(p 2)/3 1. Corollary (Lee-Oh) Assuming GRH, the Cohen, Diaz y Diaz, Olivier Conjecture is true.
119 Number Fields Linear regression when p = 3: Slope 1 6
120 Number Fields Linear regression when p = 3: Slope x axis = log 10 (X ) y axis = log 10 (N 3 (Z/3Z; X ) c(3) X 1 2 )
121 In conclusion... Our summer toys include...
122 In conclusion... Our summer toys include... (Prime numbers) (Partitions) (Numbers and Number Fields)
123 In conclusion... So, we basically...
124 In conclusion... So, we basically......prove theorems, and...explode stuff...
GUO-NIU HAN AND KEN ONO
HOOK LENGTHS AND 3-CORES GUO-NIU HAN AND KEN ONO Abstract. Recently, the first author generalized a formula of Nekrasov and Okounkov which gives a combinatorial formula, in terms of hook lengths of partitions,
More informationarxiv: v1 [math.nt] 6 Jul 2011
UPPER BOUNDS FOR THE NUMBER OF NUMBER FIELDS WITH ALTERNATING GALOIS GROUP ERIC LARSON AND LARRY ROLEN arxiv:1107.118v1 [math.nt] 6 Jul 011 Abstract. We study the number N(n,A n,x) of number fields of
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 informationPOWERS IN LUCAS SEQUENCES VIA GALOIS REPRESENTATIONS
POWERS IN LUCAS SEQUENCES VIA GALOIS REPRESENTATIONS JESSE SILLIMAN AND ISABEL VOGT Abstract. Let u n be a nondegenerate Lucas sequence. We generalize the results of Bugeaud, Mignotte, and Siksek [6] to
More informationFibonacci numbers of the form p a ± p b
Fibonacci numbers of the form p a ± p b Florian Luca 1 and Pantelimon Stănică 2 1 IMATE, UNAM, Ap. Postal 61-3 (Xangari), CP. 8 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn University
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 informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationCHAPTER 1 REAL NUMBERS KEY POINTS
CHAPTER 1 REAL NUMBERS 1. Euclid s division lemma : KEY POINTS For given positive integers a and b there exist unique whole numbers q and r satisfying the relation a = bq + r, 0 r < b. 2. Euclid s division
More informationOn repdigits as product of consecutive Lucas numbers
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 24, 2018, No. 3, 5 102 DOI: 10.7546/nntdm.2018.24.3.5-102 On repdigits as product of consecutive Lucas numbers
More informationON THE POSITIVITY OF THE NUMBER OF t CORE PARTITIONS. Ken Ono. 1. Introduction
ON THE POSITIVITY OF THE NUMBER OF t CORE PARTITIONS Ken Ono Abstract. A partition of a positive integer n is a nonincreasing sequence of positive integers whose sum is n. A Ferrers graph represents a
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 informationSums of Consecutive Perfect Powers is Seldom a Perfect Power
Sums of Consecutive Perfect Powers is Seldom a Perfect Power Journées Algophantiennes Bordelaises 2017, Université de Bordeaux June 7, 2017 A Diophantine Equation Question x k + (x + 1) k + + (x + d 1)
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 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 informationSome New Diophantine Problems
A talk given at the Confer. on Diophantine Analysis and Related Topics (Wuhan, March 10-13, 2016) Some New Diophantine Problems Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn
More informationDivisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006
Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18
More informationCONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS
CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS JEREMY BOOHER Continued fractions usually get short-changed at PROMYS, but they are interesting in their own right and useful in other areas
More informationMath 61CM - Solutions to homework 2
Math 61CM - Solutions to homework 2 Cédric De Groote October 5 th, 2018 Problem 1: Let V be the vector space of polynomials of degree at most 5, with coefficients in a field F Let U be the subspace of
More informationOn Some Combinations of Non-Consecutive Terms of a Recurrence Sequence
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.3.5 On Some Combinations of Non-Consecutive Terms of a Recurrence Sequence Eva Trojovská Department of Mathematics Faculty of Science
More informationCOMBINATORIAL APPLICATIONS OF MÖBIUS INVERSION
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 COMBINATORIAL APPLICATIONS OF MÖBIUS INVERSION MARIE JAMESON AND ROBERT P. SCHNEIDER (Communicated
More informationTable of Contents. 2013, Pearson Education, Inc.
Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter
More informationAnalytic Number Theory
American Mathematical Society Colloquium Publications Volume 53 Analytic Number Theory Henryk Iwaniec Emmanuel Kowalski American Mathematical Society Providence, Rhode Island Contents Preface xi Introduction
More informationResults of modern sieve methods in prime number theory and more
Results of modern sieve methods in prime number theory and more Karin Halupczok (WWU Münster) EWM-Conference 2012, Universität Bielefeld, 12 November 2012 1 Basic ideas of sieve theory 2 Classical applications
More informationQuartic and D l Fields of Degree l with given Resolvent
Quartic and D l Fields of Degree l with given Resolvent Henri Cohen, Frank Thorne Institut de Mathématiques de Bordeaux January 14, 2013, Bordeaux 1 Introduction I Number fields will always be considered
More informationPowers of Two as Sums of Two Lucas Numbers
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.8.3 Powers of Two as Sums of Two Lucas Numbers Jhon J. Bravo Mathematics Department University of Cauca Street 5 No. 4-70 Popayán,
More informationEven perfect numbers among generalized Fibonacci sequences
Even perfect numbers among generalized Fibonacci sequences Diego Marques 1, Vinicius Vieira 2 Departamento de Matemática, Universidade de Brasília, Brasília, 70910-900, Brazil Abstract A positive integer
More informationFermat s Little Theorem. Fermat s little theorem is a statement about primes that nearly characterizes them.
Fermat s Little Theorem Fermat s little theorem is a statement about primes that nearly characterizes them. Theorem: Let p be prime and a be an integer that is not a multiple of p. Then a p 1 1 (mod p).
More informationCALCULATING EXACT CYCLE LENGTHS IN THE GENERALIZED FIBONACCI SEQUENCE MODULO p
CALCULATING EXACT CYCLE LENGTHS IN THE GENERALIZED FIBONACCI SEQUENCE MODULO p DOMINIC VELLA AND ALFRED VELLA. Introduction The cycles that occur in the Fibonacci sequence {F n } n=0 when it is reduced
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More informationcongruences Shanghai, July 2013 Simple proofs of Ramanujan s partition congruences Michael D. Hirschhorn
s s m.hirschhorn@unsw.edu.au Let p(n) be the number of s of n. For example, p(4) = 5, since we can write 4 = 4 = 3+1 = 2+2 = 2+1+1 = 1+1+1+1 and there are 5 such representations. It was known to Euler
More informationPARTITION-THEORETIC FORMULAS FOR ARITHMETIC DENSITIES
PARTITION-THEORETIC FORMULAS FOR ARITHMETIC DENSITIES KEN ONO, ROBERT SCHNEIDER, AND IAN WAGNER In celebration of Krishnaswami Alladi s 60th birthday Abstract If gcd(r, t) = 1, then a theorem of Alladi
More informationECEN 5022 Cryptography
Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,
More informationOn some inequalities between prime numbers
On some inequalities between prime numbers Martin Maulhardt July 204 ABSTRACT. In 948 Erdős and Turán proved that in the set of prime numbers the inequality p n+2 p n+ < p n+ p n is satisfied infinitely
More informationFlorian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P , Morelia, Michoacán, México
Florian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P. 8180, Morelia, Michoacán, México e-mail: fluca@matmor.unam.mx Laszlo Szalay Department of Mathematics and Statistics,
More informationNUMBER FIELDS WITHOUT SMALL GENERATORS
NUMBER FIELDS WITHOUT SMALL GENERATORS JEFFREY D. VAALER AND MARTIN WIDMER Abstract. Let D > be an integer, and let b = b(d) > be its smallest divisor. We show that there are infinitely many number fields
More information198 VOLUME 46/47, NUMBER 3
LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson
More informationArithmetic Statistics Lecture 1
Arithmetic Statistics Lecture 1 Álvaro Lozano-Robledo Department of Mathematics University of Connecticut May 28 th CTNT 2018 Connecticut Summer School in Number Theory Question What is Arithmetic Statistics?
More informationHere is another characterization of prime numbers.
Here is another characterization of prime numbers. Theorem p is prime it has no divisors d that satisfy < d p. Proof [ ] If p is prime then it has no divisors d that satisfy < d < p, so clearly no divisor
More informationON GENERALIZED BALANCING SEQUENCES
ON GENERALIZED BALANCING SEQUENCES ATTILA BÉRCZES, KÁLMÁN LIPTAI, AND ISTVÁN PINK Abstract. Let R i = R(A, B, R 0, R 1 ) be a second order linear recurrence sequence. In the present paper we prove that
More informationSection X.55. Cyclotomic Extensions
X.55 Cyclotomic Extensions 1 Section X.55. Cyclotomic Extensions Note. In this section we return to a consideration of roots of unity and consider again the cyclic group of roots of unity as encountered
More informationPythagoras = $1 million problem. Ken Ono Emory University
Pythagoras = $1 million problem Ken Ono Emory University Pythagoras The Pythagorean Theorem Theorem (Pythagoras) If (a, b, c) is a right triangle, then a 2 + b 2 = c 2. Pythagoras The Pythagorean Theorem
More informationPARITY OF THE COEFFICIENTS OF KLEIN S j-function
PARITY OF THE COEFFICIENTS OF KLEIN S j-function CLAUDIA ALFES Abstract. Klein s j-function is one of the most fundamental modular functions in number theory. However, not much is known about the parity
More informationDIVISIBILITY PROPERTIES OF THE 5-REGULAR AND 13-REGULAR PARTITION FUNCTIONS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (008), #A60 DIVISIBILITY PROPERTIES OF THE 5-REGULAR AND 13-REGULAR PARTITION FUNCTIONS Neil Calkin Department of Mathematical Sciences, Clemson
More informationMA441: Algebraic Structures I. Lecture 18
MA441: Algebraic Structures I Lecture 18 5 November 2003 1 Review from Lecture 17: Theorem 6.5: Aut(Z/nZ) U(n) For every positive integer n, Aut(Z/nZ) is isomorphic to U(n). The proof used the map T :
More informationDirichlet Series Associated with Cubic and Quartic Fields
Dirichlet Series Associated with Cubic and Quartic Fields Henri Cohen, Frank Thorne Institut de Mathématiques de Bordeaux October 23, 2012, Bordeaux 1 Introduction I Number fields will always be considered
More informationWhy is the Riemann Hypothesis Important?
Why is the Riemann Hypothesis Important? Keith Conrad University of Connecticut August 11, 2016 1859: Riemann s Address to the Berlin Academy of Sciences The Zeta-function For s C with Re(s) > 1, set ζ(s)
More informationIntroduction to Elliptic Curves
IAS/Park City Mathematics Series Volume XX, XXXX Introduction to Elliptic Curves Alice Silverberg Introduction Why study elliptic curves? Solving equations is a classical problem with a long history. Starting
More informationGAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT
Journal of Prime Research in Mathematics Vol. 8 202, 28-35 GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT JORGE JIMÉNEZ URROZ, FLORIAN LUCA 2, MICHEL
More informationBig doings with small g a p s
Big doings with small g a p s Paul Pollack University of Georgia AAAS Annual Meeting February 16, 2015 1 of 26 SMALL GAPS: A SHORT SURVEY 2 of 26 300 BCE Let p n denote the nth prime number, so p 1 = 2,
More informationON THE SEMIPRIMITIVITY OF CYCLIC CODES
ON THE SEMIPRIMITIVITY OF CYCLIC CODES YVES AUBRY AND PHILIPPE LANGEVIN Abstract. We prove, without assuming the Generalized Riemann Hypothesis, but with at most one exception, that an irreducible cyclic
More informationA PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES
A PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES MATTHEW S. MIZUHARA, JAMES A. SELLERS, AND HOLLY SWISHER Abstract. Ramanujan s celebrated congruences of the partition function p(n have inspired a vast
More informationImaginary Quadratic Fields With Isomorphic Abelian Galois Groups
Imaginary Quadratic Fields With Isomorphic Abelian Galois Groups Universiteit Leiden, Université Bordeaux 1 July 12, 2012 - UCSD - X - a Question Let K be a number field and G K = Gal(K/K) the absolute
More informationPolygonal Numbers, Primes and Ternary Quadratic Forms
Polygonal Numbers, Primes and Ternary Quadratic Forms Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/ zwsun August 26, 2009 Modern number theory has
More informationarxiv: v2 [math.co] 9 May 2017
Partition-theoretic formulas for arithmetic densities Ken Ono, Robert Schneider, and Ian Wagner arxiv:1704.06636v2 [math.co] 9 May 2017 In celebration of Krishnaswami Alladi s 60th birthday. Abstract If
More informationPartition Numbers. Kevin Y.X. Wang. September 5, School of Mathematics and Statistics The University of Sydney
Partition Numbers Kevin Y.X. Wang School of Mathematics and Statistics The University of Sydney September 5, 2017 Outline 1 Introduction 2 Generating function of partition numbers 3 Jacobi s Triple Product
More informationApplications of modular forms to partitions and multipartitions
Applications of modular forms to partitions and multipartitions Holly Swisher Oregon State University October 22, 2009 Goal The goal of this talk is to highlight some applications of the theory of modular
More informationGalois Representations
Galois Representations Samir Siksek 12 July 2016 Representations of Elliptic Curves Crash Course E/Q elliptic curve; G Q = Gal(Q/Q); p prime. Fact: There is a τ H such that E(C) = C Z + τz = R Z R Z. Easy
More informationNON-CONJUGATE, ROOK EQUIVALENT t-cores
NON-CONJUGATE, ROOK EQUIVALENT t-cores ALEX MONTOYE AND NATALIE RICH ADVISOR: HOLLY SWISHER OREGON STATE UNIVERSITY ABSTRACT. Consider a partition of a natural number n. The partition is called a t-core
More informationCONSTRUCTING SUPERSINGULAR ELLIPTIC CURVES. Reinier Bröker
CONSTRUCTING SUPERSINGULAR ELLIPTIC CURVES Reinier Bröker Abstract. We give an algorithm that constructs, on input of a prime power q and an integer t, a supersingular elliptic curve over F q with trace
More informationInfinite rank of elliptic curves over Q ab and quadratic twists with positive rank
Infinite rank of elliptic curves over Q ab and quadratic twists with positive rank Bo-Hae Im Chung-Ang University The 3rd East Asian Number Theory Conference National Taiwan University, Taipei January
More informationPartition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example
Partition of Integers into Even Summands We ask for the number of partitions of m Z + into positive even integers The desired number is the coefficient of x m in + x + x 4 + ) + x 4 + x 8 + ) + x 6 + x
More informationDEDEKIND S ETA-FUNCTION AND ITS TRUNCATED PRODUCTS. George E. Andrews and Ken Ono. February 17, Introduction and Statement of Results
DEDEKIND S ETA-FUNCTION AND ITS TRUNCATED PRODUCTS George E. Andrews and Ken Ono February 7, 2000.. Introduction and Statement of Results Dedekind s eta function ηz, defined by the infinite product ηz
More informationExercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.
Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)
More informationPartition Congruences in the Spirit of Ramanujan
Partition Congruences in the Spirit of Ramanujan Yezhou Wang School of Mathematical Sciences University of Electronic Science and Technology of China yzwang@uestc.edu.cn Monash Discrete Mathematics Research
More informationMATHEMATICS 6180, SPRING 2017 SOME MOTIVATIONAL PROBLEMS IN NUMBER THEORY. p k
MATHEMATICS 680, SPRING 207 SOME MOTIVATIONAL PROBLEMS IN NUMBER THEORY KATHERINE E. STANGE Number theory may be loosely defined as the study of the integers: in particular, the interaction between their
More informationTHE p-adic VALUATION OF LUCAS SEQUENCES
THE p-adic VALUATION OF LUCAS SEQUENCES CARLO SANNA Abstract. Let (u n) n 0 be a nondegenerate Lucas sequence with characteristic polynomial X 2 ax b, for some relatively prime integers a and b. For each
More informationBasic Algorithms in Number Theory
Basic Algorithms in Number Theory Algorithmic Complexity... 1 Basic Algorithms in Number Theory Francesco Pappalardi Discrete Logs, Modular Square Roots & Euclidean Algorithm. July 20 th 2010 Basic Algorithms
More informationA numerically explicit Burgess inequality and an application to qua
A numerically explicit Burgess inequality and an application to quadratic non-residues Swarthmore College AMS Sectional Meeting Akron, OH October 21, 2012 Squares Consider the sequence Can it contain any
More informationMaterial covered: Class numbers of quadratic fields, Valuations, Completions of fields.
ALGEBRAIC NUMBER THEORY LECTURE 6 NOTES Material covered: Class numbers of quadratic fields, Valuations, Completions of fields. 1. Ideal class groups of quadratic fields These are the ideal class groups
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 informationAlgebra for error control codes
Algebra for error control codes EE 387, Notes 5, Handout #7 EE 387 concentrates on block codes that are linear: Codewords components are linear combinations of message symbols. g 11 g 12 g 1n g 21 g 22
More informationA RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES
#A63 INTEGERS 1 (01) A RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES Brandt Kronholm Department of Mathematics, Whittier College, Whittier,
More informationEXERCISES IN MODULAR FORMS I (MATH 726) (2) Prove that a lattice L is integral if and only if its Gram matrix has integer coefficients.
EXERCISES IN MODULAR FORMS I (MATH 726) EYAL GOREN, MCGILL UNIVERSITY, FALL 2007 (1) We define a (full) lattice L in R n to be a discrete subgroup of R n that contains a basis for R n. Prove that L is
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 informationResults and open problems related to Schmidt s Subspace Theorem. Jan-Hendrik Evertse
Results and open problems related to Schmidt s Subspace Theorem Jan-Hendrik Evertse Universiteit Leiden 29 ièmes Journées Arithmétiques July 6, 2015, Debrecen Slides can be downloaded from http://pub.math.leidenuniv.nl/
More informationTwists of elliptic curves of rank at least four
1 Twists of elliptic curves of rank at least four K. Rubin 1 Department of Mathematics, University of California at Irvine, Irvine, CA 92697, USA A. Silverberg 2 Department of Mathematics, University of
More informationA NOTE ON THE EXISTENCE OF CERTAIN INFINITE FAMILIES OF IMAGINARY QUADRATIC FIELDS
A NOTE ON THE EXISTENCE OF CERTAIN INFINITE FAMILIES OF IMAGINARY QUADRATIC FIELDS IWAO KIMURA ABSTRACT. Let l > 3 be an odd prime. Let S 0, S +, S be mutually disjoint nite sets of rational primes. For
More informationQUADRATIC RECURRENCES WITH A POSITIVE DENSITY OF PRIME DIVISORS
QUADRATIC RECURRENCES WITH A POSITIVE DENSITY OF PRIME DIVISORS RICHARD GOTTESMAN AND KWOKFUNG TANG Abstract. For f(x) Z[x] and a Z, we let f n (x) be the nth iterate of f(x), P (f, a) = {p prime : p f
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 informationCONGRUENCES FOR BROKEN k-diamond PARTITIONS
CONGRUENCES FOR BROKEN k-diamond PARTITIONS MARIE JAMESON Abstract. We prove two conjectures of Paule and Radu from their recent paper on broken k-diamond partitions. 1. Introduction and Statement of Results
More informationThe Inverse Galois Problem David P. Roberts University of Minnesota, Morris
The Inverse Galois Problem David P. Roberts University of Minnesota, Morris 1. Polynomials, fields, and their invariants: A degree n number field K has a discriminant D Z and a Galois group G S n. 2. The
More informationPARITY OF THE PARTITION FUNCTION. (Communicated by Don Zagier)
ELECTRONIC RESEARCH ANNOUNCEMENTS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 1, Issue 1, 1995 PARITY OF THE PARTITION FUNCTION KEN ONO (Communicated by Don Zagier) Abstract. Let p(n) denote the number
More informationDiophantine equations
Diophantine equations So far, we have considered solutions to equations over the real and complex numbers. This chapter instead focuses on solutions over the integers, natural and rational numbers. There
More informationDiscrete Logarithms. Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set
Discrete Logarithms Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set Z/mZ = {[0], [1],..., [m 1]} = {0, 1,..., m 1} of residue classes modulo m is called
More informationPrimes and Factorization
Primes and Factorization 1 A prime number is an integer greater than 1 with no proper divisors. The list begins 2, 3, 5, 7, 11, 13, 19,... See http://primes.utm.edu/ for a wealth of information about primes.
More informationNumbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 =
2 Numbers 2.1 Integers You remember the definition of a prime number. On p. 7, we defined a prime number and formulated the Fundamental Theorem of Arithmetic. Numerous beautiful results can be presented
More informationAn Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt
An Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt Class Objectives Field Axioms Finite Fields Field Extensions Class 5: Fields and Field Extensions 1 1. Axioms for a field
More informationOLIVIA BECKWITH. 3 g+2
CLASS NUMBER DIVISIBILITY FOR IMAGINARY QUADRATIC FIELDS arxiv:809.05750v [math.nt] 5 Sep 208 OLIVIA BECKWITH Abstract. In this note we revisit classic work of Soundararajan on class groups of imaginary
More informationNumber Theory A focused introduction
Number Theory A focused introduction This is an explanation of RSA public key cryptography. We will start from first principles, but only the results that are needed to understand RSA are given. We begin
More informationDegrees of Regularity of Colorings of the Integers
Degrees of Regularity of Colorings of the Integers Alan Zhou MIT PRIMES May 19, 2012 Alan Zhou (MIT PRIMES) Degree of Regularity May 19, 2012 1 / 15 Background Original problem: For a given homogeneous
More informationCONGRUENCES FOR POWERS OF THE PARTITION FUNCTION
CONGRUENCES FOR POWERS OF THE PARTITION FUNCTION MADELINE LOCUS AND IAN WAGNER Abstract. Let p tn denote the number of partitions of n into t colors. In analogy with Ramanujan s work on the partition function,
More informationCOMBINATORIAL CONSTRUCTIONS FOR THE ZECKENDORF SUM OF DIGITS OF POLYNOMIAL VALUES
COMBINATORIAL CONSTRUCTIONS FOR THE ZECKENDORF SUM OF DIGITS OF POLYNOMIAL VALUES THOMAS STOLL Abstract. Let p(x) Z[X] with p(n) N be of degree h 2 and denote by s F (n) the sum of digits in the Zeckendorf
More informationRANK AND PERIOD OF PRIMES IN THE FIBONACCI SEQUENCE. A TRICHOTOMY
RANK AND PERIOD OF PRIMES IN THE FIBONACCI SEQUENCE. A TRICHOTOMY Christian Ballot Université de Caen, Caen 14032, France e-mail: ballot@math.unicaen.edu Michele Elia Politecnico di Torino, Torino 10129,
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 informationMath Topics in Algebra Course Notes: A Proof of Fermat s Last Theorem. Spring 2013
Math 847 - Topics in Algebra Course Notes: A Proof of Fermat s Last Theorem Spring 013 January 6, 013 Chapter 1 Background and History 1.1 Pythagorean triples Consider Pythagorean triples (x, y, z) so
More informationOn the generalized Fermat equation x 2l + y 2m = z p
On the generalized Fermat equation x 2l + y 2m = z p Samuele Anni joint work with Samir Siksek University of Warwick University of Debrecen, 29 th Journées Arithmétiques; 6 th July 2015 Generalized Fermat
More informationIntroduction to Techniques for Counting
Introduction to Techniques for Counting A generating function is a device somewhat similar to a bag. Instead of carrying many little objects detachedly, which could be embarrassing, we put them all in
More information5. Sequences & Recursion
5. Sequences & Recursion Terence Sim 1 / 42 A mathematician, like a painter or poet, is a maker of patterns. Reading Sections 5.1 5.4, 5.6 5.8 of Epp. Section 2.10 of Campbell. Godfrey Harold Hardy, 1877
More informationORDERS OF UNITS IN MODULAR ARITHMETIC
ORDERS OF UNITS IN MODULAR ARITHMETIC KEITH CONRAD. Introduction If a mod m is a unit then a ϕ(m) mod m by Euler s theorem. Depending on a, it might happen that a n mod m for a positive integer n that
More informationMaximal Class Numbers of CM Number Fields
Maximal Class Numbers of CM Number Fields R. C. Daileda R. Krishnamoorthy A. Malyshev Abstract Fix a totally real number field F of degree at least 2. Under the assumptions of the generalized Riemann hypothesis
More informationA. Algebra and Number Theory
A. Algebra and Number Theory Public-key cryptosystems are based on modular arithmetic. In this section, we summarize the concepts and results from algebra and number theory which are necessary for an understanding
More information