Continued Fractions New and Old Results
|
|
- Myles Warren
- 5 years ago
- Views:
Transcription
1 Continued Fractions New and Old Results Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada Joint work with Dzmitry Badziahin 1/43
2 Continued fractions By a continued fraction we mean an expression of the form a 0 + a a a n or 1 a a a a n + where a 1,a 2,..., are positive integers and a 0 is an integer. To save space, as usual, we write [a 0,a 1,...,a n ] for the first expression and [a 0,a 1,...,] for the second. 2/43
3 What s known Euler, Lagrange: a real number has an ultimately periodic continued fraction expansion if and only if it is a quadratic irrational Other interesting numbers: e = [2,(1,2n,1) n=1] = [2,1,2,1,1,4,1,1,6,1,1,8,1,...] e 2 = [7,(3n 1,1,1,3n,12n+6) n=1] = [7,2,1,1,3,18,5,1,1,6,30,...] tan1 = [(1,2n 1) n=1] = [1,1,1,3,1,5,1,7,...] These three are examples of Hurwitz continued fractions, where there is a quasiperiod of terms that grow linearly. No simple pattern is currently known for the expansions of π or e 3 or e 4. 3/43
4 Irrationality measure The irrationality measure µ(x) of a real number x is the supremum of the real numbers µ such that the inequality x p q < 1 q µ has infinitely many solutions in rational numbers p/q. So it measures how well x is approximated by rationals. Liouville s theorem: if x is algebraic of degree n then µ(x) n. Roth s theorem: if x is an algebraic irrational number then µ(x) = 2. If the continued fraction for x has bounded partial quotients then µ(x) = 2. 4/43
5 Irrationality measures of some famous numbers µ(e) = 2 µ(π) (Salikhov) µ(π 2 ) (Rhin & Viola) by studying the integral ( x h (1 x) i y k (1 y) j (1 xy) i+j l ) n dxdy 1 xy = a n b n ζ(2), in particular for (h,i,j,k,l) = (12,12,14,14,13). µ(log 2) (Marcovecchio) µ(ζ(3)) (Rhin & Viola) 5/43
6 The usual conventions Given a real irrational number x with partial quotients x = [a 0,a 1,a 2,...] we define the sequence of convergents by p 2 = 0 p 1 = 1 p n = a n p n 1 +p n 2 (n 0) q 2 = 1 q 1 = 0 q n = a n q n 1 +q n 2 (n 0) and then [a 0,a 1,...,a n ] = p n q n. Furthermore, we use the Hurwitz-Kolden-Frame representation of continued fractions via 2 2 matrices, as follows: [ ][ ] [ ] [ a0 1 a1 1 an 1 pn p M(a 0,...,a n ) := = n q n q n 1 ]. 6/43
7 The matrix approach By taking determinants we immediately deduce the classical identity p n q n 1 p n 1 q n = ( 1) n+1 for n 0. Given a finite sequence z = (a 0,...,a n ) we let z R denote the reversed sequence (a n,...,a 0 ). A sequence is a palindrome if z = z R. By taking the transpose of the equation above, we get M(a n,...,a 0 ) := [ an ] [ a ][ a ] [ pn q = n p n 1 q n 1 ]. Hence if [a 0,a 1,...,a n ] = p n /q n then [a n,...,a 1,a 0 ] = p n /p n 1. 7/43
8 Ultimately periodic continued fractions By an expression of the form [x,w], where x and w are finite strings, we mean the continued fraction [x,w,w,w,...], where the overbar or vinculum denotes the repeating portion. Thus, for example, 7 = [2,1,1,1,4] = [2,1,1,1,4,1,1,1,4,1,1,1,4,...]. 8/43
9 Numbers with easy to describe continued fractions We want to understand the characteristics and Diophantine properties of numbers whose continued fraction expansion is generated by a simple computational model, such as a finite automaton. Famous example: the Thue-Morse sequence on the symbols {a,b} where a = b and b = a, given by t = t 0 t 1 t 2 = abbabaab and defined by a, if n = 0; t n = t n/2, if n even; t n 1, if n odd. 9/43
10 Automatic sequences A continued fraction like [t] = [a,b,b,a,b,a,a,b,...] is called automatic because its terms are generated by a finite automaton. Basic idea: input to the automaton is n expressed in base 2 each symbol read causes a transition to the appropriate state output is associated with the last state reached /43
11 Previous results Queffélec proved that if a, b are distinct positive integers, then the real number [t] = [t 0,t 1,t 2,...] is transcendental. Later, a simpler proof was found by Adamczewski and Bugeaud. Queffélec also proved the transcendence of a much wider class of automatic continued fractions. Many new recent results about properties of automatic, morphic, and Sturmian continued fractions (Allouche, Davis, Quéffelec, Zamboni, Adamczewski, Bugeaud,...) Finally, Bugeaud proved (2012) that any automatic continued fraction is either a quadratic number or is transcendental. 11/43
12 Another automatic continued fraction Consider the number α k = n 0k 2n = k 1 +k 2 +k 4 +k 8 + for an integer k 2. These numbers, sometimes mistakenly called the Fredholm numbers, are all known to be transcendental. Their continued fraction is (for k 3): α k = [0,k 1,k+2,k,k,k 2,k,k+2,k,k 2,k+2,k,k 2,...] where the partial quotients all lie in the set {0,k 2,k 1,k,k +2}. (JOS and Kmošek, independently). 12/43
13 Another automatic continued fraction There is an automaton that generates this sequence: k k ,1 k ,1 0 k 2 0,1 1 k k k k 1 k Figure: Automaton generating the continued fraction for α k 13/43
14 k-regular sequences Drawback: all automatic sequences (and the more general class of morphic sequences) take only finitely many distinct values A more general class, allowing unbounded terms, is the k-regular sequences of integers, for integer k 2. These are sequences (a n ) n 0 where the k-kernel, defined by {(a k e n+i) n 0 : e 0, 0 i < k e }, is contained in a finitely generated module. Example: s k (n), the function counting the sum of the base-k digits of n. It satisfies s k (k e n+i) = s k (n)+s k (i) and hence each sequence (s k (k e n+i)) n 0 can be written as a linear combination of the sequence (s k (n)) n 0 and the constant sequence 1. 14/43
15 A conjecture Conjecture Every continued fraction where the terms form a k-regular sequence of positive integers is either transcendental or quadratic. 15/43
16 A particular 2-regular non-automatic sequence Let s = s 0 s 1 s 2 = (1,2,1,4,1,2,1,8,...) where s i = 2 ν 2(i+1) and ν p (x) is the p-adic valuation of x (the exponent of the largest power of p dividing x). To see that s is 2-regular, notice that every sequence in the 2-kernel is a linear combination of s itself and the constant sequence (1,1,1,...). Define the real number σ to have continued fraction expansion σ = [s] = [s 0,s 1,s 2,...] = [1,2,1,4,1,2,1,8,...] = The sequence s is sometimes called the ruler sequence. 16/43
17 Properties of σ σ has slowly growing partial quotients (indeed, s i i +1 for all i) But empirical calculation for σ 2 = demonstrates the appearance of some exceptionally large partial quotients! Here are the first few terms: σ 2 = [1,1,4,1,74,1,8457,1, ,1,1,1,2,1, , 11, 37, 1, 4, 2, ,11,5,3,12,2,34,2,9,8,1,1,2,7, ,. First noticed by Paul D. Hanna and Robert G. Wilson in November /43
18 The basic idea To prove that the partial quotients of σ 2 truly do grow doubly exponentially, we will rely on the following classical estimate: 1 (a n+1 +2)qn 2 < x p n q n < 1 a n+1 qn 2. So to show that some partial quotients of x are huge, it is sufficient to find convergents p n /q n of x such that x p n /q n is much smaller than q 2 n. 18/43
19 An Old Result We now recall a classical result: Lemma Let a 0 be a positive integer and w denote a finite palindrome of positive integers. Then p [a 0,w,2a 0 ] = q, where M(w) = [ α β γ δ ] p = a 2 0α+2a 0 β +δ q = α. 19/43
20 Two sequences We now define two related sequences for n 2: u(n) = (s 1,s 2,...,s 2 n 3) v(n) = (s 1,s 2,...,s 2 n 2) = (u(n),1) Recall that s n = 2 v 2(n+1) is defined in the introduction. The following table gives the first few values of these quantities: n u(n) v(n) /43
21 A proposition The following proposition, which is easily proved by induction, gives the relationship between these sequences, for n 2: Proposition (a) u(n+1) = (v(n),2 n,v(n) R ); (b) u(n) is a palindrome; (c) v(n+1) = (v(n),2 n,1,v(n)). 21/43
22 Two matrices Furthermore, we can define the sequence of associated matrices with u(n) and v(n): [ ] cn e M(u(n)) := n d n f n [ ] wn y M(v(n)) := n. x n z n 22/43
23 A calculation Now let σ n = [1,u(n),2] Then by the previous lemma with a 0 = 1 and w = u(n) we get σ n = cn +2e n +f n c n. Write σ = [s 0,s 1,...] and [s 0,s 1,...,s n ] = pn q n. Furthermore define ˆσ n = [1,u(n)]. Notice that σ, σ n, and ˆσ n all agree on the first 2 n 2 partial quotients. 23/43
24 An inequality We have σ ˆσ n < 1 q 2 n 3q 2 n 2 by a classical theorem on continued fractions. Furthermore, since s 2 n 3 = 2, s 2 n 2 = 1, we have, for n 3, that σ < σ n < ˆσ n. Hence σ σ n < 1 q 2 n 3q 2 n 2. 24/43
25 A good approximation Now by considering M(1)M(u(n))M(1) = = [ ][ ][ 1 1 cn e n d n f n 1 0 [ ] 2cn +d n e n +f n, c n +d n c n ] we see that q 2 n 3 = c n and q 2 n 2 = c n +d n. 25/43
26 A good approximation (continued) For simplicity write g n = c n +2e n +f n. Then σ σ n = σ gn < 1, and so σ 2 g n = σ c n gn c n c n c 2 n σ + gn < 3. So we have already found good approximations of σ 2 by rational numbers. Next we show g n and c n have a large common factor, which will improve the quality of the approximation. c n c 2 n 26/43
27 Improving the approximation From previous results we get that the matrix [ ] cn+1 e n+1, d n+1 f n+1 associated with u(n+1), is equal to the matrix associated with (v(n),2 n,v(n) R ), which is [ ][ ][ ] wn y n 2 n 1 wn x n 1 0 [ = x n z n 2 n wn 2 +2w n y n 2 n w n x n +x n y n +w n z n 2 n w n x n +x n y n +w n z n 2 n xn 2 +2x n z n y n z n ]. 27/43
28 Improving the approximation Notice that c n+1 = (2 n w n +2y n )w n. (1) On the other hand, we have g n+1 = c n+1 +2d n+1 +f n+1 = c n+1 +2(2 n w n x n +x n y n +w n z n )+2 n xn 2 +2x n z n = c n+1 +2(2 n w n x n +x n y n +w n z n )+2 n xn 2 +2x n z n +2(x n y n w n z n +1) = c n+1 +(2 n w n +2y n )2x n +2 n xn 2 +2x n z n +2 = (2 n w n +2y n )(2x n +w n )+2 n xn 2 +2x n z n +2, By Euclidean division, we get gcd(g n+1,2 n w n +2y n ) = gcd(2 n w n +2y n,2 n xn 2 +2x n z n +2). 28/43
29 The other matrix Next we work with v(n+1). We get that the matrix [ ] wn+1 y n+1 x n+1 z n+1 associated with v(n+1) is equal to the matrix associated with (v(n),2 n,1,v(n)), which is [ wn y n x n z n ][ 2 n ][ ][ wn y n x n z n [ (2 = n +1)wn 2 +2 n w n x n +y n (w n +x n ) (2 n +1)w n y n +2 n ] w n z n +y n (y n +z n ) (2 n +1)x n w n +2 n xn 2 +z n (w n +x n ) (2 n +1)x n y n +2 n. x n z n +z n (y n +z n ) ] 29/43
30 The other matrix Letting r n := 2 n (w n +x n )+w n +y n +z n, we see that 2 n+1 w n+1 +2y n+1 = 2 n+1 ((2 n +1)wn 2 +2 n w n x n +y n (w n +x n ))+ 2((2 n +1)w n y n +2 n w n z n +y n (y n +z n )) = 2(2 n w n +y n )(2 n (w n +x n )+w n +y n +z n ) = 2(2 n w n +y n )r n. (2) 30/43
31 A simplification Now x n+1 = (2 n +1)x n w n +2 n xn 2 +z n (w n +x n ) = x n (2 n (w n +x n )+w n +y n +z n )+w n z n x n y n = x n r n +1 and z n+1 = (2 n +1)x n y n +2 n x n z n +z n (y n +z n ) = z n (2 n (w n +x n )+w n +y n +z n )+(2 n +1)(x n y n w n z n ) = z n r n 2 n 1. 31/43
32 More simplification Tedious simplification now gives 2 n xn+1 2 +x n+1z n+1 +1 = (2 n +1)w n x n z n +2 n (2 n +1)w n xn 2 +z n r n +(2 n 1)x n +2 n xny 2 n +2 n+1 xnz 2 n +x n y n z n +2 2n xn 3 +x n zn. 2 Reindexing, we get c n+2 = w n+1 (2 n+1 w n+1 +2y n+1 ) = 2w n+1 (2 n w n +y n )r n, 32/43
33 Refining the approximation Also, from the argument above about gcd s, we see that 2r n g n+2. Hence for n 2 we have for integers g n+2 c n+2 = P n+2 Q n+2 P n+2 := g n+2 2r n Q n+2 := w n+1 (2 n w n +y n ). It remains to see that P n+2 /Q n+2 are particularly good rational approximations to σ 2. 33/43
34 Since w n /x n and y n /z n denote successive convergents to a continued fraction, we have w n x n, w n y n, and w n z n. It follows that Q n+2 = w n+1 (2 n w n +y n ) = ((2 n +1)w 2 n +2 n w n x n +y n (w n +x n ))(2 n w n +y n ) (2 n+1 +3)w 2 n (2 n +1)w n = (2 n+1 +3)(2 n +1)w 3 n. 34/43
35 The approximation is better than we hoped On the other hand, c n+2 = 2Q n+2 r n > 2(2 n +1)wn 2 2 n w n (2 n +1)w n = 2 n+1 (2 n +1) 2 wn 4 Q 4/3 2 n+1 (2 n +1) 2 n+2 ((2 n+1 +3)(2 n +1)) 4/3 > Q 4/3 n+2. 35/43
36 Finally, the result about σ 2 Putting this all together, we get Theorem σ2 P n+2 < Q 8/3 n+2 for all integers n 2. Q n+2 36/43
37 Irrationality measure The result we have just shown can be nicely formulated in terms of the irrationality measure. Theorem The irrationality measure of σ 2 is at least 8/3. It would be interesting to find the precise value of the irrationality measure of σ 2. Numerical experiments suggest that the bound 8/3 is sharp; however, we do not currently know how to prove that. 37/43
38 Remarks Note that the classical Khintchine theorem states that for almost all real numbers (in terms of Lebesgue measure), the irrationality measure equals two. Hence our theorem says that the number σ 2 belongs to a very tiny set of zero Lebesgue measure. From Roth s theorem we conclude that σ 2 (and hence σ) are transcendental numbers. However... By a 2007 result of Adamczewski and Bugeaud, we already know that if a continued fraction of a real number x starts with arbitrarily long palindromes, then x is transcendental. Clearly σ satisfies this property. 38/43
39 Some partial quotients are double exponential in size We now provide a lower bound for some very large partial quotients of σ 2. For each n 2 we have σ2 P n+2 < Q 8/3 n+2 < 1 Q n+2 2Q 2 n+2. In particular this implies that the rational number P n+2 /Q n+2 is a convergent of σ 2. 39/43
40 Observations Notice that P n+2 and Q n+2 are not necessarily relatively prime. Let P n+2 / Q n+2 denote the reduced fraction of P n+2 /Q n+2. If P n+2 / Q n+2 is the m th convergent of σ 2, then define A n+2 to be the (m+1) th partial quotient of σ 2. 40/43
41 An inequality Then the estimate above implies 1 < (A n+2 +2) Q n+2 2 σ2 P n+2 Q n+2 < 3 c 2 n+2 where we used the fact (established earlier) that c n+2 = 2r n Q n+2 2r n Q n+2. Hence A n r2 n rn 2 Q, n /43
42 The last result From the formula for r n and the inequalities w n x n,w n y n,w n z n one can easily derive (2 n +1)w n r n (2 n+1 +3)w n. This, together with the formula for w n+1, gives the estimate r n+1 (2 n+1 +1)w n+1 (2 n+1 +1)(2 n +1)w 2 n > r 2 n +1. Therefore we get Theorem The sequence 4 3 r2 n 2, and in turn the sequence A n+2, both grow doubly exponentially. This explains the observation of Hanna and Wilson. 42/43
43 Open problems 1. Say something interesting about the continued fraction expansion of e What are the diophantine properties of the powers of the number [0,1,1,2,1,2,2,3,...] where the n th partial quotient is s 2 (n)? 43/43
Continued Fractions New and Old Results
Continued Fractions New and Old Results Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@cs.uwaterloo.ca https://www.cs.uwaterloo.ca/~shallit Joint
More informationAn Unusual Continued Fraction
An Unusual Continued Fraction arxiv:505.00667v [math.nt] 4 May 205 Dzmitry Badziahin Department of Mathematical Sciences Durham University Lower Mountjoy Stockton Rd Durham, DH 3LE United Kingdom dzmitry.badziahin@durham.ac.uk
More informationAutomatic Sequences and Transcendence of Real Numbers
Automatic Sequences and Transcendence of Real Numbers Wu Guohua School of Physical and Mathematical Sciences Nanyang Technological University Sendai Logic School, Tohoku University 28 Jan, 2016 Numbers
More informationCombinatorics, Automata and Number Theory
Combinatorics, Automata and Number Theory CANT Edited by Valérie Berthé LIRMM - Université Montpelier II - CNRS UMR 5506 161 rue Ada, F-34392 Montpellier Cedex 5, France Michel Rigo Université de Liège,
More informationConference on Diophantine Analysis and Related Fields 2006 in honor of Professor Iekata Shiokawa Keio University Yokohama March 8, 2006
Diophantine analysis and words Institut de Mathématiques de Jussieu + CIMPA http://www.math.jussieu.fr/ miw/ March 8, 2006 Conference on Diophantine Analysis and Related Fields 2006 in honor of Professor
More informationarxiv: v1 [math.nt] 4 May 2012
ON THE EXPANSION OF SOME EXPONENTIAL PERIODS IN AN INTEGER BASE arxiv:1205.0961v1 [math.nt] 4 May 2012 by Boris Adamczewski Abstract. We derive a lower bound for the subword complexity of the base-b expansion
More informationA Short Proof of the Transcendence of Thue-Morse Continued Fractions
A Short Proof of the Transcendence of Thue-Morse Continued Fractions Boris ADAMCZEWSKI and Yann BUGEAUD The Thue-Morse sequence t = (t n ) n 0 on the alphabet {a, b} is defined as follows: t n = a (respectively,
More informationRegular Sequences. Eric Rowland. School of Computer Science University of Waterloo, Ontario, Canada. September 5 & 8, 2011
Regular Sequences Eric Rowland School of Computer Science University of Waterloo, Ontario, Canada September 5 & 8, 2011 Eric Rowland (University of Waterloo) Regular Sequences September 5 & 8, 2011 1 /
More informationON THE DECIMAL EXPANSION OF ALGEBRAIC NUMBERS
Fizikos ir matematikos fakulteto Seminaro darbai, Šiaulių universitetas, 8, 2005, 5 13 ON THE DECIMAL EXPANSION OF ALGEBRAIC NUMBERS Boris ADAMCZEWSKI 1, Yann BUGEAUD 2 1 CNRS, Institut Camille Jordan,
More informationMathematische Annalen
Math. Ann. (2010) 346:107 116 DOI 10.1007/s00208-009-0391-z Mathematische Annalen On the expansion of some exponential periods in an integer base Boris Adamczewski Received: 25 September 2008 / Revised:
More informationON PATTERNS OCCURRING IN BINARY ALGEBRAIC NUMBERS
ON PATTERNS OCCURRING IN BINARY ALGEBRAIC NUMBERS B. ADAMCZEWSKI AND N. RAMPERSAD Abstract. We prove that every algebraic number contains infinitely many occurrences of 7/3-powers in its binary expansion.
More informationOn the rational approximation to the Thue Morse Mahler number. Yann BUGEAUD
On the rational approximation to the Thue Morse Mahler number Yann BUGEAUD Abstract. Let (t k ) k 0 be the Thue Morse sequence on {0,1} defined by t 0 = 0, t k = t k and t k+1 = 1 t k for k 0. Let b be
More information#A5 INTEGERS 18A (2018) EXPLICIT EXAMPLES OF p-adic NUMBERS WITH PRESCRIBED IRRATIONALITY EXPONENT
#A5 INTEGERS 8A (208) EXPLICIT EXAMPLES OF p-adic NUMBERS WITH PRESCRIBED IRRATIONALITY EXPONENT Yann Bugeaud IRMA, UMR 750, Université de Strasbourg et CNRS, Strasbourg, France bugeaud@math.unistra.fr
More informationReversals and palindromes in continued fractions
Theoretical Computer Science 380 (007) 0 37 www.elsevier.com/locate/tcs Reversals and palindromes in continued fractions Boris Adamczewski a, Jean-Paul Allouche b, a CNRS, Université Claude Bernard Lyon,
More informationGENERALIZED PALINDROMIC CONTINUED FRACTIONS
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 48, Number 1, 2018 GENERALIZED PALINDROMIC CONTINUED FRACTIONS DAVID M. FREEMAN ABSTRACT. In this paper, we introduce a generalization of palindromic continued
More informationarxiv: v5 [math.nt] 23 May 2017
TWO ANALOGS OF THUE-MORSE SEQUENCE arxiv:1603.04434v5 [math.nt] 23 May 2017 VLADIMIR SHEVELEV Abstract. We introduce and study two analogs of one of the best known sequence in Mathematics : Thue-Morse
More informationIrrationality exponent and rational approximations with prescribed growth
Irrationality exponent and rational approximations with prescribed growth Stéphane Fischler and Tanguy Rivoal June 0, 2009 Introduction In 978, Apéry [2] proved the irrationality of ζ(3) by constructing
More informationReport on some recent advances in Diophantine approximation
Report on some recent advances in Diophantine approximation Michel Waldschmidt Université Pierre et Marie Curie Paris 6, UMR 7586 IMJ Institut de Mathématiques de Jussieu, 4, Place Jussieu, Paris, F 75005
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationIrrationality proofs, moduli spaces, and dinner parties
Irrationality proofs, moduli spaces, and dinner parties Francis Brown, IHÉS-CNRS las, Members Colloquium 17th October 2014 1 / 32 Part I History 2 / 32 Zeta values and Euler s theorem Recall the Riemann
More informationApproximation of complex algebraic numbers by algebraic numbers of bounded degree
Approximation of complex algebraic numbers by algebraic numbers of bounded degree YANN BUGEAUD (Strasbourg) & JAN-HENDRIK EVERTSE (Leiden) Abstract. To measure how well a given complex number ξ can be
More informationPalindromic continued fractions
Palindromic continued fractions Boris Adamczewski, Yann Bugeaud To cite this version: Boris Adamczewski, Yann Bugeaud. Palindromic continued fractions. 2005. HAL Id: hal-00014969 https://hal.archives-ouvertes.fr/hal-00014969
More informationOn Normal Numbers. Theodore A. Slaman. University of California Berkeley
1/24 On Normal Numbers Theodore A. Slaman University of California Berkeley Joint work with Verónica Becher, and in part with Pablo Heiber, Yann Bugeaud and Jan Reimann CApril 29, 2015 2/24 Émile Borel
More informationPalindromic continued fractions. 1. Introduction
Palindromic continued fractions Boris ADAMCZEWSKI (Lyon) & Yann BUGEAUD * (Strasbourg) 1. Introduction An old problem adressed by Khintchin [15] deals with the behaviour of the continued fraction expansion
More informationApproximation exponents for algebraic functions in positive characteristic
ACTA ARITHMETICA LX.4 (1992) Approximation exponents for algebraic functions in positive characteristic by Bernard de Mathan (Talence) In this paper, we study rational approximations for algebraic functions
More information#A7 INTEGERS 11B (2011) SUBWORD COMPLEXITY AND LAURENT SERIES
#A7 INTEGERS 11B (2011) SUBWORD COMPLEXITY AND LAURENT SERIES Alina Firicel Institut Camille Jordan, Université Lyon 1, Villeurbanne, France firicel@math.univ-lyon1.fr Received: 10/18/10, Revised: 4/4/11,
More informationPrime Numbers and Irrational Numbers
Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.
More informationCOMPLEX NUMBERS WITH BOUNDED PARTIAL QUOTIENTS
COMPLEX NUMBERS WITH BOUNDED PARTIAL QUOTIENTS WIEB BOSMA AND DAVID GRUENEWALD Abstract. Conjecturally, the only real algebraic numbers with bounded partial quotients in their regular continued fraction
More informationComplex Continued Fraction Algorithms
Complex Continued Fraction Algorithms A thesis presented in partial fulfilment of the requirements for the degree of Master of Mathematics Author: Bastiaan Cijsouw (s3022706) Supervisor: Dr W Bosma Second
More informationSYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS
SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS J MC LAUGHLIN Abstract Let fx Z[x] Set f 0x = x and for n 1 define f nx = ff n 1x We describe several infinite
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 information1 Continued Fractions
Continued Fractions To start off the course, we consider a generalization of the Euclidean Algorithm which has ancient historical roots and yet still has relevance and applications today.. Continued Fraction
More informationarxiv: v2 [math.nt] 25 Jan 2017
GENERALIZED PALINDROMIC CONTINUED FRACTIONS DAVID M FREEMAN arxiv:160406755v2 [mathnt] 25 Jan 2017 ABSTRACT In this paper we introduce a generalization of palindromic continued fractions as studied by
More informationDIOPHANTINE APPROXIMATION AND CONTINUED FRACTIONS IN POWER SERIES FIELDS
DIOPHANTINE APPROXIMATION AND CONTINUED FRACTIONS IN POWER SERIES FIELDS A. LASJAUNIAS Avec admiration pour Klaus Roth 1. Introduction and Notation 1.1. The Fields of Power Series F(q) or F(K). Let p be
More informationCONTINUED FRACTIONS. 1. Finite continued fractions A finite continued fraction is defined by [a 0,..., a n ] = a 0 +
CONTINUED FRACTIONS Abstract Continued fractions are used in various areas of number theory and its applications They are seen in the extended Euclidean algorithm; in approximations (of numbers and functions);
More informationRECENT RESULTS ON LINEAR RECURRENCE SEQUENCES
RECENT RESULTS ON LINEAR RECURRENCE SEQUENCES Jan-Hendrik Evertse (Leiden) General Mathematics Colloquium, Delft May 19, 2005 1 INTRODUCTION A linear recurrence sequence U = {u n } n=0 (in C) is a sequence
More informationPell s equation. Michel Waldschmidt
Faculté des Sciences et Techniques (FAST), Bamako, Mali École de recherche CIMPA Théorie des Nombres et Algorithmique Updated: December 7, 200 Pell s equation Michel Waldschmidt This text is available
More informationarxiv: v2 [math.co] 24 Oct 2012
On minimal factorizations of words as products of palindromes A. Frid, S. Puzynina, L. Zamboni June 23, 2018 Abstract arxiv:1210.6179v2 [math.co] 24 Oct 2012 Given a finite word u, we define its palindromic
More informationOn the classification of irrational numbers
arxiv:506.0044v [math.nt] 5 Nov 07 On the classification of irrational numbers José de Jesús Hernández Serda May 05 Abstract In this note we make a comparison between the arithmetic properties of irrational
More informationarxiv: v3 [math.nt] 15 Mar 2017
Noname manuscript No. (will be inserted by the editor) On a two-valued sequence and related continued fractions in power series fields Bill Allombert, Nicolas Brisebarre and Alain Lasjaunias arxiv:1607.07235v3
More informationINITIAL POWERS OF STURMIAN SEQUENCES
INITIAL POWERS OF STURMIAN SEQUENCES VALÉRIE BERTHÉ, CHARLES HOLTON, AND LUCA Q. ZAMBONI Abstract. We investigate powers of prefixes in Sturmian sequences. We obtain an explicit formula for ice(ω), the
More informationSequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.
Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More information18-29 mai 2015: Oujda (Maroc) École de recherche CIMPA-Oujda Théorie des Nombres et ses Applications. Continued fractions. Michel Waldschmidt
18-29 mai 2015: Oujda (Maroc) École de recherche CIMPA-Oujda Théorie des Nombres et ses Applications. Continued fractions Michel Waldschmidt We first consider generalized continued fractions of the form
More informationHankel Matrices for the Period-Doubling Sequence
Hankel Matrices for the Period-Doubling Sequence arxiv:1511.06569v1 [math.co 20 Nov 2015 Robbert J. Fokkink and Cor Kraaikamp Applied Mathematics TU Delft Mekelweg 4 2628 CD Delft Netherlands r.j.fokkink@ewi.tudelft.nl
More informationSubwords, Regular Languages, and Prime Numbers
Subwords, Regular Languages, and Prime Numbers Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@cs.uwaterloo.ca https://www.cs.uwaterloo.ca/~shallit
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 informationMorphisms and Morphic Words
Morphisms and Morphic Words Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@graceland.uwaterloo.ca http://www.cs.uwaterloo.ca/~shallit 1 / 58
More informationA sequence is k-automatic if its n th term is generated by a finite state machine with n in base k as the input.
A sequence is k-automatic if its n th term is generated by a finite state machine with n in base k as the input. 1 Examples of automatic sequences The Thue-Morse sequence 011010011001011010010 This sequence
More informationMathematics 228(Q1), Assignment 2 Solutions
Mathematics 228(Q1), Assignment 2 Solutions Exercise 1.(10 marks) A natural number n > 1 is said to be square free if d N with d 2 n implies d = 1. Show that n is square free if and only if n = p 1 p k
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 informationMATH10040: Numbers and Functions Homework 1: Solutions
MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3
More informationOpen Problems in Automata Theory: An Idiosyncratic View
Open Problems in Automata Theory: An Idiosyncratic View Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@cs.uwaterloo.ca http://www.cs.uwaterloo.ca/~shallit
More informationInfinite Continued Fractions
Infinite Continued Fractions 8-5-200 The value of an infinite continued fraction [a 0 ; a, a 2, ] is lim c k, where c k is the k-th convergent k If [a 0 ; a, a 2, ] is an infinite continued fraction with
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More information8 The Gelfond-Schneider Theorem and Some Related Results
8 The Gelfond-Schneider Theorem and Some Related Results In this section, we begin by stating some results without proofs. In 1900, David Hilbert posed a general problem which included determining whether
More informationCombinatorics on Words:
Combinatorics on Words: Applications to Number Theory and Ramsey Theory Narad Rampersad Department of Mathematics and Statistics University of Winnipeg 9 May 2008 Narad Rampersad (University of Winnipeg)
More informationDIFFERENTIABILITY OF A PATHOLOGICAL FUNCTION, DIOPHANTINE APPROXIMATION, AND A REFORMULATION OF THE THUE-SIEGEL-ROTH THEOREM
DIFFERENTIABILITY OF A PATHOLOGICAL FUNCTION, DIOPHANTINE APPROXIMATION, AND A REFORMULATION OF THE THUE-SIEGEL-ROTH THEOREM JUAN LUIS VARONA Abstract. We study the differentiability of the real function
More informationQUARTIC POWER SERIES IN F 3 ((T 1 )) WITH BOUNDED PARTIAL QUOTIENTS. Alain Lasjaunias
QUARTIC POWER SERIES IN F 3 ((T 1 )) WITH BOUNDED PARTIAL QUOTIENTS Alain Lasjaunias 1991 Mathematics Subject Classification: 11J61, 11J70. 1. Introduction. We are concerned with diophantine approximation
More informationBadly approximable numbers over imaginary quadratic fields
Badly approximable numbers over imaginary quadratic fields Robert Hines University of Colorado, Boulder March 11, 2018 Simple continued fractions: Definitions 1 The Euclidean algorthim a = ba 0 + r 0,
More informationChakravala - a modern Indian method. B.Sury
Chakravala - a modern Indian method BSury Indian Statistical Institute Bangalore, India sury@isibangacin IISER Pune, India Lecture on October 18, 2010 1 Weil Unveiled What would have been Fermat s astonishment
More informationFifty Years of Fine and Wilf
Fifty Years of Fine and Wilf Jeffrey Shallit School of Computer Science, University of Waterloo Waterloo, Ontario N2L 3G1, Canada shallit@cs.uwaterloo.ca https://www.cs.uwaterloo.ca/~shallit 1 / 51 Words
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #5 09/19/2013
18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #5 09/19/2013 5.1 The field of p-adic numbers Definition 5.1. The field of p-adic numbers Q p is the fraction field of Z p. As a fraction field,
More informationSeries of Error Terms for Rational Approximations of Irrational Numbers
2 3 47 6 23 Journal of Integer Sequences, Vol. 4 20, Article..4 Series of Error Terms for Rational Approximations of Irrational Numbers Carsten Elsner Fachhochschule für die Wirtschaft Hannover Freundallee
More informationNumération : mathématiques et informatique
Numération : mathématiques et informatique Rencontre organisée par : Boris Adamczewski, Anne Siegel and Wolfgang Steiner 23-27 mars 2009 Tanguy Rivoal On the binary expansion of irrational algebraic numbers
More informationNOTES ON IRRATIONALITY AND TRANSCENDENCE
NOTES ON IRRATIONALITY AND TRANSCENDENCE Frits Beukers September, 27 Introduction. Irrationality Definition.. Let α C. We call α irrational when α Q. Proving irrationality and transcendence of numbers
More informationFURTHER NUMBER THEORY
FURTHER NUMBER THEORY SANJU VELANI. Dirichlet s Theorem and Continued Fractions Recall a fundamental theorem in the theory of Diophantine approximation. Theorem. (Dirichlet 842). For any real number x
More informationLecture Historical introduction to irrationality
The University of Arizona The Southwest Center for Arithmetic Geometry 2008 Arizona Winter School, March 5-9, 2008 Special Functions and Transcendence http://swc.math.arizona.edu/aws/08/index.html Updated:
More informationMix-Automatic Sequences
Mix-Automatic Sequences Jörg Endrullis 1, Clemens Grabmayer 2, and Dimitri Hendriks 1 1 VU University Amsterdam 2 Utrecht University Abstract. Mix-automatic sequences form a proper extension of the class
More informationThe Ubiquitous Thue-Morse Sequence
The Ubiquitous Thue-Morse Sequence Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@graceland.uwaterloo.ca http://www.cs.uwaterloo.ca/~shallit
More informationON THE MAILLET BAKER CONTINUED FRACTIONS
ON THE MAILLET BAKER CONTINUED FRACTIONS BORIS ADAMCZEWSKI, YANN BUGEAUD Abstract. We use the Schmidt Subspace Theorem to establish the transcendence of a class of quasi-periodic continued fractions. This
More informationFifty Years of Fine and Wilf
Fifty Years of Fine and Wilf Jeffrey Shallit School of Computer Science, University of Waterloo Waterloo, Ontario N2L 3G1, Canada shallit@cs.uwaterloo.ca https://www.cs.uwaterloo.ca/~shallit 1 / 56 Words
More informationNORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY
ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion
More informationMinimum Critical Exponents for Palindromes
Minimum Critical Exponents for Palindromes arxiv:1612.05320v2 [cs.fl] 20 Dec 2016 Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, ON N2L 3G1 Canada shallit@cs.uwaterloo.ca December
More informationWaiting times, recurrence times, ergodicity and quasiperiodic dynamics
Waiting times, recurrence times, ergodicity and quasiperiodic dynamics Dong Han Kim Department of Mathematics, The University of Suwon, Korea Scuola Normale Superiore, 22 Jan. 2009 Outline Dynamical Systems
More informationContinued fractions for complex numbers and values of binary quadratic forms
arxiv:110.3754v1 [math.nt] 18 Feb 011 Continued fractions for complex numbers and values of binary quadratic forms S.G. Dani and Arnaldo Nogueira February 1, 011 Abstract We describe various properties
More informationContinued fractions and transcendental numbers
Continued fractions and transcendental numbers Boris Adamczewski, Yann Bugeaud, Les Davison To cite this version: Boris Adamczewski, Yann Bugeaud, Les Davison. Continued fractions and transcendental numbers.
More informationCongruences for combinatorial sequences
Congruences for combinatorial sequences Eric Rowland Reem Yassawi 2014 February 12 Eric Rowland Congruences for combinatorial sequences 2014 February 12 1 / 36 Outline 1 Algebraic sequences 2 Automatic
More 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 informationNOTES ON DIOPHANTINE APPROXIMATION
NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse December 11, 2007 8 Approximation of algebraic numbers Literature: W.M. Schmidt, Diophantine approximation, Lecture Notes in Mathematics 785, Springer
More informationBinomial coefficients and k-regular sequences
Binomial coefficients and k-regular sequences Eric Rowland Hofstra University New York Combinatorics Seminar CUNY Graduate Center, 2017 12 22 Eric Rowland Binomial coefficients and k-regular sequences
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationbe a sequence of positive integers with a n+1 a n lim inf n > 2. [α a n] α a n
Rend. Lincei Mat. Appl. 8 (2007), 295 303 Number theory. A transcendence criterion for infinite products, by PIETRO CORVAJA and JAROSLAV HANČL, communicated on May 2007. ABSTRACT. We prove a transcendence
More informationChapter 5: The Integers
c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition
More informationChapter One Hilbert s 7th Problem: It s statement and origins
Chapter One Hilbert s 7th Problem: It s statement and origins At the second International Congress of athematicians in Paris, 900, the mathematician David Hilbert was invited to deliver a keynote address,
More informationLECTURE 15, WEDNESDAY
LECTURE 15, WEDNESDAY 31.03.04 FRANZ LEMMERMEYER 1. The Filtration of E (1) Let us now see why the kernel of reduction E (1) is torsion free. Recall that E (1) is defined by the exact sequence 0 E (1)
More informationSums of Digits, Overlaps, and Palindromes
Sums of Digits, Overlaps, and Palindromes Jean-Paul Allouche, Jeffrey Shallit To cite this version: Jean-Paul Allouche, Jeffrey Shallit Sums of Digits, Overlaps, and Palindromes Discrete Mathematics and
More informationProofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 1, 018 Outline Non POMI Based s Some Contradiction s Triangle
More informationPade Approximations and the Transcendence
Pade Approximations and the Transcendence of π Ernie Croot March 9, 27 1 Introduction Lindemann proved the following theorem, which implies that π is transcendental: Theorem 1 Suppose that α 1,..., α k
More informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More informationSome properties of a Rudin Shapiro-like sequence
Some properties of a Rudin Shapiro-like sequence Narad Rampersad (Joint work with Philip Lafrance and Randy Yee) Department of Mathematics and Statistics University of Winnipeg Digital sequences there
More informationThe Separating Words Problem
The Separating Words Problem Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@cs.uwaterloo.ca https://www.cs.uwaterloo.ca/~shallit 1/54 The Simplest
More informationSome Results Concerning Uniqueness of Triangle Sequences
Some Results Concerning Uniqueness of Triangle Sequences T. Cheslack-Postava A. Diesl M. Lepinski A. Schuyler August 12 1999 Abstract In this paper we will begin by reviewing the triangle iteration. We
More informationREAL NUMBERS. Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b.
REAL NUMBERS Introduction Euclid s Division Algorithm Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b. Fundamental
More informationCONGRUENCES FOR BERNOULLI - LUCAS SUMS
CONGRUENCES FOR BERNOULLI - LUCAS SUMS PAUL THOMAS YOUNG Abstract. We give strong congruences for sums of the form N BnVn+1 where Bn denotes the Bernoulli number and V n denotes a Lucas sequence of the
More informationCongruences for algebraic sequences
Congruences for algebraic sequences Eric Rowland 1 Reem Yassawi 2 1 Université du Québec à Montréal 2 Trent University 2013 September 27 Eric Rowland (UQAM) Congruences for algebraic sequences 2013 September
More informationIntroduction to Diophantine methods: irrationality and transcendence
UNIVERSITY OF NATURAL SCIENCES HO CHI MINH City http://www.hcmuns.edu.vn/ September 2 October 4, 2007 Introduction to Diophantine methods: irrationality and transcendence Michel Waldschmidt, Professeur,
More informationOn Robbins example of a continued fraction expansion for a quartic power series over F 13
Journal of Number Theory 28 (2008) 09 5 www.elsevier.com/locate/jnt On Robbins example of a continued fraction expansion for a quartic power series over F 3 Alain Lasjaunias C.N.R.S.-UMR 5465, Université
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 informationProofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 12, 2018 Outline 1 Non POMI Based s 2 Some Contradiction s 3
More information