On generalizing happy numbers to fractional base number systems

Size: px
Start display at page:

Download "On generalizing happy numbers to fractional base number systems"

Transcription

1 On generalizing hay numbers to fractional base number systems Enriue Treviño, Mikita Zhylinski October 17, 018 Abstract Let n be a ositive integer and S (n) be the sum of the suares of its digits. It is well known that if you iterate S enough times you reach a cycle. When the cycle is {1}, then n is called hay. The notion of hay numbers has been generalized to different bases, different owers and even negative bases. In this article we consider generalizations to fractional number bases. Let S e, (n) be the sum of the e-th owers of the digits of n base /. We rove that iterating S e, we show that the number of times the iteration is reuired to reach a cycle can be arbitrarily large. reaches a cycle and, if = or e = 1, 1 Introduction Let n be a ositive integer and S (n) be the sum of the suares of its digits. It is well known (for a comlete roof look at [6]) that if you iterate S enough times you either reach 1 or you reach the cycle When the iteration reaches 1, we say n is hay. A natural generalization is to relace sum of suares of digits, with sums of e-owers for integers e 1. Let S e (n) be the sum of e-th owers of n. If we iterate extensively and reach 1, we say n is an e-ower hay number. The study of which cycles can be reached for 1 e 10 has been done by Grundman and Teele in [3]. Another generalization considered in [3] is to change the base of the number system. Let S e,b (n) be the sum of the e-th owers of the digits of n in base b. The cycles that can be reached by iterating S e,b has been calculated for e {, 3} and bases b 10. The techniues in [3] can easily find the cycles for other choices of e and b. Another generalization is to allow the base b to be a negative number. It turns out that for a ositive integer n, there is a uniue set of digits 0 a i b 1 such that n = r a ib i. Grundman and Harris, in [5], find the cycles reached for b 10 and e =. The authors also study when can you have consecutive elements in an arithmetic rogression be b-hay (it means that the iterations of S,b reach 1 eventually), generalizing work of El-Sedy and Siksek [] and the work of Grundman and Teele [4]. In [1], Bland et al. addressed a series of uestions regarding a generalization of hay numbers to fractional bases. Any number n has a uniue reresentation modulo / when > and gcd(, ) = 1. Namely, there exist 0 a i < such that n = ( ) i a i. 1

