Odd multiperfect numbers of abundancy four
|
|
- Nathan Harrington
- 5 years ago
- Views:
Transcription
1 Odd multiperfect numbers of abundancy four Kevin A. Broughan and Qizhi Zhou University of Waikato, Hamilton, New Zealand Version: th December MSC000: A05, A5, N99. Key words: odd multiply perfect number, abundancy, Euler factor.. INTRODUCTION We say a number is multiperfect of abundancy k (or k-perfect) if (N) = kn. No k-perfect odd numbers are known for any k, and it is believed that none exist. For a survey of known results see [6] or [3] and the references given there. For example, if N is odd and 4-perfect then N has at least distinct prime factors. If it is also not divisible by 3 then it has at least 4 prime factors. In this paper we consider properties of classes of odd numbers which must be satised if they are to be 4-perfect. Conversely, properties of classes which can never be 4-perfect. In a number of cases theorems follow, with some changes, in the pattern of corresponding results for -perfect numbers. However, mostly because of the number of primes involved, some of those techniques, from the theory of -perfect numbers, are not so readily available. We show that Euler's structure theorem, that every odd -perfect number has the shape N = q e p pm m, where q e mod 4, has an extension to odd 4-perfect numbers, and then to odd k -perfect numbers. For 4-perfect numbers there are three possible shapes like Euler's form, (A) with q's instead of, (B) with q 3 mod 8 and e mod 4, and (C) with q mod 4 and e 3 mod 8. An immediate corollary is that no square or square free number is 4-perfect. For k -perfect numbers we need to derive a fact, which could be of independent interest. For j, odd primes p and odd e, we have j jj(p e ) if and only if j+ jj(p + )(e + ). We include negative results (i.e. shapes which no odd 4-perfect number can have) for odd 4-perfect cubes, numbers with 9 being the maximum
2 BROUGHAN AND ZHOU power of 3 dividing N, numbers with each of the p i occurring to the power, and a positive result on the power of 3 dividing any odd k -perfect number.. RESTRICTED FORMS FOR AN ODD PERFECT NUMBER OF ABUNDANCY 4 We begin with two lemmas, summarizing well known results. Lemma.. Let d and n be whole numbers and p a prime number. If d + j n + then (p d ) j (p n ). Lemma.. (Congruences modulo 3) Let p be an odd prime with p 6= 3. () Let j be any natural number and p > 3 an odd prime. Then (p 6j ) mod 3. () Let the whole number j be odd. If p mod 3 then (p 3j ) mod 3. If p mod 3 then (p 3j ) 0 mod 3. (3) Let j be a natural number. If p mod 3 then (p +3j ) mod 3. If p mod 3 then (p +3j ) 0 mod 3 if j is even and (p +3j ) mod 3 if j is odd. (4) Let j be any natural number. If p mod 3 then (p +3j ) 0 mod 3. If p mod 3 then (p +3j ) mod 3 if j is even and (p +3j ) 0 mod 3 if j is odd. This set of results is best summarized in a table, with the rows corresponding to values of p modulo 3, in the rst column, and the columns the values of (p e ) mod 3 for values of e modulo 6 which are in the rst row: p=e Theorem.. (Euler equivalent) Let N be an odd 4-perfect number. Then N has one of the following forms, where the i are whole numbers and the p i odd primes: (A) N = q e qe p p m m for primes q i and whole numbers e i with q i e i mod 4. In the remaining types N = q e p p m m where:
3 ODD FOUR-PERFECT NUMBERS 3 (B) q mod 4 and e 3 mod 8 or (C) q 3 mod 8 and e mod 4. Proof. () Let N = p pm m where the p i are odd primes and the i whole numbers. Then (N) = 4N implies jj(p ) (pm m ) so either is the maximum power of two dividing two distinct terms in the product and the remaining terms are odd, or is the maximum power dividing one term and the remaining terms are odd. So type (A) is the former shape and (B) and (C) the latter. Therefore we need only consider primes q and powers such that jj(q ). () Claim: If q mod 4 and 3 mod 8 then 4 j (q ). To see this let = 3 + 8e and q = + 4x then (where f and y are integers) (q ) = ( + 4x)4+8e 4x = ( + 4x)4f 4x = 4f 4x (4x 4f + = 4g (4x) + (4x) 3 y) so 4 j (q ). (3) In the same situation as in (), 8 - (q ): Write (q ) = + q + q + q q 3+8e ; group the 4 + 8e terms in + e sets of 4 terms, so that (q ) ( + q + q + q 3 )( + e) mod 8; where we have used q 4 mod 8. Replacing q by + 4x and reducing modulo 8 we get (q ) 4 ( + e) mod 8, which is non-zero, so 8 - (q ). (4) Claim: If q 3 mod 8 and mod 4 then 4 j (q ). Let = +4e and q = 3 + 8x then (where f; y; z and w are integers) (q ) = (3 + 8x)f where f is odd + 8x = ( + y)f where y is odd y = f y (y f + (y) + ) = f + f(f )y + 4z = 4w
4 4 BROUGHAN AND ZHOU so 4 j (q ). (5) In the same situation as in (4) 8 - (q ): write (q ) = q+4e + 8x q (3 + 8x) 4 mod 8: so, again 8 - (q ). (6) The remainder of the proof consists in showing the above cases constitute the only possibilities by examining in turn the possible additional values of fq; eg modulo 8. In summary, using the notation q e for the values of q and e modulo 8, and using the same techniques as used in parts (), (3) and (4) of the proof, the cases ; 5 ; 5 ; 5 5 give 4 - (q e ). The cases 7 ; 3 3 ; 3 7 ; 5 7 ; 7 ; 7 3 ; 7 5 ; 7 7 give 8 j (p e ), so cannot occur. The remaining cases 5 3 ; 3 5 are covered by (B) and (C). Corollary.. No square or square free number is odd and 4-perfect. Proof. Since the exponents of the leading primes are odd, and one of the three forms is always present, the rst part of the claim is immediate. For the second part we need only consider the special forms N = q q and N = q, where the q i are odd primes to see that m 6= 0, so no odd 4-perfect number is square free. It might be of interest to speculate, on the basis of Euler's theorem and the above, on the general form for division of (p ) by powers of. However for powers 3, and beyond, the situation appears to be well structured but mysterious. For example, in the following each pair corresponds to the classes modulo 4 of an odd prime and odd exponent (p; e) such that 3 jj(p e ). The list appears to be complete for this power of : (; 7); (3; 3); (3; ); (5; 7); (7; ); (7; 5); (7; 9); (7; 3); (9; 7); (; 3); (; ); (3; 7): Note that in each case 4 jj(p + )(e + ). It is a beautiful fact that this is true in general for all powers of. Theorem.. (P + E + ) For all odd primes p, powers j and odd exponents e > 0 we have j jj(p e ) () j+ jj(p + )(e + ):
5 ODD FOUR-PERFECT NUMBERS 5 Proof. () Let j jj(p e ). First expand p to base : p = + e + e + + j+ ; where f0g [ N and e i f0; g. There exits a minimum i with i j so that since otherwise so p = i + 0: i + + j+ p = j + j+ mod j+ (p e ) = + p + p + + p e + 0 mod j+ so j+ j(p e ) which is impossible. Hence we can write p = i + i+ ; f0g [ N: Therefore p + = i o where here, and in what follows, \o" represents a generic odd integer, with not necessarily the same value in a given expression. Since e + is even, there exists an l such that e + = l o. Since j jj(p e ) we have p l o p = j o and therefore ( i o ) l o = j o ( i o ). Call this equation (). (a) If i > examine both sides of equation () in base and equate the lowest powers of. This leads to i + l = j + since i o = o. Therefore l = j i +. (b) If i = write p + = :o so p = k o for some k. Hence, because j jj(p e ), p l o ( + k o) l o = j k o = j+k o so, again comparing the lowest powers of on both sides, k + l = j + k so l = j = j +. Hence, for all i, l = j i + and we can write p = i + i+ x e = j i+ + j+ i+ y
6 6 BROUGHAN AND ZHOU where x; y are integers. Hence (p + )(e + ) = j+ ( + x)( + y) so j+ jj(p + )(e + ). () Conversely, let j+ jj(p + )(e + ) so for some i > 0, i jjp + and j+ i jje +. We now consider two cases, depending on the values if i and j. (a) Let i = and j =. (This is really Euler's theorem). In this case p + = o = (x + ) so p = 4x + and e + = o. Therefore (p e ) = p o p = po p (po + ) = ( + p + + p o )((4x + ) o + ) = o (4y + ) = o so jj(p e ). (b) Let i = and j >. Again p = 4x +. The inductive hypothesis is that for all j 0 < j, j0 jj(p j0 o )=(p j o (p e ) = p p ). Then (p j o + ) = j o((4x + ) j o + ) = j o(4y + ) = j o so in this case also j jj(p e ). (3) First we make some preliminary polynomial constructions where all polynomials are in Z[x]. For n N dene f n ; q n ; s n ; r n by Then f n (x) = ( + x) n = xq n (x) s n (x) = ( + x) n + = (x + )r n (x) for n odd: f o = (( + x) o )(( + x) o + ) = x r o (x) (x + ) q o (x); and for l f l o = f l o(x) s l o(x) = s l o(x) s l o(x) s o (x)x(x + ) r o (x) q o (x) s l o = ((( + x) l ) o ( )) = (( + x) l ( ))((( + x) l ) o + + ) = (( + x) l + )( )
7 ODD FOUR-PERFECT NUMBERS 7 Since i >, x = i o = o. Hence x + = o + = o and s l o = (o l + )(an even number of odd terms + ) = o o = o; and x + = i o. Note also that r o (x) = (( + y) o )=(y) = o + z = o and q o (x) = (( + x) o )=(x + ) = (o o o o + ) = o. Therefore, with this value of x l o x = l o i o o o = l+i o: Now, at last, we can complete the proof. Let x = p = i o and l = j + i. Then so j jj(p e ). (p e ) = pe+ p = l ( + x) o x = f l o (x) = l+i o = j o Corollary.. Let M q be a Mersenne prime and e odd with e. If j jj(mq e ) then j q. From the theorem we also get the following corollary, which is an extension of Euler's theorem to perfect numbers of abundancy k. Corollary.3. Let N be odd and k -perfect. Then there exists a partition of k, k = k + + k n, with k i, such that N = ny i= p ei i where the e i are odd, the p i ; q j odd primes, and for each i with i n there exist positive integers l i and m i such that li jjp i +, mi jje i + and l i + m i = k i +. my j= q fj j Theorem.3. (Cubes) Let N be an odd cube with 3 - N. (A) If N has shape N = q +4e q +4e p pm m and q 5 mod (i.e. q mod 4 and mod 3) and q mod 4, then N is not a 4-perfect number.
8 8 BROUGHAN AND ZHOU and q mod 4 (i.e. (B) If N has shape N = q +4e p p m m q 3 mod 8 and mod 3), then N is not a 4-perfect number. (C) If N has shape N = q 3+8e p p m m mod 4 and mod 3), then N is not a 4-perfect number. and q 5 mod (i.e. q Proof. (C) Let N be an odd and 4-perfect cube with q mod 3. Then we can write: (N) = (q 3+4e )(p 6 ) (p 6m m ): By Lemma., the rst factor on the right is congruent to 0 modulo 3, so (N) 0 mod 3. Since (N) = 4N, 0 q 3+4e p 6 p 6m m mod 3; but each factor on the right hand side is non-zero modulo three. Hence N is not 4-perfect. In parts (A) and (B) the result also follows since (q 3+6f ) 0 mod 3. Theorem.4. (Nine is the maximum power of three dividing N) If N is a whole number with 3 jjn and such that if 3, 6 and 97 appear in the prime factorization of N, they do so to powers congruent to modulo 6. Then N is not an odd 4-perfect number. Proof. Let the hypotheses of the theorem hold for N, but let it also be odd and 4-perfect. Then 3 jjn implies (3 ) = 3 j N. So 3 must appear, and by the argument given below, 6 and 97 must also appear. Now, by Lemma., for all primes p and natural numbers e, (p ) j (p +6e ). So 3 6 = (3 ) j (3 ) j N, for some, which implies 3 6 j N. Again = (6 ) j (6 ) j N, for some, which implies j N. Finally = (97 ) j (97 ) j N, for some, so 3 j N. Now if 3, 6 or 97 appear, even though each is congruent to modulo 4, their powers, being congruent to modulo 6, are even, so must appear amongst the p i in each of the three shapes given in Theorem.. Therefore 3 3 j N, which is a contradiction. Therefore N is not 4-perfect. The following result uses techniques similar to those developed for - perfect numbers by Steuerwald in [8]. Theorem.5. (Small powers) () If N is odd, 3 j N and N has the shape either (a) N = q +4e q +4e 3 p p m or (b) N = q3+8e 3 p p m where, in either case, q i mod 4, or (c) q +4e 3 p p m, where q 3 mod 8, where the primes are distinct, then N is not an odd 4-perfect number.
9 ODD FOUR-PERFECT NUMBERS 9 () If N is odd, 3 - N and N has the shape either (a) N = q 3+8e p p m with q mod 4 or (b) N = q+4e p p m with q 3 mod 8, or (c) N = q +4e q +4e p p m, with q i mod 4, then N is not a 4-perfect number. Proof. () Let N satisfy (N) = 4N. Then (3 ) = 3 j N. In case (c), q is not in the set f3; 6; 97g. Assume rst that the q i are not in this set in cases (a) and (b). (Below we consider the situation which arises when a q i is in this set.) Under this assumption we obtain the chain: (3 ) = 3 6; (6 ) = ; (97 ) = 3 369; so 3 3 j N, which is false. Hence N is not 4-perfect. Since the exponent of each q i is odd, for q = q or q, e = e or e, q + j (q e ). If q = 3, since q + j N we obtain the chain: (7 ) = 3 9 j N; (9 ) = 3 7 j N; (7 ) = j N; giving 3 3 j N, which is false. If q = 6 we can assume also (3 ) = 3 6 j N. Again, since q + j N We obtain the chain: (3 ) = 3 33 j N; (33 ) = j N; (7 ) = j N; again giving 3 3 j N, which is false. If q = 97 then (q + )= = 7 j N and the same chain as in the q = 3 case can be derived with the same conclusion. Thus our assumption that no q i is in the set f3; 6; 97g is valid and the proof is complete. (a) and (b): Let N satisfy (N) = 4N and 3 - N, with shape N = q f p p m; where 3 < p < < p m and f is odd. Since, for each i, (p i ) = + p i + p i and 3 - N, we must have p i mod 3. By Theorem., q is congruent to modulo 4 or 3 modulo 8. Because f is odd, q + j (q f ) j N and since also 3 - N we cannot have q mod 3, so must have q mod 3. Since (p ) < (p + ) < p, (p ) is divisible by at most one p i. Therefore either (a) (p ) = q g with g or (b) (p ) = q g p i for some i. Case (b) is impossible, since it is invalid modulo 3. In case (a), [, Lemma ] shows the only possibility is g =.
10 0 BROUGHAN AND ZHOU Let x = (q + )=. Then x mod 3. Since x is too small to include a power of at least two q's, it must be a product of the p i. We cannot have x = p i since p i mod 3, so it must have at least prime factors, with the smallest factor being less than or equal to p x, and therefore p i p x for some i. But then q = + p + p + p i + p i + p x + x q + 3 r q + + so q = 5 or q = 7. Each of these is impossible since q mod 4 and mod 3 or q 3 mod 8. (c): Now let N = q +4e q +4e p p m, be odd and 4-perfect with 3 - N. Since (N) = 4N we can write: (q +4e )(q +4e )(+p +p )( )(+p m +p m) = 4q +4e q +4e p p m: Considering this equation modulo 3 shows each p i mod 3 and then (q +4e )(q +4e ) q +4e q +4e mod 3. But q i mod 3 implies, by Lemma., 3 j (qi +4ei ), which is impossible. This means q mod 3, q mod 3. (Now we modify the argument of Steuerwald, and nd that the Lemma of Brauer is not needed.) Since (p ) < p, (p ) is divisible by at most one of the p i, so we can write (p ) = q g qg p i or (p ) = q g qg or (p ) = q g or (p ) = q g ; where q < q, g i except in the rst case where g i 0. Consideration of these possibilities modulo 3 shows that the rst case cannot occur. Since e is odd, by Lemma., x = q+ j N and x mod 3. Now x is too small to include a q i in its prime factorization, so must be a product of the p i. We cannot have x = p i (consider modulo 3 again), so there must be two or more of the p i in the factorization of x, so there exists an i with p i p x. But then, in all remaining cases, r q + p + p + p i + p i + p q + x + x = + + q + ; so q + q q+ + q+. But this means q must be ; 3; 5 or 7. Each of these is impossible, since q mod 4 and mod 3. This contradiction veries our conclusion (that no such 4-perfect number exists) in this nal case. If we call the leading prime(s) to odd power(s) with special shape the \Euler part" and the rest the \squared part", then the previous result says
11 ODD FOUR-PERFECT NUMBERS that \no odd 4-perfect number exists with squared part a square of a square free number". The following result is based on the technique of Starni [7] whose theorem, for -perfect numbers, had uniform powers for the p i. This, in turn depended on a result of McDaniel [4] (incorrectly cited), where the powers are not uniform. Theorem.6. Let N = 3 Q M i= pi i be odd and k -perfect, where the p i are distinct odd primes with p i > 3, > 0, the Euler factor has any of the forms given by Theorem., and, for all i i 6 mod 3. Then 3 j ( ). Proof. Firstly ((3 ); 3 ) =. Since i 6 mod 3, + i ; 5 mod 6. Since p i ; mod 6, (p i i ) mod 6 if p i mod 6 or (p i i ) + i mod 6 if p i mod 6. But then, subject maybe to some reordering, there exists an m 0 with P := MY i= (p i i ) my i= my i= + i mod 6 + i mod 3: By the given assumption, + i 6 0 mod 3, so P 6 0 mod 3, and thus (P; 3 ) =. But for some whole number k, (N) = k N so therefore Therefore 3 j ( ). ( )(3 )P = k 3 MY i= p i i : REFERENCES. A. Brauer, On the non-existence of odd perfect numbers of the form p a q q t q 4 t,, Bull Amer. Math. Soc. 49 (943), p P. Erdos, Remarks on the number theory II, some problems on the function, Acta Arith. 5 (959), A. Flammenkamp, The Multiply perfect numbers page,
12 BROUGHAN AND ZHOU 4. W. L. McDaniel, The non-existence of odd perfect numbers of a certain form, Arch. Math. 5 (970), W. L. McDaniel and P. Hagis Jr, Some results concerning the non-existence of odd perfect numbers of the form p M, Fibbonacci Quarterly 3 (975), R. Sorli, Multiperfect numbers, 7. P. Starni, On some properties of the Euler's factor of certain odd perfect numbers, J. of Number Theory 6 (006), R. Steuerwald, Verschaeung einer notwendigen Bedingung fuer die Existenz einer ungeraden vollkommenen, Zahl. S.-B Math.-Nat.Kl.Bayer. Akad. Wiss., (937),
NONEXISTENCE OF ODD PERFECT NUMBERS OF A CERTAIN FORM
NONEXISTENCE OF ODD PERFECT NUMBERS OF A CERTAIN FORM Ronald Evans Department of Mathematics, 0112 University of California at San Diego La Jolla, California 92093-0112 revans@ucsd.edu and Jonathan Pearlman
More informationODD REPDIGITS TO SMALL BASES ARE NOT PERFECT
#A34 INTEGERS 1 (01) ODD REPDIGITS TO SMALL BASES ARE NOT PERFECT Kevin A. Broughan Department of Mathematics, University of Waikato, Hamilton 316, New Zealand kab@waikato.ac.nz Qizhi Zhou Department of
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 informationOdd perfect polynomials over F 2
Journal de Théorie des Nombres de Bordeaux 19 (2007), 165 174 Odd perfect polynomials over F 2 par Luis H. GALLARDO et Olivier RAHAVANDRAINY Résumé. Un polynôme A F 2 [x] est dit parfait s il est égal
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More informationWilson s Theorem and Fermat s Little Theorem
Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =
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 informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationOn Dris conjecture about odd perfect numbers
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 513, Online ISSN 367 875 Vol. 4, 018, No. 1, 5 9 DOI: 10.7546/nntdm.018.4.1.5-9 On Dris conjecture about odd perfect numbers Paolo Starni
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationNumber Theory Homework.
Number Theory Homewor. 1. The Theorems of Fermat, Euler, and Wilson. 1.1. Fermat s Theorem. The following is a special case of a result we have seen earlier, but as it will come up several times in this
More informationM381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
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 informationModern Algebra Lecture Notes: Rings and fields set 6, revision 2
Modern Algebra Lecture Notes: Rings and fields set 6, revision 2 Kevin Broughan University of Waikato, Hamilton, New Zealand May 20, 2010 Solving quadratic equations: traditional The procedure Work in
More informationOn the missing values of n! mod p
On the missing values of n! mod p Kevin A. Broughan and A. Ross Barnett University of Waikato, Hamilton, New Zealand Version: 15th Jan 2009 E-mail: kab@waikato.ac.nz, arbus@math.waikato.ac.nz We show that
More informationFlat primes and thin primes
Flat primes and thin primes Kevin A. Broughan and Zhou Qizhi University of Waikato, Hamilton, New Zealand Version: 0th October 2008 E-mail: kab@waikato.ac.nz, qz49@waikato.ac.nz Flat primes and thin primes
More informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationOn Integers for Which the Sum of Divisors is the Square of the Squarefree Core
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 15 (01), Article 1.7.5 On Integers for Which the Sum of Divisors is the Square of the Squarefree Core Kevin A. Broughan Department of Mathematics University
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationCS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II
CS 5319 Advanced Discrete Structure Lecture 9: Introduction to Number Theory II Divisibility Outline Greatest Common Divisor Fundamental Theorem of Arithmetic Modular Arithmetic Euler Phi Function RSA
More informationSome congruences for Andrews Paule s broken 2-diamond partitions
Discrete Mathematics 308 (2008) 5735 5741 www.elsevier.com/locate/disc Some congruences for Andrews Paule s broken 2-diamond partitions Song Heng Chan Division of Mathematical Sciences, School of Physical
More informationDefinition For a set F, a polynomial over F with variable x is of the form
*6. Polynomials Definition For a set F, a polynomial over F with variable x is of the form a n x n + a n 1 x n 1 + a n 2 x n 2 +... + a 1 x + a 0, where a n, a n 1,..., a 1, a 0 F. The a i, 0 i n are the
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 informationQuadratic reciprocity and the Jacobi symbol Stephen McAdam Department of Mathematics University of Texas at Austin
Quadratic reciprocity and the Jacobi symbol Stephen McAdam Department of Mathematics University of Texas at Austin mcadam@math.utexas.edu Abstract: We offer a proof of quadratic reciprocity that arises
More informationMath 261 Spring 2014 Final Exam May 5, 2014
Math 261 Spring 2014 Final Exam May 5, 2014 1. Give a statement or the definition for ONE of the following in each category. Circle the letter next to the one you want graded. For an extra good final impression,
More informationEXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES
#A7 INTEGERS 15A (2015) EXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES Joshua Harrington Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania JSHarrington@ship.edu Lenny
More informationNONABELIAN GROUPS WITH PERFECT ORDER SUBSETS
NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in
More informationMATH 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring
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 informationNotes on Primitive Roots Dan Klain
Notes on Primitive Roots Dan Klain last updated March 22, 2013 Comments and corrections are welcome These supplementary notes summarize the presentation on primitive roots given in class, which differed
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
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 informationArithmetic properties of overcubic partition pairs
Arithmetic properties of overcubic partition pairs Bernard L.S. Lin School of Sciences Jimei University Xiamen 3101, P.R. China linlsjmu@13.com Submitted: May 5, 014; Accepted: Aug 7, 014; Published: Sep
More informationSQUARE PATTERNS AND INFINITUDE OF PRIMES
SQUARE PATTERNS AND INFINITUDE OF PRIMES KEITH CONRAD 1. Introduction Numerical data suggest the following patterns for prime numbers p: 1 mod p p = 2 or p 1 mod 4, 2 mod p p = 2 or p 1, 7 mod 8, 2 mod
More information1. Introduction. Let P and Q be non-zero relatively prime integers, α and β (α > β) be the zeros of x 2 P x + Q, and, for n 0, let
C O L L O Q U I U M M A T H E M A T I C U M VOL. 78 1998 NO. 1 SQUARES IN LUCAS SEQUENCES HAVING AN EVEN FIRST PARAMETER BY PAULO R I B E N B O I M (KINGSTON, ONTARIO) AND WAYNE L. M c D A N I E L (ST.
More informationAn integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.
Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More informationNORTHWESTERN UNIVERSITY Thrusday, Oct 6th, 2011 ANSWERS FALL 2011 NU PUTNAM SELECTION TEST
Problem A1. Let a 1, a 2,..., a n be n not necessarily distinct integers. exist a subset of these numbers whose sum is divisible by n. Prove that there - Answer: Consider the numbers s 1 = a 1, s 2 = a
More informationarxiv:math.nt/ v1 5 Jan 2005
NEW TECHNIQUES FOR BOUNDS ON THE TOTAL NUMBER OF PRIME FACTORS OF AN ODD PERFECT NUMBER arxiv:math.nt/0501070 v1 5 Jan 2005 KEVIN G. HARE Abstract. Let σ(n) denote the sum of the positive divisors of n.
More informationA Generalization of Boolean Rings
A Generalization of Boolean Rings Adil Yaqub Abstract: A Boolean ring satisfies the identity x 2 = x which, of course, implies the identity x 2 y xy 2 = 0. With this as motivation, we define a subboolean
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 information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationMcGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60
McGill University Faculty of Science Solutions to Practice Final Examination Math 40 Discrete Structures Time: hours Marked out of 60 Question. [6] Prove that the statement (p q) (q r) (p r) is a contradiction
More informationEach copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.
On Runs of Residues Author(s): D. H. Lehmer and Emma Lehmer Source: Proceedings of the American Mathematical Society, Vol. 13, No. 1 (Feb., 1962), pp. 102-106 Published by: American Mathematical Society
More informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
More informationCHAPTER 3. Number Theory
CHAPTER 3 Number Theory 1. Factors or not According to Carl Friedrich Gauss (1777-1855) mathematics is the queen of sciences and number theory is the queen of mathematics, where queen stands for elevated
More informationEquidivisible consecutive integers
& Equidivisible consecutive integers Ivo Düntsch Department of Computer Science Brock University St Catherines, Ontario, L2S 3A1, Canada duentsch@cosc.brocku.ca Roger B. Eggleton Department of Mathematics
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 informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationMath 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n.
Math 324, Fall 2011 Assignment 7 Solutions Exercise 1. (a) Suppose a and b are both relatively prime to the positive integer n. If gcd(ord n a, ord n b) = 1, show ord n (ab) = ord n a ord n b. (b) Let
More informationDefinition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively
6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise
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 informationSECOND-ORDER RECURRENCES. Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C
p-stability OF DEGENERATE SECOND-ORDER RECURRENCES Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C. 20064 Walter Carlip Department of Mathematics and Computer
More informationAn Arithmetic Function Arising from the Dedekind ψ Function
An Arithmetic Function Arising from the Dedekind ψ Function arxiv:1501.00971v2 [math.nt] 7 Jan 2015 Colin Defant Department of Mathematics University of Florida United States cdefant@ufl.edu Abstract We
More informationTHE MILLER RABIN TEST
THE MILLER RABIN TEST KEITH CONRAD 1. Introduction The Miller Rabin test is the most widely used probabilistic primality test. For odd composite n > 1 at least 75% of numbers from to 1 to n 1 are witnesses
More informationThe Impossibility of Certain Types of Carmichael Numbers
The Impossibility of Certain Types of Carmichael Numbers Thomas Wright Abstract This paper proves that if a Carmichael number is composed of primes p i, then the LCM of the p i 1 s can never be of the
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 informationRepresenting numbers as the sum of squares and powers in the ring Z n
Representing numbers as the sum of squares powers in the ring Z n Rob Burns arxiv:708.03930v2 [math.nt] 23 Sep 207 26th September 207 Abstract We examine the representation of numbers as the sum of two
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 informationOn the Prime Divisors of Odd Perfect Numbers
On the Prime Divisors of Odd Perfect Numbers Justin Sweeney Department of Mathematics Trinity College Hartford, CT justin.sweeney@trincoll.edu April 27, 2009 1 Contents 1 History of Perfect Numbers 5 2
More informationPartial Sums of Powers of Prime Factors
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 10 (007), Article 07.1.6 Partial Sums of Powers of Prime Factors Jean-Marie De Koninck Département de Mathématiques et de Statistique Université Laval Québec
More informationThe Chinese Remainder Theorem
Chapter 5 The Chinese Remainder Theorem 5.1 Coprime moduli Theorem 5.1. Suppose m, n N, and gcd(m, n) = 1. Given any remainders r mod m and s mod n we can find N such that N r mod m and N s mod n. Moreover,
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 informationPerfect Power Riesel Numbers
Perfect Power Riesel Numbers Carrie Finch a, Lenny Jones b a Mathematics Department, Washington and Lee University, Lexington, VA 24450 b Department of Mathematics, Shippensburg University, Shippensburg,
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 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 information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationMATH10040: Numbers and Functions Homework 1: Solutions
MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3
More 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 informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More 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 informationMathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.
1. (4.46) Let A and B be sets. Prove that A B = A B if and only if A = B. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. Proof of (1): Suppose
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 informationCONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ω(q) AND ν(q)
CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ωq) AND νq) GEORGE E. ANDREWS, DONNY PASSARY, JAMES A. SELLERS, AND AE JA YEE Abstract. Recently, Andrews, Dixit and Yee introduced partition
More informationMath Homework # 4
Math 446 - Homework # 4 1. Are the following statements true or false? (a) 3 5(mod 2) Solution: 3 5 = 2 = 2 ( 1) is divisible by 2. Hence 2 5(mod 2). (b) 11 5(mod 5) Solution: 11 ( 5) = 16 is NOT divisible
More informationTHE LIND-LEHMER CONSTANT FOR 3-GROUPS. Stian Clem 1 Cornell University, Ithaca, New York
#A40 INTEGERS 18 2018) THE LIND-LEHMER CONSTANT FOR 3-GROUPS Stian Clem 1 Cornell University, Ithaca, New York sac369@cornell.edu Christopher Pinner Department of Mathematics, Kansas State University,
More informationCISC-102 Fall 2017 Week 6
Week 6 page 1! of! 15 CISC-102 Fall 2017 Week 6 We will see two different, yet similar, proofs that there are infinitely many prime numbers. One proof would surely suffice. However, seeing two different
More informationNumber Theory Math 420 Silverman Exam #1 February 27, 2018
Name: Number Theory Math 420 Silverman Exam #1 February 27, 2018 INSTRUCTIONS Read Carefully Time: 50 minutes There are 5 problems. Write your name neatly at the top of this page. Write your final answer
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 informationThe group (Z/nZ) February 17, In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer.
The group (Z/nZ) February 17, 2016 1 Introduction In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer. If we factor n = p e 1 1 pe, where the p i s are distinct
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 informationChapter 1. Number of special form. 1.1 Introduction(Marin Mersenne) 1.2 The perfect number. See the book.
Chapter 1 Number of special form 1.1 Introduction(Marin Mersenne) See the book. 1.2 The perfect number Definition 1.2.1. A positive integer n is said to be perfect if n is equal to the sum of all its positive
More informationCorollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1
4. Primality testing 4.1. Introduction. Factorisation is concerned with the problem of developing efficient algorithms to express a given positive integer n > 1 as a product of powers of distinct primes.
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 informationCHAPTER 6. Prime Numbers. Definition and Fundamental Results
CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n
More informationCONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ω(q) AND ν(q)
CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ωq) AND νq) GEORGE E. ANDREWS, DONNY PASSARY, JAMES A. SELLERS, AND AE JA YEE Abstract. Recently, Andrews, Dixit, and Yee introduced partition
More information, p 1 < p 2 < < p l primes.
Solutions Math 347 Homework 1 9/6/17 Exercise 1. When we take a composite number n and factor it into primes, that means we write it as a product of prime numbers, usually in increasing order, using exponents
More informationORDERS OF UNITS IN MODULAR ARITHMETIC
ORDERS OF UNITS IN MODULAR ARITHMETIC KEITH CONRAD. Introduction If a mod m is a unit then a ϕ(m) mod m by Euler s theorem. Depending on a, it might happen that a n mod m for a positive integer n that
More informationMath 319 Problem Set #2 Solution 14 February 2002
Math 39 Problem Set # Solution 4 February 00. (.3, problem 8) Let n be a positive integer, and let r be the integer obtained by removing the last digit from n and then subtracting two times the digit ust
More informationThe Diophantine equation x n = Dy 2 + 1
ACTA ARITHMETICA 106.1 (2003) The Diophantine equation x n Dy 2 + 1 by J. H. E. Cohn (London) 1. Introduction. In [4] the complete set of positive integer solutions to the equation of the title is described
More informationEXAMPLES OF MORDELL S EQUATION
EXAMPLES OF MORDELL S EQUATION KEITH CONRAD 1. Introduction The equation y 2 = x 3 +k, for k Z, is called Mordell s equation 1 on account of Mordell s long interest in it throughout his life. A natural
More informationSums of Squares. Bianca Homberg and Minna Liu
Sums of Squares Bianca Homberg and Minna Liu June 24, 2010 Abstract For our exploration topic, we researched the sums of squares. Certain properties of numbers that can be written as the sum of two squares
More informationBasic Proof Examples
Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
More informationx 3 2x = (x 2) (x 2 2x + 1) + (x 2) x 2 2x + 1 = (x 4) (x + 2) + 9 (x + 2) = ( 1 9 x ) (9) + 0
1. (a) i. State and prove Wilson's Theorem. ii. Show that, if p is a prime number congruent to 1 modulo 4, then there exists a solution to the congruence x 2 1 mod p. (b) i. Let p(x), q(x) be polynomials
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More information