EULER'S PARTITION IDENTITY ARE THERE ANY MORE LIKE IT?
|
|
- Susan Rich
- 5 years ago
- Views:
Transcription
1 HENRY L. ALDER University of California, Davis, CA AM IN A. MUWAFi American University of Beirut, Beirut, Lebanon JEFFREY K* LEWIS University of California, Davis, CA (Submitted August ) INTRODUCTION A partition of a positive integer n is defined as a way of writing n as a sum of positive integers. Two such ways of writing n in which the parts merely differ in the order in which they are written are considered the same partition. We shall denote by p(n) the number of partitions of n. Thus, for example, since can be expressed by, +, +, + +, + +, + + +, and , we have p() =. The function p(n) is referred to as the number of unrestricted partitions of n to make clear that no restrictions are imposed upon the way in which n is partitioned into parts. In this paper, we shall concern ourselves with certain restricted partitions, that is, partitions in which some kind of restriction is imposed upon the parts. Specifically, we shall consider identities valid for all positive integers n of the general type p\ri) = p"(n), () where p r (n) is the number of partitions of n where the parts of n are subject to a first restriction and p"(n) is the number of partitions of n where the parts of n are subject to an entirely different restriction. The most celebrated identity of this type is due to Euler [], who discovered it in. Theorem (Euler) The number of partitions of n into distinct parts is equal to the number of partitions of n into odd parts. Thus, for example, the partitions of into distinct parts are, +, +, +, + +, +, + +, + +, that is, there are such partitions, and the partitions of into odd parts are, + +, + +, , + +, , + + +, + + +, so that there are also partitions of into odd parts. For a proof of this theorem by combinatorial methods, see [], and by means of generating functions, see [] or []. ]
2 In [], Alder has given a survey of the existence and nonexistence of generalizations of Euler f s partition identity and, in [], he has shown how to use generating functions to discover and prove the existence and the nonexistence of certain generalizations of this identity. The use of generating functions, however, is by no means the only method for discovering partition identities or for proving their existence or nonexistence. Other methods, particularly those likely to produce positive results, that is, suggesting the existence of new partition identities, need, therefore, to be developed. Other points of view in looking at the possibility of the existence of such identities need to be encouraged. One such method is used in this paper. It is used to show that a certain generalization of a known partition identity cannot exist. It may well be, however, that as of yet unthought of techniques may prove successful in discovering a generalization. In D. R. Hickerson [] proved the following generalization of Euler f s partition identity. Theorem (Hickerson) If f(r, ri) denotes the number of partitions of n of the form b 0 + b + b + + b s, where, for 0 < < s -, bi > r^i + i> and g(r s ri) denotes the number of partitions of n where each part is of the form + r + r + e + ri for some i ^ 0, then f(r ri) = g(r, ri). () Thus, for example, for r =, the partitions of of the first type are, +, +, +, + +, so that /(, ) =, and the partitions of of the second type, that is, where each part is chosen from the set {l,,,... }, are + +, + +, , + + +, and + + +, so t h a t a l s o g(, ) =. Hickerson gave a proof of this theorem, both by combinatorial methods and by means of generating functions. In this paper we are addressing the question: Do there exist identities of the type given by Theorem, where the inequality b^ ^ vbi + is replaced by b i > rb i+ THE NONEXISTENCE OF CERTAIN TYPES OF PARTITION IDENTITIES OF THE EULER TYPE We shall consider the question stated above in the following more specific form: If /(p, ri) denotes the number of partitions of n of the form b 0 + b ± + + b s where, for 0 < i < s -, b t > rb i+ and g(r ri) denotes the number of partitions of n, where each part is taken from a set of integers S r, for which r do there exist sets S v such that f(r ri) = g(r n) We know, of course, that for v =, there exists such a set, since Euler*s partition theorem states that S is the set of all positive odd integers. The question -whether there exist other values of r for which there exist sets S r so that () holds for all positive integers n was posed at an undergraduate seminar on Number Theory by the first two authors in the Winter quarter, and was answered with proof for all integers v > by Jeffrey Lewis, namely as follows: [May
3 / ( p, EULER'S PARTITION IDENTITY ARE THERE ANY MORE LIKE IT? Theorem (Lewis) The number f(v ri) of partitions of n of the form b Q + b x + + b S where, for G < i < s -, bi> rb i + r a positive integer, is not, for all n equal to the number of partitions of n into parts taken from any set of integers whatsoever unless r -. Proof of Theorem - "We shall prove this theorem by contradiction. Let us assume that for some integer p > there exists a set S r of positive integers denote the number of partitions of n into parts taken from that set by g(r ri) for which f(r s n) = g(r n) for all n. Since f(r ) =, we see that E S r [otherwise, g(r ) = 0]. Since f(r s ) =, it follows that < S r [otherwise, g(r ) = ]. Since /(p, ) = f(r> ) = = f(r x> + ) =, we conclude that S V S r >..., r + S r. Now f(r r+ ) =, since the partitions of r + for which b i > rbi + are (p+) and (p+l)+l. It follows that p + E r [otherwise, g(r p + ) = ). Thus, we have verified the entries in Table up to n - r+. We will now complete the construction of this table. Table. Determination of the Elements of S r for p an Integer > n n), n) if n #(p, n) if n E,, Conclusion 0 E S f p + p + p + p + p + E p + S P + P + P + r + S r + E S Contradiction Next we determine the least value of n for which f(r if n is of either of the forms n = b 0 + b + with Z? 0 > PZ? X and b ± > r or n) =. This occurs n = Z? 0 + w i t h Z? 0 > P 0 The l e a s t n for which t h e f i r s t can occur i s n = ( P + P + ) + ( P + ) + = P + p + e The least n for which the second can occur is n = (P + ) + = P +. Since P + < r + v + for all positive P, it follows that n = P + is ]
4 the least value of n for which f(r n) =. In that case, the partitions of P + for which b i > rb i + are (r + ), (r+ ) +, (r + ) +. Now, since thus far only G r and r + E S r it follows that there are only two partitions of P + into parts taken from that set, namely (r + ) and + + +, so that we need v + E S r in order to make g(v r+ ) =. Now f(r P + ) =, since the only partitions of v +, with b^ > r ^ +, are (r+), (r+) +, ( P + ) +. (Note that it is here where we are using the fact that r >.) On the other hand, the partitions of v + into parts taken from the set {, p +, r+ } are ( r + ) + l, (r+ ) + (r+ ), (r+) , , so that g(r r + ) = if r + < P and #(r, r + ) = if r + E r, which is a contradiction. The question arises whether Theorem is true also for all values of v >. We have some partial answers to this question. Theorem k The nonexistence of sets S r given in Theorem also applies to all v in any of the intervals N < r < N + /, where N is any integer >. Proof of Theorem : This proof is identical to that for Theorem, except that, in the construction of Table, the entries in the columns for n and the conclusions have to be changed by replacing r in every case by [r], the grestest integer in r a Note that the condition that v < N + / is needed in the determination of the partitions of [r] + with b^ > rb i+l which are ([r] + ), ([p] + ) +, and ([r] + ) +, the latter satisfying the inequality, since [r] + = N + = (N + j \ > r. Now, for values of r for which N + (/) < r < N +, we have a method for proving the nonexistence of S v for certain intervals, but have no method which will give a conclusion valid for all such intervals. We illustrate this method for intervals in the range.0 < r <.00. First we use the same method used in the construction of Table to determine the elements of S v for r =.0. (See Table.) Since a contradiction is obtained for n = 0, it follows that for r =.0 no set S r can exist for which f(r ri) = g(r n) for all positive integers n. Next we note that Table applies for all r with.0 < r < x/y where x/y is the least rational number >.0 for which both x and y appear as parts in a partition counted by f(r s n) in Table ; that is, we need to find the least rational number x/y >.0 for which x + y < 0. This clearly is /, since + is a partition of and, therefore, Table would not be applicable for r = / because the partition of = + would not satisfy > r for v = /. Thus, Table is applicable for all r with.0 < r < /, and the nonexistence of the sets S r follows for all r in this interval. [May
5 EULER f S PARTITION IDENTITY ARE THERE ANY MORE LIKE IT? Table. Determination of the Elements of S r for v =.0 n f(r, n) g(r, n) if g(n, r) if n & S n E Conclusio E S i t s g S E g S S ( S S 0 S e g g g g g g S E g Contradict: We now construct, by programming on a computer, a table similar to Table for r = / (not shown here), obtaining a contradiction for n =. Next, we note that this table applies to all r with / < r < x/y, where x/y is the least rational number > / for which x + y <. This clearly is /, so that this table is applicable for all v with / < r < /. Constructing a table similar to Table for r = /, we obtain a contradiction for n = and find that this table is valid for all v with / < r < /. Then, constructing the appropriate table for r = /, we were unable to obtain a contradiction on the computer in the time available, that is, for n <. Though we were unable to obtain a contradiction for r = / =..., we were able to obtain one for v =., namely for n - 0 and, using the previously described method, to determine that this table is valid for all v with. < v < /. Then, considering v> /, we were able to obtain contradictions for all v < / =.0... for the values of n indicated in Table. For values of P ) /, the corresponding tables again became so long that the time available on the computer to arrive at a contradiction was exceeded; thus, we have no conclusions for / ^ r <. For values of r between and, the smallest value of r we considered was v =.0, for which we obtained a contradiction for n =. Using the same method as used for values of v in the interval.0 < v < /, it was possible to prove the nonexistence of S r for all r in the short interval.0 < r < / = To obtain results valid for larger intervals, we started with r =. and proved the nonexistence of S r for all r in the interval. < r < / =..., as indicated in Table. ]
6 Table - The Nonexistence of S T for.0 < r < / =... and. < r < / =.0... Interval.0 < v < / / < v < / / < v < / / < v < / / < v < / / < v < / / < r < / / < r < / / < v < lb / < v < 0/ 0/ < r < / / < v < / / < v < /0 /0 < v < / Value of n for Which Contradiction Occurs 0 No concli 0 0 Table k. The Nonexistence of S r for. < r < / =... Interval. < r < / / < r < / / < v < / / < r < / / < v < / / < r < Ilk Ilk < v < / / < v < / / < v < / / < v < / / < r < / / < v < /0 /0 < r < / / < r < / Value of n for Which Contradiction Occurs 0 For values of v <., as indicated above, the intervals for which a table similar to Table is valid become very small. Considering the values of v =.0,.0,...,.0, separately, we obtained a contradiction for each of them. For values of r close to, the time available on the computer to arrive at a contradiction was exceeded. This is not surprising, because we know that, for r =, we have the Euler identity and, therefore, no contradiction can be obtained. For values of r in the interval < v <., except for those listed above and for those in the interval / < r <, we have no conclusions. It is an interesting question whether Theorem can be proved by a method valid for all nonintegral values of r >. [May
7 The authors are greatly indebted to M. Reza Monajjemi for developing the program needed to construct Tables and, and for cheerfully spending many hours in helping to prepare them. REFERENCES. H. L. Alder. "The Nonexistence of Certain Identities in the Theory of Partitions and Compositions." Bull. Amev. Math. Soc. ():-.. H. L. Alder. "Partition Identities from Euler to the Present." Amev. Math. Monthly ():-.. H. L. Alder. "The Use of Generating Functions To Discover and Prove Partition Identities." Two-Year College Math. J. 0 ().--.. L. Euler. "Introductio in Analysin Infinitorium." Lausanne ():-.. D. R. Hickerson. "A Partition Identity of the Euler Type." Amev. Math. Monthly ():-.. I. Niven & H. S. Zuckerman. An Intvoduction to the Theovy of Numbevs, th ed. p.. New York: Wiley, 0. ]
IDENTITIES FOR OVERPARTITIONS WITH EVEN SMALLEST PARTS
IDENTITIES FOR OVERPARTITIONS WITH EVEN SMALLEST PARTS MIN-JOO JANG AND JEREMY LOVEJOY Abstract. We prove several combinatorial identities involving overpartitions whose smallest parts are even. These
More informationTHE HALF-FACTORIAL PROPERTY IN INTEGRAL EXTENSIONS. Jim Coykendall Department of Mathematics North Dakota State University Fargo, ND.
THE HALF-FACTORIAL PROPERTY IN INTEGRAL EXTENSIONS Jim Coykendall Department of Mathematics North Dakota State University Fargo, ND. 58105-5075 ABSTRACT. In this paper, the integral closure of a half-factorial
More informationAnother Proof of Nathanson s Theorems
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 (2011), Article 11.8.4 Another Proof of Nathanson s Theorems Quan-Hui Yang School of Mathematical Sciences Nanjing Normal University Nanjing 210046
More informationRadio Number for Square of Cycles
Radio Number for Square of Cycles Daphne Der-Fen Liu Melanie Xie Department of Mathematics California State University, Los Angeles Los Angeles, CA 9003, USA August 30, 00 Abstract Let G be a connected
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationMath From Scratch Lesson 28: Rational Exponents
Math From Scratch Lesson 28: Rational Exponents W. Blaine Dowler October 8, 2012 Contents 1 Exponent Review 1 1.1 x m................................. 2 x 1.2 n x................................... 2 m
More informationWinkler s Hat Guessing Game: Better Results for Imbalanced Hat Distributions
arxiv:1303.705v1 [math.co] 8 Mar 013 Winkler s Hat Guessing Game: Better Results for Imbalanced Hat Distributions Benjamin Doerr Max-Planck-Institute for Informatics 6613 Saarbrücken Germany April 5, 018
More information#A45 INTEGERS 9 (2009), BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS. Gyula Károlyi 1. H 1117, Hungary
#A45 INTEGERS 9 (2009, 591-603 BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS Gyula Károlyi 1 Institute of Mathematics, Eötvös University, Pázmány P. sétány 1/C, Budapest, H 1117, Hungary karolyi@cs.elte.hu
More informationA RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES
#A63 INTEGERS 1 (01) A RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES Brandt Kronholm Department of Mathematics, Whittier College, Whittier,
More informationCounting on Continued Fractions
appeared in: Mathematics Magazine 73(2000), pp. 98-04. Copyright the Mathematical Association of America 999. All rights reserved. Counting on Continued Fractions Arthur T. Benjamin Francis Edward Su Harvey
More informationMATH 271 Summer 2016 Practice problem solutions Week 1
Part I MATH 271 Summer 2016 Practice problem solutions Week 1 For each of the following statements, determine whether the statement is true or false. Prove the true statements. For the false statement,
More informationA LATTICE POINT ENUMERATION APPROACH TO PARTITION IDENTITIES
A LATTICE POINT ENUMERATION APPROACH TO PARTITION IDENTITIES A thesis presented to the faculty of San Francisco State University In partial fulfilment of The Requirements for The Degree Master of Arts
More informationARITHMETIC PROPERTIES FOR HYPER M ARY PARTITION FUNCTIONS
ARITHMETIC PROPERTIES FOR HYPER M ARY PARTITION FUNCTIONS Kevin M. Courtright Department of Mathematics, The Pennsylvania State University, University Park, PA 16802 kmc260@psu.edu James A. Sellers Department
More informationA PARTITION IDENTITY AND THE UNIVERSAL MOCK THETA FUNCTION g 2
A PARTITION IDENTITY AND THE UNIVERSAL MOCK THETA FUNCTION g KATHRIN BRINGMANN, JEREMY LOVEJOY, AND KARL MAHLBURG Abstract. We prove analytic and combinatorial identities reminiscent of Schur s classical
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
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 informationA PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES
A PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES MATTHEW S. MIZUHARA, JAMES A. SELLERS, AND HOLLY SWISHER Abstract. Ramanujan s celebrated congruences of the partition function p(n have inspired a vast
More informationVarious new observations about primes
A talk given at Univ. of Illinois at Urbana-Champaign (August 28, 2012) and the 6th National Number Theory Confer. (October 20, 2012) and the China-Korea Number Theory Seminar (October 27, 2012) Various
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 information(4.2) Equivalence Relations. 151 Math Exercises. Malek Zein AL-Abidin. King Saud University College of Science Department of Mathematics
King Saud University College of Science Department of Mathematics 151 Math Exercises (4.2) Equivalence Relations Malek Zein AL-Abidin 1440 ه 2018 Equivalence Relations DEFINITION 1 A relation on a set
More informationPROBLEMS. Problems. x 1
Irish Math. Soc. Bulletin Number 76, Winter 05, 9 96 ISSN 079-5578 PROBLEMS IAN SHORT We begin with three integrals. Problems Problem 76.. a 0 sinx dx b 0 x log x dx c cos x e /x + dx I learnt the next
More informationThings to remember: x n a 1. x + a 0. x n + a n-1. P(x) = a n. Therefore, lim g(x) = 1. EXERCISE 3-2
lim f() = lim (0.8-0.08) = 0, " "!10!10 lim f() = lim 0 = 0.!10!10 Therefore, lim f() = 0.!10 lim g() = lim (0.8 - "!10!10 0.042-3) = 1, " lim g() = lim 1 = 1.!10!0 Therefore, lim g() = 1.!10 EXERCISE
More informationTHE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS
THE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS JOSEPH E. BONIN AND JOSEPH P. S. KUNG ABSTRACT. We show that when n is greater than 3, the number of points in a combinatorial
More informationThesis submitted in partial fulfillment of the requirement for The award of the degree of. Masters of Science in Mathematics and Computing
SOME n-color COMPOSITION Thesis submitted in partial fulfillment of the requirement for The award of the degree of Masters of Science in Mathematics and Computing Submitted by Shelja Ratta Roll no- 301203014
More informationOn the Ordinary and Signed Göllnitz-Gordon Partitions
On the Ordinary and Signed Göllnitz-Gordon Partitions Andrew V. Sills Department of Mathematical Sciences Georgia Southern University Statesboro, Georgia, USA asills@georgiasouthern.edu Version of October
More informationOn a certain vector crank modulo 7
On a certain vector crank modulo 7 Michael D Hirschhorn School of Mathematics and Statistics University of New South Wales Sydney, NSW, 2052, Australia mhirschhorn@unsweduau Pee Choon Toh Mathematics &
More informationinv lve a journal of mathematics 2009 Vol. 2, No. 1 Atoms of the relative block monoid mathematical sciences publishers
inv lve a journal of mathematics Atoms of the relative block monoid Nicholas Baeth and Justin Hoffmeier mathematical sciences publishers 2009 Vol. 2, No. INVOLVE 2:(2009 Atoms of the relative block monoid
More informationON UNIVERSAL SUMS OF POLYGONAL NUMBERS
Sci. China Math. 58(2015), no. 7, 1367 1396. ON UNIVERSAL SUMS OF POLYGONAL NUMBERS Zhi-Wei SUN Department of Mathematics, Nanjing University Nanjing 210093, People s Republic of China zwsun@nju.edu.cn
More informationSquares in products with terms in an arithmetic progression
ACTA ARITHMETICA LXXXVI. (998) Squares in products with terms in an arithmetic progression by N. Saradha (Mumbai). Introduction. Let d, k 2, l 2, n, y be integers with gcd(n, d) =. Erdős [4] and Rigge
More informationTHESIS. Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University
The Hasse-Minkowski Theorem in Two and Three Variables THESIS Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University By
More informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
More informationNumber Theory: Niven Numbers, Factorial Triangle, and Erdos' Conjecture
Sacred Heart University DigitalCommons@SHU Mathematics Undergraduate Publications Mathematics -2018 Number Theory: Niven Numbers, Factorial Triangle, and Erdos' Conjecture Sarah Riccio Sacred Heart University,
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 informationAbstract In this paper I give an elementary proof of congruence identity p(11n + 6) 0(mod11).
An Elementary Proof that p(11n + 6) 0(mod 11) By: Syrous Marivani, Ph.D. LSU Alexandria Mathematics Department 8100 HWY 71S Alexandria, LA 71302 Email: smarivani@lsua.edu Abstract In this paper I give
More informationProcedure for Graphing Polynomial Functions
Procedure for Graphing Polynomial Functions P(x) = a nx n + a n-1x n-1 + + a 1x + a 0 To graph P(x): As an example, we will examine the following polynomial function: P(x) = 2x 3 3x 2 23x + 12 1. Determine
More informationDiscrete Math I Exam II (2/9/12) Page 1
Discrete Math I Exam II (/9/1) Page 1 Name: Instructions: Provide all steps necessary to solve the problem. Simplify your answer as much as possible. Additionally, clearly indicate the value or expression
More information5-DESIGNS IN AFFINE SPACES
PACIFIC JOURNAL OF MATHEMATICS Vol. 39, No. 3, 1971 5-DESIGNS IN AFFINE SPACES W 0. ALLTOP The ^-dimensional affine group over GF{2) is triply transitive on 2 n symbols. For n ^ 4, 4 ^ k ^ 2 n ~\ any orbit
More informationTRANSVERSALS OF LATIN SQUARES AND THEIR GENERALIZATIONS
PACIFIC JOURNAL OF MATHEMATICS Vol. 59, No. 2, 1975 TRANSVERSALS OF LATIN SQUARES AND THEIR GENERALIZATIONS S. K. STEIN The main theme in this paper is the existence of a transversal with many distinct
More informationEXACT ENUMERATION OF GARDEN OF EDEN PARTITIONS. Brian Hopkins Department of Mathematics and Physics, Saint Peter s College, Jersey City, NJ 07306, USA
EXACT ENUMERATION OF GARDEN OF EDEN PARTITIONS Brian Hopkins Department of Mathematics and Physics, Saint Peter s College, Jersey City, NJ 07306, USA bhopkins@spc.edu James A. Sellers Department of Mathematics,
More informationSOME CONGRUENCES FOR PARTITION FUNCTIONS RELATED TO MOCK THETA FUNCTIONS ω(q) AND ν(q) S.N. Fathima and Utpal Pore (Received October 13, 2017)
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 47 2017), 161-168 SOME CONGRUENCES FOR PARTITION FUNCTIONS RELATED TO MOCK THETA FUNCTIONS ωq) AND νq) S.N. Fathima and Utpal Pore Received October 1, 2017) Abstract.
More informationON THE SLACK EULER PAIR FOR VECTOR PARTITION
#A7 INTEGERS 18 (2018 ON THE SLACK EULER PAIR FOR VECTOR PARTITION Shishuo Fu College of Mathematics and Statistics, Chongqing University, Huxi Campus, Chongqing, P.R. China. fsshuo@cqu.edu.cn Ting Hua
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationAN UPPER BOUND FOR ODD PERFECT NUMBERS. Pace P. Nielsen Department of Mathematics, University of California, Berkeley, CA 94720, U.S.A.
AN UPPER BOUND FOR ODD PERFECT NUMBERS Pace P. Nielsen Department of Mathematics, University of California, Berkeley, CA 94720, U.S.A. pace@math.berkeley.edu Received:1/31/03, Revised: 9/29/03, Accepted:
More informationGroup divisible designs in MOLS of order ten
Des. Codes Cryptogr. (014) 71:83 91 DOI 10.1007/s1063-01-979-8 Group divisible designs in MOLS of order ten Peter Dukes Leah Howard Received: 10 March 011 / Revised: June 01 / Accepted: 10 July 01 / Published
More informationRow and Column Distributions of Letter Matrices
College of William and Mary W&M ScholarWorks Undergraduate Honors Theses Theses, Dissertations, & Master Projects 5-2016 Row and Column Distributions of Letter Matrices Xiaonan Hu College of William and
More informationNew infinite families of Candelabra Systems with block size 6 and stem size 2
New infinite families of Candelabra Systems with block size 6 and stem size 2 Niranjan Balachandran Department of Mathematics The Ohio State University Columbus OH USA 4210 email:niranj@math.ohio-state.edu
More informationWhat is the crank of a partition? Daniel Glasscock, July 2014
What is the crank of a partition? Daniel Glasscock, July 2014 These notes complement a talk given for the What is...? seminar at the Ohio State University. Introduction The crank of an integer partition
More informationELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS
Bull Aust Math Soc 81 (2010), 58 63 doi:101017/s0004972709000525 ELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS MICHAEL D HIRSCHHORN and JAMES A SELLERS (Received 11 February 2009) Abstract
More informationTHE NUMBER OF LOCALLY RESTRICTED DIRECTED GRAPHS1
THE NUMBER OF LOCALLY RESTRICTED DIRECTED GRAPHS1 LEO KATZ AND JAMES H. POWELL 1. Preliminaries. We shall be concerned with finite graphs of / directed lines on n points, or nodes. The lines are joins
More informationarxiv: v2 [math.nt] 21 Mar 2018
PROOF OF BERTRAND S POSTULATE FOR n 6 MANOJ VERMA arxiv:40.468v [math.nt] Mar 08 Abstract. We add a few ideas to Erdős s proof of Bertrand s Postulate to produce one using a little calculus but requiring
More informationWHAT IS SPECIAL ABOUT THE DIVISORS OF 24?
WHAT IS SPECIAL ABOUT THE DIVISORS OF 24? SUNIL K. CHEBOLU It is a miracle that the human mind can string a thousand arguments together without getting itself into contradictions. 1. Introduction Eugene
More informationMATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals
MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real
More informationSHORT PATHS IN 3-UNIFORM QUASI-RANDOM HYPERGRAPHS. Joanna Polcyn. Department of Discrete Mathematics Adam Mickiewicz University
Discussiones Mathematicae Graph Theory 24 (2004 ) 469 484 SHORT PATHS IN 3-UNIFORM QUASI-RANDOM HYPERGRAPHS Joanna Polcyn Department of Discrete Mathematics Adam Mickiewicz University Poznań e-mail: joaska@amu.edu.pl
More informationProofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 1, 018 Outline Non POMI Based s Some Contradiction s Triangle
More informationDecember 20, :48 ws-book9x6 Book Title dice page 1
December 0, 06 5:48 ws-book9x6 Book Title dice page Generating Functions vs Elementary Methods: Loaded Dice by Miguel Berlanga, Santa Rosa Junior College William Gasarch, University of Maryland at College
More informationWritten Homework # 2 Solution
Math 517 Spring 2007 Radford Written Homework # 2 Solution 02/23/07 Throughout R and S are rings with unity; Z denotes the ring of integers and Q, R, and C denote the rings of rational, real, and complex
More informationON DIVISIBILITY OF SOME POWER SUMS. Tamás Lengyel Department of Mathematics, Occidental College, 1600 Campus Road, Los Angeles, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (007, #A4 ON DIVISIBILITY OF SOME POWER SUMS Tamás Lengyel Department of Mathematics, Occidental College, 600 Campus Road, Los Angeles, USA
More informationOn non-antipodal binary completely regular codes
On non-antipodal binary completely regular codes J. Borges, J. Rifà Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, 08193-Bellaterra, Spain. V.A. Zinoviev Institute
More informationSECTION Types of Real Numbers The natural numbers, positive integers, or counting numbers, are
SECTION.-.3. Types of Real Numbers The natural numbers, positive integers, or counting numbers, are The negative integers are N = {, 2, 3,...}. {..., 4, 3, 2, } The integers are the positive integers,
More informationCOMPOSITIONS AND FIBONACCI NUMBERS
COMPOSITIONS AND FIBONACCI NUMBERS V. E. HOGGATT, JR., and D. A. LIND San Jose State College, San Jose, California and University of Cambridge, England 1, INTRODUCTION A composition of n is an ordered
More informationRAINBOW 3-TERM ARITHMETIC PROGRESSIONS. Veselin Jungić Department of Mathematics, Simon Fraser University, Burnaby, B.C., Canada.
RAINBOW 3-TERM ARITHMETIC PROGRESSIONS Veselin Jungić Department of Mathematics, Simon Fraser University, Burnaby, B.C., Canada vjungic@sfu.ca Radoš Radoičić Department of Mathematics, MIT, Cambridge,
More informationNumbers and their divisors
Chapter 1 Numbers and their divisors 1.1 Some number theoretic functions Theorem 1.1 (Fundamental Theorem of Arithmetic). Every positive integer > 1 is uniquely the product of distinct prime powers: n
More informationVertex colorings of graphs without short odd cycles
Vertex colorings of graphs without short odd cycles Andrzej Dudek and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513, USA {adudek,rramadur}@andrew.cmu.edu
More informationOnline Interval Coloring and Variants
Online Interval Coloring and Variants Leah Epstein 1, and Meital Levy 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. Email: lea@math.haifa.ac.il School of Computer Science, Tel-Aviv
More informationON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS
Acta Math. Univ. Comenianae Vol. LXXXVII, 2 (2018), pp. 291 299 291 ON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS B. FARHI Abstract. In this paper, we show that
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 informationON PARTITION FUNCTIONS OF ANDREWS AND STANLEY
ON PARTITION FUNCTIONS OF ANDREWS AND STANLEY AE JA YEE Abstract. G. E. Andrews has established a refinement of the generating function for partitions π according to the numbers O(π) and O(π ) of odd parts
More informationinto B multisets, or blocks, each of cardinality K (K V ), satisfying
,, 1{8 () c Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Balanced Part Ternary Designs: Some New Results THOMAS KUNKLE DINESH G. SARVATE Department of Mathematics, College of Charleston,
More informationIntroduction to proofs. Niloufar Shafiei
Introduction to proofs Niloufar Shafiei proofs Proofs are essential in mathematics and computer science. Some applications of proof methods Proving mathematical theorems Designing algorithms and proving
More informationComputer Science Section 1.6
Computer Science 180 Solutions for Recommended Exercises Section 1.6. Let m and n be any two even integers (possibly the same). Then, there exist integers k and l such that m = k and n = l. Consequently,
More informationNON-NEGATIVE INTEGER LINEAR CONGRUENCES. 1. Introduction We consider the problem of finding all non-negative integer solutions to a linear congruence
NON-NEGATIVE INTEGER LINEAR CONGRUENCES JOHN C. HARRIS AND DAVID L. WEHLAU arxiv:math/0409489v1 [math.nt] 24 Sep 2004 Abstract. We consider the problem of describing all non-negative integer solutions
More informationAsymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shapes, and column strict arrays
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8:, 06, #6 arxiv:50.0890v4 [math.co] 6 May 06 Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard
More information1 Reals are Uncountable
CS 30: Discrete Math in CS (Winter 2019): Lecture 6 Date: 11th January, 2019 (Friday) Topic: Uncountability and Undecidability Disclaimer: These notes have not gone through scrutiny and in all probability
More information*!5(/i,*)=t(-i)*-, fty.
ON THE DIVISIBILITY BY 2 OF THE STIRLING NUMBERS OF THE SECOND KIND T* Lengyel Occidental College, 1600 Campus Road., Los Angeles, CA 90041 {Submitted August 1992) 1. INTRODUCTION In this paper we characterize
More informationm-gapped Progressions and van der Waerden Numbers
m-gapped Progressions and van der Waerden Numbers Carleton College October 17, 2016 Background Definition An r-coloring on a set A is a function µ : A {1, 2,...r}. Equivalently, an r-coloring is a partition
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 informationEdge Isoperimetric Theorems for Integer Point Arrays
Edge Isoperimetric Theorems for Integer Point Arrays R. Ahlswede, S.L. Bezrukov Universität Bielefeld, Fakultät für Mathematik Postfach 100131, 33501 Bielefeld, Germany Abstract We consider subsets of
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics GENERALIZATIONS OF THE ROGERS-RAMANUJAN IDENTITIES HENRY LUDWIG ALDER Vol. 4, No. 2 June 1954 GENERALIZATIONS OF THE ROGERS-RAMANUJAN IDENTITIES HENRY L.ALDER 1. Introduction.
More informationarxiv: v1 [math.co] 25 Nov 2018
The Unimodality of the Crank on Overpartitions Wenston J.T. Zang and Helen W.J. Zhang 2 arxiv:8.003v [math.co] 25 Nov 208 Institute of Advanced Study of Mathematics Harbin Institute of Technology, Heilongjiang
More informationMOCK THETA FUNCTIONS AND THETA FUNCTIONS. Bhaskar Srivastava
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 36 (2007), 287 294 MOCK THETA FUNCTIONS AND THETA FUNCTIONS Bhaskar Srivastava (Received August 2004). Introduction In his last letter to Hardy, Ramanujan gave
More informationProof of Euler's φ (Phi) Function Formula
Rose-Hulman Undergraduate Mathematics Journal Volume 14 Issue 2 Article 6 Proof of Euler's φ (Phi Function Formula Shashank Chorge Mumbai University, chorgeshashank@yahoo.co.in Juan Vargas UNC Charlotte,
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationCOMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS
COMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS A. KNOPFMACHER, M. E. MAYS, AND S. WAGNER Abstract. A composition of the positive integer n is a representation of n as an ordered sum of positive integers
More informationRelating minimum degree and the existence of a k-factor
Relating minimum degree and the existence of a k-factor Stephen G Hartke, Ryan Martin, and Tyler Seacrest October 6, 010 Abstract A k-factor in a graph G is a spanning regular subgraph in which every vertex
More informationSolution Set 2. Problem 1. [a] + [b] = [a + b] = [b + a] = [b] + [a] ([a] + [b]) + [c] = [a + b] + [c] = [a + b + c] = [a] + [b + c] = [a] + ([b + c])
Solution Set Problem 1 (1) Z/nZ is the set of equivalence classes of Z mod n. Equivalence is determined by the following rule: [a] = [b] if and only if b a = k n for some k Z. The operations + and are
More informationFINITE GROUPS IN WHICH SOME PROPERTY OF TWO-GENERATOR SUBGROUPS IS TRANSITIVE
FINITE GROUPS IN WHICH SOME PROPERTY OF TWO-GENERATOR SUBGROUPS IS TRANSITIVE COSTANTINO DELIZIA, PRIMOŽ MORAVEC, AND CHIARA NICOTERA Abstract. Finite groups in which a given property of two-generator
More informationLEVEL MATRICES G. SEELINGER, P. SISSOKHO, L. SPENCE, AND C. VANDEN EYNDEN
LEVEL MATRICES G. SEELINGER, P. SISSOKHO, L. SPENCE, AND C. VANDEN EYNDEN Abstract. Let n > 1 and k > 0 be fixed integers. A matrix is said to be level if all its column sums are equal. A level matrix
More informationOn the Equation =<#>(«+ k)
MATHEMATICS OF COMPUTATION, VOLUME 26, NUMBER 11, APRIL 1972 On the Equation =(«+ k) By M. Lai and P. Gillard Abstract. The number of solutions of the equation (n) = >(n + k), for k ä 30, at intervals
More informationRamanujan-type congruences for broken 2-diamond partitions modulo 3
Progress of Projects Supported by NSFC. ARTICLES. SCIENCE CHINA Mathematics doi: 10.1007/s11425-014-4846-7 Ramanujan-type congruences for broken 2-diamond partitions modulo 3 CHEN William Y.C. 1, FAN Anna
More informationMonochromatic Solutions to Equations with Unit Fractions
Monochromatic Solutions to Equations with Unit Fractions Tom C. Brown and Voijtech Rödl Citation data T.C. Brown and V. Rödl, Monochromatic solutions to equations with unit fractions, Bull. Aus. Math.
More informationThis paper was published in Connections in Discrete Mathematics, S. Butler, J. Cooper, and G. Hurlbert, editors, Cambridge University Press,
This paper was published in Connections in Discrete Mathematics, S Butler, J Cooper, and G Hurlbert, editors, Cambridge University Press, Cambridge, 2018, 200-213 To the best of my knowledge, this is the
More informationPacking of Rigid Spanning Subgraphs and Spanning Trees
Packing of Rigid Spanning Subgraphs and Spanning Trees Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti December 14, 2011 Abstract We prove that every 6k + 2l, 2k-connected simple graph contains
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 informationSpecial Pythagorean Triangles and Pentagonal Numbers
Special Pythagorean Triangles and Pentagonal Numbers Mita Darbari m.darbari@rediffmail.com Department of Mathematics St. Aloysius College, Jabalpur India Abstract: The objective of this paper is to show
More information(3,1) Methods of Proof
King Saud University College of Sciences Department of Mathematics 151 Math Exercises (3,1) Methods of Proof 1-Direct Proof 2- Proof by Contraposition 3- Proof by Contradiction 4- Proof by Cases By: Malek
More informationCOMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES. James McLaughlin Department of Mathematics, West Chester University, West Chester, PA 19383, USA
COMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES James McLaughlin Department of Mathematics, West Chester University, West Chester, PA 9383, USA jmclaughl@wcupa.edu Andrew V. Sills Department of Mathematical
More informationPARITY OF THE PARTITION FUNCTION. (Communicated by Don Zagier)
ELECTRONIC RESEARCH ANNOUNCEMENTS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 1, Issue 1, 1995 PARITY OF THE PARTITION FUNCTION KEN ONO (Communicated by Don Zagier) Abstract. Let p(n) denote the number
More informationOn Partition Functions and Divisor Sums
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 5 (2002), Article 02.1.4 On Partition Functions and Divisor Sums Neville Robbins Mathematics Department San Francisco State University San Francisco,
More informationOn Subsequence Sums of a Zero-sum Free Sequence
On Subsequence Sums of a Zero-sum Free Sequence Fang Sun Center for Combinatorics, LPMC Nankai University, Tianjin, P.R. China sunfang2005@1.com Submitted: Jan 1, 2007; Accepted: Jul 18, 2007; Published:
More information