2 For our notation, we will say n = a r a r 1 a 1 a 0. Let S e, (n) be the sum of the e-th owers of the digits of n when written in fractional base /, i.e., S e, (n) = a e i. In [1], the authors studied the case when e = and roved that there are no hay numbers greater than 1 for any fractional base. They mainly study the fractional base 3/, finding the ossible cycles that S, 3 can reach. They end the aer with several uestions. The three we will focus on in this aer are the following: 1. Can the cycles for different e-th owers be found for / = 3/?. Can the cycles for different / be found if we restrict e =? 3. Are there ositive integers n of arbitrary height? For the last uestion, we need to exlain what the height of a number is. The height is the number of iterations of S e, that are reuired to reach a cycle. In the case of ositive integer bases, that there are numbers with arbitrary height is relatively simle to rove because you can find an n such that S e,b (n) = k for any ositive integer k by having n be a number with k 1 s in its base b exansion. For examle, let a 1 = 10, then a 1 has height 1 since S (10) = 1. Let a = } 11 {{ 1}. 10 Since S (a ) = 10, then a has height. Let a n = } 11 {{ 1}. a n 1 Then a n has height n. This is a simle rocess to create a seuence of numbers with larger and larger heights by attaching the aroriate number of 1 s to a number. The roblem with fractional bases is that not every choice of digits leads to an integer. For examle 11 3 is not an integer, since Z. We answer the three uestions with a coule of theorems. The first theorem answers two of the uestions. Theorem 1. Let > be ositive integers with gcd(, ) = 1, and let e be a ositive integer. Then, for every ositive integer n, the reeated iterations of the function S e, on n will eventually reach a cycle. In articular, the ossible cycles reached for 1 e 1, / = 3/ can be found in Table, answering the first uestion. Also, the ossible cycles reached for e {, 3, 4} and / {5/, 5/3, 5/4, 7/} are in Table 3, answering the second uestion. The second theorem answers the third uestion for a secial class of fractional bases that includes 3/, and for all fractional bases when e = 1. Theorem. Let > be ositive integers with gcd(, ) = 1, and let e and H be ositive integers. If = or e = 1, then there exists an integer n such that the height of n is H. In section, we will resent useful background on fractional base number systems. In section 3, we rove Theorem 1. Finally, in section 4, we rove Theorem.

3 Fractional base number systems As mentioned in the introduction, for any / with gcd(, ) = 1 and >, for every ositive integer n, there exist fractional digits a 0, a 1,..., a r satisfying 0 a i < such that n = ( ) i a i. We will use the following notation to denote that a i are the fractional digits of n. n = a k a k 1 a k... a a 1 a 0 3. For examle base 3/ uses numbers 0, 1, as digits. Table 1 is a table of numbers in base 3/: n n in base 3/ n n in base 3/ Table 1: The first 1 non-negative integers in the 3/ base number system It is easy to find n given its exansion in base /, but going the other way around is a little harder. Suose we have the number n and we want to find its fractional digits base /. Let n = a k a k 1 a 1 a 0. Then ( ) n a 0 = a k a k 1 a 1 The left side is an integer, so the right side is also an integer. Since gcd(, ) = 1, then a k a k 1 a 1, and so (n a 0 ). Therefore n a 0 mod. There is a uniue a 0 in {0, 1,,, 1} that is congruent to n modulo. But we also have ( ) a k a k 1 a 1 = (n a 0 ). We reeat the rocess and we can say that ( ) n (n a 0 ) a 1 mod. Therefore, we can find a 1. We can reeat this rocess until we reach 0 and find all of the digits of n. We can summarize the algorithm to translate numbers into the fractional base as follows: 1. n 0 = n (mod ). (. n = (n n 0 ) ). 3

4 3. Reeat stes 1 and, until n is zero. As an examle, suose we want to find the digits of 1 in base 3/. First we have 1 0 mod 3, so a 0 = 0. Then we calculate (1 0) = 8. We find 8 mod 3, so a 3 1 =. Then we find (8 ) = 4 and 4 1 mod 3, so a 3 = 1. Then we find (4 1)(/3) = and mod 3, so a 3 =. Since the next ste yields 0, we ve found that 1 = The cycles formed when iterating S e, 3 Numbers n > 1 in fractional base number systems cannot be hay. Indeed suose that n is hay, then S m e, (n) = 1 for some minimal number m. But then k = S m 1 (n) must satisfy e, that the sum of the e-th owers of its digits is 1. Therefore the fractional base exansion of k is But that means k = (/)r for some integer r. This number is not an integer unless r = 0, which would imly k = 1, but we assumed k > 1. While hainess is imossible, we can still search for what cycles the iterations can land on. For us to be able to rove that the determination of cycles is comlete, we need to first rove the following lemma. Lemma 1. Let / satisfy > and gcd(, ) = 1, and let e be a ositive integer. Then, there exists an n such that S e, (n ) n, and S e, (n) < n for all n > n. The values of n for different values of e and / = 3/ can be found in the last column of Table. The values of n for e {, 3, 4} and / {5/, 5/3, 5/4, 7/} are in Table 3. Proof. Let n be a ositive integer. Then so r log (n). But then n = a r a r 1 a 1 a 0 S e, (n) = a e i < Since e is a constant, then eventually = ( a i ) i ( ) r a r ( ) r, e = (r + 1) e (log (n) + 1)e. n > (log (n) + 1)e > S e, (n). (1) Indeed, one can confirm with L Hoital s rule that n/(c log(n)) as n. Therefore, there is a maximum n such that n < S e, (n ). To calculate the recise value of n, we use a comuter to find an N for which (1) is satisfied. Then we evaluate S e, (n) for all n N and record which one is the largest satisfying that n < S e, (n). Proof of Theorem 1. Let S(n) = S e, (n). Let n be as in Lemma 1. Now, for each n n, comute n, S(n), S(S(n)),... until it cycles. The rocess terminates because S(n) < n for 4

5 e Cycles n 1 [1], [] [1], [5, 8, 9] 8 3 [1], [9], [10], [17, 18] 3 4 [1], [51], [5] 77 5 [1], [131], [98, 99] [1], [197, 60, 387, 33, 63, 450], [34, 131, 59] [1], [771, 516, 643, 518] [1], [1539, 775, 184], [187, 1794, 1796, 05], [103], [1033] 73 9 [1], [566], [565] [1], [1047] [1], [1434, 16388, 14344], [14341], [14340] [1], [8678], [8677] 6933 Table : Cycles reached when iterating S e, 3, and the value of n for different values of e. all n > n. For n > n, eventually S k (n) n. Therefore, the cycle n reaches is one that was already comuted. Therefore, we need only find the cycles for n n. The outcome of erforming these calculations for different values of e and / = 3/ is recorded in Table. The outcome of erforming these calculations on e {, 3, 4} with / {5/, 5/3, 5/4, 7/} is recorded in 3. 4 Arbitrary Heights in fractional base number systems The key to our roof of Theorem is showing that there is n such that S e, (n) = k for every large enough k. The following lemma handles the case when =. Lemma. Let e 1 and > be an odd ositive integer. For every integer k e, there exists n, such that S e, (n) = k. Proof. We will rove it by induction. To show that it is ossible for k = e, consider the number. is, therefore S e, () = e. Now suose there exists an even m such that S e, (m) = k for some k e. Let m = b c where b 1 and c is odd. Write m in base / as Then m = a r a r 1 a 1 a 0. ( ) b m + 1 = ar a r 1 a 1 a }{{} 1, b 1 where there are b 1 zero digits. Since m = b c, then (/) b m + 1 is even. Furthermore, since it has the same digits as before with b 1 zeroes added and one 1 added, then the sum of the e-th owers of the digits is k + 1. The following lemma handles the e = 1 case. 5

6 / e = e = 3 e = 4 5 / [16, 6, 5, 4], [3, 4, 9]; [65], [163, 190, 73, 118, 64], [81], [80], [66], [17]; [371, 76, 75, 74], [355, 130, 113], [195, 353]; n = 39 n = 39 n = / 3 [34, 50], [5], [6], [59], [3], [11], [10]; [100, 38, 64, 10, 46], [101, 39], [17, 107, 73, 135], [16], [193], [190, 166, 18], [199, 37]; [77, 804, 454, 788, 950, 658, 934, 116, 108, 10, 868, 936, 390], [107, 1137, 115], [11, 994], [199], [101], [100]; n = 59 n = 84 n = / 4 [66, 55], [50], [58, 75, 49, 56, 67], [74, 83], [51]; [311, 51, 47, 31, 371], [361], [417], [ 374], [360], [314], [44, 418, 436, 7, 38, 364]; [1786, 1880, 1403, 1594, 1659, 011, 075, 1579, 057, 1947, 1688, 19, 1641, 1676, 1946, 1673, 1851, 159, 1419, 1974, 058, 01, 090]; n = 74 n = 464 n = / [5, 5], [97]; n = 97 [341, 591, 376, 143, 187, 16, 35, 5, 80, 44, 469, 63, 18, 44, 141, 161, 197, 73, 307, 467, 377, 34, 18, 91], [35], [88, 343, 9, 16, 7], [36], [189], [190], [468]; n = 615 [914, 065, 1953, 1538, 819, 690, 10, 1507, 1491, 610, 1856, 1348, 1666, 59, 1808, 659, 3136, 184], [1634, 1731, 994], [371, 34, 1313], [130, 354, 89, 1938, 365, 930, 1474, 1570], [451, 195, 177, 1554, 179, 513, 034, 530]; n = 5417 Table 3: Cycles reached when iterating S e, 3, and the value of n for different values of e and /. Lemma 3. Let / > 1 be written in lowest terms. For every integer k S 1, (), there exists n, such that S 1, (n) = k. Proof. We will rove this by strong induction. Using the exansion for we get that the statement is true for k = S 1, () = k 0. Now suose there is an integer m that is a multile of such that S 1, (m) = k for some k k 0, and that for each s [k 0, k], there is an integer m s such that S 1, (m s) = s. Write m as m = α b for some α 1 and b relatively rime to. Suose m = a t a t 1 a 0. Then l = ( ) α m = a t a }{{}. α We know l 0 mod. Let r be the smallest ositive integer such that l + r 0 mod. Then 1 r 1 < 1. But then l + r = a t a 0 0 } {{ 0} r, α because r < 1. This imlies that the digital sum base / of the numbers l + 1, l +,..., l + r are k + 1, k +,..., k + r, resectively. Now l + r is a multile of with 6

7 S 1, (l + r) = k + r k + 1, and we have that for all k 0 s k + r, there exists m s such that S 1, (m s) = s. Using these two Lemmas, we can now resent the roof of Theorem. Proof of Theorem. Let n be as defined in Lemma 1 and let k 0 = S 1, (). Since the cycles that are reached by iterations of S e, are finite and there s finitely many of them, there is a largest integer K with height 0. Let n be an integer greater than M = max{n, e, k 0, K}. Since n > K, then n has some height h > 0. Then, S e, (n) has height h 1, S e, (n) has height h, and so on. Therefore, every height i h can be reached. Since n > e, by Lemma, if =, then there exists t such that S e, (t) = n. Since n > k 0, by Lemma 3, if e = 1, then there exists t such that S 1, (t) = n. Therefore, in either case ( = or e = 1), there exists an integer t such that S e, (t) = n. But t > n, which imlies that n = S e, (t) < t. Therefore t > n and t has height h + 1. The roof follows by induction. References [1] Andre Bland, Zoe Cramer, Phili de Castro, Desiree Domini, Tom Edgar, Devon Johnson, Steven Klee, Joseh Koblitz, and Ranjani Sundaresan, Hainess is integral but not rational, Math Horiz. 5 (017), no. 1, MR [] Esam El-Sedy and Samir Siksek, On hay numbers, Rocky Mountain J. Math. 30 (000), no., MR [3] H. G. Grundman and E. A. Teele, Generalized hay numbers, Fibonacci Quart. 39 (001), no. 5, MR [4], Seuences of consecutive hay numbers, Rocky Mountain J. Math. 37 (007), no. 6, MR [5] Helen G. Grundman and Pamela E. Harris, Seuences of consecutive hay numbers in negative bases, The Fibonacci Quarterly 56, no. 3. [6] Ross Honsberger, Ingenuity in mathematics, New Mathematical Library, vol. 3, Random House, Inc., New York, MR

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2, MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write

More information

MATH 3240Q Introduction to Number Theory Homework 7

MATH 3240Q Introduction to Number Theory Homework 7 As long as algebra and geometry have been searated, their rogress have been slow and their uses limited; but when these two sciences have been united, they have lent each mutual forces, and have marched

More information

Mersenne and Fermat Numbers

Mersenne and Fermat Numbers NUMBER THEORY CHARLES LEYTEM Mersenne and Fermat Numbers CONTENTS 1. The Little Fermat theorem 2 2. Mersenne numbers 2 3. Fermat numbers 4 4. An IMO roblem 5 1 2 CHARLES LEYTEM 1. THE LITTLE FERMAT THEOREM

More information

Practice Final Solutions

Practice Final Solutions Practice Final Solutions 1. True or false: (a) If a is a sum of three squares, and b is a sum of three squares, then so is ab. False: Consider a 14, b 2. (b) No number of the form 4 m (8n + 7) can be written

More information

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS #A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,

More information

A Curious Property of the Decimal Expansion of Reciprocals of Primes

A Curious Property of the Decimal Expansion of Reciprocals of Primes A Curious Proerty of the Decimal Exansion of Recirocals of Primes Amitabha Triathi January 6, 205 Abstract For rime 2, 5, the decimal exansion of / is urely eriodic. For those rime for which the length

More information

By Evan Chen OTIS, Internal Use

By Evan Chen OTIS, Internal Use Solutions Notes for DNY-NTCONSTRUCT Evan Chen January 17, 018 1 Solution Notes to TSTST 015/5 Let ϕ(n) denote the number of ositive integers less than n that are relatively rime to n. Prove that there

More information

Representing Integers as the Sum of Two Squares in the Ring Z n

Representing Integers as the Sum of Two Squares in the Ring Z n 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 17 (2014), Article 14.7.4 Reresenting Integers as the Sum of Two Squares in the Ring Z n Joshua Harrington, Lenny Jones, and Alicia Lamarche Deartment

More information

HENSEL S LEMMA KEITH CONRAD

HENSEL S LEMMA KEITH CONRAD HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar

More information

Practice Final Solutions

Practice Final Solutions Practice Final Solutions 1. Find integers x and y such that 13x + 1y 1 SOLUTION: By the Euclidean algorithm: One can work backwards to obtain 1 1 13 + 2 13 6 2 + 1 1 13 6 2 13 6 (1 1 13) 7 13 6 1 Hence

More information

The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001

The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse-Minkowski Theorem rovides a characterization of the rational quadratic forms. What follows is a roof of the Hasse-Minkowski

More information

RECIPROCITY LAWS JEREMY BOOHER

RECIPROCITY LAWS JEREMY BOOHER RECIPROCITY LAWS JEREMY BOOHER 1 Introduction The law of uadratic recirocity gives a beautiful descrition of which rimes are suares modulo Secial cases of this law going back to Fermat, and Euler and Legendre

More information

On the Multiplicative Order of a n Modulo n

On the Multiplicative Order of a n Modulo n 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 2010), Article 10.2.1 On the Multilicative Order of a n Modulo n Jonathan Chaelo Université Lille Nord de France F-59000 Lille France jonathan.chaelon@lma.univ-littoral.fr

