Solving Pell s equation using the nearest square continued fraction
|
|
- Jesse Snow
- 5 years ago
- Views:
Transcription
1 Solving Pell s equation using the nearest square continued fraction Keith Matthews 12th June 2008
2 Abstract This talk is about the nearest square continued fraction of A.A.K. Ayyangar (1941) and its use in finding the smallest positive solution of Pell s equation x 2 Dy 2 = ±1. Contrary to the 1944 review by D.H. Lehmer, its slight blemishes are indeed compensated by the its period length being about 70% of that of the regular continued fraction of D and also having a 3-case mid-point criterion for solving Pell s equation.
3 Hugh Williams and Peter Buhr (1979) gave a 6-case midpoint criterion in terms of Hurwitz continued fraction of the first kind. Their paper was rather complicated. It was after studying their paper that Jim White and John Robertson came up with a 3-case midpoint criterion using the nearest square continued fraction.
4 Euler (1765) gave a two-case midpoint criterion for solving Pell s equation x 2 Dy 2 = ±1 using the regular continued fraction (RCF) expansion of D. 1 D = a0 + 1 a 1 + a 2 + where a 0 = D and a i 1 for all i. We write D = [a0, a 1, a 2,...].
5 The n-th convergent is defined by A n /B n = a 0 + a a n a n A n and B n can be computed recursively: A 0 = a 0, B 0 = 1, A 1 = a 0 a 1 + 1, B 1 = a 1, for i 1. A i+1 = a i+1 A i + A i 1 B i+1 = a i+1 B i + B i 1,
6 The RCF for D is periodic with period-length k: D = { [a0, a 1,..., a h 1, a h 1,..., a 1, 2a 0 ] if k = 2h 1, [a 0, a 1,..., a h 1, a h, a h 1,..., a 1, 2a 0 ] if k = 2h. The smallest positive integer solution of x 2 Dy 2 = ±1 is given by (x, y) = (A k 1, B k 1 ), where A n /B n is the n-th convergent to D.
7 Euler observed that if k = 2h 1, while if k = 2h, A k 1 = A h 1 B h 1 + A h 2 B h 2 B k 1 = B 2 h 1 + B2 h 2, A k 1 = B h 1 (A h + A h 2 ) + ( 1) h B k 1 = B h 1 (B h + B h 2 ).
8 Also if ξ n = (P n + D)/Q n = [a n, a n+1,...] is the n-th complete quotient of the RCF expansion of D, then the equations Q h = Q h 1 if k = 2h 1, P h = P h+1 if k = 2h, enable us to determine h, as Q v = Q v+1 (k odd) and P v = P v+1, (k even), 1 v < k imply k = h.
9 The nearest square continued fraction (NSCF) of a quadratic surd ξ 0 was introduced by A.A.K. Ayyangar (AAK) in 1940 and based on the cyclic method of solving Pell s equation due to Bhaskara in The NSCF is a half-regular continued fraction. ie. ξ 0 = a 0 + where the a i are integers and a 1 + ɛ 1 ɛ 2 a 2 + a i 1, ɛ i = ±1 and a i + ɛ i+1 1 if i 1. We write the continued fraction as ξ 0 = a 0 + ɛ 1 a 1 + ɛ 2 a 2 +
10 Let ξ 0 = P+ D Q be a quadratic surd in standard form. ie. D is a non-square positive integer and P, Q 0, D P2 Q integers, having no common factor other than 1. Then with a = ξ 0, the integer part of ξ 0, we can represent ξ 0 in one of two forms (positive or negative representations) where P + D Q P + D Q = a + > 1 and P + D Q Q P + D = a + 1 Q P + D, > 1 are also standard surds. are
11 These equations imply (1) P = aq P; (2) P = (a + 1)Q P, (3) P 2 = R QQ ; (4) P 2 = R + QQ. These in turn imply (5) P P = Q and (6) P + P = Q + Q. We get P and Q from (1) and (3), then P and Q from (5) and (6), respectively.
12 AAK chose the partial denominator a 0 and numerator ɛ 1 of the new continued fraction development as follows: (a) a 0 = a if Q < Q, or Q = Q and Q < 0, (b) a 0 = a + 1 if Q > Q, or Q = Q and Q > 0. Also ɛ 1 = 1 and ξ 1 = P + D Q in case (a), ɛ 1 = 1 and ξ 1 = P + D Q in case (b).
13 Then ξ 0 = a 0 + ɛ 1 ξ 1 and ɛ 1 = ±1, a 0 is an integer and ξ 1 = P 1+ D Q 1 > 1. We proceed similarly with ξ 1 and so on: and ξ n = a n + ɛ n+1 ξ n+1 ξ 0 = a 0 + ɛ 1 a 1 + ɛ 2 a 2 + ξ n+1 is called the successor of ξ n.
14 Relations analogous to those for regular continued fractions hold for P n, Q n and a n, n 0: P n+1 + P n = a n Q n P 2 n+1 + ɛ n+1 Q n Q n+1 = D. The Q n successively diminish as long as Q n > D and so eventually, we have Q n < D. When this stage is reached, 0 < P i < 2 D and 0 < Q i < D for i n + 1. This implies eventual periodicity of the complete quotients and hence the partial quotients.
15 AAK defines ξ v to be a special surd if Q 2 v Q2 v D, Q 2 v Q2 v 1 D. A semi-reduced surd is the successor of a special surd. A reduced surd to the successor of a semi-reduced surd. Properties: 1. A semi-reduced surd is a special surd. 2. A quadratic surd has a purely periodic NSCF expansion if and only if it is reduced. 3. If ξ v is reduced, then P v > 0, Q v > 0 and a v 2. Examples: (i) p+q+ p 2 +q 2 p, p > 2q > 0, gcd(p, q) = 1, (ii) the successor of D.
16 The NSCF development of D has the form D = a0 + ɛ 1 a 1 + ɛ k, (1) 2a 0 where the asterisks denote a period of length k and ξ p = ξ p+k, ɛ p = ɛ p+k, a p = a p+k for p 1. Note: a 0 is the nearest integer to D. There are two types of NSCF expansions of D:
17 (I) No complete quotient of the cycle has the form p+q+ p 2 +q 2 p, where p > 2q > 0, gcd(p, q) = 1. This type possesses the classical symmetries of the regular continued fraction if k > 1: a v = a k v (1 v k 1) Q v = Q k v (1 v k 1) ɛ v = ɛ k+1 v (1 v k) P v = P k+1 v (1 v k). Note: If k = 2h + 1, then Q h = Q h+1. Conversely Q v = Q v+1, 1 v < k implies v = h. If k = 2h, then P h = P h+1. Conversely P v = P v+1, 1 v < k implies v = h.
18 Examples. 73 = (odd period) 19 = (even period) n = n + 1 2n (n 1), n 2 1 = n 1 2n (n > 1).
19 (II) There is one complete quotient ξ h in the cycle of the form p+q+ p 2 +q 2 p, where p > 2q > 0, gcd(p, q) = 1. In this case k 4 is even and h = k/2. This type also possesses the symmetries of Type I, apart from a central set of three unsymmetrical terms: a k 2 = 2, ɛ k 2 = 1, ɛ k 2 +1 = 1, a k 2 1 = a k D = a0 + ɛ 1 ɛ k a 1 a k a k ɛ k. 2a 0 For example 29 = Other examples are 53, 58, 85, 97.
20 E n is the number of D < 10 n of Type I with even period. O n is the number of D < 10 n of Type I with odd period. F n is the number of D < 10 n of Type II. N n is the number of D < 10 n. n E n O n F n N n
21 Note: P v P v+1, 1 v < k. ɛ h = 1, Q h 1 is even and P h = Q h Q h 1 (observed by John Robertson and Jim White). Conversely if ɛ v = 1, Q v 1 is even and P v = Q v Q v 1, 1 v < k, then D is of Type II and v = h.
22 For both types I and II, we have Q k = 1. For Hence P 1 = a 0. Then D = a0 + ɛ 1Q 1 P 1 + D = a 0 + ɛ 1Q 1 (P 1 D) P 2 1 D = a 0 P 1 + D. P 1 = P k (symmetry) P 1 = P k+1 (periodicity) 2a 0 = 2P 1 = P k + P k+1 = a k Q k = 2a 0 Q k. Note: ξ k = P k+ D Q k = a 0 + D.
23 A classical result for a half-regular expansion of ξ 0 = P 0+ D Q 0 A 2 n DB 2 n = ( 1) n+1 (ɛ 1 ɛ 2 ɛ n+1 )Q n+1 Q 0. In the special case ξ 0 = D, where Q 0 = 1 = Q k, we have A 2 k 1 DB2 k 1 = ( 1)k ɛ 1 ɛ 2 ɛ k. Also by periodicity, Q n = 1 if k divides n. is
24 Conversely, suppose Q n = 1, n 1. Then ξ n = P n + D. We prove P n = [ D] = a 0, the nearest integer to D. Then ξ n = a 0 + D = ξ k and k divides n.
25 We start with P 2 n + ɛ n Q n 1 Q n = D, noting that Q n 1 > 0, Q n > 0. Case 1. P n > D. Then ɛ n = 1. Hence P n = [ D]. Pn 2 D = Q n 1 < D (ξ n is reduced) 0 < P n D D D < P n + D < 2 D = 1 2.
26 Case 2. P n < D. Then ɛ n = 1. Q 2 n Q2 n D = P 2 n + Q n 1 (ξ n is reduced) (Q n )2 P 2 n Q n P n Q n 1 P n D Pn 2 = Q n 1 P n 0 < P n D P n < P n = 1 D + Pn 2P n 2. Again P n = [ D].
27 The convergents A kt 1 /B kt 1, t 1, in fact give all positive integer solutions of Pell s equation x 2 Dy 2 = ±1. For if x 2 Dy 2 = ±1, x > 0, y > 0, we can prove that x/y is an NSCF convergent to D, as follows. It is certainly an RCF convergent. We now introduce a transformation T 1 of Perron, which converts a half-regular continued fraction to an RCF:
28 To get the RCF partial quotients: Before a negative partial numerator, insert the term Replace each a n, n 0 by: (a) a n if ɛ n = +1, ɛ n+1 = +1, (b) a n 1 if ɛ n = +1, ɛ n+1 = -1, or ɛ n = -1, ɛ n+1 = +1, (c) a n 2 if ɛ n = -1, ɛ n+1 = -1. Here ɛ 0 = 1. Note: If ξ v and ξ v+1 are NSCF reduced quadratic surds and ɛ v = 1 and ɛ v+1 = 1, then a v 3. Hence T 1 produces a genuine RCF, ie. with no zero partial quotients.
29 For n 0, (i) ɛ n+1 = 1 gives rise to RCF convergents A m 1/B m 1 = (A n A n 1 )/(B n B n 1 ), A m/b m = A n /B n and RCF complete quotients P m + D Q m = ξ n+1 /(ξ n+1 1), P m+1 + D Q m+1 = ξ n+1 1. (ii) ɛ n+1 = 1 gives rise to RCF convergent A n /B n and RCF complete quotient ξ n+1.
30 It is not difficult to show that x/y does not have the form (A n A n 1 )/(B n B n 1 ) and hence x/y must also be an NSCF convergent. Remark. Arguing along these lines shows that the period length of the RCF expansion of D is k + r, where r is the number of ɛ n = 1 occurring in the period partial numerators ɛ 1,..., ɛ k of the NSCF expansion of D.
31 Example. D = 97. The NSCF expansion of 97 is of type II, with period-length 6. There are five ɛ i = 1 in the period range 1 i 6 and the period-length of the RCF expansion is 11. j i ξ i ξ j ɛ i a i a j A i /B i A j /B j /1 9/ / /7 59/ / /20 128/ / /33 325/ /86 522/ / / / / / / / / /
32 Exactly one of the following P, Q and PQ tests will apply for any D > 0, not a square: P-test: For some h, 1 h < k, P h = P h+1, in which case k = 2h and In this case A 2 k 1 DB2 k 1 = 1. A k 1 = A h B h 1 + ɛ h A h 1 B h 2 B k 1 = B h 1 (B h + ɛ h B h 2 ).
33 Q-test: For some h, 0 h < k, Q h = Q h+1, in which case k = 2h + 1 and A k 1 = A h B h + ɛ h+1 A h 1 B h 1 B k 1 = B 2 h + ɛ h+1b 2 h 1. In this case A 2 k 1 DB2 k 1 = ɛ h+1.
34 PQ-test: For some h, 1 h < k, Q h 1 is even, P h = Q h Q h 1 and ɛ h = 1, in which case k = 2h and A k 1 = A h B h 1 B h 2 (A h 1 A h 2 ) B k 1 = 2B 2 h 1 B hb h 2. In this case A 2 k 1 DB2 k 1 = 1.
35 The formulae for A k 1 and B k 1 depend on the following conservation identities which are proved using downward induction on t: (i) Let k = 2h + 1. Then for Type I and 0 t h, we have A 2h = A h+t B h t + ɛ h+1+t A h+t 1 B h t 1 B 2h = B h+t B h t + ɛ h+1+t B h+t 1 B h t 1 (ii) Let k = 2h. Then for Type I and 0 t h, or Type II with h 2 and 2 t h, we have A 2h 1 = A h+t 1 B h t + ɛ h+t A h+t 2 B h t 1 B 2h 1 = B h+t 1 B h t + ɛ h+t B h+t 2 B h t 1
36 Let π(d) and p(d) respectively denote the periods of the NSCF and RCF expansions of D, where D is not a perfect square and let Π(n) = π(d), P(n) = p(d). D n D n n Π(n) p(n) Π(n)/P(n)
37 There are grounds for believing that Π(n)/P(n) 1+ log ( 5 2 ) = log 2 For D with a long RCF period, we expect π(d)/p(d) to be near this value. For example, D = , Daniel Shanks (1974) and quoted by William Adams (1979). p(d) = , π(d) = , π(d)/p(d) = This D obeys the PQ-test.
38 AAK s paper and a L A TEX version are available at fractions.html BCMATH versions of NSCF and some other continued fraction algorithms are available at
Unisequences and nearest integer continued fraction midpoint criteria for Pell s equation
Unisequences and nearest integer continued fraction midpoint criteria for Pell s equation Keith R. Matthews Department of Mathematics University of Queensland Brisbane Australia 4072 and Centre for Mathematics
More informationOn a diophantine equation of Andrej Dujella
On a diophantine equation of Andrej Dujella Keith Matthews (joint work with John Robertson and Jim White published in Math. Glasnik, 48, number 2 (2013) 265-289.) The unicity conjecture (Dujella 2009)
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 informationSolving x 2 Dy 2 = N in integers, where D > 0 is not a perfect square. Keith Matthews
Solving x 2 Dy 2 = N in integers, where D > 0 is not a perfect square. Keith Matthews Abstract We describe a neglected algorithm, based on simple continued fractions, due to Lagrange, for deciding the
More informationSEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Copyright Cengage Learning. All rights reserved. SECTION 5.4 Strong Mathematical Induction and the Well-Ordering Principle for the Integers Copyright
More informationOn the continued fraction expansion of 2 2n+1
On the continued fraction expansion of n+1 Keith Matthews February 6, 007 Abstract We derive limited information about the period of the continued fraction expansion of n+1 : The period-length is a multiple
More informationON THE LENGTH OF THE PERIOD OF A REAL QUADRATIC IRRATIONAL. N. Saradha
Indian J Pure Appl Math, 48(3): 311-31, September 017 c Indian National Science Academy DOI: 101007/s136-017-09-4 ON THE LENGTH OF THE PERIOD OF A REAL QUADRATIC IRRATIONAL N Saradha School of Mathematics,
More informationUSING SHANKS BABY-STEP GIANT-STEP METHOD TO SOLVE THE GENERALIZED PELL EQUATION x 2 Dy 2 = N. Copyright 2009 by John P. Robertson. 1.
USING SHANKS BABY-STEP GIANT-STEP METHOD TO SOLVE THE GENERALIZED PELL EQUATION x 2 Dy 2 = N Abstract. For D > 0 not a square, and N 0, the continued fraction algorithm can be used to solve the generalized
More informationPODSYPANIN S PAPER ON THE LENGTH OF THE PERIOD OF A QUADRATIC IRRATIONAL. Copyright 2007
PODSYPANIN S PAPER ON THE LENGTH OF THE PERIOD OF A QUADRATIC IRRATIONAL JOHN ROBERTSON Copyright 007 1. Introduction The major result in Podsypanin s paper Length of the period of a quadratic irrational
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 informationPOLYNOMIAL SOLUTIONS OF PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS
J. London Math. Soc. 67 (2003) 16 28 C 2003 London Mathematical Society DOI: 10.1112/S002461070200371X POLYNOMIAL SOLUTIONS OF PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS J. MCLAUGHLIN
More informationON DIRICHLET S CONJECTURE ON RELATIVE CLASS NUMBER ONE
ON DIRICHLET S CONJECTURE ON RELATIVE CLASS NUMBER ONE AMANDA FURNESS Abstract. We examine relative class numbers, associated to class numbers of quadratic fields Q( m) for m > 0 and square-free. The relative
More informationThe Diophantine equation x n = Dy 2 + 1
ACTA ARITHMETICA 106.1 (2003) The Diophantine equation x n Dy 2 + 1 by J. H. E. Cohn (London) 1. Introduction. In [4] the complete set of positive integer solutions to the equation of the title is described
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 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 informationHilbert s theorem 90, Dirichlet s unit theorem and Diophantine equations
Hilbert s theorem 90, Dirichlet s unit theorem and Diophantine equations B. Sury Stat-Math Unit Indian Statistical Institute 8th Mile Mysore Road Bangalore - 560 059 India. sury@isibang.ac.in Introduction
More informationMath 2 Variable Manipulation Part 2 Powers & Roots PROPERTIES OF EXPONENTS:
Math 2 Variable Manipulation Part 2 Powers & Roots PROPERTIES OF EXPONENTS: 1 EXPONENT REVIEW PROBLEMS: 2 1. 2x + x x + x + 5 =? 2. (x 2 + x) (x + 2) =?. The expression 8x (7x 6 x 5 ) is equivalent to?.
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 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 informationCPSC 467b: Cryptography and Computer Security
Outline Quadratic residues Useful tests Digital Signatures CPSC 467b: Cryptography and Computer Security Lecture 14 Michael J. Fischer Department of Computer Science Yale University March 1, 2010 Michael
More informationContinued Fractions Expansion of D and Pell Equation x 2 Dy 2 = 1
Mathematica Moravica Vol. 5-2 (20), 9 27 Continued Fractions Expansion of D and Pell Equation x 2 Dy 2 = Ahmet Tekcan Abstract. Let D be a positive non-square integer. In the first section, we give some
More informationSingularities, Algebraic entropy and Integrability of discrete Systems
Singularities, Algebraic entropy and Integrability of discrete Systems K.M. Tamizhmani Pondicherry University, India. Indo-French Program for Mathematics The Institute of Mathematical Sciences, Chennai-2016
More informationPell s Equation Claire Larkin
Pell s Equation is a Diophantine equation in the form: Pell s Equation Claire Larkin The Equation x 2 dy 2 = where x and y are both integer solutions and n is a positive nonsquare integer. A diophantine
More informationNORM OR EXCEPTION? KANNAPPAN SAMPATH & B.SURY
NORM OR EXCEPTION? KANNAPPAN SAMPATH & B.SURY Introduction In a first course on algebraic number theory, a typical homework problem may possibly ask the student to determine the class group of a quadratic
More informationPELL S EQUATION, II KEITH CONRAD
PELL S EQUATION, II KEITH CONRAD 1. Introduction In Part I we met Pell s equation x dy = 1 for nonsquare positive integers d. We stated Lagrange s theorem that every Pell equation has a nontrivial solution
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 informationThe theory of continued fractions and the approximations of irrational numbers
교육학석사학위청구논문 연분수이론과무리수의근사 The theory of continued fractions and the approximations of irrational numbers 202 년 2 월 인하대학교교육대학원 수학교육전공 정미라 교육학석사학위청구논문 연분수이론과무리수의근사 The theory of continued fractions and the
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 informationQuadratic Diophantine Equations x 2 Dy 2 = c n
Irish Math. Soc. Bulletin 58 2006, 55 68 55 Quadratic Diophantine Equations x 2 Dy 2 c n RICHARD A. MOLLIN Abstract. We consider the Diophantine equation x 2 Dy 2 c n for non-square positive integers D
More informationLearning Objectives These show clearly the purpose and extent of coverage for each topic.
Preface This book is prepared for students embarking on the study of Additional Mathematics. Topical Approach Examinable topics for Upper Secondary Mathematics are discussed in detail so students can focus
More informationPOLYNOMIAL SOLUTIONS TO PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS arxiv: v1 [math.nt] 27 Dec 2018
POLYNOMIAL SOLUTIONS TO PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS arxiv:1812.10828v1 [math.nt] 27 Dec 2018 J. MC LAUGHLIN Abstract. Finding polynomial solutions to Pell s equation
More informationTHE UNIT GROUP OF A REAL QUADRATIC FIELD
THE UNIT GROUP OF A REAL QUADRATIC FIELD While the unit group of an imaginary quadratic field is very simple the unit group of a real quadratic field has nontrivial structure Its study involves some geometry
More informationOn Representations of integers by the quadratic form x2 Dy2
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 5-4-2012 On Representations of integers by the quadratic form x2 Dy2 Christopher Thomas Follow this and additional
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More informationContinued Fractions with Non-Integer Numerators
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 0 (017), Article 17.1. Continued Fractions with Non-Integer Numerators John Greene and Jesse Schmieg Department of Mathematics and Statistics University
More informationMULTI-VARIABLE POLYNOMIAL SOLUTIONS TO PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS
MULTI-VARIABLE POLYNOMIAL SOLUTIONS TO PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS J. MC LAUGHLIN Abstract. Solving Pell s equation is of relevance in finding fundamental units in real
More informationnot to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results
REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results Euclid s Division Lemma : Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 r < b. Euclid s Division
More informationNumber Theory and Graph Theory. Prime numbers and congruences.
1 Number Theory and Graph Theory Chapter 2 Prime numbers and congruences. By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 2 Module-1:Primes
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 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 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 information1 2 1 = = =
IAP 07 Daniel W Stroock Traditional method for computing square roots: The traditional method for computing square roots is based on the identity (a + b) a + (a + b)b For example to compute one begins
More informationSection 11.1 Sequences
Math 152 c Lynch 1 of 8 Section 11.1 Sequences A sequence is a list of numbers written in a definite order: a 1, a 2, a 3,..., a n,... Notation. The sequence {a 1, a 2, a 3,...} can also be written {a
More informationHomework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.
2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >
More informationNote that r = 0 gives the simple principle of induction. Also it can be shown that the principle of strong induction follows from simple induction.
Proof by mathematical induction using a strong hypothesis Occasionally a proof by mathematical induction is made easier by using a strong hypothesis: To show P(n) [a statement form that depends on variable
More informationExercise on Continued Fractions
Exercise on Continued Fractions Jason Eisner, Spring 1993 This was one of several optional small computational projects assigned to undergraduate mathematics students at Cambridge University in 1993. I
More informationME44 Review Test3. 1. Express in simplest radical form. 2. Express in simplest radical form.
ME44 Review Test3 1. Express in simplest radical form. 2. Express in simplest radical form. 3. What is 2 expressed in simplest radical 3 5 6 18 4. What is 3 expressed in simplest radical 5 8 15 75 5. Express
More informationSun Life Financial Canadian Open Mathematics Challenge Section A 4 marks each. Official Solutions
Sun Life Financial Canadian Open Mathematics Challenge 2015 Official Solutions COMC exams from other years, with or without the solutions included, are free to download online. Please visit http://comc.math.ca/2015/practice.html
More informationMath 3320 Problem Set 10 Solutions 1
Math 3320 Problem Set 10 Solutions 1 1. For the form Q(x,y)=x 2 +xy+y 2 do the following things: (a) Draw enough of the topograph to show all the values less than 100 that occur in the topograph. You do
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 informationCircles - Edexcel Past Exam Questions. (a) the coordinates of A, (b) the radius of C,
- Edecel Past Eam Questions 1. The circle C, with centre at the point A, has equation 2 + 2 10 + 9 = 0. Find (a) the coordinates of A, (b) the radius of C, (2) (2) (c) the coordinates of the points at
More informationIntroduction to Number Theory
Introduction to Number Theory Paul Yiu Department of Mathematics Florida Atlantic University Spring 017 March 7, 017 Contents 10 Pythagorean and Heron triangles 57 10.1 Construction of Pythagorean triangles....................
More informationMath 110 HW 3 solutions
Math 0 HW 3 solutions May 8, 203. For any positive real number r, prove that x r = O(e x ) as functions of x. Suppose r
More informationPre-Calculus Midterm Practice Test (Units 1 through 3)
Name: Date: Period: Pre-Calculus Midterm Practice Test (Units 1 through 3) Learning Target 1A I can describe a set of numbers in a variety of ways. 1. Write the following inequalities in interval notation.
More informationPELL S EQUATION NATIONAL INSTITUTE OF TECHNOLOGY ROURKELA, ODISHA
PELL S EQUATION A Project Report Submitted by PANKAJ KUMAR SHARMA In partial fulfillment of the requirements For award of the degree Of MASTER OF SCIENCE IN MATHEMATICS UNDER GUIDANCE OF Prof GKPANDA DEPARTMENT
More informationMathematical Induction Assignments
1 Mathematical Induction Assignments Prove the Following using Principle of Mathematical induction 1) Prove that for any positive integer number n, n 3 + 2 n is divisible by 3 2) Prove that 1 3 + 2 3 +
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 informationShort multipliers for the extended gcd problem
Short multipliers for the extended gcd problem Keith Matthews Abstract For given non zero integers s 1,, s m, the problem of finding integers a 1,, a m satisfying s = gcd (s 1,, s m ) = a 1 s 1 + + a m
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 informationNecessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1
Necessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1 R.A. Mollin Abstract We look at the simple continued
More informationChapter 5. Number Theory. 5.1 Base b representations
Chapter 5 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,
More informationk-automatic sets of rational numbers
k-automatic sets of rational numbers Eric Rowland 1 Jeffrey Shallit 2 1 LaCIM, Université du Québec à Montréal 2 University of Waterloo March 5, 2012 Eric Rowland (LaCIM) k-automatic sets of rational numbers
More informationMAS 6217 (Fall 2017) Number Theory and Cryptography (Yiu) Class Notes, October 10. Construction of Pythagorean triangles By a Pythagorean triangle we
MAS 617 (Fall 017) Number Theory and Cryptography (Yiu) Class Notes, October 10. Construction of Pythagorean triangles By a Pythagorean triangle we mean a right triangle whose side lengths are integers.
More informationA family of quartic Thue inequalities
A family of quartic Thue inequalities Andrej Dujella and Borka Jadrijević Abstract In this paper we prove that the only primitive solutions of the Thue inequality x 4 4cx 3 y + (6c + 2)x 2 y 2 + 4cxy 3
More informationReading Mathematical Expressions & Arithmetic Operations Expression Reads Note
Math 001 - Term 171 Reading Mathematical Expressions & Arithmetic Operations Expression Reads Note x A x belongs to A,x is in A Between an element and a set. A B A is a subset of B Between two sets. φ
More informationp = This is small enough that its primality is easily verified by trial division. A candidate prime above 1000 p of the form p U + 1 is
LARGE PRIME NUMBERS 1. Fermat Pseudoprimes Fermat s Little Theorem states that for any positive integer n, if n is prime then b n % n = b for b = 1,..., n 1. In the other direction, all we can say is that
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
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 informationFractional Parts of the Period of the Continued Fraction Expansion of Quadratic Integers. A. J. van der Poorten Macquarie University
Fractional Parts of the Period of the Continued Fraction Expansion of Quadratic Integers A J van der Poorten Macquarie University The elementary nature and simplicity of the theory of continued fractions
More informationCONSTRUCTION OF THE REAL NUMBERS.
CONSTRUCTION OF THE REAL NUMBERS. IAN KIMING 1. Motivation. It will not come as a big surprise to anyone when I say that we need the real numbers in mathematics. More to the point, we need to be able to
More informationCluster algebras, snake graphs and continued fractions. Ralf Schiffler
Cluster algebras, snake graphs and continued fractions Ralf Schiffler Intro Cluster algebras Continued fractions Snake graphs Intro Cluster algebras Continued fractions expansion formula via perfect matchings
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 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 informationR.A. Mollin Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, Canada, T2N 1N4
PERIOD LENGTHS OF CONTINUED FRACTIONS INVOLVING FIBONACCI NUMBERS R.A. Mollin Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, Canada, TN 1N e-mail ramollin@math.ucalgary.ca
More informationExtending Theorems of Serret and Pavone
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 20 (2017), Article 17.10.5 Extending Theorems of Serret and Pavone Keith R. Matthews School of Mathematics and Physics University of Queensland Brisbane
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 3
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 3 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all
More informationJournal of Integer Sequences, Vol. 5 (2002), Article
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 5 (2002), Article 02.2.7 ON SHANKS ALGORITHM FOR COMPUTING THE CONTINUED FRACTION OF log b a TERENCE JACKSON 1 AND KEITH MATTHEWS 2 1 Department of Mathematics
More informationUse properties of exponents. Use the properties of rational exponents to simplify the expression. 12 d.
EXAMPLE 1 Use properties of exponents Use the properties of rational exponents to simplify the expression. a. 7 1/ 7 1/2 7 (1/ + 1/2) 7 / b. (6 1/2 1/ ) 2 (6 1/2 ) 2 ( 1/ ) 2 6( 1/2 2 ) ( 1/ 2 ) 6 1 2/
More informationPRINCIPLE OF MATHEMATICAL INDUCTION
Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION 4.1 Overview Mathematical induction is one of the techniques which can be used to prove variety of mathematical statements which are formulated in terms of
More informationChapter 1. Introduction
Chapter 1 Introduction The Euclidean algorithm is the epitome of elegance in computational mathematics: it is clean and simple, much faster than factoring the inputs one by one and then casting out common
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 informationQUADRATIC EQUATIONS M.K. HOME TUITION. Mathematics Revision Guides Level: GCSE Higher Tier
Mathematics Revision Guides Quadratic Equations Page 1 of 8 M.K. HOME TUITION Mathematics Revision Guides Level: GCSE Higher Tier QUADRATIC EQUATIONS Version: 3.1 Date: 6-10-014 Mathematics Revision Guides
More informationMathematical Fundamentals
Mathematical Fundamentals Sets Factorials, Logarithms Recursion Summations, Recurrences Proof Techniques: By Contradiction, Induction Estimation Techniques Data Structures 1 Mathematical Fundamentals Sets
More informationSPEEDING FERMAT S FACTORING METHOD
MATHEMATICS OF COMPUTATION Volume 68, Number 228, Pages 1729 1737 S 0025-5718(99)01133-3 Article electronically published on March 1, 1999 SPEEDING FERMAT S FACTORING METHOD JAMES MCKEE Abstract. A factoring
More informationThe Truncated Pentagonal Number Theorem
The Truncated Pentagonal Number Theorem George E. Andrews Department of Mathematics The Pennsylvania State University University Park, PA 16802 USA Mircea Merca Doctoral School in Applied Mathematics University
More informationAlgebraic Functions, Equations and Inequalities
Algebraic Functions, Equations and Inequalities Assessment statements.1 Odd and even functions (also see Chapter 7)..4 The rational function a c + b and its graph. + d.5 Polynomial functions. The factor
More informationFibonacci numbers. Chapter The Fibonacci sequence. The Fibonacci numbers F n are defined recursively by
Chapter Fibonacci numbers The Fibonacci sequence The Fibonacci numbers F n are defined recursively by F n+ = F n + F n, F 0 = 0, F = The first few Fibonacci numbers are n 0 5 6 7 8 9 0 F n 0 5 8 55 89
More informationPRIMALITY TEST FOR FERMAT NUMBERS USING QUARTIC RECURRENCE EQUATION. Predrag Terzic Podgorica, Montenegro
PRIMALITY TEST FOR FERMAT NUMBERS USING QUARTIC RECURRENCE EQUATION Predrag Terzic Podgorica, Montenegro pedja.terzic@hotmail.com Abstract. We present deterministic primality test for Fermat numbers, F
More informationTHE TRIANGULAR THEOREM OF THE PRIMES : BINARY QUADRATIC FORMS AND PRIMITIVE PYTHAGOREAN TRIPLES
THE TRIANGULAR THEOREM OF THE PRIMES : BINARY QUADRATIC FORMS AND PRIMITIVE PYTHAGOREAN TRIPLES Abstract. This article reports the occurrence of binary quadratic forms in primitive Pythagorean triangles
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
More information2018 LEHIGH UNIVERSITY HIGH SCHOOL MATH CONTEST
08 LEHIGH UNIVERSITY HIGH SCHOOL MATH CONTEST. A right triangle has hypotenuse 9 and one leg. What is the length of the other leg?. Don is /3 of the way through his run. After running another / mile, he
More informationPUTNAM 2016 SOLUTIONS. Problem A1. Find the smallest positive integer j such that for every polynomial p(x) with integer coefficients
Math 7 Fall 5 PUTNAM 6 SOLUTIONS Problem A Find the smallest positive integer j such that for every polynomial px with integer coefficients and for every integer k, the integer the j-th derivative of px
More informationSydney University Mathematical Society Problems Competition Solutions.
Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed
More informationCONTINUED FRACTIONS Lecture notes, R. M. Dudley, Math Lecture Series, January 15, 2014
CONTINUED FRACTIONS Lecture notes, R. M. Dudley, Math Lecture Series, January 5, 204. Basic definitions and facts A continued fraction is given by two sequences of numbers {b n } n 0 and {a n } n. One
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 informationNONABELIAN GROUPS WITH PERFECT ORDER SUBSETS
NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in
More informationRAMANUJAN S MOST BEAUTIFUL IDENTITY
RAMANUJAN S MOST BEAUTIFUL IDENTITY MICHAEL D. HIRSCHHORN Abstract We give a simple proof of the identity which for Hardy represented the best of Ramanujan. On the way, we give a new proof of an important
More informationNewton s formula and continued fraction expansion of d
Newton s formula and continued fraction expansion of d ANDREJ DUJELLA Abstract It is known that if the period s(d) of the continued fraction expansion of d satisfies s(d), then all Newton s approximants
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is closed under addition, subtraction, multiplication, and also
More informationContinued Fractions: Introduction and Applications
PROCEEDINGS OF THE ROMAN NUMBER THEORY ASSOCIATION Volume 2, Number, March 207, pages 6-8 Michel Waldschmidt Continued Fractions: Introduction and Applications written by Carlo Sanna The continued fraction
More information