A Division Algorithm Approach to p-adic Sylvester Expansions
|
|
- Cecilia Boyd
- 5 years ago
- Views:
Transcription
1 arxiv: v1 [math.nt] 6 Aug 2015 A Division Algorithm Approach to p-adic Sylvester Expansions Eric Errthum Department of Mathematics and Statistics Winona State University Winona, MN eerrthum@winona.edu Astract A method of constructing finite p-adic Sylvester expansions for all rationals is presented. This method parallels the classical Fionacci- Sylvester (greedy) algorithm y iterating a p-adic division algorithm. The method extends to irrational p-adics that have an emedding in the reals. 1 Introduction In [2] and [3] A. Knopfmacher and J. Knopfmacher give algorithms for constructing Egyptian fraction expansions in a p-adic setting that are analogous to those given for the reals y Oppenheim [8]. However, for some positive rational inputs the Knopfmachers algorithm fails to return a finite expansion. In Section 2 we review the asics of the Knopfmachers Sylvester-type algorithm and give such an example. We then introduce a modification of 2010 Mathematics Suject Classification: Primary 11A67; Secondary 11J61. Key words and phrases: p-adic numer, p-adic division algorithm, Sylvester series expansion. 1
2 A Division Algorithm Approach to p-adic Sylvester Expansions 2 their algorithm that will give finite Sylvester expansions for all rationals. The seemingly unnatural correction term in our algorithm is explained y the alternate approach detailed in the final two sections. In Section 3 we riefly recall the Fionacci-Sylvester Greedy Algorithm, especially its relationship to the classical division algorithm. This provides the main motivation for Section 4 wherein we define a new p-adic division algorithm and use the same relationship to construct finite rational p-adic Sylvester expansions. Lastly we show that the division algorithm approach and the given modification to Knopfmachers algorithm yield the same output. 2 p-adic Numers 2.1 Basics of p-adic Numers We egin with some of the necessary asics of p-adic numers. A more thorough exposition can e found in [4]. Let p e a prime and Q p the completion of the rationals with respect to the p-adic asolute value p defined on Q y 0 p = 0 and r p = p ν if r = a pν, where p a. The exponent ν Z is the p-adicvaluation, or order, of r andwill e denoted ν p (r). Proposition 2.1 (c.f. [4]). Let nonzero ζ,ξ Q p. 1. There exists a unique ζ ) Q p such that ν p ( ζ = 0 and ζ = ζp νp(ζ). We will call ζ the unit part of ζ. 2. ν p (ζξ) = ν p (ζ)+ν p (ξ). 3. ν p (ζ +ξ) min{ν p (ζ),ν p (ξ)}. We have equality when ν p (ζ) ν p (ξ).
3 A Division Algorithm Approach to p-adic Sylvester Expansions 3 Every element of Q p has the shape ζ = n=ν p(ζ) c n p n (2.1) for c n {0,1,...,p 1}. This representation is unique, however p-adic numers can also e represented in the form ζ = a 0 + n=1 1 a n (2.2) where a n Z[ 1 ] and the sum is either finite or converges p-adically. There p are a variety of algorithms to decompose a p-adic into this form (c.f. [2]). One reason to study such representations is that they can e considered the p-adic analogue to representing real numers as Egyptian fractions, i.e. as the sum of unit fractions. 2.2 Sylvester-type Series Expansions of p-adic Numers There are various methods of decomposing a rational numer into an Egyptian fraction representation. One of the more naïve methods was given originally y Fionacci and again in modern times y Sylvester [9]. This algorithm is commonly known as the Greedy Algorithm ecause at each inductive step of the decomposition one simply takes the largest unit fraction smaller than the value eing decomposed. Later, Oppenheim [8] generalized this and other Egyptian fraction algorithms to real numers given y their decimal representations. The following inductive algorithm, which results in an expansion like (2.2), is presented y the Knopfmachers in [2] as a p-adic analogue to the Sylvester-Oppenheim algorithm on real numers. Begin y defining the fractional part of a p-adic numer ζ as in (2.1) y ζ = 0 n=ν p(ζ) c n p n. (2.3)
4 A Division Algorithm Approach to p-adic Sylvester Expansions 4 Algorithm 2.2 ([2]). Let ζ Q p. For the initial term, set a 0 = ζ. Then take ζ 1 = ζ a 0 so that ν p (ζ 1 ) 1. Continuing as long as ζ n 0, let 1 a n = and ζ n+1 = ζ n 1. a n ζ n In [3] (see Proposition 5.3) it is stated that the aove Sylvester-type algorithm and a similarly defined Engel-type algorithm terminate if and only if ζ Q. However in [1] Graner and A. Knopfmacher give an example of a rational with nonterminating Engel-type algorithm. Likewise, there are rationals for which this Sylvester-type algorithm does not terminate. Indeed, suppose ζ = a p+a Q with p a. Then a 0 = 1 and ζ 1 < 0. Since all the a n are defined to e positive, a finite sum in (2.2) leads to a contradiction. Although Laohakosol and Kanasri [6] give a complete characterization of the infinite Sylvester-type expansions from the Knopfmachers algorithm that correspond to rational numers, it is less ovious the necessary conditions under which a rational will result in a finite expansion. 2.3 A New Sylvester-Type Algorithm We start y generalizing the definition in (2.3) in the following way. Let ζ k = k 1 n=ν p(ζ) c n p n so that ζ 1 = ζ. In other words, ζ k is the rational image of ζ under the mod p k projection from Q p to Z[ 1 p ]. For real x, define the ceiling function, x, to e the least integer greater than x. Notice that since Q p is not an ordered field, this function is not well-defined for all p-adics. However, if ζ Q p such that there exists an emedding of Q(ζ) into R, then the ceiling function pulls ack to Q(ζ) Q p. We now state our modification to Algorithm 2.2. Algorithm 2.3. Let nonzero ζ Q p such that there exists an emedding ψ : Q(ζ) R and k Z such that k > ν p (ζ). Set ζ 0 = ζ. Inductively for
5 A Division Algorithm Approach to p-adic Sylvester Expansions 5 1 i 0 set t i = ζ i k, 1 ti ψ(ζ i ) q i = t i + p k, p k ψ(ζ i ) and The algorithm terminates if any ζ N = 0. ζ i+1 = ζ i 1 q i. (2.4) Theorem 2.4. Algorithm 2.3 produces a sequence of q i Z[ 1 ] such that p ζ = i=0 q i 1 where the sum (if infinite) converges p-adically. Proof. By (2.4), if the sum converges, it does so to ζ. It suffices to show that ζ i p 0. Suppose ν p (ζ i ) = s > k so that ζ i = ζ i p s. Then and for some m Z. Then t i = 1 p s ζ i ( 1 q i = ζ1 k = k+s 1 ζ1 p s k+s +mp k+s ) p s ζ i q i 1 = ζ 1 i ζ1 + ζ i mp k+s 1 0 mod p k+s k+s so ν p (ζ i q i 1) k +s. Then ν p (ζ i+1 ) k +s ν p (q i ). Since k > s, then ν p (q i ) s. Hence, ν p (ζ i+1 ) k +2s > ν p (ζ i ). Since the order of the ζ i is strictly increasing, ζ i p 0.
6 A Division Algorithm Approach to p-adic Sylvester Expansions 6 Example 2.5. Let k = 1 and consider ξ Q 7 with ξ 2 = 1 and ξ 4 11 mod 7. Then Q(ξ) emeds into R y either ψ(ξ) = 1 11 or ψ(ξ) = For the first choice, Algorithm 2.3 gives The second emedding yields ξ = ξ = Algorithm 2.3 certainly isn t as elegant looking as Knopfmachers Algorithm and has limitations for which p-adics it can e used on. However the importance of Algorithm 2.3 is in the following theorem. Theorem 2.6. Algorithm 2.3 terminates if and only if ζ Q. Instead of proving this theorem directly, in the following sections we will re-frame the approach to finding p-adic Sylvester expansions for rationals to mimic a more classical technique. In Section 4.3 we will show the link etween the two and the proof of Theorem 2.6 will follow easily. 3 The Fionacci-Sylvester Greedy Algorithm The algorithm given y Fionacci and Sylvester for Egyptian fractions of rationals can e interpretted as iterating a modified version of the classical division algorithm (c.f. [7]). We review these classical methods now to provide reference and motivation for the techniques used later. Theorem 3.1 (Modifed Classical Division Algorithm). For all a, Z, a > 0, there exist unique q, r Z such that with = aq r (3.1) 0 r < a. (3.2)
7 A Division Algorithm Approach to p-adic Sylvester Expansions 7 Note that Theorem 3.1 is greedy in the sense that it finds the smallest q such that aq >, i.e. so that a > 1 q. Algorithm 3.2 (F-S Greedy Algorithm). Let 1 < a Q, with a > 0 and gcd(a,) = 1. Iterate Theorem 3.1 in the following way: = aq 0 r 0 q 0 = r 0 q 1 r 1. (3.3) q 0 q 1 q i 1 = r i 1 q i r i The process terminates if any r N = 0. A straightforward computation (c.f. [7]) then gives the following: Theorem 3.3. Algorithm 3.2 terminates in a finite numer of steps and. N a = 1. (3.4) q i 4 A p-adic Division Algorithm Approach i=0 4.1 The p k -Division Algorithm We egin the process of retracing the classical approach y generalizing Theorem 3.1. The p-adic division algorithm defined here is similar to the one given in [5] ut differs consideraly in the restrictions on the quotient and remainder. Theorem 4.1 (p k -Division Algorithm). Let p e prime and k Z. For all a, Z[ 1], a > 0, there exist unique q,r p Z[1 ] such that p = aq r (4.1)
8 A Division Algorithm Approach to p-adic Sylvester Expansions 8 with and 0 r < ap k (4.2) r p ap k p. (4.3) Proof. We first prove existence. Since â and p are relatively prime, positive and negative powers of p are defined mod â. Let α = ν p (a) and β = ν p () and take 0 r < â such that r p β α k mod â. (Case 1: k > β α.) For some m Z we have rp β+α+k + = âm which gives p β = âp α mp β α rp α+k. Thus we can take q = mp β α and r = rp α+k. (Case 2: k β α.) For some m Z we have r+ p β α k = âm which gives p β = âmp α+k rp α+k. (4.4) Thus we can take q = mp k and r = rp α+k. In oth cases, since r < â, oth (4.2) and (4.3) are satisfied. To show uniqueness, suppose that there exist q 1,r 1,q 2,r 2 satisfying (4.1), (4.2), and (4.3). Then a(q 1 q 2 ) = r 1 r 2, thus r 1 r 2 mod â. Also r 1 r 2 mod p α+k since y assumption ν p (r i ) ν p ( ap k ). Therefore, r 1 r 2 mod ap k. Since oth are etween 0 and ap k, r 1 = r 2. Thus q 1 = q 2 and we have uniqueness as desired. Note that the value r may have nontrivial order. When ν p (r) 1 we say a jump occurs. Of course, if p > â then r = r and there is no jump. Also notice that one recovers Theorem 3.1 from Theorem 4.1 y setting k = 0 (or p = 1) and (redundantly) using the standard asolute value in (4.3). Additionally Theorem 4.1 generalizes the classical algorithm in the form of the following corollary.
9 A Division Algorithm Approach to p-adic Sylvester Expansions 9 Corollary 4.2. Suppose a,,p,k Z with p prime and k ν p () ν p (a). Let q p denote the quotient from the p k -division algorithm on a and and let q denote the quotient from the modified classical division algorithm on ap k and. Then q p = q p k. Proof. Since k ν p () ν p (a), Case 2 in the proof of Theorem 4.1 applies and q p = mp k. So it suffices to show that m = q. By (4.4), Thus (3.1) and (3.2) are satisfied. 0 ap k m < ap k. Inaddition, notethatthep k -DivisionAlgorithmcaneextended torational a and in the following way. Suppose = s and a = u for r,s,t,u Z. t v To find the quotient and remainder, clear denominators and compute the desired division algoritm on = sv and a = ut to find q and r. Then q = q and r = r satisfy (4.1), (4.2) and (4.3). However, since we are mostly vt interested in the quotient a, we will assume a, Z[1]. p 4.2 The p k -Greedy Algorithm Since we now have a generalization of Theorem 3.1, we can sustitute it into the iterative process of Algorithm 3.2. Algorithm 4.3 (p k -GreedyAlgorithm). Let a Q, with a > 0, gcd(a,) = 1 ( and k > ν a p ). Iterate Theorem 4.1 as in (3.3). The process terminates if any r N = 0. ( The condition k > ν a p ) plays the synonymous role to 1 < a in the F-S Greedy Algorithm: it prevents the division algorithm from returning a quotient equal to 0. This restriction on k is actually stronger than it needs to e for this alone. However, for reasons related to Corollary 4.2 and explained ( further elow, k ν a p ) is generally undesirale. The Knopfmachers avoided this ostruction y defining their initial a 0 outside of the inductive pattern so that ν p (ζ 1 ) 1. A similar strategy could e used here as well, though we find it more desirale to instead simply choose a different k value.
10 A Division Algorithm Approach to p-adic Sylvester Expansions 10 Theorem 4.4. Algorithm 4.3 terminates after a finite numer of steps. Proof. As opposed to Algorithm 3.2, now we have q i,r i Z[ 1 ] instead of Z. p However r i r i < r i 1 Z, so the sequence of r i s is a decreasing sequence of positive integers much like the classical remainders. Since the algorithm terminates, again we get that (3.4) holds. Example 4.5. Consider a = 473. Performing the3-greedyalgorithmyields, = = = = and thus = However, performing the 3 4 -Greedy Algorithm results in the sum = Applying Corollary 4.2 to Algorithm 4.3 gives another relationship etween the classical and p-adic algorithms. Corollary 4.6. Suppose a > 0 and the situation of k ν a p( ) holds. If no jumps occur than each term of the p k -Greedy Algorithm for a is equal to the corresponding term in the F-S Greedy Algorithm on apk divided y p k. Example 4.7. Consider the fraction a = = If we take p = 11 and k = 1, then k ν 11 ( a ) = 2. Applying the 11-Greedy Algorithm to encounters no jumps and gives =
11 A Division Algorithm Approach to p-adic Sylvester Expansions 11 On 5 11 = 5, the F-S Greedy Algorithm yields = The restriction on jumps is sufficient ut not necessary. For example, the 3-Greedy Algorithm on 22 encounters a jump, yet the relation aove to the 45 classical algorithm on 22 still holds. 15 ( Also notice that, again with k ν a ) p, if ap k > 1 then the F-S Greedy Algorithm returns quotients q i = 1 until the remaining value to e decomposed is less than 1. Hence, y Corollary 4.6 the p k -Greedy Algorithm on a produces a finite string of terms equal to 1 p k. For these reasons we only consider the cases where k > ν p ( a ). This condition is minor, though, in the grand scheme. Each inductive step of Algorithm 4.3 is independent of each other with respect to the value of k. So if the desired k fails the order criteria, it is possile to temporarily use a sufficiently large k in the initial step(s) and then switch ack to the desired k value once the corresponding orders ecome large enough. In this way finite p-adic Sylvester expansions can e found for all rationals. 4.3 Connection Between Approaches WearenowinthepositiontoreturntothemodificationoftheKnopfmachers algorithm given in Section 2. Theorem 4.8. For ζ Q, Algorithm 2.3 and Algorithm 4.3 produce the same output. Proof. Suppose ζ i Q for some i 0. Then ζ i = a for a, Z. Algorithm 2.3 produces /a /a k q i = + p k. a k p k Let r = aq i and σ k =. Then a k a 0 r a = σ σk k + p k < p k. p k
12 A Division Algorithm Approach to p-adic Sylvester Expansions 12 Since ν p (σ k ) k, then r p ap k p. Hence oth (4.2) and (4.3) are satisfied. The proof of Theorem 2.6 is simply a comination of Theorem 4.4 and Theorem 4.8. Further the condition of k > ν p (ζ) in Algorithm 2.3 is explained in light of Corollary 4.6. Indeed, for negative or irrational ζ with k ν p (ζ),astatementanalogoustocorollary4.6holdsandthusalgorithm 2.3 produces a p-adically divergent result. Though, as mentioned aove, this can e worked around y temporarily using alternate k-values. Acknowledgements Thank you to Anthony Martino for eing the first to convince me that Egyptian fractions are interesting and for helping me work out parts of Sections 4.1 and 4.2 in the k = 1 case. This work is dedicated to my children, Gedion and Eomji. References [1] Graner, Peter J.; Knopfmacher, Arnold. Arithmetic and metric properties of p-adic Engel series expansions. Pul. Math. Derecen 63 (2003), no. 3, [2] Knopfmacher, A.; Knopfmacher, J. Series expansions in p-adic and other non-archimedean fields. J. Numer Theory 32 (1989), no. 3, [3] Knopfmacher, A.; Knopfmacher, J. Infinite series expansions for p-adic numers, J. Numer Theory 41 (1992), no. 2, [4] Kolitz, N. p-adic Numers, p-adic Analysis, and Zeta-Functions. Graduate Texts in Mathematics 58, Springer, New York, 1977.
13 A Division Algorithm Approach to p-adic Sylvester Expansions 13 [5] Lager, C. A p-adic Euclidean Algorithm, Rose-Hulman Undergraduate Mathematics Journal 10 (2009), no. 2. [6] Laohakosol, V.; Kanasri, N. R. A characterization of rational numers y p-adic Sylvester series expansions, Acta Arith. 130 (2007), no. 4, [7] Mays, M. A worst case of the Fionacci-Sylvester expansion, J. Comin. Math. Comin. Comput. 1 (1987), [8] Oppenheim, A. The representation of real numers y infinite series of rationals, Acta Arith. 21 (1972) [9] Sylvester, J. J. On a Point in the Theory of Vulgar Fractions. Amer. J. Math. 3 (1880), no. 4,
PROBLEM SET 1 SOLUTIONS 1287 = , 403 = , 78 = 13 6.
Math 7 Spring 06 PROBLEM SET SOLUTIONS. (a) ( pts) Use the Euclidean algorithm to find gcd(87, 0). Solution. The Euclidean algorithm is performed as follows: 87 = 0 + 78, 0 = 78 +, 78 = 6. Hence we have
More informationA p-adic Euclidean Algorithm
A p-adic Euclidean Algorithm Cortney Lager Winona State University October 0, 009 Introduction The rational numbers can be completed with respect to the standard absolute value and this produces the real
More informationExploring Lucas s Theorem. Abstract: Lucas s Theorem is used to express the remainder of the binomial coefficient of any two
Delia Ierugan Exploring Lucas s Theorem Astract: Lucas s Theorem is used to express the remainder of the inomial coefficient of any two integers m and n when divided y any prime integer p. The remainder
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More information1Number ONLINE PAGE PROOFS. systems: real and complex. 1.1 Kick off with CAS
1Numer systems: real and complex 1.1 Kick off with CAS 1. Review of set notation 1.3 Properties of surds 1. The set of complex numers 1.5 Multiplication and division of complex numers 1.6 Representing
More information#A50 INTEGERS 14 (2014) ON RATS SEQUENCES IN GENERAL BASES
#A50 INTEGERS 14 (014) ON RATS SEQUENCES IN GENERAL BASES Johann Thiel Dept. of Mathematics, New York City College of Technology, Brooklyn, New York jthiel@citytech.cuny.edu Received: 6/11/13, Revised:
More informationNOTES ON SIMPLE NUMBER THEORY
NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
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 informationZeroing the baseball indicator and the chirality of triples
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.1.7 Zeroing the aseall indicator and the chirality of triples Christopher S. Simons and Marcus Wright Department of Mathematics
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More informationMATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology.
MATH 501 Discrete Mathematics Lecture 6: Number theory Prof. Dr. Slim Abdennadher, slim.abdennadher@guc.edu.eg German University Cairo, Department of Media Engineering and Technology 1 Number theory Number
More informationStandard forms for writing numbers
Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,
More informationTHE JACOBI SYMBOL AND A METHOD OF EISENSTEIN FOR CALCULATING IT
THE JACOBI SYMBOL AND A METHOD OF EISENSTEIN FOR CALCULATING IT STEVEN H. WEINTRAUB ABSTRACT. We present an exposition of the asic properties of the Jacoi symol, with a method of calculating it due to
More informationNOTES ON DIOPHANTINE APPROXIMATION
NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse January 29, 200 9 p-adic Numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationLecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman
Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Factorization 0.1.1 Factorization of Integers and Polynomials Now we are going
More informationApplied Cryptography and Computer Security CSE 664 Spring 2017
Applied Cryptography and Computer Security Lecture 11: Introduction to Number Theory Department of Computer Science and Engineering University at Buffalo 1 Lecture Outline What we ve covered so far: symmetric
More informationa = qb + r where 0 r < b. Proof. We first prove this result under the additional assumption that b > 0 is a natural number. Let
2. Induction and the division algorithm The main method to prove results about the natural numbers is to use induction. We recall some of the details and at the same time present the material in a different
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 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 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 information1 Adeles over Q. 1.1 Absolute values
1 Adeles over Q 1.1 Absolute values Definition 1.1.1 (Absolute value) An absolute value on a field F is a nonnegative real valued function on F which satisfies the conditions: (i) x = 0 if and only if
More informationRemainders. We learned how to multiply and divide in elementary
Remainders We learned how to multiply and divide in elementary school. As adults we perform division mostly by pressing the key on a calculator. This key supplies the quotient. In numerical analysis and
More informationINTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.
INTEGERS PETER MAYR (MATH 2001, CU BOULDER) In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. 1. Divisibility Definition. Let a, b
More informationArithmetic and Metric Properties of p-adic Alternating Engel Series Expansions
International Journal of Algebra, Vol 2, 2008, no 8, 383-393 Arithmetic and Metric Proerties of -Adic Alternating Engel Series Exansions Yue-Hua Liu and Lu-Ming Shen Science College of Hunan Agriculture
More informationARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS
ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS TIMO ERKAMA It is an open question whether n-cycles of complex quadratic polynomials can be contained in the field Q(i) of complex rational numbers
More informationJonathan Sondow 209 West 97th Street Apt 6F New York, NY USA
Which Partial Sums of the Taylor Series for e Are Convergents to e? (and a Link to the Primes 2, 5, 13, 37, 463,...) arxiv:0709.0671v1 [math.nt] 5 Sep 2007 Jonathan Sondow 209 West 97th Street Apt 6F New
More information1 x i. i=1 EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA
Volume, Number 2, Pages 63 78 ISSN 75-0868 ON THE EQUATION n i= = IN DISTINCT ODD OR EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA Abstract. In this paper we combine theoretical
More informationSection 2.1: Reduce Rational Expressions
CHAPTER Section.: Reduce Rational Expressions Section.: Reduce Rational Expressions Ojective: Reduce rational expressions y dividing out common factors. A rational expression is a quotient of polynomials.
More information2. THE EUCLIDEAN ALGORITHM More ring essentials
2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationcse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska
cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska LECTURE 12 CHAPTER 4 NUMBER THEORY PART1: Divisibility PART 2: Primes PART 1: DIVISIBILITY Basic Definitions Definition Given m,n Z, we say
More informationSolutions, Project on p-adic Numbers, Real Analysis I, Fall, 2010.
Solutions, Project on p-adic Numbers, Real Analysis I, Fall, 2010. (24) The p-adic numbers. Let p {2, 3, 5, 7, 11,... } be a prime number. (a) For x Q, define { 0 for x = 0, x p = p n for x = p n (a/b),
More informationProperties of proper rational numbers
arxiv:1109.6820v1 [math.gm] 29 Sep 2011 Properties of proper rational numers Konstantine Zelator Mathematics, Statistics, and Computer Science 212 Ben Franklin Hall Bloomsurg University of Pennsylvania
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 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 informationUpper Bounds for Stern s Diatomic Sequence and Related Sequences
Upper Bounds for Stern s Diatomic Sequence and Related Sequences Colin Defant Department of Mathematics University of Florida, U.S.A. cdefant@ufl.edu Sumitted: Jun 18, 01; Accepted: Oct, 016; Pulished:
More informationOpen Problems with Factorials
Mathematics Open Problems with Factorials Sílvia Casacuberta supervised by Dr. Xavier Taixés November 3, 2017 Preamble This essay contains the results of a research project on number theory focusing on
More informationThe number of solutions of linear equations in roots of unity
ACTA ARITHMETICA LXXXIX.1 (1999) The number of solutions of linear equations in roots of unity by Jan-Hendrik Evertse (Leiden) 1. Introduction. We deal with equations (1.1) a 1 ζ 1 +... + a n ζ n = 1 in
More informationON THE p-adic VALUE OF JACOBI SUMS OVER F p
Kyushu J. Math. 68 (014), 3 38 doi:10.06/kyushujm.68.3 ON THE p-adic VALUE OF JACOBI SUMS OVER F p 3 Takahiro NAKAGAWA (Received 9 November 01 and revised 3 April 014) Abstract. Let p be a prime and q
More informationNumbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 =
2 Numbers 2.1 Integers You remember the definition of a prime number. On p. 7, we defined a prime number and formulated the Fundamental Theorem of Arithmetic. Numerous beautiful results can be presented
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationGOLOMB S ARITHMETICAL SEMIGROUP TOPOLOGY AND A SEMIPRIME SUFFICIENCY CONDITION FOR DIRICHLET S THEOREM
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 46, Number 3, 2016 GOLOMB S ARITHMETICAL SEMIGROUP TOPOLOGY AND A SEMIPRIME SUFFICIENCY CONDITION FOR DIRICHLET S THEOREM CHRIS ORUM ABSTRACT. Dirichlet s theorem
More informationChaos and Dynamical Systems
Chaos and Dynamical Systems y Megan Richards Astract: In this paper, we will discuss the notion of chaos. We will start y introducing certain mathematical concepts needed in the understanding of chaos,
More informationA CONSTRUCTION OF ARITHMETIC PROGRESSION-FREE SEQUENCES AND ITS ANALYSIS
A CONSTRUCTION OF ARITHMETIC PROGRESSION-FREE SEQUENCES AND ITS ANALYSIS BRIAN L MILLER & CHRIS MONICO TEXAS TECH UNIVERSITY Abstract We describe a particular greedy construction of an arithmetic progression-free
More informationEgyptian Fractions: Part II
Egyptian Fractions: Part II Prepared y: Eli Jaffe Octoer 15, 2017 1 Will It End 1. Consider the following algorithm for eating some initial amount of cake. Step 1: Eat 1 of the remaining amount of cake.
More informationSHABNAM AKHTARI AND JEFFREY D. VAALER
ON THE HEIGHT OF SOLUTIONS TO NORM FORM EQUATIONS arxiv:1709.02485v2 [math.nt] 18 Feb 2018 SHABNAM AKHTARI AND JEFFREY D. VAALER Abstract. Let k be a number field. We consider norm form equations associated
More informationModule 9: Further Numbers and Equations. Numbers and Indices. The aim of this lesson is to enable you to: work with rational and irrational numbers
Module 9: Further Numers and Equations Lesson Aims The aim of this lesson is to enale you to: wor with rational and irrational numers wor with surds to rationalise the denominator when calculating interest,
More informationThe p-adic numbers. Given a prime p, we define a valuation on the rationals by
The p-adic numbers There are quite a few reasons to be interested in the p-adic numbers Q p. They are useful for solving diophantine equations, using tools like Hensel s lemma and the Hasse principle,
More informationMATH 225: Foundations of Higher Matheamatics. Dr. Morton. 3.4: Proof by Cases
MATH 225: Foundations of Higher Matheamatics Dr. Morton 3.4: Proof y Cases Chapter 3 handout page 12 prolem 21: Prove that for all real values of y, the following inequality holds: 7 2y + 2 2y 5 7. You
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 information5: The Integers (An introduction to Number Theory)
c Oksana Shatalov, Spring 2017 1 5: The Integers (An introduction to Number Theory) The Well Ordering Principle: Every nonempty subset on Z + has a smallest element; that is, if S is a nonempty subset
More information4 Powers of an Element; Cyclic Groups
4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)
More informationarxiv: v1 [math.nt] 8 Jan 2014
A NOTE ON p-adic VALUATIONS OF THE SCHENKER SUMS PIOTR MISKA arxiv:1401.1717v1 [math.nt] 8 Jan 2014 Abstract. A prime number p is called a Schenker prime if there exists such n N + that p nandp a n, wherea
More informationGraphs and polynomials
5_6_56_MQVMM - _t Page Frida, Novemer 8, 5 :5 AM MQ Maths Methods / Final Pages / 8//5 Graphs and polnomials VCEcoverage Areas of stud Units & Functions and graphs Algera In this chapter A The inomial
More informationFORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS
Sairaiji, F. Osaka J. Math. 39 (00), 3 43 FORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS FUMIO SAIRAIJI (Received March 4, 000) 1. Introduction Let be an elliptic curve over Q. We denote by ˆ
More informationNonarchimedean Cantor set and string
J fixed point theory appl Online First c 2008 Birkhäuser Verlag Basel/Switzerland DOI 101007/s11784-008-0062-9 Journal of Fixed Point Theory and Applications Nonarchimedean Cantor set and string Michel
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 informationMATHEMATICS X l Let x = p q be a rational number, such l If p, q, r are any three positive integers, then, l that the prime factorisation of q is of t
CHAPTER 1 Real Numbers [N.C.E.R.T. Chapter 1] POINTS FOR QUICK REVISION l Euclid s Division Lemma: Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 r
More informationThe Completion of a Metric Space
The Completion of a Metric Space Let (X, d) be a metric space. The goal of these notes is to construct a complete metric space which contains X as a subspace and which is the smallest space with respect
More informationMETRIC HEIGHTS ON AN ABELIAN GROUP
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 44, Number 6, 2014 METRIC HEIGHTS ON AN ABELIAN GROUP CHARLES L. SAMUELS ABSTRACT. Suppose mα) denotes the Mahler measure of the non-zero algebraic number α.
More information10 Lorentz Group and Special Relativity
Physics 129 Lecture 16 Caltech, 02/27/18 Reference: Jones, Groups, Representations, and Physics, Chapter 10. 10 Lorentz Group and Special Relativity Special relativity says, physics laws should look the
More informationLEGENDRE S THEOREM, LEGRANGE S DESCENT
LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +
More informationDONG QUAN NGOC NGUYEN
REPRESENTATION OF UNITS IN CYCLOTOMIC FUNCTION FIELDS DONG QUAN NGOC NGUYEN Contents 1 Introduction 1 2 Some basic notions 3 21 The Galois group Gal(K /k) 3 22 Representation of integers in O, and the
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More informationMath 3450 Homework Solutions
Math 3450 Homework Solutions I have decided to write up all the solutions to prolems NOT assigned from the textook first. There are three more sets to write up and I am doing those now. Once I get 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 informationQUOTIENTS OF FIBONACCI NUMBERS
QUOTIENTS OF FIBONACCI NUMBERS STEPHAN RAMON GARCIA AND FLORIAN LUCA Abstract. There have been many articles in the Monthly on quotient sets over the years. We take a first step here into the p-adic setting,
More informationThe p-adic Numbers. Akhil Mathew. 4 May Math 155, Professor Alan Candiotti
The p-adic Numbers Akhil Mathew Math 155, Professor Alan Candiotti 4 May 2009 Akhil Mathew (Math 155, Professor Alan Candiotti) The p-adic Numbers 4 May 2009 1 / 17 The standard absolute value on R: A
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 informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationCHARACTERIZING INTEGERS AMONG RATIONAL NUMBERS WITH A UNIVERSAL-EXISTENTIAL FORMULA
CHARACTERIZING INTEGERS AMONG RATIONAL NUMBERS WITH A UNIVERSAL-EXISTENTIAL FORMULA BJORN POONEN Abstract. We prove that Z in definable in Q by a formula with 2 universal quantifiers followed by 7 existential
More informationNUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:
NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,
More informationClass IX Chapter 1 Number Sustems Maths
Class IX Chapter 1 Number Sustems Maths Exercise 1.1 Question Is zero a rational number? Can you write it in the form 0? and q, where p and q are integers Yes. Zero is a rational number as it can be represented
More informationEVALUATIONS OF EXPECTED GENERALIZED ORDER STATISTICS IN VARIOUS SCALE UNITS
APPLICATIONES MATHEMATICAE 9,3 (), pp. 85 95 Erhard Cramer (Oldenurg) Udo Kamps (Oldenurg) Tomasz Rychlik (Toruń) EVALUATIONS OF EXPECTED GENERALIZED ORDER STATISTICS IN VARIOUS SCALE UNITS Astract. We
More informationFundamentals of Pure Mathematics - Problem Sheet
Fundamentals of Pure Mathematics - Problem Sheet ( ) = Straightforward but illustrates a basic idea (*) = Harder Note: R, Z denote the real numbers, integers, etc. assumed to be real numbers. In questions
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More information2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.
2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say
More informationQuivers. Virginia, Lonardo, Tiago and Eloy UNICAMP. 28 July 2006
Quivers Virginia, Lonardo, Tiago and Eloy UNICAMP 28 July 2006 1 Introduction This is our project Throughout this paper, k will indicate an algeraically closed field of characteristic 0 2 Quivers 21 asic
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 informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationComputing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q John Cremona 1 and Samir Siksek 2 1 School of Mathematical Sciences, University of Nottingham, University Park, Nottingham NG7
More informationUNIT 4 NOTES: PROPERTIES & EXPRESSIONS
UNIT 4 NOTES: PROPERTIES & EXPRESSIONS Vocabulary Mathematics: (from Greek mathema, knowledge, study, learning ) Is the study of quantity, structure, space, and change. Algebra: Is the branch of mathematics
More informationA number that can be written as, where p and q are integers and q Number.
RATIONAL NUMBERS 1.1 Definition of Rational Numbers: What are rational numbers? A number that can be written as, where p and q are integers and q Number. 0, is known as Rational Example:, 12, -18 etc.
More informationDiscrete valuation rings. Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that:
Discrete valuation rings Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that: 1. v is surjective. 2. v(ab) = v(a) + v(b). 3. v(a + b) min(v(a), v(b)) if a + b 0. Proposition:
More informationBasic Algebra. Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series
Basic Algebra Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series Cornerstones Selected Pages from Chapter I: pp. 1 15 Anthony
More informationGEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS
GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS JENNY WANG Abstract. In this paper, we study field extensions obtained by polynomial rings and maximal ideals in order to determine whether solutions
More informationarxiv: v1 [math.gm] 1 Oct 2015
A WINDOW TO THE CONVERGENCE OF A COLLATZ SEQUENCE arxiv:1510.0174v1 [math.gm] 1 Oct 015 Maya Mohsin Ahmed maya.ahmed@gmail.com Accepted: Abstract In this article, we reduce the unsolved problem of convergence
More informationON A THEOREM OF TARTAKOWSKY
ON A THEOREM OF TARTAKOWSKY MICHAEL A. BENNETT Dedicated to the memory of Béla Brindza Abstract. Binomial Thue equations of the shape Aa n Bb n = 1 possess, for A and B positive integers and n 3, at most
More informationTHE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany
#A95 INTEGERS 18 (2018) THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS Bernd C. Kellner Göppert Weg 5, 37077 Göttingen, Germany b@bernoulli.org Jonathan Sondow 209 West 97th Street, New Yor,
More informationEUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972)
Intro to Math Reasoning Grinshpan EUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972) We all know that every composite natural number is a product
More informationFAREY-PELL SEQUENCE, APPROXIMATION TO IRRATIONALS AND HURWITZ S INEQUALITY (COMMUNICATED BY TOUFIK MANSOUR)
Bulletin of Mathematical Analysis Applications ISSN: 8-9 URL: http://wwwmathaag Volume 8 Issue (06) Pages - FAREY-PELL SEQUENCE APPROXIMATION TO IRRATIONALS AND HURWITZ S INEQUALITY (COMMUNICATED BY TOUFIK
More informationarxiv: v3 [math.ac] 29 Aug 2018
ON THE LOCAL K-ELASTICITIES OF PUISEUX MONOIDS MARLY GOTTI arxiv:1712.00837v3 [math.ac] 29 Aug 2018 Abstract. If M is an atomic monoid and x is a nonzero non-unit element of M, then the set of lengths
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationThe Real Number System
MATH 337 The Real Number System Sets of Numbers Dr. Neal, WKU A set S is a well-defined collection of objects, with well-defined meaning that there is a specific description from which we can tell precisely
More informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
More information