More information

MATH 2710: NOTES FOR ANALYSIS

MATH 2710: NOTES FOR ANALYSIS MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite

More information

HOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH

HOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH HOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH 1. Section 2.1, Problems 5, 8, 28, and 48 Problem. 2.1.5 Write a single congruence that is equivalent to the air of congruences x 1 mod 4 and x 2

More information

Pythagorean triples and sums of squares

Pythagorean triples and sums of squares Pythagorean triles and sums of squares Robin Chaman 16 January 2004 1 Pythagorean triles A Pythagorean trile (x, y, z) is a trile of ositive integers satisfying z 2 + y 2 = z 2. If g = gcd(x, y, z) then

More information

Math 104B: Number Theory II (Winter 2012)

Math 104B: Number Theory II (Winter 2012) Math 104B: Number Theory II (Winter 01) Alina Bucur Contents 1 Review 11 Prime numbers 1 Euclidean algorithm 13 Multilicative functions 14 Linear diohantine equations 3 15 Congruences 3 Primes as sums

More information

#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS

#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS #A47 INTEGERS 15 (015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS Mihai Ciu Simion Stoilow Institute of Mathematics of the Romanian Academy, Research Unit No. 5,

More information

Arithmetic Consequences of Jacobi s Two-Squares Theorem

