Dedekind Sums with Arguments Near Euler s Number e
|
|
- Debra Allen
- 6 years ago
- Views:
Transcription
1 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 Austria Kurt.Girstmair@uib.ac.at Abstract We study the asymptotic behaviour of the classical Dedeind sums s(m/n) for convergents m/n of e, e, and (e+1)/(e 1), where e = is Euler s number. Our main tool is the Baran-Hicerson-Knuth formula, which yields a precise description of what happens in all cases. 1 Introduction and results Dedeind sums have quite a number of interesting applications in analytic number theory (modular forms), algebraic number theory (class numbers), lattice point problems and algebraic geometry (for instance [1, 7, 9, 1]). Let n be a positive integer and m Z, (m,n) = 1. The classical Dedeind sum s(m/n) is defined by n s(m/n) = ((/n))((m/n)) =1 where ((...)) is the usual sawtooth function (for example, [9, p. 1]). In the present setting it is more natural to wor with instead. S(m/n) = 1s(m/n) 1
2 In the previous paper [] we used the Baran-Hicerson-Knuth-formula to study the asymptotic behaviour of S(s /t ) for the convergents s /t of a periodic simple continued fraction α = [a 0,a 1,a,...], i. e., for a quadratic irrational α. In this situation two cases are possible: The sequence S(s /t ) either remains bounded with a finite number of cluster points or it essentially behaves lie C for some constant C depending on α. In the latter case S(s /t ) C remains bounded with finitely many cluster points. The former case occurs, for instance, if the period length of α is odd. Since the order of magnitude of S(m/n) is log n on average [4], quadratic irrationalities produce Dedeind sums of a considerably smaller size. In fact, the inequality log t / log + 1 was already proved in 1841 [11]. Accordingly, if S(s /t ) is not bounded, we have S(s /t ) = O(log t ) for a quadratic irrational α. Because the structure of the continued fraction expansions of transcendental numbers lie e or e is similar to that of quadratic irrationals [8, p. 1 ff.], nothing prevents us from applying the Baran-Hicerson-Knuth-formula (() below) to these cases. It turns out that the asymptotic behaviour of Dedeind sums is quite similar to the case of quadratic irrationals. Only the case S(s /t ) bounded cannot occur, as the said formula shows, since the continued fraction expansions of these numbers have unbounded digits. We shall show Theorem 1. For a nonnegative integer put, if 0, 1, (mod 6); L() =, otherwise. Then we have, for the convergents s /t of Euler s number e, S(s /t ) L() = O e, if (mod 6); e, if 1 (mod 6); 6 + e +, if (mod 6); e +, if 4 (mod 6); 6 e, if (mod 6). The continued fraction expansion of e = is more complicated than that of e. This has the effect that the analogue of Theorem 1 also loos more complicated. We obtain Theorem. For a nonnegative integer put, if 1,, (mod 10);, if 6, 7, 8 (mod 10); L() = 6, if 0, 4 (mod 10); 6, if, 9 (mod 10).
3 Then we have, for the convergents s /t of the number e, e 7, if 0 (mod 10); S(s /t ) L() = O + e 7, if 1 (mod 10); e 9, if (mod 10); e 1 + 1, if (mod 10); e 16, if 4 (mod 10); e + 1, if (mod 10); e + 7, if 6 (mod 10); e 1, if 7 (mod 10); e 4 + 1, if 8 (mod 10); e 14, if 9 (mod 10). Finally, we consider the case of e = (e + 1)/(e 1), which is fairly simple. Theorem. For a nonnegative integer put, if is even; L() =, if is odd. Then we have, for the convergents s /t of e, Proofs S(s /t ) L() = O + e, if is even; e 1, if is odd. We start with the continued fraction expansion [a 0,a 1,a,...] of an arbitrary irrational number. The numerators and denominators of its convergents s /t are defined by the recursion formulas s = 0, s 1 = 1, s = a s 1 + s and t = 1, t 1 = 0, t = a t 1 + t, for 0. (1) The Baran-Hicerson-Knuth formula says that for 0 (s S(s /t ) = ( 1) j 1 + t 1 )/t, if is odd; a j + () (s t 1 )/t, if is even; [], [], [6]. Here s and t are defined as in (1), but for the number [0,a 1,a,...] instead of [a 0,a 1,a,...]. We prove the simplest case first.
4 Proof of Theorem. The digits a j of the continued fraction expansion of e are a j = 4j +, j = 0, 1,,... [8, p. 14]. An easy calculation shows that for 0 ( 1) j 1, if is even; a j = () + 4, if is odd. Now s /t converges against [0,a 1,a,...] = e, and e s /t < 1/t [8, p. 7]. We remared in the Introduction that = O(log t ). Hence we also have e s /t = O(1/). Finally, (1) gives t 1 /t = t 1 /(a t 1 + t ) 1/a = O(1/). These observations, together with () and (), prove the theorem. Proof of Theorem 1. In the case of e = [a 0,a 1,a,...] one easily derives from [8, p. 14] that, if j = 0; a j = (j 1)/ +, if j (mod ); 1, otherwise. An elementary computation with arithmetic series (which is more laborious than that of the proof of Theorem ) yields, if 0 (mod 6); ( 1) j 1 a j = 1 + 1, if (mod 6); + 1, if 1 (mod 6);, if 4 (mod 6); 1 1, if (mod 6); +, if (mod 6). In the same way as in the proof Theorem we have s /t e and e s /t = O(1/). If (mod ), we note t 1 /t 1/a = O(1/). If 0 (mod ) and, we have (4) t 1 t = t 1 t 1 t = 1. () 1 + t /t 1 Since t /t 1 = O(1/), this shows t 1 /t = 1 + O(1/). If 1 (mod ) and 4, formula () also holds. Together with t /t 1 = 1+O(1/), it gives t 1 /t = 1/+O(1/). These observations, combined with () and (4), prove the theorem. Proof of Theorem. The proof follows the above pattern. One obtains from [8, p. 1] 7, if j = 0; (j + 7)/, if j 1 (mod ); a j = (j + )/, if j 4 (mod ); 1j/ + 6, if j 0 (mod ),j > 0; 1, otherwise. 4
5 Further, ( 1) +, if 1 (mod 10); ( 1) + 9, if 6 (mod 10); ( ) + 1, if (mod 10); ( 1) j 1 a j = ( ) + 10, if 7 (mod 10); ( ) +, if (mod 10); ( ) + 9, if 8 (mod 10); 6 6, if 0 (mod 10); + 11, if (mod 10); 6( 4) 1, if 4 (mod 10); 6( 4) + 1, if 9 (mod 10). In the same way as in the proof of Theorem 1 we observe e 7 s /t = O(1/) and t 1 t = O + Thereby, and by (6), we obtain the theorem. 0, if 0, 1, 4 (mod ); 1, if (mod );, if (mod ). 1 Remar It is easy to see that the error term O(1/) in the theorems cannot be made smaller. Accordingly, the convergence is rather slow, which is a further difference between the present cases and the case of quadratic irrationals.. The continued fraction expansions of e /q and (e /q + 1)/(e /q 1) for integers q 1 have a shape similar to that of e, e, and e [8, p. 14 f.]. The same holds for the the numbers tan(1/q). Therefore, similar theorems about Dedeind sums can be expected for the convergents of these numbers.. Due to a theorem of Hurwitz [8, p. 119] one may even hope for similar results for the numbers ae /q + b ce /q + d, where the integer q is 1 and a,b,c,d Z are such that ad bc 0. It seems, however, that not all continued fraction expansions of these numbers are explicitly nown. 4. The continued fraction expansions of the numbers b j, b Z,b, j=0 are also nown [10]. They are, however, much more involved than those considered here. Accordingly, the asymptotic behaviour of the corresponding Dedeind sums seems to be far more complicated. (6)
6 References [1] T. M. Apostol, Modular Functions and Dirichlet Series in Number Theory, Springer, [] Ph. Baran, Sur les sommes de Dedeind et les fractions continues finies, C. R. Acad. Sci. Paris Sér. A-B 84 (1977) A9 A96. [] K. Girstmair, Dedeind sums in the vicinity of quadratic irrationals, J. Number Th. 1 (01), [4] K. Girstmair and J. Schoißengeier, On the arithmetic mean of Dedeind sums, Acta Arith. 116 (00), [] D. Hicerson, Continued fractions and density results for Dedeind sums, J. Reine Angew. Math. 90 (1977), [6] D. E. Knuth, Notes on generalized Dedeind sums, Acta Arith. (1977), 97. [7] C. Meyer, Die Berechnung der Klassenzahl Abelscher Körper über quadratischen Zahlörpern, Aademie-Verlag, 197. [8] O. Perron, Die Lehre von den Kettenbrüchen, vol. I (rd ed.), Teubner, 194. [9] H. Rademacher and E. Grosswald, Dedeind Sums, Mathematical Association of America, 197. [10] J. Shallit, Simple continued fractions for some irrational numbers, J. Number Th. 11 (1979), [11] J. Shallit, Origins of the analysis of the Euclidean algorithm, Hist. Math 1 (1994), [1] G. Urzúa, Arrangements of curves and algebraic surfaces, J. Algebraic Geom. 19 (010), Mathematics Subject Classification: Primary 11F0; Secondary 11A. Keywords: asymptotic behaviour of Dedeind sums, continued fraction expansions of transcendental numbers. Received May 8 01; revised version received May Published in Journal of Integer Sequences, June Return to Journal of Integer Sequences home page. 6
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 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 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 informationConjectures and Results on Super Congruences
Conjectures and Results on Suer Congruences Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn htt://math.nju.edu.cn/ zwsun Feb. 8, 2010 Part A. Previous Wor by Others What are
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 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 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 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 informationarxiv: v2 [math.gm] 31 Dec 2017
New results on the stopping time behaviour of the Collatz 3x + 1 function arxiv:1504.001v [math.gm] 31 Dec 017 Mike Winkler Fakultät für Mathematik Ruhr-Universität Bochum, Germany mike.winkler@ruhr-uni-bochum.de
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 informationA STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A31 A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP Shinji Tanimoto Department of Mathematics, Kochi Joshi University
More informationarxiv: v1 [math.gm] 29 Mar 2015
arxiv:1504.001v1 [math.gm] 9 Mar 015 New results on the stopping time behaviour of the Collatz 3x + 1 function Mike Winkler March 7, 015 Abstract Let σ n = 1 + n log 3. For the Collatz 3x + 1 function
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 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 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 informationSELECTED GEOMETRICAL CONSTRUCTIONS
FACULTY OF NATURAL SCIENCES CONSTANTINE THE PHILOSOPHER UNIVERSITY IN NITRA ACTA MATHEMATICA 17 SELECTED GEOMETRICAL CONSTRUCTIONS ABSTRACT. This article deals with selected classical geometric constructions
More informationProof that Mersenne Prime Numbers are Infinite and that Even Perfect Numbers are Infinite
Proof that Mersenne Prime Numbers are Infinite and that Even Perfect Numbers are Infinite Stephen Marshall 7 November 208 Abstract Mersenne prime is a prime number that is one less than a power of two.
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 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 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 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 information8.3 Prove It! A Practice Understanding Task
15 8.3 Prove It! A Practice Understanding Task In this task you need to use all the things you know about quadrilaterals, distance, and slope to prove that the shapes are parallelograms, rectangles, rhombi,
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 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 informationOn repdigits as product of consecutive Fibonacci numbers 1
Rend. Istit. Mat. Univ. Trieste Volume 44 (2012), 33 37 On repdigits as product of consecutive Fibonacci numbers 1 Diego Marques and Alain Togbé Abstract. Let (F n ) n 0 be the Fibonacci sequence. In 2000,
More informationMinimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field
Minimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field Gretchen L. Matthews and Justin D. Peachey Abstract. The norm-trace function field is a generalization
More information1.6 Congruence Modulo m
1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number
More information6.2 Modular Arithmetic
6.2 Modular Arithmetic Every reader is familiar with arithmetic from the time they are three or four years old. It is the study of numbers and various ways in which we can combine them, such as through
More informationSiyavula textbooks: Grade 12 Maths. Collection Editor: Free High School Science Texts Project
Siyavula textbooks: Grade 12 Maths Collection Editor: Free High School Science Texts Project Siyavula textbooks: Grade 12 Maths Collection Editor: Free High School Science Texts Project Authors: Free
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets
More informationTwo sequences completely characterize an ordinary continued fraction: a 1. , a 2
Continued Fractions Continued fractions are part of the lost mathematics, the mathematics now considered too advanced for high school and too elementary for college. Petr Beckmann, A History of Pi Most
More informationCLASS NOTES. A mathematical proof is an argument which convinces other people that something is true.
Propositional Statements A mathematical proof is an argument which convinces other people that something is true. The implication If p then q written as p q means that if p is true, then q must also be
More informationMeet #3 January Intermediate Mathematics League of Eastern Massachusetts
Meet #3 January 2009 Intermediate Mathematics League of Eastern Massachusetts Meet #3 January 2009 Category 1 Mystery 1. How many two-digit multiples of four are there such that the number is still a
More informationOutline Introduction Big Problems that Brun s Sieve Attacks Conclusions. Brun s Sieve. Joe Fields. November 8, 2007
Big Problems that Attacks November 8, 2007 Big Problems that Attacks The Sieve of Eratosthenes The Chinese Remainder Theorem picture Big Problems that Attacks Big Problems that Attacks Eratosthene s Sieve
More informationClosed Almost Knight s Tours on 2D and 3D Chessboards
Closed Almost Knight s Tours on 2D and 3D Chessboards Michael Firstein 1, Anja Fischer 2, and Philipp Hungerländer 1 1 Alpen-Adria-Universität Klagenfurt, Austria, michaelfir@edu.aau.at, philipp.hungerlaender@aau.at
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 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 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 informationarxiv: v1 [math.co] 30 Nov 2017
A NOTE ON 3-FREE PERMUTATIONS arxiv:1712.00105v1 [math.co] 30 Nov 2017 Bill Correll, Jr. MDA Information Systems LLC, Ann Arbor, MI, USA william.correll@mdaus.com Randy W. Ho Garmin International, Chandler,
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 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 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 informationCMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013
CMPSCI 250: Introduction to Computation Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013 The Chinese Remainder Theorem Infinitely Many Primes Reviewing Inverses and the Inverse
More informationFACTORS AND PRIMES IN TWO SMARANDACHE SEQUENCES RALF W. STEPHAN Abstract. Using a personal computer and freely available software, the author factored
FACTORS AND PRIMES IN TWO SMARANDACHE SEQUENCES RALF W. STEPHAN Abstract. Using a personal computer and freely available software, the author factored some members of the Smarandache consecutive sequence
More informationTOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1
TOPOLOGY, LIMITS OF COMPLEX NUMBERS Contents 1. Topology and limits of complex numbers 1 1. Topology and limits of complex numbers Since we will be doing calculus on complex numbers, not only do we need
More informationThe Complexity of Sorting with Networks of Stacks and Queues
The Complexity of Sorting with Networks of Stacks and Queues Stefan Felsner Institut für Mathematik, Technische Universität Berlin. felsner@math.tu-berlin.de Martin Pergel Department of Applied Mathematics
More informationA Compendium of BBP-Type Formulas for Mathematical Constants
A Compendium of BBP-Type Formulas for Mathematical Constants David H. Bailey August 5, 207 Abstract A 996 paper by the author, Peter Borwein and Simon Plouffe showed that any mathematical constant given
More informationPublic Key Encryption
Math 210 Jerry L. Kazdan Public Key Encryption The essence of this procedure is that as far as we currently know, it is difficult to factor a number that is the product of two primes each having many,
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 informationHonors Algebra 2 Assignment Sheet - Chapter 1
Assignment Sheet - Chapter 1 #01: Read the text and the examples in your book for the following sections: 1.1, 1., and 1.4. Be sure you read and understand the handshake problem. Also make sure you copy
More informationMonotone Sequences & Cauchy Sequences Philippe B. Laval
Monotone Sequences & Cauchy Sequences Philippe B. Laval Monotone Sequences & Cauchy Sequences 2 1 Monotone Sequences and Cauchy Sequences 1.1 Monotone Sequences The techniques we have studied so far require
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 information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 7 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 7 1 / 8 Invertible matrices Theorem. 1. An elementary matrix is invertible. 2.
More information1. I N T R O D U C T I O N
Tamas Lengyel Occidental College, 1600 Campus Road, Los Angeles, CA 90041 (Submitted April 2001-Final Revision July 2001) 1. I N T R O D U C T I O N In the two-person nim-type game called Euclid a position
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 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 informationPermutations with short monotone subsequences
Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2,..., n 2 whose longest monotone subsequence is of length n and are therefore extremal for the Erdős-Szekeres
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 informationContinuity of the Norm of a Composition Operator
Integr. equ. oper. theory 45 (003) 35 358 0378-60X/03035-8 $.50+0.0/0 c 003 Birkhäuser Verlag Basel/Switzerl Integral Equations Operator Theory Continuity of the Norm of a Composition Operator David B.
More informationSTRATEGY AND COMPLEXITY OF THE GAME OF SQUARES
STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES FLORIAN BREUER and JOHN MICHAEL ROBSON Abstract We introduce a game called Squares where the single player is presented with a pattern of black and white
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 informationSolutions for the Practice Final
Solutions for the Practice Final 1. Ian and Nai play the game of todo, where at each stage one of them flips a coin and then rolls a die. The person who played gets as many points as the number rolled
More information#A13 INTEGERS 15 (2015) THE LOCATION OF THE FIRST ASCENT IN A 123-AVOIDING PERMUTATION
#A13 INTEGERS 15 (2015) THE LOCATION OF THE FIRST ASCENT IN A 123-AVOIDING PERMUTATION Samuel Connolly Department of Mathematics, Brown University, Providence, Rhode Island Zachary Gabor Department of
More informationTwenty-sixth Annual UNC Math Contest First Round Fall, 2017
Twenty-sixth Annual UNC Math Contest First Round Fall, 07 Rules: 90 minutes; no electronic devices. The positive integers are,,,,.... Find the largest integer n that satisfies both 6 < 5n and n < 99..
More informationCalculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand.
Midterm #: practice MATH Intro to Number Theory midterm: Thursday, Nov 7 Please print your name: Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating
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 informationCMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012
CMPSCI 250: Introduction to Computation Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012 The Chinese Remainder Theorem Infinitely Many Primes Reviewing Inverses and the
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 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 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 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 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 informationCombinatorial Expressions Involving Fibonacci, Hyperfibonacci, and Incomplete Fibonacci Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 17 (2014), Article 14.4.3 Combinatorial Expressions Involving Fibonacci, Hyperfibonacci, and Incomplete Fibonacci Numbers Hacène Belbachir and Amine
More informationPROPERTIES OF MERSENNE NUMBERS AND PRIMES
PROPERTIES OF MERSEE UMBERS AD PRIMES If one looks at the sequence of numbers- = 3, 7, 31, 127, 2047, 8291, 131071, 524287 one notices that its elements are, with the exception of 2047, prime numbers defined
More informationAsymptotic Results for the Queen Packing Problem
Asymptotic Results for the Queen Packing Problem Daniel M. Kane March 13, 2017 1 Introduction A classic chess problem is that of placing 8 queens on a standard board so that no two attack each other. This
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 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 informationUNIT 2 LINEAR AND EXPONENTIAL RELATIONSHIPS Station Activities Set 2: Relations Versus Functions/Domain and Range
UNIT LINEAR AND EXPONENTIAL RELATIONSHIPS Station Activities Set : Relations Versus Functions/Domain and Range Station You will be given a ruler and graph paper. As a group, use our ruler to determine
More information#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS. Thomas A. Plick
#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS Thomas A. Plick tomplick@gmail.com Received: 10/5/14, Revised: 9/17/16, Accepted: 1/23/17, Published: 2/13/17 Abstract We show that out of the
More informationBRITISH COLUMBIA SECONDARY SCHOOL MATHEMATICS CONTEST, 2006 Senior Preliminary Round Problems & Solutions
BRITISH COLUMBIA SECONDARY SCHOOL MATHEMATICS CONTEST, 006 Senior Preliminary Round Problems & Solutions 1. Exactly 57.4574% of the people replied yes when asked if they used BLEU-OUT face cream. The fewest
More informationYale University Department of Computer Science
LUX ETVERITAS Yale University Department of Computer Science Secret Bit Transmission Using a Random Deal of Cards Michael J. Fischer Michael S. Paterson Charles Rackoff YALEU/DCS/TR-792 May 1990 This work
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 informationDUBLIN CITY UNIVERSITY
DUBLIN CITY UNIVERSITY SEMESTER ONE EXAMINATIONS 2013 MODULE: (Title & Code) CA642 Cryptography and Number Theory COURSE: M.Sc. in Security and Forensic Computing YEAR: 1 EXAMINERS: (Including Telephone
More informationArithmetic Sequences Read 8.2 Examples 1-4
CC Algebra II HW #8 Name Period Row Date Arithmetic Sequences Read 8.2 Examples -4 Section 8.2 In Exercises 3 0, tell whether the sequence is arithmetic. Explain your reasoning. (See Example.) 4. 2, 6,
More informationNeverending Fractions
Neverending Fractions Despite their classical nature, continued fractions are a neverending research area, with a body of results accessible enough to suit a wide audience, from researchers to students
More informationNEW Published in June 2018 CATALOGUE 2019
NEW Published in June 2018 CATALOGUE 2019 PASS PUBLICATIONS PRIVATE ACADEMIC AND SCIENTIFIC STUDIES LIMITED passpublications.uk@gmail.com +44(0)20 8857 4752 P A S S PUBLICATIONS PASS is an acronym for
More informationSequences. like 1, 2, 3, 4 while you are doing a dance or movement? Have you ever group things into
Math of the universe Paper 1 Sequences Kelly Tong 2017/07/17 Sequences Introduction Have you ever stamped your foot while listening to music? Have you ever counted like 1, 2, 3, 4 while you are doing a
More information1999 Mathcounts National Sprint Round Solutions
999 Mathcounts National Sprint Round Solutions. Solution: 5. A -digit number is divisible by if the sum of its digits is divisible by. The first digit cannot be 0, so we have the following four groups
More informationNumber-Theoretic Algorithms
Number-Theoretic Algorithms Hengfeng Wei hfwei@nju.edu.cn March 31 April 6, 2017 Hengfeng Wei (hfwei@nju.edu.cn) Number-Theoretic Algorithms March 31 April 6, 2017 1 / 36 Number-Theoretic Algorithms 1
More informationOrder and Compare Rational and Irrational numbers and Locate on the number line
806.2.1 Order and Compare Rational and Irrational numbers and Locate on the number line Rational Number ~ any number that can be made by dividing one integer by another. The word comes from the word "ratio".
More informationUnique Sequences Containing No k-term Arithmetic Progressions
Unique Sequences Containing No k-term Arithmetic Progressions Tanbir Ahmed Department of Computer Science and Software Engineering Concordia University, Montréal, Canada ta ahmed@cs.concordia.ca Janusz
More informationIdeas beyond Number. Activity worksheets
Ideas beyond Number Activity sheet 1 Task 1 Some students started to solve this equation in different ways: For each statement tick True or False: = = = = Task 2: Counter-examples The exception disproves
More informationSequence of Integers Generated by Summing the Digits of their Squares
Indian Journal of Science and Technology, Vol 8(5), DOI: 0.785/ijst/205/v8i5/6992, July 205 ISSN (Print) : 097-686 ISSN (Online) : 097-565 Sequence of Integers Generated by Summing the Digits of their
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 informationlecture notes September 2, Batcher s Algorithm
18.310 lecture notes September 2, 2013 Batcher s Algorithm Lecturer: Michel Goemans Perhaps the most restrictive version of the sorting problem requires not only no motion of the keys beyond compare-and-switches,
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem Theorem. Let m and n be two relatively prime positive integers. Let a and b be any two integers. Then the two congruences x a (mod m) x b (mod n) have common solutions. Any
More informationSection V.1.Appendix. Ruler and Compass Constructions
V.1.Appendix. Ruler and Compass Constructions 1 Section V.1.Appendix. Ruler and Compass Constructions Note. In this section, we explore straight edge and compass constructions. Hungerford s expression
More informationNIM Games: Handout 1
NIM Games: Handout 1 Based on notes by William Gasarch 1 One-Pile NIM Games Consider the following two-person game in which players alternate making moves. There are initially n stones on the board. During
More informationLECTURE 8: DETERMINANTS AND PERMUTATIONS
LECTURE 8: DETERMINANTS AND PERMUTATIONS MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1 Determinants In the last lecture, we saw some applications of invertible matrices We would now like to describe how
More informationIdeas beyond Number. Teacher s guide to Activity worksheets
Ideas beyond Number Teacher s guide to Activity worksheets Learning objectives To explore reasoning, logic and proof through practical, experimental, structured and formalised methods of communication
More information