On the Largest Integer that is not a Sum of Distinct Positive nth Powers
|
|
- Ada Jacobs
- 5 years ago
- Views:
Transcription
1 On the Largest Integer that is not a Sum of Distinct Positive nth Powers arxiv: v4 [math.nt] 9 Jul 2017 Doyon Kim Department of Mathematics and Statistics Auburn University Auburn, AL USA dzk0028@auburn.edu Abstract Itisknownthatforanarbitrarypositiveinteger nthesequencesx n = 1 n,2 n,... is complete, meaning that every sufficiently large integer is a sum of distinct nth powers of positive integers. We prove that every integer m b 12 n 1 r b 122n 1+2b 2 n 2a+ab, where a = n!2 n2, b = 2 n3 a n 1, r = 2 n2 n a, is a sum of distinct positive nth powers. 1 Introduction Let S = s 1,s 2,... be a sequence of integers. The sequence S is said to be complete if every sufficiently large integer can be represented as a sum of distinct elements of S. For a complete sequence S, the largest integer that is not representable as a sum of distinct elements of S is called the threshold of completeness of S. We let θ S denote the threshold of completeness of S. The threshold of completeness is often very difficult to find even for a simple sequence. For an arbitrary positive integer n, let Sx n denote the sequence of nth powers of positive integers, i.e., Sx n = 1 n,2 n,... The completeness of the sequence was proved in 1948, by Sprague [6]. In 1954, Roth and Szekeres [5] further generalized the result by proving that if fx is a polynomial that maps integers into integers, then Sf = f1,f2,... is complete if and only if fx has a positive leading coefficient and for any prime p there exists an integer m such that p does not divide fm. In 1964, Graham [2] re-proved the theorem of Roth and Szekeres using alternative elementary techniques. However, little is known about the threshold of completeness of Sx n. The value θ Sx n is known only for n 6. The values are as follows: θ Sx = 0, θ Sx 2 = 128 [7], θ Sx 3 = [2], θ Sx 4 = [3], θ Sx 5 = [4], θ Sx 6 = [1]. Sprague, Roth and Szekeres, and Graham proved that Sx n is complete, but they were not interested in the size of θ Sx n. The values θ Sx n for 3 n 6 were found by methods that require lengthy 1
2 calculations assisted by computer, and they do not give any idea on the size of θ Sx n for general n. In this paper, we establish an upper bound of θ Sx n as a function of n. Using the elementary techniques Graham used in his proof, it is possible to obtain an explicit upper bound of the threshold of completeness of Sx n = 1 n,2 n,3 n,... Since the case n = 1 is trivial, we let n be a positive integer greater than 1. We prove the following theorem: Theorem 1. Let a = n!2 n2, b = 2 n3 a n 1 and r = 2 n2 n a. Then θ Sx n < b 12 n 1 r b 122n 1+2b 2 n 2a+ab. The theorem yields the result θ Sx n = On! n n4 +n 3 +n 2 +2 ln3 ln2 n. The upper bound of θ Sx n given by the formula is much greater than 4 n4, while the actual values of θ Sx n for 2 n 6 are less than 4 n2. So the upper bound obtained in this paper is most likely far from being tight. 2 Preliminary results Let S = s 1,s 2,... be a sequence of integers. Definition 2. The set PS is a set of all sums of the form k=1 ǫ ks k where ǫ k is 0 or 1, all but a finite number of ǫ k are 0 and at least one of ǫ k is 1. Definition 3. The sequence S is complete if PS contains every sufficiently large integer. Definition 4. If S is complete, the threshold of completeness θ S is the largest integer that is not in PS. Definition 5. The set AS is a set of all sums of the form k=1 δ ks k where δ k is 1, 0 or 1 and all but a finite number of δ k are 0. Definition 6. Let k be a positive integer. The sequence S is a Σk-sequence if s 1 k, and n 1 s n k + s j, n 2. j=1 For example, if S = 2,4,8,16,... then S is a Σ2-sequence since 2 n = 2+ n 1 j=1 2j for all n 2. Definition 7. Let c and k be positive integers. The sequence S is c, k-representable if PS contains k consecutive integers c+j, 1 j k. 2
3 For example, if S = 1,3,6,10,... is a sequence of triangle numbers then S is 8,3- representable since {9,10,11} PS. Definition 8. For a positive integer m, we define Z m S to be the sequence α 1,α 2,..., where 0 α i < m and s i α i mod m for all i. The two following lemmas, slightly modified from Lemma 1 and Lemma 2 in Graham s paper [2], are used to obtain the upper bound. Lemma 9. For a positive integer k, let S = s 1,s 2,... be a strictly increasing Σk-sequence of positive integers and let T = t 1,t 2,... be c,k-representable. Then U = s 1,t 1,s 2,t 2,... is complete and θ U c. Proof. It suffices to prove that every positive integer greater than c belongs to PU. The proof proceeds by induction. Note that all the integers c+t, 1 t k belong to PT, and all the integers c+s 1 +t, 1 t k belong to PU. If 1 t k then c+t PT PU, and if k +1 t k +s 1, then 1 k s 1 +1 t s 1 k and we have Therefore all the integers c+t = c+t s 1 +s 1 PU. c+t, 1 t k +s 1 belong to PU. Now, let n 2 and suppose that all the integers n 1 c+t, 1 t k + belong to PU, and that for every such t there is a PU representation of c+t such that none of s m, m n is in the sum. Since all the integers c+t+s n, 1 t k+ n 1 j=1 s j belong to PU and c+1+s n c+1+k + n 1 j=1 s j, all the integers c+t, 1 t k + belong to PU. Since S is a strictly increasing sequence of positive integers, this completes the induction step and the proof of lemma. Lemma 10. Let S = s 1,s 2,... be a strictly increasing sequence of positive integers. If s k 2s k 1 for all k 2, then S is a Σs 1 -sequence. j=1 n j=1 s j s j 3
4 Proof. For k 2, we have Therefore, S is a Σs 1 -sequence. s k 2s k 1 = s k 1 +s k 1 s k 1 +2s k 2 = s k 1 +s k 2 +s k 2 s k 1 +s k 2 +2s k 3 k 1 s 1 + s j. j=1 Lemma 9 shows that if a sequence S can be partitioned into one Σk-sequence and one c,k-representable sequence then S is complete with θ S c. What we aim to do is to partition Sx n into two such sequences for some c and k. Let fx = x n and let Sf = f1,f2,... Let a = n!2 n2 and r = 2 n2 n a. Partition the elements of the sequence Sf into four sets B 1, B 2, B 3 and B 4 defined by so that and B 1 = {fαa+β : 0 α 2 n2 n 1, 1 β 2 n }, B 2 = {fαa+β : 0 α 2 n2 n 1, 2 n +1 β a, αa+β < 2 n2 n a}, B 3 = {f2 n2 n a,f2 n2 n a+2,f2 n2 n a+4,...}, B 4 = {f2 n2 n a+1,f2 n2 n a+3,f2 n2 n a+5,...}, B 1 B 2 = {f1,f2,...,fr 1} B 3 B 4 = {fr,fr+1,fr+2,...}. Let S, T, U and W be the strictly increasing sequences defined by S = s 1,s 2,...,s 2 n 2, s j B 1, T = t 1,t 2,..., t j B 3, U = u 1,u 2,..., u j B 1 B 3, W = w 1,w 2,..., w j B 2 B 4. Then the sequences U and W partition the sequence Sf. First, using Lemma 10, we show that W is a Σa-sequence. Lemma 11. For a = n!2 n2 and r = 2 n2 n a, fr +1 fr 1 < fa+2n +1 < f2n +2 fa f2 n
5 Proof. Re-write the inequalities as 1+ 2 r 1 n < 1+ 2n +1 a n < 1+ 1 n 2. 2 n +1 It is clear that r 1 > a 2 2 n +1 > 2n +1, which proves the first two inequalities. The proof of the third inequality 1+ 1 n n n 12 n is also straightforward. Corollary 12. The sequence W is a Σa-sequence. Proof. Note that w 1 = 2 n + 1 n. For every k 2, equalities: w k w k 1 satisfies one of the following w k = fα+1 w k 1 fα w k, for α 2 n +1; 1 = fβa+2n +1, for β 1; w k 1 fβa 2 w k fγ +2 =, for γ r 1. w k 1 fγ 3 Also, for every α 2 n +1, β 1 and γ r 1 we have fα+1 fα fβa+2 n +1 fβa fγ +2 fγ f2n +2 f2 n +1, fa+2n +1, fa fr+1 fr 1. w Thus, by Lemma 11, k w k 1 2 for k 2, and therefore by Lemma 10, W is a Σ2 n +1 n - sequence. To complete the proof, it remains to prove that 2 n +1 n < a for all n > 1. The inequality is true for n = 2 and n = 3, and for n > 3 we have Therefore, W is a Σa-sequence. 2 n +1 n < 2 n +2 n n = 2 n 2 n2 < n!2 n2 = a. 5
6 Now, we prove that U is d,a-representable for some positive integer d. By Lemma 9, the value d is the upper bound of θ Sx n. Note that the sequences S and T partition U. Lemma 13 shows that PS contains a complete residue system modulo a, and Lemma 14 and 15 together show that PT contains arbitrarily long arithmetic progression of integers with common difference a. The properties of S and T are used in Lemma 16 to prove that PU contains a consecutive integers. Lemma 13. The set PS contains a complete residue system modulo a. Proof. Itsufficestoprovethat{1,2,...,a} PZ a S. LetS 1, S 2,..., S 2 n bethesequences defined by S j = j n,j n,...,j n, 1 j 2 n where S j = 2 n2 n for all j. Since for each 0 α 2 n2 n 1, 1 β 2 n we have fαa+β β n mod a, and S is the sequence of such fαa+β in increasing order, the sequences S 1, S 2,..., S 2 n partition the sequence Z a S. Note that PS 1 = {1,2,...,2 n2 n }, PS 2 = {2 n,2 2 n,3 2 n,...,2 n2 n 2 n }. Since for every integer 1 m 2 n2 n 1+2 n there exist 0 α 2 n2 n, 1 β 2 n such that m = α2 n +β, we have Likewise, for every j 3, the inequality PS 1 S 2 = {1,2,3,...,2 n2 n 1+2 n }. j n < 2 n j 1 n < 2 n2 n 1+2 n + +j 1 n holds, and therefore for every 1 m 2 n2 n 1+2 n + +j n there exists 0 α 2 n2 n, 1 β 2 n2 n 1+2 n + j 1 n such that m = αj n +β. Therefore PZ a S = PS 1 S 2 S 2 n = {1,2,3,...,2 n2 n 1+2 n +3 n + +2 n2 }. It remains to prove that a = n!2 n2 2 n2 n 1+2 n +3 n + +2 n2. Since 1+2 n + +2 n2 2 n 1 n n 2 n, 6
7 we have 2 2 n2 n 1+2 n + +2 n n n n 2 n n +1 =. 2 Since 2 n +1 > 2j for every positive integer j n, we have 2 n2 n 1+2 n + +2 n2 2 n 2 n n +1 1 n!2 n2 2 n!2 n2 = 2n +1 n = n!2 n n 2 n +1 2j j=1 > 1. Therefore, a = n!2 n2 < 2 n2 n 1+2 n + +2 n2 and it completes the proof. Lemma 14. For every positive integer m, fm,fm+2,fm+4,...,fm+ 2 a A 3 22n 1. Proof. Define k : Q[x] Q[x] by: 1 gx = g4x+2 g4x, k gx = 1 k 1 gx, 2 k n, so that for 1 k n, k fx is a polynomial of degree n k. For example, and = 2 fx = 1 f4x+2 f4x f16x+10+f16x f16x+8+f16x+2 3 fx = 1 2 fx = f64x+42+f64x+32+f64x+8+f64x+2 f64x+40+f64x+34+f64x+10+f64x. It is easy to check that there are 2 k 1 positive terms and 2 k 1 negative terms in k fx, and all of the terms are distinct. Therefore, for each 1 k n, there exist 2 k distinct integers α k 1 > α k 2 > > α k 2 k 1, β k 1 > β k 2 > > β k 2 k 1 with α k 1 > β k 1 such that 2 k 1 k fx = f 2 2k x+α k i i=1 7 2 k 1 i=1 f 2 2k x+β k i.
8 Since α 1 1 = 2 and α k 1 = 4α k for k 2, we have α k 1 = k 1. Also, we have {α k 2 k 1,β k 2 k 1 } = {0,2}. Therefore f2 k fx A 2k x,f2 2k x+2,...,f2 2k x k 1. On the other hand, since we have Therefore, 1 fx = f4x+2 f4x = 4x+2 n 4x n = n2 2n 1 x n 1 +terms of lower degree, n fx = nn 1n n 1 2 2n 3 2 2n = n!2 n2 = a. f2 a A 2n x,f2 2n x+2,...,f2 2n x n 1. Since the n fx is a polynomial of degree 0, the value a = n fx is independent of x. Therefore, we can replace 2 2n x with an arbitrary positive integer m and we have fm,fm+2,fm+4,...,fm+ 2 a A 3 22n 1. Lemma 15. For every positive integer t, there exists a positive integer c such that all the integers c+ja, 1 j t belong to PT and c < t 12 n 1 r t 122n 1+2t 2 n a. Proof. Let α = n 1, and let T 1,T 2,...,T t 1 be the sequences defined by T 1 = fr,fr+2,fr+4,...,fr+α, T 2 = fr+α+2,fr+α+4,...,fr+2α+2, T 3 = fr+2α+4,fr+2α+6,...,fr+3α+4,... T t 1 = fr+t 2α+2t 2,...,fr+t 1α+2t 2. 8
9 By Lemma 14, a AT j for every 1 j t 1, and there exists A j,b j PT j such that A j B j = a, both A j and B j consist of 2 n 1 terms, and all 2 n terms of A j and B j are distinct. Let C 1 = B 1 +B 2 +B 3 + +B t 1, C 2 = A 1 +B 2 +B 3 + +B t 1, C 3 = A 1 +A 2 +B 3 + +B t 1,... j 1 t 1 C j = A i + B i,... i=1 i=j C t = A 1 +A 2 +A 3 + +A t 1. Then each C j belongs to PT, and C 1,C 2,...,C t is an arithmetic progression of t integers with common difference a. Thus, they are exactly the integers c + ja, 1 j t with c = C 1 a = B 1 +B 2 + +B t 1 a. Since each B j, 1 j t 1 is a sum of 2 n 1 terms in T, and all of the terms are less than or equal to fr+t 1α+2t 2 = r t 122n 1+2t 2 n, we have c = C 1 a < t 12 n 1 r t 122n 1+2t 2 n a. Finally, we show that PU contains a consecutive integers k 1 + t 1,k 2 + t 2,...,k a + t a, where {k 1,k 2,...,k a } is a complete residue system of a in PS and t 1,t 2,...,t a are taken from the arithmetic progression in PT. Lemma 16. Let b = 2 n3 a n 1. The sequence U is d,a-representable for a positive integer d such that d < b 12 n 1 r b 122n 1+2b 2 n 2a+ab. Proof. By Lemma 15, PT contains an arithmetic progression of b integers, c+ja, 1 j b with c < b 12 n 1 r b 122n 1+2b 2 n a. By Lemma 13, there exist positive integers 1 = k 1 < k 2 < < k a in PS such that {k 1,k 2,...,k a } is a complete residue system modulo a. For 1 j a, let ka k j n j = +1. a 9
10 Then for each 1 j a, k a k j a < n j k a k j a +1 k a < n j a+k j k a +a. Also, if i j then n i a+k i n j a+k j mod a. Therefore is the set of a consecutive integers {c+n 1 a+k 1,c+n 2 a+k 2,...,c+n a a+k a } {c+k a +1,c+k a +2,...,c+k a +a}. It remains to prove that each c + n j a + k j is in PU. Let ΣS denote the sum of every element of S. Since S = 2 n2, and s j f2 n2 n 1a+2 n = r a+2 n n < r n a 2 n n < r n n! for each s j S, we have Therefore, for each 1 j a we have ΣS < 2 n2 r n n! = 2 n2 r n a. 1 n j < k a a +1 1 a ΣS+1 < 1 a 2n2 r n = 2 n3 a n 1 = b and thus all of c +n j a belong to PT. Since all of k j belong to PS, all of c +n j a+k j belong to PU. Therefore, U is c+k a,a-representable. Let Since k a < ΣS < 2 n2 r n a = ab a, d = c+k a. d = c+k a < b 12 n 1 r+ 2 3 b 122n 1+2b 2 n 2a+ab. Now we have everything we need to prove the theorem. 3 Proof of the theorem Recall that U and W are disjoint subsequences of Sf. By Corollary 12, W is a Σa- sequence and by Lemma 16, U is d, a-representable with d < b 12 n 1 r b 122n 1+2b 2 n 2a+ab. Therefore by Lemma 9, Sx n = Sf is complete and θ Sx n d < b 12 n 1 r b 122n 1+2b 2 n 2a+ab. 10
11 4 Acknowledgments The author would like to thank Dr. Luke Oeding of Auburn University for his advice. His suggestions were valuable and helped the author to obtain a better upper bound. Also, the author would like to thank Dr. Peter Johnson of Auburn University and the anonymous referees for their helpful comments. References [1] C. Fuller and R. H. Nichols, Generalized Anti-Waring numbers, J. Integer Seq , Article [2] R. L. Graham, Complete sequences of polynomial values, Duke Math. J , [3] S. Lin, Computer experiments on sequences which form integral bases, in J. Leech, ed., Computational Problems in Abstract Algebra, Pergamon Press, 1970, [4] C. Patterson, The Derivation of a High Speed Sieve Device, Ph.D. thesis, University of Calgary, [5] K. F. Roth and G. Szekeres, Some asymptotic formulae in the theory of partitions, Q. J. Math , [6] R. Sprague, Über Zerlegungen in n-te Potenzen mit lauter verschiedenen Grundzahlen, Math. Z , [7] R. Sprague, Über Zerlegungen in ungleiche Quadratzahlen, Math. Z , Mathematics Subject Classification: Primary 11P05; Secondary 05A17. Keywords: complete sequence, threshold of completeness, sum of powers. Concerned with sequence A
Algebra Review 2. 1 Fields. A field is an extension of the concept of a group.
Algebra Review 2 1 Fields A field is an extension of the concept of a group. Definition 1. A field (F, +,, 0 F, 1 F ) is a set F together with two binary operations (+, ) on F such that the following conditions
More informationSTRINGS OF CONSECUTIVE PRIMES IN FUNCTION FIELDS NOAM TANNER
STRINGS OF CONSECUTIVE PRIMES IN FUNCTION FIELDS NOAM TANNER Abstract In a recent paper, Thorne [5] proved the existence of arbitrarily long strings of consecutive primes in arithmetic progressions in
More informationAnalytic Number Theory Solutions
Analytic Number Theory Solutions Sean Li Cornell University sxl6@cornell.edu Jan. 03 Introduction This document is a work-in-progress solution manual for Tom Apostol s Introduction to Analytic Number Theory.
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More informationarxiv: v2 [math.nt] 9 Oct 2013
UNIFORM LOWER BOUND FOR THE LEAST COMMON MULTIPLE OF A POLYNOMIAL SEQUENCE arxiv:1308.6458v2 [math.nt] 9 Oct 2013 SHAOFANG HONG, YUANYUAN LUO, GUOYOU QIAN, AND CHUNLIN WANG Abstract. Let n be a positive
More informationarithmetic properties of weighted catalan numbers
arithmetic properties of weighted catalan numbers Jason Chen Mentor: Dmitry Kubrak May 20, 2017 MIT PRIMES Conference background: catalan numbers Definition The Catalan numbers are the sequence of integers
More informationMathematical Structures Combinations and Permutations
Definitions: Suppose S is a (finite) set and n, k 0 are integers The set C(S, k) of k - combinations consists of all subsets of S that have exactly k elements The set P (S, k) of k - permutations consists
More informationSuccessive Derivatives and Integer Sequences
2 3 47 6 23 Journal of Integer Sequences, Vol 4 (20, Article 73 Successive Derivatives and Integer Sequences Rafael Jaimczu División Matemática Universidad Nacional de Luján Buenos Aires Argentina jaimczu@mailunlueduar
More informationChapter 0. Introduction: Prerequisites and Preliminaries
Chapter 0. Sections 0.1 to 0.5 1 Chapter 0. Introduction: Prerequisites and Preliminaries Note. The content of Sections 0.1 through 0.6 should be very familiar to you. However, in order to keep these notes
More informationarxiv: v2 [math.nt] 29 Jul 2017
Fibonacci and Lucas Numbers Associated with Brocard-Ramanujan Equation arxiv:1509.07898v2 [math.nt] 29 Jul 2017 Prapanpong Pongsriiam Department of Mathematics, Faculty of Science Silpakorn University
More informationOn the possible quantities of Fibonacci numbers that occur in some type of intervals
On the possible quantities of Fibonacci numbers that occur in some type of intervals arxiv:1508.02625v1 [math.nt] 11 Aug 2015 Bakir FARHI Laboratoire de Mathématiques appliquées Faculté des Sciences Exactes
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 informationGordon solutions. n=1 1. p n
Gordon solutions 1. A positive integer is called a palindrome if its base-10 expansion is unchanged when it is reversed. For example, 121 and 7447 are palindromes. Show that if we denote by p n the nth
More informationarxiv: v3 [math.nt] 11 Apr 2015
ON INTEGERS WHICH ARE REPRESENTABLE AS SUMS OF LARGE SQUARES ALESSIO MOSCARIELLO arxiv:1408.1435v3 [math.nt] 11 Apr 2015 Abstract. We prove that the greatest positive integer that is not expressible as
More informationPACKING POLYNOMIALS ON SECTORS OF R 2. Caitlin Stanton Department of Mathematics, Stanford University, California
#A67 INTEGERS 14 (014) PACKING POLYNOMIALS ON SECTORS OF R Caitlin Stanton Department of Mathematics, Stanford University, California ckstanton@stanford.edu Received: 10/7/13, Revised: 6/5/14, Accepted:
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More 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 informationAlgebraic function fields
Algebraic function fields 1 Places Definition An algebraic function field F/K of one variable over K is an extension field F K such that F is a finite algebraic extension of K(x) for some element x F which
More informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
More informationA WEAK VERSION OF ROLLE S THEOREM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3147 3153 S 0002-9939(97)03910-5 A WEAK VERSION OF ROLLE S THEOREM THOMAS C. CRAVEN (Communicated by Wolmer
More informationArithmetic Properties for a Certain Family of Knot Diagrams
Arithmetic Properties for a Certain Family of Knot Diagrams Darrin D. Frey Department of Science and Math Cedarville University Cedarville, OH 45314 freyd@cedarville.edu and James A. Sellers Department
More informationA SUMMATION FORMULA FOR SEQUENCES INVOLVING FLOOR AND CEILING FUNCTIONS
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 36, Number 5, 006 A SUMMATION FORMULA FOR SEQUENCES INVOLVING FLOOR AND CEILING FUNCTIONS M.A. NYBLOM ABSTRACT. A closed form expression for the Nth partial
More informationBURGESS INEQUALITY IN F p 2. Mei-Chu Chang
BURGESS INEQUALITY IN F p 2 Mei-Chu Chang Abstract. Let be a nontrivial multiplicative character of F p 2. We obtain the following results.. Given ε > 0, there is δ > 0 such that if ω F p 2\F p and I,
More informationQUADRATIC FORMS. A mathematical vignette. Ed Barbeau, University of Toronto
QUADRATIC FORMS A mathematical vignette Ed Barbeau, University of Toronto 1. Difference of squares. Question: What positive integers can be written as the difference of two squares? This is a good problem
More informationCANONICAL FORMS FOR LINEAR TRANSFORMATIONS AND MATRICES. D. Katz
CANONICAL FORMS FOR LINEAR TRANSFORMATIONS AND MATRICES D. Katz The purpose of this note is to present the rational canonical form and Jordan canonical form theorems for my M790 class. Throughout, we fix
More informationarxiv: v1 [math.co] 17 Jul 2007
arxiv:0707.2591v1 [math.co] 17 Jul 2007 An Elementary Proof of the Fundamental Theorem of Tropical Algebra Nathan Grigg Nathan Manwaring May 22, 2018 Abstract In this paper we give an elementary proof
More informationActa Arith., 140(2009), no. 4, ON BIALOSTOCKI S CONJECTURE FOR ZERO-SUM SEQUENCES. 1. Introduction
Acta Arith., 140(009), no. 4, 39 334. ON BIALOSTOCKI S CONJECTURE FOR ZERO-SUM SEQUENCES SONG GUO AND ZHI-WEI SUN* arxiv:081.174v3 [math.co] 16 Dec 009 Abstract. Let n be a positive even integer, and let
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationULTRAFILTER AND HINDMAN S THEOREM
ULTRAFILTER AND HINDMAN S THEOREM GUANYU ZHOU Abstract. In this paper, we present various results of Ramsey Theory, including Schur s Theorem and Hindman s Theorem. With the focus on the proof of Hindman
More informationarxiv: v2 [math.nt] 4 Jun 2016
ON THE p-adic VALUATION OF STIRLING NUMBERS OF THE FIRST KIND PAOLO LEONETTI AND CARLO SANNA arxiv:605.07424v2 [math.nt] 4 Jun 206 Abstract. For all integers n k, define H(n, k) := /(i i k ), where the
More informationDIRECTED STUDIES IN MATHEMATICS - FINAL REPORT. 1. Introduction
DIRECTED STUDIES IN MATHEMATICS - FINAL REPORT ZHANG YONGQUAN 1. Introduction The factorial function n!, usually defined as the number of permutations of n distinct objects (or equivalently the product
More informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationRigid Divisibility Sequences Generated by Polynomial Iteration
Rigid Divisibility Sequences Generated by Polynomial Iteration Brian Rice Nicholas Pippenger, Advisor Christopher Towse, Reader May, 2008 Department of Mathematics Copyright c 2008 Brian Rice. The author
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 informationCullen Numbers in Binary Recurrent Sequences
Cullen Numbers in Binary Recurrent Sequences Florian Luca 1 and Pantelimon Stănică 2 1 IMATE-UNAM, Ap. Postal 61-3 (Xangari), CP 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn
More informationCHAPTER 3 REVIEW QUESTIONS MATH 3034 Spring a 1 b 1
. Let U = { A M (R) A = and b 6 }. CHAPTER 3 REVIEW QUESTIONS MATH 334 Spring 7 a b a and b are integers and a 6 (a) Let S = { A U det A = }. List the elements of S; that is S = {... }. (b) Let T = { A
More informationarxiv: v1 [math.nt] 4 Jun 2018
On the orbit of a post-critically finite polynomial of the form x d +c arxiv:1806.01208v1 [math.nt] 4 Jun 2018 Vefa Goksel Department of Mathematics University of Wisconsin Madison, WI 53706, USA E-mail:
More informationThe best expert versus the smartest algorithm
Theoretical Computer Science 34 004 361 380 www.elsevier.com/locate/tcs The best expert versus the smartest algorithm Peter Chen a, Guoli Ding b; a Department of Computer Science, Louisiana State University,
More informationA PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY
A PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY I. HECKENBERGER AND J. SAWADA Abstract. A bound resembling Pascal s identity is presented for binary necklaces with fixed density using
More informationUpper Bounds for Partitions into k-th Powers Elementary Methods
Int. J. Contemp. Math. Sciences, Vol. 4, 2009, no. 9, 433-438 Upper Bounds for Partitions into -th Powers Elementary Methods Rafael Jaimczu División Matemática, Universidad Nacional de Luján Buenos Aires,
More informationFormal Groups. Niki Myrto Mavraki
Formal Groups Niki Myrto Mavraki Contents 1. Introduction 1 2. Some preliminaries 2 3. Formal Groups (1 dimensional) 2 4. Groups associated to formal groups 9 5. The Invariant Differential 11 6. The Formal
More informationare the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).
Lecture A jacques@ucsd.edu Notation: N, R, Z, F, C naturals, reals, integers, a field, complex numbers. p(n), S n,, b(n), s n, partition numbers, Stirling of the second ind, Bell numbers, Stirling of the
More informationJ. Combin. Theory Ser. A 116(2009), no. 8, A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE
J. Combin. Theory Ser. A 116(2009), no. 8, 1374 1381. A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE Hao Pan and Zhi-Wei Sun Department of Mathematics, Naning University Naning 210093, People s Republic
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationNotes on Equidistribution
otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for
More informationSum and shifted-product subsets of product-sets over finite rings
Sum and shifted-product subsets of product-sets over finite rings Le Anh Vinh University of Education Vietnam National University, Hanoi vinhla@vnu.edu.vn Submitted: Jan 6, 2012; Accepted: May 25, 2012;
More informationAlgebraic Number Theory Notes: Local Fields
Algebraic Number Theory Notes: Local Fields Sam Mundy These notes are meant to serve as quick introduction to local fields, in a way which does not pass through general global fields. Here all topological
More informationarxiv: v1 [math.nt] 19 Dec 2018
ON SECOND ORDER LINEAR SEQUENCES OF COMPOSITE NUMBERS DAN ISMAILESCU 2, ADRIENNE KO 1, CELINE LEE 3, AND JAE YONG PARK 4 arxiv:1812.08041v1 [math.nt] 19 Dec 2018 Abstract. In this paper we present a new
More informationAn Additive Characterization of Fibers of Characters on F p
An Additive Characterization of Fibers of Characters on F p Chris Monico Texas Tech University Lubbock, TX c.monico@ttu.edu Michele Elia Politecnico di Torino Torino, Italy elia@polito.it January 30, 2009
More informationARCS IN FINITE PROJECTIVE SPACES. Basic objects and definitions
ARCS IN FINITE PROJECTIVE SPACES SIMEON BALL Abstract. These notes are an outline of a course on arcs given at the Finite Geometry Summer School, University of Sussex, June 26-30, 2017. Let K denote an
More informationCOMPLETE PADOVAN SEQUENCES IN FINITE FIELDS. JUAN B. GIL Penn State Altoona, 3000 Ivyside Park, Altoona, PA 16601
COMPLETE PADOVAN SEQUENCES IN FINITE FIELDS JUAN B. GIL Penn State Altoona, 3000 Ivyside Park, Altoona, PA 16601 MICHAEL D. WEINER Penn State Altoona, 3000 Ivyside Park, Altoona, PA 16601 CATALIN ZARA
More informationComputing Minimal Polynomial of Matrices over Algebraic Extension Fields
Bull. Math. Soc. Sci. Math. Roumanie Tome 56(104) No. 2, 2013, 217 228 Computing Minimal Polynomial of Matrices over Algebraic Extension Fields by Amir Hashemi and Benyamin M.-Alizadeh Abstract In this
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 informationExamples of Dual Spaces from Measure Theory
Chapter 9 Examples of Dual Spaces from Measure Theory We have seen that L (, A, µ) is a Banach space for any measure space (, A, µ). We will extend that concept in the following section to identify an
More informationTHE GROUP OF UNITS OF SOME FINITE LOCAL RINGS I
J Korean Math Soc 46 (009), No, pp 95 311 THE GROUP OF UNITS OF SOME FINITE LOCAL RINGS I Sung Sik Woo Abstract The purpose of this paper is to identify the group of units of finite local rings of the
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationExact formulae for the prime counting function
Notes on Number Theory and Discrete Mathematics Vol. 19, 013, No. 4, 77 85 Exact formulae for the prime counting function Mladen Vassilev Missana 5 V. Hugo Str, 114 Sofia, Bulgaria e-mail: missana@abv.bg
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationSolutions of exercise sheet 6
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 6 1. (Irreducibility of the cyclotomic polynomial) Let n be a positive integer, and P Z[X] a monic irreducible factor of X n 1
More informationPARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS
PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS GEORGE E. ANDREWS, MATTHIAS BECK, AND NEVILLE ROBBINS Abstract. We study the number p(n, t) of partitions of n with difference t between
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationImproved Bounds on the Anti-Waring Number
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 0 (017, Article 17.8.7 Improved Bounds on the Anti-Waring Number Paul LeVan and David Prier Department of Mathematics Gannon University Erie, PA 16541-0001
More information3 Solutions of congruences
3 Solutions of congruences 3.1 The Chinese Remainder Theorem revisited Let f(x) be a polynomial with coefficients in Z. A congruence equation is of the form f(x) 0 (mod m), where m is a positive integer.
More information1 Take-home exam and final exam study guide
Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationCONGRUENCES MODULO 2 FOR CERTAIN PARTITION FUNCTIONS
Bull. Aust. Math. Soc. 9 2016, 400 409 doi:10.1017/s000497271500167 CONGRUENCES MODULO 2 FOR CERTAIN PARTITION FUNCTIONS M. S. MAHADEVA NAIKA, B. HEMANTHKUMAR H. S. SUMANTH BHARADWAJ Received 9 August
More informationPartition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example
Partition of Integers into Even Summands We ask for the number of partitions of m Z + into positive even integers The desired number is the coefficient of x m in + x + x 4 + ) + x 4 + x 8 + ) + x 6 + x
More informationOn families of anticommuting matrices
On families of anticommuting matrices Pavel Hrubeš December 18, 214 Abstract Let e 1,..., e k be complex n n matrices such that e ie j = e je i whenever i j. We conjecture that rk(e 2 1) + rk(e 2 2) +
More informationIntroduction to finite fields
Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationEXPONENTIAL SUMS OVER THE SEQUENCES OF PRN S PRODUCED BY INVERSIVE GENERATORS
Annales Univ. Sci. Budapest. Sect. Comp. 48 018 5 3 EXPONENTIAL SUMS OVER THE SEQUENCES OF PRN S PRODUCED BY INVERSIVE GENERATORS Sergey Varbanets Odessa Ukraine Communicated by Imre Kátai Received February
More informationNew congruences for overcubic partition pairs
New congruences for overcubic partition pairs M. S. Mahadeva Naika C. Shivashankar Department of Mathematics, Bangalore University, Central College Campus, Bangalore-560 00, Karnataka, India Department
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 informationARITHMETIC PROGRESSIONS IN THE POLYGONAL NUMBERS
#A43 INTEGERS 12 (2012) ARITHMETIC PROGRESSIONS IN THE POLYGONAL NUMBERS Kenneth A. Brown Dept. of Mathematics, University of South Carolina, Columbia, South Carolina brownka5@mailbox.sc.edu Scott M. Dunn
More informationGap Between Consecutive Primes By Using A New Approach
Gap Between Consecutive Primes By Using A New Approach Hassan Kamal hassanamal.edu@gmail.com Abstract It is nown from Bertrand s postulate, whose proof was first given by Chebyshev, that the interval [x,
More informationMATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11
MATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11 3. Examples I did some examples and explained the theory at the same time. 3.1. roots of unity. Let L = Q(ζ) where ζ = e 2πi/5 is a primitive 5th root of
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationChapter 1 Preliminaries
Chapter 1 Preliminaries 1.1 Conventions and Notations Throughout the book we use the following notations for standard sets of numbers: N the set {1, 2,...} of natural numbers Z the set of integers Q the
More informationarxiv: v2 [math.nt] 6 Nov 2017
PRIME DIVISORS OF SEQUENCES OF INTEGERS arxiv:1706.09102v2 [math.nt] 6 Nov 2017 XIANZU LIN College of Mathematics and Computer Science, Fujian Normal University, Fuzhou, 350108, China; Email: linxianzu@126.com
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 informationarxiv: v1 [math.co] 29 Nov 2018
ON THE INDUCIBILITY OF SMALL TREES AUDACE A. V. DOSSOU-OLORY AND STEPHAN WAGNER arxiv:1811.1010v1 [math.co] 9 Nov 018 Abstract. The quantity that captures the asymptotic value of the maximum number of
More informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
More informationFermat numbers and integers of the form a k + a l + p α
ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac
More information#A42 INTEGERS 10 (2010), ON THE ITERATION OF A FUNCTION RELATED TO EULER S
#A42 INTEGERS 10 (2010), 497-515 ON THE ITERATION OF A FUNCTION RELATED TO EULER S φ-function Joshua Harrington Department of Mathematics, University of South Carolina, Columbia, SC 29208 jh3293@yahoo.com
More informationContinued Fraction Digit Averages and Maclaurin s Inequalities
Continued Fraction Digit Averages and Maclaurin s Inequalities Steven J. Miller, Williams College sjm1@williams.edu, Steven.Miller.MC.96@aya.yale.edu Joint with Francesco Cellarosi, Doug Hensley and Jake
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationProduct Representations of Polynomials
Product Representations of Polynomials Jacques Verstraëte Abstract For a fixed polyomial f Z[X], let ρ k (N denote the maximum size of a set A {1, 2,..., N} such that no product of k distinct elements
More informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationA proof of Freiman s Theorem, continued. An analogue of Freiman s Theorem in a bounded torsion group
A proof of Freiman s Theorem, continued Brad Hannigan-Daley University of Waterloo Freiman s Theorem Recall that a d-dimensional generalized arithmetic progression (GAP) in an abelian group G is a subset
More informationPart IA. Numbers and Sets. Year
Part IA Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2017 19 Paper 4, Section I 1D (a) Show that for all positive integers z and n, either z 2n 0 (mod 3) or
More informationMinimum number of non-zero-entries in a 7 7 stable matrix
Linear Algebra and its Applications 572 (2019) 135 152 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Minimum number of non-zero-entries in a
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
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 informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More informationfn" <si> f2(i) i + [/i + [/f] (1.1) ELEMENTARY SEQUENCES (1.2)
Internat. J. Math. & Math. Sci. VOL. 15 NO. 3 (1992) 581-588 581 ELEMENTARY SEQUENCES SCOTT J. BESLIN Department of Mathematics Nicholls State University Thibodaux, LA 70310 (Received December 10, 1990
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 informationOn the power-free parts of consecutive integers
ACTA ARITHMETICA XC4 (1999) On the power-free parts of consecutive integers by B M M de Weger (Krimpen aan den IJssel) and C E van de Woestijne (Leiden) 1 Introduction and main results Considering the
More information