Arithmetic Consequences of Jacobi s Two-Squares Theorem THE RAMANUJAN JOURNAL 4, 51 57, 2000 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Arithmetic Consequences of Jacobi s Two-Squares Theorem MICHAEL D. HIRSCHHORN School of Mathematics,

More information

x 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p,

x 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p, 13. Quadratic Residues We now turn to the question of when a quadratic equation has a solution modulo m. The general quadratic equation looks like ax + bx + c 0 mod m. Assuming that m is odd or that b

More information

Solvability and Number of Roots of Bi-Quadratic Equations over p adic Fields

Solvability and Number of Roots of Bi-Quadratic Equations over p adic Fields Malaysian Journal of Mathematical Sciences 10(S February: 15-35 (016 Secial Issue: The 3 rd International Conference on Mathematical Alications in Engineering 014 (ICMAE 14 MALAYSIAN JOURNAL OF MATHEMATICAL

More information

Gaps in Semigroups. Université Pierre et Marie Curie, Paris 6, Equipe Combinatoire - Case 189, 4 Place Jussieu Paris Cedex 05, France.

Gaps in Semigroups. Université Pierre et Marie Curie, Paris 6, Equipe Combinatoire - Case 189, 4 Place Jussieu Paris Cedex 05, France. Gas in Semigrous J.L. Ramírez Alfonsín Université Pierre et Marie Curie, Paris 6, Equie Combinatoire - Case 189, 4 Place Jussieu Paris 755 Cedex 05, France. Abstract In this aer we investigate the behaviour

More information

arxiv: v1 [math.nt] 9 Sep 2015

arxiv: v1 [math.nt] 9 Sep 2015 REPRESENTATION OF INTEGERS BY TERNARY QUADRATIC FORMS: A GEOMETRIC APPROACH GABRIEL DURHAM arxiv:5090590v [mathnt] 9 Se 05 Abstract In957NCAnkenyrovidedanewroofofthethreesuarestheorem using geometry of

More information

2 Asymptotic density and Dirichlet density

2 Asymptotic density and Dirichlet density 8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime

More information

Almost All Palindromes Are Composite

Almost All Palindromes Are Composite Almost All Palindromes Are Comosite William D Banks Det of Mathematics, University of Missouri Columbia, MO 65211, USA bbanks@mathmissouriedu Derrick N Hart Det of Mathematics, University of Missouri Columbia,

More information

2 Asymptotic density and Dirichlet density

2 Asymptotic density and Dirichlet density 8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime

More information

Mobius Functions, Legendre Symbols, and Discriminants

Mobius Functions, Legendre Symbols, and Discriminants Mobius Functions, Legendre Symbols, and Discriminants 1 Introduction Zev Chonoles, Erick Knight, Tim Kunisky Over the integers, there are two key number-theoretic functions that take on values of 1, 1,

More information

GOOD MODELS FOR CUBIC SURFACES. 1. Introduction

GOOD MODELS FOR CUBIC SURFACES. 1. Introduction GOOD MODELS FOR CUBIC SURFACES ANDREAS-STEPHAN ELSENHANS Abstract. This article describes an algorithm for finding a model of a hyersurface with small coefficients. It is shown that the aroach works in

More information

Characteristics of Fibonacci-type Sequences

Characteristics of Fibonacci-type Sequences Characteristics of Fibonacci-tye Sequences Yarden Blausa May 018 Abstract This aer resents an exloration of the Fibonacci sequence, as well as multi-nacci sequences and the Lucas sequence. We comare and

More information

CERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education

CERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education CERIAS Tech Reort 2010-01 The eriod of the Bell numbers modulo a rime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education and Research Information Assurance and Security Purdue University,

More information

ISOSCELES TRIANGLES IN Q 3. Matt Noble Department of Mathematics, Middle Georgia State University, Macon, Georgia

ISOSCELES TRIANGLES IN Q 3. Matt Noble Department of Mathematics, Middle Georgia State University, Macon, Georgia #A9 INTEGERS 18 (2018) ISOSCELES TRIANGLES IN Q Matt Noble Deartment of Mathematics, Middle Georgia State University, Macon, Georgia matthew.noble@mga.edu Received: 7/2/17, Acceted: 2//18, Published: 2/19/18

More information

Chapter 7 Rational and Irrational Numbers

Chapter 7 Rational and Irrational Numbers Chater 7 Rational and Irrational Numbers In this chater we first review the real line model for numbers, as discussed in Chater 2 of seventh grade, by recalling how the integers and then the rational numbers

More information

An Estimate For Heilbronn s Exponential Sum

An Estimate For Heilbronn s Exponential Sum An Estimate For Heilbronn s Exonential Sum D.R. Heath-Brown Magdalen College, Oxford For Heini Halberstam, on his retirement Let be a rime, and set e(x) = ex(2πix). Heilbronn s exonential sum is defined

More information

Number Theory Naoki Sato

Number Theory Naoki Sato Number Theory Naoki Sato 0 Preface This set of notes on number theory was originally written in 1995 for students at the IMO level. It covers the basic background material that an IMO

More information

March 4, :21 WSPC/INSTRUCTION FILE FLSpaper2011

March 4, :21 WSPC/INSTRUCTION FILE FLSpaper2011 International Journal of Number Theory c World Scientific Publishing Comany SOLVING n(n + d) (n + (k 1)d ) = by 2 WITH P (b) Ck M. Filaseta Deartment of Mathematics, University of South Carolina, Columbia,

More information

#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS

#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS #A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS Ramy F. Taki ElDin Physics and Engineering Mathematics Deartment, Faculty of Engineering, Ain Shams University, Cairo, Egyt

More information

p-adic Measures and Bernoulli Numbers

p-adic Measures and Bernoulli Numbers -Adic Measures and Bernoulli Numbers Adam Bowers Introduction The constants B k in the Taylor series exansion t e t = t k B k k! k=0 are known as the Bernoulli numbers. The first few are,, 6, 0, 30, 0,

More information

Almost 4000 years ago, Babylonians had discovered the following approximation to. x 2 dy 2 =1, (5.0.2)

Almost 4000 years ago, Babylonians had discovered the following approximation to. x 2 dy 2 =1, (5.0.2) Chater 5 Pell s Equation One of the earliest issues graled with in number theory is the fact that geometric quantities are often not rational. For instance, if we take a right triangle with two side lengths

More information

Jonathan Sondow 209 West 97th Street, New York, New York

Jonathan Sondow 209 West 97th Street, New York, New York #A34 INTEGERS 11 (2011) REDUCING THE ERDŐS-MOSER EQUATION 1 n + 2 n + + k n = (k + 1) n MODULO k AND k 2 Jonathan Sondow 209 West 97th Street, New York, New York jsondow@alumni.rinceton.edu Kieren MacMillan

More information

Diophantine Equations and Congruences

Diophantine Equations and Congruences International Journal of Algebra, Vol. 1, 2007, no. 6, 293-302 Diohantine Equations and Congruences R. A. Mollin Deartment of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada,

More information

A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract

A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS CASEY BRUCK 1. Abstract The goal of this aer is to rovide a concise way for undergraduate mathematics students to learn about how rime numbers behave

More information

HASSE INVARIANTS FOR THE CLAUSEN ELLIPTIC CURVES

HASSE INVARIANTS FOR THE CLAUSEN ELLIPTIC CURVES HASSE INVARIANTS FOR THE CLAUSEN ELLIPTIC CURVES AHMAD EL-GUINDY AND KEN ONO Astract. Gauss s F x hyergeometric function gives eriods of ellitic curves in Legendre normal form. Certain truncations of this

More information

Modeling Chebyshev s Bias in the Gaussian Primes as a Random Walk

Modeling Chebyshev s Bias in the Gaussian Primes as a Random Walk Modeling Chebyshev s Bias in the Gaussian Primes as a Random Walk Daniel J. Hutama July 18, 2016 Abstract One asect of Chebyshev s bias is the henomenon that a rime number,, modulo another rime number,,

More information

MAZUR S CONSTRUCTION OF THE KUBOTA LEPOLDT p-adic L-FUNCTION. n s = p. (1 p s ) 1.

MAZUR S CONSTRUCTION OF THE KUBOTA LEPOLDT p-adic L-FUNCTION. n s = p. (1 p s ) 1. MAZUR S CONSTRUCTION OF THE KUBOTA LEPOLDT -ADIC L-FUNCTION XEVI GUITART Abstract. We give an overview of Mazur s construction of the Kubota Leooldt -adic L- function as the -adic Mellin transform of a

More information

6 Binary Quadratic forms

6 Binary Quadratic forms 6 Binary Quadratic forms 6.1 Fermat-Euler Theorem A binary quadratic form is an exression of the form f(x,y) = ax 2 +bxy +cy 2 where a,b,c Z. Reresentation of an integer by a binary quadratic form has

More information

On the Rank of the Elliptic Curve y 2 = x(x p)(x 2)

On the Rank of the Elliptic Curve y 2 = x(x p)(x 2) On the Rank of the Ellitic Curve y = x(x )(x ) Jeffrey Hatley Aril 9, 009 Abstract An ellitic curve E defined over Q is an algebraic variety which forms a finitely generated abelian grou, and the structure

More information

An Inverse Problem for Two Spectra of Complex Finite Jacobi Matrices

An Inverse Problem for Two Spectra of Complex Finite Jacobi Matrices Coyright 202 Tech Science Press CMES, vol.86, no.4,.30-39, 202 An Inverse Problem for Two Sectra of Comlex Finite Jacobi Matrices Gusein Sh. Guseinov Abstract: This aer deals with the inverse sectral roblem

More information

POWERS OF RATIONALS MODULO 1 AND RATIONAL BASE NUMBER SYSTEMS

POWERS OF RATIONALS MODULO 1 AND RATIONAL BASE NUMBER SYSTEMS ISRAEL JOURNAL OF MATHEMATICS 68 (8), 53 9 DOI:.7/s856-8-56-4 POWERS OF RATIONALS MODULO AND RATIONAL BASE NUMBER SYSTEMS BY Shigeki Akiyama Deartment of Mathematics, Niigata University, Jaan e-mail: akiyama@math.sc.niigata-u.ac.j

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013 18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013 In this lecture we lay the groundwork needed to rove the Hasse-Minkowski theorem for Q, which states that a quadratic form over

More information

Infinitely Many Quadratic Diophantine Equations Solvable Everywhere Locally, But Not Solvable Globally

Infinitely Many Quadratic Diophantine Equations Solvable Everywhere Locally, But Not Solvable Globally Infinitely Many Quadratic Diohantine Equations Solvable Everywhere Locally, But Not Solvable Globally R.A. Mollin Abstract We resent an infinite class of integers 2c, which turn out to be Richaud-Degert

More information

MA3H1 TOPICS IN NUMBER THEORY PART III

MA3H1 TOPICS IN NUMBER THEORY PART III MA3H1 TOPICS IN NUMBER THEORY PART III SAMIR SIKSEK 1. Congruences Modulo m In quadratic recirocity we studied congruences of the form x 2 a (mod ). We now turn our attention to situations where is relaced

More information

Linear diophantine equations for discrete tomography

Linear diophantine equations for discrete tomography Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,

More information

MATH 361: NUMBER THEORY EIGHTH LECTURE

MATH 361: NUMBER THEORY EIGHTH LECTURE MATH 361: NUMBER THEORY EIGHTH LECTURE 1. Quadratic Recirocity: Introduction Quadratic recirocity is the first result of modern number theory. Lagrange conjectured it in the late 1700 s, but it was first

More information

PETER J. GRABNER AND ARNOLD KNOPFMACHER

PETER J. GRABNER AND ARNOLD KNOPFMACHER ARITHMETIC AND METRIC PROPERTIES OF -ADIC ENGEL SERIES EXPANSIONS PETER J. GRABNER AND ARNOLD KNOPFMACHER Abstract. We derive a characterization of rational numbers in terms of their unique -adic Engel

More information

Multi-Operation Multi-Machine Scheduling

Multi-Operation Multi-Machine Scheduling Multi-Oeration Multi-Machine Scheduling Weizhen Mao he College of William and Mary, Williamsburg VA 3185, USA Abstract. In the multi-oeration scheduling that arises in industrial engineering, each job

More information

The Fibonacci Quarterly 44(2006), no.2, PRIMALITY TESTS FOR NUMBERS OF THE FORM k 2 m ± 1. Zhi-Hong Sun

The Fibonacci Quarterly 44(2006), no.2, PRIMALITY TESTS FOR NUMBERS OF THE FORM k 2 m ± 1. Zhi-Hong Sun The Fibonacci Quarterly 44006, no., 11-130. PRIMALITY TESTS FOR NUMBERS OF THE FORM k m ± 1 Zhi-Hong Sun eartment of Mathematics, Huaiyin Teachers College, Huaian, Jiangsu 3001, P.R. China E-mail: zhsun@hytc.edu.cn

More information

THE DIOPHANTINE EQUATION x 4 +1=Dy 2

THE DIOPHANTINE EQUATION x 4 +1=Dy 2 MATHEMATICS OF COMPUTATION Volume 66, Number 9, July 997, Pages 347 35 S 005-57897)0085-X THE DIOPHANTINE EQUATION x 4 +=Dy J. H. E. COHN Abstract. An effective method is derived for solving the equation

More information

A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod p) ZHI-HONG SUN

A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod p) ZHI-HONG SUN A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod ) ZHI-HONG SUN Deartment of Mathematics, Huaiyin Teachers College, Huaian 223001, Jiangsu, P. R. China e-mail: hyzhsun@ublic.hy.js.cn

More information

MATH342 Practice Exam

MATH342 Practice Exam MATH342 Practice Exam This exam is intended to be in a similar style to the examination in May/June 2012. It is not imlied that all questions on the real examination will follow the content of the ractice

More information

t s (p). An Introduction

t s (p). An Introduction Notes 6. Quadratic Gauss Sums Definition. Let a, b Z. Then we denote a b if a divides b. Definition. Let a and b be elements of Z. Then c Z s.t. a, b c, where c gcda, b max{x Z x a and x b }. 5, Chater1

More information

QUADRATIC RECIPROCITY

QUADRATIC RECIPROCITY QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick

More information

1 Integers and the Euclidean algorithm

1 Integers and the Euclidean algorithm 1 1 Integers and the Euclidean algorithm Exercise 1.1 Prove, n N : induction on n) 1 3 + 2 3 + + n 3 = (1 + 2 + + n) 2 (use Exercise 1.2 Prove, 2 n 1 is rime n is rime. (The converse is not true, as shown

More information

DUAL NUMBERS, WEIGHTED QUIVERS, AND EXTENDED SOMOS AND GALE-ROBINSON SEQUENCES. To Alexandre Alexandrovich Kirillov on his 3 4 th anniversary

DUAL NUMBERS, WEIGHTED QUIVERS, AND EXTENDED SOMOS AND GALE-ROBINSON SEQUENCES. To Alexandre Alexandrovich Kirillov on his 3 4 th anniversary DUAL NUMBERS, WEIGHTED QUIVERS, AND EXTENDED SOMOS AND GALE-ROBINSON SEQUENCES VALENTIN OVSIENKO AND SERGE TABACHNIKOV Abstract. We investigate a general method that allows one to construct new integer

More information

MAS 4203 Number Theory. M. Yotov

MAS 4203 Number Theory. M. Yotov MAS 4203 Number Theory M. Yotov June 15, 2017 These Notes were comiled by the author with the intent to be used by his students as a main text for the course MAS 4203 Number Theory taught at the Deartment

More information

Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems

Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems Int. J. Oen Problems Comt. Math., Vol. 3, No. 2, June 2010 ISSN 1998-6262; Coyright c ICSRS Publication, 2010 www.i-csrs.org Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various

More information

MATH 371 Class notes/outline October 15, 2013

MATH 371 Class notes/outline October 15, 2013 MATH 371 Class notes/outline October 15, 2013 More on olynomials We now consider olynomials with coefficients in rings (not just fields) other than R and C. (Our rings continue to be commutative and have

More information

CONGRUENCE PROPERTIES MODULO 5 AND 7 FOR THE POD FUNCTION

CONGRUENCE PROPERTIES MODULO 5 AND 7 FOR THE POD FUNCTION CONGRUENCE PROPERTIES MODULO 5 AND 7 FOR THE POD FUNCTION SILVIU RADU AND JAMES A. SELLERS Abstract. In this aer, we rove arithmetic roerties modulo 5 7 satisfied by the function odn which denotes the

More information

ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM

ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM JOHN BINDER Abstract. In this aer, we rove Dirichlet s theorem that, given any air h, k with h, k) =, there are infinitely many rime numbers congruent to

More information

ON THE SET a x + b g x (mod p) 1 Introduction

ON THE SET a x + b g x (mod p) 1 Introduction PORTUGALIAE MATHEMATICA Vol 59 Fasc 00 Nova Série ON THE SET a x + b g x (mod ) Cristian Cobeli, Marian Vâjâitu and Alexandru Zaharescu Abstract: Given nonzero integers a, b we rove an asymtotic result

More information

NOTES. The Primes that Euclid Forgot

NOTES. The Primes that Euclid Forgot NOTES Eite by Sergei Tabachnikov The Primes that Eucli Forgot Paul Pollack an Enrique Treviño Abstract. Let q 2. Suosing that we have efine q j for all ale j ale k, let q k+ be a rime factor of + Q k j

More information

Quadratic Reciprocity

Quadratic Reciprocity Quadratic Recirocity 5-7-011 Quadratic recirocity relates solutions to x = (mod to solutions to x = (mod, where and are distinct odd rimes. The euations are oth solvale or oth unsolvale if either or has

More information

PARTITIONS AND (2k + 1) CORES. 1. Introduction

PARTITIONS AND (2k + 1) CORES. 1. Introduction PARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND 2k + CORES SILVIU RADU AND JAMES A. SELLERS Abstract. In this aer we rove several new arity results for broken k-diamond artitions introduced in 2007

More information

LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS

LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS HELMUT MAIER AND MICHAEL TH. RASSIAS Abstract. We rove a modification as well as an imrovement

More information

Public Key Cryptosystems RSA

Public Key Cryptosystems RSA Public Key Crytosystems RSA 57 17 Receiver Sender 41 19 and rime 53 Attacker 47 Public Key Crytosystems RSA Comute numbers n = * 2337 323 57 17 Receiver Sender 41 19 and rime 53 Attacker 2491 47 Public

More information

Intrinsic Approximation on Cantor-like Sets, a Problem of Mahler

Intrinsic Approximation on Cantor-like Sets, a Problem of Mahler Intrinsic Aroximation on Cantor-like Sets, a Problem of Mahler Ryan Broderick, Lior Fishman, Asaf Reich and Barak Weiss July 200 Abstract In 984, Kurt Mahler osed the following fundamental question: How

More information

Dedekind sums and continued fractions

Dedekind sums and continued fractions ACTA ARITHMETICA LXIII.1 (1993 edekind sums and continued fractions by R. R. Hall (York and M. N. Huxley (Cardiff Let ϱ(t denote the row-of-teeth function ϱ(t = [t] t + 1/2. Let a b c... r be ositive integers.

More information

ON FREIMAN S 2.4-THEOREM

ON FREIMAN S 2.4-THEOREM ON FREIMAN S 2.4-THEOREM ØYSTEIN J. RØDSETH Abstract. Gregory Freiman s celebrated 2.4-Theorem says that if A is a set of residue classes modulo a rime satisfying 2A 2.4 A 3 and A < /35, then A is contained

More information

ON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES

ON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES C O L L O Q U I U M M A T H E M A T I C U M VOL. * 0* NO. * ON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES BY YOUNESS LAMZOURI, M. TIP PHAOVIBUL and ALEXANDRU ZAHARESCU

More information

BOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia

BOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia GLASNIK MATMATIČKI Vol. 39(59(2004, 199 205 BOUNDS FOR TH SIZ OF STS WITH TH PROPRTY D(n Andrej Dujella University of Zagreb, Croatia Abstract. Let n be a nonzero integer and a 1 < a 2 < < a m ositive

More information

16 The Quadratic Reciprocity Law

16 The Quadratic Reciprocity Law 16 The Quadratic Recirocity Law Fix an odd rime If is another odd rime, a fundamental uestion, as we saw in the revious section, is to know the sign, ie, whether or not is a suare mod This is a very hard

More information

.4. Congruences. We say that a is congruent to b modulo N i.e. a b mod N i N divides a b or equivalently i a%n = b%n. So a is congruent modulo N to an

.4. Congruences. We say that a is congruent to b modulo N i.e. a b mod N i N divides a b or equivalently i a%n = b%n. So a is congruent modulo N to an . Modular arithmetic.. Divisibility. Given ositive numbers a; b, if a 6= 0 we can write b = aq + r for aroriate integers q; r such that 0 r a. The number r is the remainder. We say that a divides b (or

More information

1. INTRODUCTION. Fn 2 = F j F j+1 (1.1)

1. INTRODUCTION. Fn 2 = F j F j+1 (1.1) CERTAIN CLASSES OF FINITE SUMS THAT INVOLVE GENERALIZED FIBONACCI AND LUCAS NUMBERS The beautiful identity R.S. Melham Deartment of Mathematical Sciences, University of Technology, Sydney PO Box 23, Broadway,

More information

Elementary Analysis in Q p

Elementary Analysis in Q p Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some

More information

Chapter 3. Number Theory. Part of G12ALN. Contents

Chapter 3. Number Theory. Part of G12ALN. Contents Chater 3 Number Theory Part of G12ALN Contents 0 Review of basic concets and theorems The contents of this first section well zeroth section, really is mostly reetition of material from last year. Notations:

More information

MA3H1 Topics in Number Theory. Samir Siksek

MA3H1 Topics in Number Theory. Samir Siksek MA3H1 Toics in Number Theory Samir Siksek Samir Siksek, Mathematics Institute, University of Warwick, Coventry, CV4 7AL, United Kingdom E-mail address: samir.siksek@gmail.com Contents Chater 0. Prologue

More information

RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES

RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES AARON ZWIEBACH Abstract. In this aer we will analyze research that has been recently done in the field of discrete

More information

#A45 INTEGERS 12 (2012) SUPERCONGRUENCES FOR A TRUNCATED HYPERGEOMETRIC SERIES

#A45 INTEGERS 12 (2012) SUPERCONGRUENCES FOR A TRUNCATED HYPERGEOMETRIC SERIES #A45 INTEGERS 2 (202) SUPERCONGRUENCES FOR A TRUNCATED HYPERGEOMETRIC SERIES Roberto Tauraso Diartimento di Matematica, Università di Roma Tor Vergata, Italy tauraso@mat.uniroma2.it Received: /7/, Acceted:

More information

ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER

ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER #A43 INTEGERS 17 (2017) ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER Lenny Jones Deartment of Mathematics, Shiensburg University, Shiensburg, Pennsylvania lkjone@shi.edu

More information

Algebraic Number Theory

Algebraic Number Theory Algebraic Number Theory Joseh R. Mileti May 11, 2012 2 Contents 1 Introduction 5 1.1 Sums of Squares........................................... 5 1.2 Pythagorean Triles.........................................

More information

Verifying Two Conjectures on Generalized Elite Primes

Verifying Two Conjectures on Generalized Elite Primes 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 12 (2009), Article 09.4.7 Verifying Two Conjectures on Generalized Elite Primes Xiaoqin Li 1 Mathematics Deartment Anhui Normal University Wuhu 241000,

More information

A FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE

A FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE International Journal of Mathematics & Alications Vol 4, No 1, (June 2011), 77-86 A FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE ARPAN SAHA AND KARTHIK C S ABSTRACT: In this aer, we rove a few lemmas

More information

Elementary Proof That There are Infinitely Many Primes p such that p 1 is a Perfect Square (Landau's Fourth Problem)

Elementary Proof That There are Infinitely Many Primes p such that p 1 is a Perfect Square (Landau's Fourth Problem) Elementary Proof That There are Infinitely Many Primes such that 1 is a Perfect Square (Landau's Fourth Problem) Stehen Marshall 7 March 2017 Abstract This aer resents a comlete and exhaustive roof of

More information

On the Diophantine Equation x 2 = 4q n 4q m + 9

On the Diophantine Equation x 2 = 4q n 4q m + 9 JKAU: Sci., Vol. 1 No. 1, : 135-141 (009 A.D. / 1430 A.H.) On the Diohantine Equation x = 4q n 4q m + 9 Riyadh University for Girls, Riyadh, Saudi Arabia abumuriefah@yahoo.com Abstract. In this aer, we

More information

Math 261 Exam 2. November 7, The use of notes and books is NOT allowed.

Math 261 Exam 2. November 7, The use of notes and books is NOT allowed. Math 261 Eam 2 ovember 7, 2018 The use of notes and books is OT allowed Eercise 1: Polynomials mod 691 (30 ts In this eercise, you may freely use the fact that 691 is rime Consider the olynomials f( 4

More information

We collect some results that might be covered in a first course in algebraic number theory.

We collect some results that might be covered in a first course in algebraic number theory. 1 Aendices We collect some results that might be covered in a first course in algebraic number theory. A. uadratic Recirocity Via Gauss Sums A1. Introduction In this aendix, is an odd rime unless otherwise

More information

Jacobi symbols and application to primality

Jacobi symbols and application to primality Jacobi symbols and alication to rimality Setember 19, 018 1 The grou Z/Z We review the structure of the abelian grou Z/Z. Using Chinese remainder theorem, we can restrict to the case when = k is a rime

More information

MATH 248A. THE CHARACTER GROUP OF Q. 1. Introduction

MATH 248A. THE CHARACTER GROUP OF Q. 1. Introduction MATH 248A. THE CHARACTER GROUP OF Q KEITH CONRAD 1. Introduction The characters of a finite abelian grou G are the homomorhisms from G to the unit circle S 1 = {z C : z = 1}. Two characters can be multilied

More information

SUMS OF TWO SQUARES PAIR CORRELATION & DISTRIBUTION IN SHORT INTERVALS

SUMS OF TWO SQUARES PAIR CORRELATION & DISTRIBUTION IN SHORT INTERVALS SUMS OF TWO SQUARES PAIR CORRELATION & DISTRIBUTION IN SHORT INTERVALS YOTAM SMILANSKY Abstract. In this work we show that based on a conjecture for the air correlation of integers reresentable as sums

More information

arxiv: v4 [math.nt] 11 Oct 2017

arxiv: v4 [math.nt] 11 Oct 2017 POPULAR DIFFERENCES AND GENERALIZED SIDON SETS WENQIANG XU arxiv:1706.05969v4 [math.nt] 11 Oct 2017 Abstract. For a subset A [N], we define the reresentation function r A A(d := #{(a,a A A : d = a a }

More information

QUADRATIC RECIPROCITY

QUADRATIC RECIPROCITY QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick

More information