Applicable Analysis and Discrete Mathematics available online at HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS
|
|
- Clement McDaniel
- 5 years ago
- Views:
Transcription
1 Alicable Analysis and Discrete Mathematics available online at htt://efmath.etf.rs Al. Anal. Discrete Math. 4 (010), doi:10.98/aadm m HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS Zerzaihi Tahar, Kecies Mohamed, Michael Kna In this work we are concerned with the calculation of the Hensel codes of square roots of -adic numbers, using the fixed oint method and this through the calculation of the aroached solution of f(x) = x a = 0 in Q. We also determine the seed of convergence and the number of iterations. 1. INTRODUCTION The knowledge of the arithmetic and algebraic roerties of the -adic numbers is useful to the study of their Diohantine roerties and the roblems of aroximations. In this resent aer we will see how we can use classical rootfinding methods (fixed oint) and exlore a very interesting alication of tools from numerical analysis to number theory. We use this method to calculate the zero of a -adic continuous function f defined on a domain D Q, where f : Q Q x f(x). To calculate the square root of a -adic number a Q, one studies the following roblem (1) { f(x) = x a = 0 a Q, rime number. Our goal is to calculate the Hensel code of a, which means to determine the first numbers of the -adic develoment of the solution of the revious equation, 000 Mathematics Subject Classification. 6E30. 34K8. Keywords and Phrases. P -adic number, square root, Hensel code, fixed oint, seed of convergence. 3
2 Hensel codes of square roots of -adic Numbers 33 and this solution is aroached by a sequence of the -adic numbers (x n ) n Q constructed by the fixed oint method. We first encountered this idea in [4] where the authors used the numerical methods to find the recirocal of an integer modulo n (see [4] for more details). We are grateful to Dr. Henry Alex Esbelin (Laboratoire d Algorithmique et Image de Clermont-Ferrand) for suggesting this toic to us, and also for several helful conversations.. PRELIMINARIES Definition.1. Let be a rime number. The field of -adic numbers Q is defined as the comletion of the field of rational numbers with resect to the -adic metric determined by the -adic norm. Thus, Q is obtained from the -adic norm in the same way as the real field R is obtained from the usual absolute value as the comletion of Q. Here, the function is called the -adic norm and is defined by x Q : x = { v (x) if x 0 0 if x = 0, and v is the -adic valuation defined by v (x) = max {r Z : r x}. The -adic distance d is defined by d : Q Q R + {0} (x, y) d (x, y) = x y. Theorem.. Every -adic number a Q has a unique -adic exansion a = λ n n + λ n+1 n λ λ 0 + λ 1 + λ + = λ k k with λ k Z and 0 λ k 1 for each k n. The short reresentation of a is λ n λ n+1... λ 1 λ 0 λ 1..., where only the coefficients of the owers of are shown. We can use the -adic oint as a device for dislaying the sign of n as follows: λ n λ n+1... λ 1 λ 0 λ 1... for n < 0 λ 0 λ 1... for n = λ 0 λ 1... for n > 0. k=n Definition.3. A -adic number a Q is said to be a -adic integer if this canonical develoment contains only non negative owers of. The set of -adic
3 34 Zerzaihi Tahar, Kecies Mohamed, Michael Kna integers is denoted by Z. So we have { } Z = λ k k, 0 λ k 1 = k=0 { } a Q : a 1. Definition.4. A -adic integer a Z is said to be a -adic unit if the first digit λ 0 in the -adic develoment is different from zero. The set of -adic units is denoted by Z. Hence we have { } Z = λ k k, λ 0 0 = k=0 { } a Q : a = 1. Proosition.5. Let a be a -adic number. Then a can be written as the roduct a = n u, n Z, u Z. Definition.6. Let be a rime number. Then the Hensel code of length M of any -adic number a = m u Q is the air (mant a, ex a ), where the left most M digits and the value m of the related -adic develoment are called the mantissa and the exonent, resectively. We use the notation H(, M, a) where is a rime and M is the integer which secifies the number of digits of the -adic develoment. One writes H(, M, a) = (a m a m+1... a 0 a 1... a t, m), where M = m + t + 1. See also [1] for more general results concerning the Hensel code. Lemma.7. (Hensel s Lemma) Let F (x) = c 0 + c 1 x + c x + + c n x n be a olynomial whose coefficients are -adic integers. Let F (x) = c 1 + c x + + nc n x n 1 be the derivative of F (x). Suose a 0 is a -adic integer which satisfies F (a 0 ) 0 (mod ) and F (a 0 ) 0 (mod ). Then there exists a unique -adic integer a such that F (a) = 0 and a a 0 (mod ). Proof. For the roof of this result we refer the reader to [5]. The following theorem makes an imortant connection between -adic numbers and congruences. Theorem.8. A olynomial with integer coefficients has a root in Z if and only if it has an integer root modulo k for every k 1. Proof. For the roof see [5].
4 Hensel codes of square roots of -adic Numbers 35 A ractical consequence of Theorem.8 is the following. Proosition.9. A rational integer a not divisible by has a square root in Z ( ) if and only if a is a quadratic residue modulo. Proof. Let P (x) = x a. Then P (x) = x. If a is a quadratic residue, then a a 0 (mod ) for some a 0 {0, 1,,..., 1}. Hence P (a 0 ) 0 (mod ). But P (a 0 ) = a 0 0 (mod ) automatically since (a 0, ) = 1, so that the solution in Z exists by Hensel s lemma. Conversely, if a is a quadratic nonresidue, by Theorem.8 it has no square root in Z. This can actually be extended to Corollary.10. Let be a rime. An element x Q is a square if and only if it can be written x = n y with n Z and y Z a -adic unit. Proof. For the roof of this result we refer the reader to [3]. 3. MAIN RESULTS Let a Q be a -adic number such that a = v(a) = m, m Z. If (x n ) n is a sequence of -adic numbers that converges to a -adic number α 0, then from a certain rank one has x n = α. We also know that if there exists a -adic number α such that α = a, then v (a) is even and x n = α = m. 3.1 Fixed oint method To use the fixed oint method we study the zeros of the equation f(x) = 0 by studying a related equation x = g(x), with the condition that these two formulations are mathematically equivalent. To imrove the seed of convergence of the sequence (x n ) n, one defines a new sequence that converges more quickly toward the solution of the equation roosed. The conditions that ermit the determination of the function g(x) are: 1) g( a) = a, g (1) ( a) =... = g (s 1) ( a) = 0, g (s) ( a) 0,
5 36 Zerzaihi Tahar, Kecies Mohamed, Michael Kna ) The olynomial g(x) must not have the square root of a in its coefficients. In order to choose g(x), we know that if a is a root of order s of (g(x) a), then there is a olynomial h(x) such that () g(x) = a + (x a) s h(x). The conditions that ermit the determination of h(x) are: i. The olynomial g(x) must not have a in its coefficients ii. h(x) deends uon the natural number s. To determine the formula for h(x), it is sufficient to work with the undetermined coefficients and to write the wanted conditions. Let s consider the following cases. Case 1: s = 1. We have g(x) = a + (x a)h(x). One chooses h(x) in order to make the square roots of a in the coefficients of g(x) disaear. For this, we ut (3) h(x) = α 0. This gives α 0 = 1 and (4) g(x) = x. Case : s =. We have (5) g(x) = a + (x a) h(x). We ut (6) h(x) = α 0 + α 1 x, and get Then we have α 0 = 1 a 1/, α 1 = 1 a. (7) h(x) = 1 a (x + a) and g(x) = 3 x 1 a x3. The sequence associated to g(x) is defined by (8) n N : x n+1 = 3 x n 1 a x 3 n. Theorem 3.1. If x n0 is the square root of a of order r, then
6 Hensel codes of square roots of -adic Numbers 37 1) If, then x n+n0 is the square root of a of order n r ( n 1)m. ) If =, then x n+n0 is the square root of a of order n r (m + 1)( n 1). Proof. Let (x n ) n the sequence defined by (8). Then (9) n N : x n+1 a = 1 4a ( 4a x n ) ( a x n ). We ut Since (10) 4 = Ω(x) = 1 4a ( 4a x ). 1 if = 4 1 if, we have Ω(x n0 ) = 1 ( ) 4a x 4a n a max { 4a, } x n0 4m max { m, m} if 4m max { m, m} if = m if m+ if =. This gives and so we have x n0+1 a = Ω(x n0 ) a x n0, x n0+1 a m r if, Then x n0+1 a m+ r if =. x n 0+1 a 0 (mod r m ) if, x n 0+1 a 0 (mod r (m+1) ) if =. In this manner, we find that if, then (11) n N : x n+n 0 a 0 (mod γn ),
7 38 Zerzaihi Tahar, Kecies Mohamed, Michael Kna where the sequence (γ n ) n is defined by (1) n N : γ n = n r ( n 1)m. If =, then (13) n N : x n+n 0 a 0 (mod γ n ), where (γ n) n is defined by (14) n N : γ n = γ n ( n 1) = n r (m + 1)( n 1). On the other hand, we have ( (15) n N : x n+1 x n = x ) n (x a n a ). Since (16) = we have 1 if = 1 if, x n+n0+1 x n+n0 = x n+n 0 x a n+n0 a. Hence we obtain x n+n0+1 x n+n0 m m γn if and so Therefore, if, then x n+n0+1 x n+n0 m m γ n if =, x n+n0+1 x n+n0 0 (mod γn m ) if x n+n0+1 x n+n0 0 (mod γ n (m+1) ) if =. (17) n N : x n+n0+1 x n+n0 0 (mod vn ), where (18) n N : v n = γ n m = n r ( n+1 1)m. If =, then (19) n N : x n+n0+1 x n+n0 0 (mod v n ), where n N : v n = v n ( n+1 1) = n r ( n+1 1)(m + 1).
8 Hensel codes of square roots of -adic Numbers 39 Conclusion If, then the following are true. (a) The seed of convergence of the sequence (x n ) n is the order v n. (b) If r m > 0, then the number of iterations to obtain M correct digits is ( ) M m ln r m (0) n = + 1. ln (c) With Hensel codes the equation (8) takes the form H(, n r ( n+1 1) m, x) = H(,, 3/) H(, n 1 r ( n 1) m, x). If =, then the following are true. H(,, 1/) H3 (, n 1 r ( n 1) m, x) H. (,, x) (a) The seed of convergence of the sequence (x n ) n is the order v n. (b) If r (m + 1) > 0, then the necessary number n of iterations to obtain M correct digits is ( ) M (m + 1) ln r (m + 1) (1) n = + 1. ln (c) With the Hensel codes the equation (8) takes the form H(, n r ( n+1 1) (m + 1), x) = H(,, 3/) H(, n 1 r ( n 1) (m + 1), x) H(,, 1/) H3 (, n 1 r ( n 1) (m + 1), x) H. (,, x) () Let s consider for the sets defined by { } S 1 = a Q : a = 1 { } S = a Q : a < 1 { } S 3 = a Q : a > 1 if m = 0 if m > 0 if m < 0. We ut v n (1) = n r if m = 0 (3) n N : v n () = n r ( n+1 1)m if m > 0 v n (3) = n r ( n+1 1)m if m < 0.
9 40 Zerzaihi Tahar, Kecies Mohamed, Michael Kna For =, we consider the sets defined by B 1 = {a Q : a = 4} if m = 1 (4) B = {a Q : a < 4} if m > 1 B 3 = {a Q : a > 4} if m < 1. We ut v n (1) = n r if m = 1 (5) n N : v n () = n r ( n+1 1)(m + 1) if m > 1 v n (3) = n r ( n+1 1)(m + 1) if m < 1. Then we have the following corollary. Corollary If, then we have the following. (a) If m = 0, then we have quadratic convergence for all the -adic numbers which belong to the set S 1. (b) If m < 0, then the seed of convergence is faster for all the -adic numbers which belong to the set S 3. (c) If m > 0, then the seed of convergence is slower for all the -adic numbers which belong to the set S.. If =, then we have the following. (a) If m = 1, then one has quadratic convergence for all the -adic numbers which belong to B 1. (b) If m < 1, then the seed of convergence is faster for all the -adic numbers which belong to the set B 3. (c) If m > 1, then the seed of convergence is slower for all the -adic numbers which belong to the set B. Case 3: s = 3. We ut (6) One finds that (7) g(x) = a + (x a) 3 h(x) h(x) = α 0 + α 1 x + α x. h(x) = 1 a + 9 8a a x + 3 8a x g(x) = 15 8 x 5 4a x a x5.
10 Hensel codes of square roots of -adic Numbers 41 The sequence associated to g(x) is defined by (8) n N : x n+1 = 3 8a x 5 n 5 4a x 3 n x n. Let (x n ) n the sequence defined by (8). Then (9) n N : x n+1 a = ( a xn ) 3 ( 1 a a 3 x n 9 ) 64a 4 x n 4. Theorem 3.4. If x n0 is the square root of a of order r, then the following are true. 1) If, then x n+n0 is the square root of a of order 3 n r (3 n 1)m. ) If =, then x n+n0 is the square root of a of order 3 n r (3 n 1)(m + 3). Proof. For the roof of this theorem, we use the method that we alied in the case where s =. From this theorem, we get that if, then (30) n N : x n+n 0 a 0 (mod πn ), where (π n ) n is defined by (31) n N : π n = 3 n r (3 n 1)m. If =, then (3) n N : x n+n 0 a 0 (mod π n ), where (π n) n is given by (33) n N : π n = 3 n r (3 n 1)(m + 3). On the other hand, we have (34) n N : x n+1 x n = ( a xn ) ( 7 8a x n 3 ) 8a x3 n. Then if, we have (35) n N : x n+n0+1 x n+n0 0 (mod Σn ), where (Σ n ) n is defined by (36) n N : Σ n = 3 n r ( 3 n 1)m. If =, then (37) n N : x n+n0+1 x n+n0 0 (mod Σ n ),
11 4 Zerzaihi Tahar, Kecies Mohamed, Michael Kna with (38) n N : Σ n = 3 n r ( ( 3 n 1)m + 3 n+1). Conclusion If, then the following are true. (a) The seed of convergence of the sequence (x n ) n is the order Σ n. (b) If r m > 0, then the number n of necessary iterations to obtain M correct digits is ( ) M m ln r m (39) n = + 1. ln 3 (c) With Hensel codes the equation (8) takes the form H(, 3 n r ( 3 n 1) m, x) = H(,, 3/8) H5 (, 3 n 1 r ( 3 n 1 1) m, x) H 4 (,, x) + H(,, 5/4) H3 (, 3 n 1 r ( 3 n 1 1) m, x) H (,, x) + H(,, 15/8) H(, 3 n 1 r ( 3 n 1 1) m, x).. If =, then the following are true. (a) The seed of convergence of the sequence (x n ) n is the order Σ n. (b) If r (m + 3) > 0, then the necessary number of iterations to obtain M correct digits is ( ) M m ln r (m + 3) (40) n = ln (c) With Hensel codes the equation (8) takes the form H(, 3 n r ( ( 3 n 1) m + 3 n+1), x) = H(,, 3/8) H5 (, 3 n 1 r ( ( 3 n 1 1) m + 3 n), x) H 4 (,, x) + H(,, 5/4) H3 (, 3 n 1 r ( ( 3 n 1 1) m + 3 n), x) H (,, x) + H(,, 15/8) H(, 3 n 1 r ( ( 3 n 1 1) m + 3 n), x).
12 Hensel codes of square roots of -adic Numbers Generalization Generally we can construct an iterative method that converges to a with a higher convergence rate. To accelerate the rate of convergence of the sequence (x n ) n as much as one wants, it is necessary to solve the roblem of letting (41) g(x) = a + (x a) s h(x, a) and choosing the function h(x, a) in order to make the square roots of a in coefficients of a function g(x) disaear. We take the degree of the function h(x) equal to s 1, giving (4) h(x) = α 0 + α 1 x + α x + + α s 1 x s 1 s 1 = α j x j. Then (43) g(x) = a+(x s 1 a) s (α 0 +α 1 x+α x + +α s 1 x s 1 ) = c j (α i, a )x j, where, if i {0,..., s 1}, (44) a + ( 1) s ( a) s α 0, if j = 0 and c j (α i, a) = j ( ) s α i ( 1) s j+i ( a) s j+i, if j {1,..., s } j i i=0 j=0 j=0 α s 1, if j = s 1, (45) α i = 0, i > s 1. To generalize the fixed oint method it is necessary that the coefficients of the even owers of x are equal to zero and according to the different calculations that we made, we suose that this condition is also sufficient until a certain s sufficiently large, i.e (46) j {0,..., s 1} : {c k } k {0,...,j} = {0} a {c k+1 } k {0,...,j}. Therefore, to determine (α i ) i {0,...,s 1} for any s, it is sufficient to solve the following linear system c 0 = a + ( 1) s ( a) s α 0 = 0 (47) c (α i, a) = 0 c 4 (α i, a) = 0. c s (α i, a) = 0., 0 i s 1
13 44 Zerzaihi Tahar, Kecies Mohamed, Michael Kna We get (48) g(x) = c 1 (a)x + c 3 (a)x c s 1 (a)x s 1. REFERENCES 1. C. K. Koc: A Tutorial on P -adic Arithmetic. Electrical and Comuter Engineering. Oregon State University, Corvallis, Oregon Technical Reort, Aril 00.. F. B. Vej: P -adic Numbers. Aalborg University, Deartment Of Mathematical Sciences. 7E 9 Aalborg st. Groue E3-104, F.Q. Gouvêa: P -adic Numbers: An Introduction. Second Edition. New York: Sringer-Verlag, M. Kna, C. Xenohotos: Numerical analysis meets number theory: using rootfinding methods to calculate inverses mod n. Al. Anal. Discrete Math., 4 (010), S. Katok: Real and -adic analysis, Course notes for Math 497C. Deartment of Mathematics, The Pennsylvania State University, Mass Program, Fall 000 revised, November (001). Laboratoire de mathématiques ures et aliquées, (Received Setember 10, 009) BP 98 Ouled Aissa, Université de Jijel, Algeria s: zerzaihi@yahoo.com kecmohamed@yahoo.fr Deartment of Mathematical Sciences, Loyola University Maryland, 4501 N. Charles Street, Baltimore, MD 110, USA mkna@loyola.edu
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 informationON 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 informationThe 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 informationA 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 informationHENSEL 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#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 informationRepresenting 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 informationDiophantine 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 informationMA3H1 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 informationQUADRATIC 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 informationMath 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 informationQUADRATIC 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 informationOn 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 informationx 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 informationSmall Zeros of Quadratic Forms Mod P m
International Mathematical Forum, Vol. 8, 2013, no. 8, 357-367 Small Zeros of Quadratic Forms Mod P m Ali H. Hakami Deartment of Mathematics, Faculty of Science, Jazan University P.O. Box 277, Jazan, Postal
More informationBOUNDS 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 informationMobius 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 informationAN IMPROVED BABY-STEP-GIANT-STEP METHOD FOR CERTAIN ELLIPTIC CURVES. 1. Introduction
J. Al. Math. & Comuting Vol. 20(2006), No. 1-2,. 485-489 AN IMPROVED BABY-STEP-GIANT-STEP METHOD FOR CERTAIN ELLIPTIC CURVES BYEONG-KWEON OH, KIL-CHAN HA AND JANGHEON OH Abstract. In this aer, we slightly
More informationCERIAS 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 informationElementary 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 informationMAT 311 Solutions to Final Exam Practice
MAT 311 Solutions to Final Exam Practice Remark. If you are comfortable with all of the following roblems, you will be very well reared for the midterm. Some of the roblems below are more difficult than
More informationCONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN
Int. J. Number Theory 004, no., 79-85. CONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN School of Mathematical Sciences Huaiyin Normal University Huaian, Jiangsu 00, P.R. China zhihongsun@yahoo.com
More informationA 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 informationMATH 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 informationWhen do Fibonacci invertible classes modulo M form a subgroup?
Calhoun: The NPS Institutional Archive DSace Reository Faculty and Researchers Faculty and Researchers Collection 2013 When do Fibonacci invertible classes modulo M form a subgrou? Luca, Florian Annales
More information#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 informationCharacteristics 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 informationp-adic Properties of Lengyel s Numbers
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.7.3 -adic Proerties of Lengyel s Numbers D. Barsky 7 rue La Condamine 75017 Paris France barsky.daniel@orange.fr J.-P. Bézivin 1, Allée
More informationarxiv: v5 [math.nt] 22 Aug 2013
Prerint, arxiv:1308900 ON SOME DETERMINANTS WITH LEGENDRE SYMBOL ENTRIES arxiv:1308900v5 [mathnt] Aug 013 Zhi-Wei Sun Deartment of Mathematics, Nanjing University Nanjing 10093, Peole s Reublic of China
More informationArithmetic and Metric Properties of p-adic Alternating Engel Series Expansions
International Journal of Algebra, Vol 2, 2008, no 8, 383-393 Arithmetic and Metric Proerties of -Adic Alternating Engel Series Exansions Yue-Hua Liu and Lu-Ming Shen Science College of Hunan Agriculture
More informationWhen do the Fibonacci invertible classes modulo M form a subgroup?
Annales Mathematicae et Informaticae 41 (2013). 265 270 Proceedings of the 15 th International Conference on Fibonacci Numbers and Their Alications Institute of Mathematics and Informatics, Eszterházy
More informationIntroduction 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 informationMath 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 informationt 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 informationClass Numbers and Iwasawa Invariants of Certain Totally Real Number Fields
Journal of Number Theory 79, 249257 (1999) Article ID jnth.1999.2433, available online at htt:www.idealibrary.com on Class Numbers and Iwasawa Invariants of Certain Totally Real Number Fields Dongho Byeon
More informationPETER 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 informationMATH 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 informationOn 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 informationAn Overview of Witt Vectors
An Overview of Witt Vectors Daniel Finkel December 7, 2007 Abstract This aer offers a brief overview of the basics of Witt vectors. As an alication, we summarize work of Bartolo and Falcone to rove that
More informationOn Character Sums of Binary Quadratic Forms 1 2. Mei-Chu Chang 3. Abstract. We establish character sum bounds of the form.
On Character Sums of Binary Quadratic Forms 2 Mei-Chu Chang 3 Abstract. We establish character sum bounds of the form χ(x 2 + ky 2 ) < τ H 2, a x a+h b y b+h where χ is a nontrivial character (mod ), 4
More information1. 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 informationLARGE 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 informationOn the smallest point on a diagonal quartic threefold
On the smallest oint on a diagonal quartic threefold Andreas-Stehan Elsenhans and Jörg Jahnel Abstract For the family x = a y +a 2 z +a 3 v + w,,, > 0, of diagonal quartic threefolds, we study the behaviour
More informationVarious 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 informationThe Fekete Szegő theorem with splitting conditions: Part I
ACTA ARITHMETICA XCIII.2 (2000) The Fekete Szegő theorem with slitting conditions: Part I by Robert Rumely (Athens, GA) A classical theorem of Fekete and Szegő [4] says that if E is a comact set in the
More informationON 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 informationMersenne 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 informationp-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#A8 INTEGERS 12 (2012) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS
#A8 INTEGERS 1 (01) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS Mohammadreza Bidar 1 Deartment of Mathematics, Sharif University of Technology, Tehran, Iran mrebidar@gmailcom
More informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem on Arithmetic Progressions Thai Pham Massachusetts Institute of Technology May 2, 202 Abstract In this aer, we derive a roof of Dirichlet s theorem on rimes in arithmetic rogressions.
More informationGlobal Behavior of a Higher Order Rational Difference Equation
International Journal of Difference Euations ISSN 0973-6069, Volume 10, Number 1,. 1 11 (2015) htt://camus.mst.edu/ijde Global Behavior of a Higher Order Rational Difference Euation Raafat Abo-Zeid The
More informationON 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 informationAlgebraic number theory LTCC Solutions to Problem Sheet 2
Algebraic number theory LTCC 008 Solutions to Problem Sheet ) Let m be a square-free integer and K = Q m). The embeddings K C are given by σ a + b m) = a + b m and σ a + b m) = a b m. If m mod 4) then
More informationARITHMETIC 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 informationPOINTS ON CONICS MODULO p
POINTS ON CONICS MODULO TEAM 2: JONGMIN BAEK, ANAND DEOPURKAR, AND KATHERINE REDFIELD Abstract. We comute the number of integer oints on conics modulo, where is an odd rime. We extend our results to conics
More informationFactorability in the ring Z[ 5]
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Dissertations, Theses, and Student Research Paers in Mathematics Mathematics, Deartment of 4-2004 Factorability in the ring
More informationRAMANUJAN-NAGELL CUBICS
RAMANUJAN-NAGELL CUBICS MARK BAUER AND MICHAEL A. BENNETT ABSTRACT. A well-nown result of Beuers [3] on the generalized Ramanujan-Nagell equation has, at its heart, a lower bound on the quantity x 2 2
More informationPractice 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 informationHASSE 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 informationJacobi 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 informationOn Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve
On onlinear Polynomial Selection and Geometric Progression (mod ) for umber Field Sieve amhun Koo, Gooc Hwa Jo, and Soonhak Kwon Email: komaton@skku.edu, achimheasal@nate.com, shkwon@skku.edu Det. of Mathematics,
More informationLinear 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 informationMATH 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 informationThe Arm Prime Factors Decomposition
The Arm Prime Factors Decomosition Arm Boris Nima arm.boris@gmail.com Abstract We introduce the Arm rime factors decomosition which is the equivalent of the Taylor formula for decomosition of integers
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 J. E. CREMONA Contents 0. Introduction: What is Number Theory? 2 Basic Notation 3 1. Factorization 4 1.1. Divisibility in Z 4 1.2. Greatest Common
More informationQUADRATIC RESIDUES AND DIFFERENCE SETS
QUADRATIC RESIDUES AND DIFFERENCE SETS VSEVOLOD F. LEV AND JACK SONN Abstract. It has been conjectured by Sárközy that with finitely many excetions, the set of quadratic residues modulo a rime cannot be
More informationFactor Rings and their decompositions in the Eisenstein integers Ring Z [ω]
Armenian Journal of Mathematics Volume 5, Number 1, 013, 58 68 Factor Rings and their decomositions in the Eisenstein integers Ring Z [ω] Manouchehr Misaghian Deartment of Mathematics, Prairie View A&M
More informationNUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:
NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two oerations defined on them, addition and multilication,
More informationRound-off Errors and Computer Arithmetic - (1.2)
Round-off Errors and Comuter Arithmetic - (.). Round-off Errors: Round-off errors is roduced when a calculator or comuter is used to erform real number calculations. That is because the arithmetic erformed
More informationInfinitely Many Insolvable Diophantine Equations
ACKNOWLEDGMENT. After this aer was submitted, the author received messages from G. D. Anderson and M. Vuorinen that concerned [10] and informed him about references [1] [7]. He is leased to thank them
More informationSolving Higher-Order p-adic Polynomial Equations via Newton-Raphson Method
Malaysian Journal of Mathematical Sciences 11(1): 41 51 (017) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES Journal homepage: http://einspem.upm.edu.my/journal Solving Higher-Order p-adic Polynomial Equations
More informationInfinitely 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 informationAn 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 informationCongruences modulo 3 for two interesting partitions arising from two theta function identities
Note di Matematica ISSN 113-53, e-issn 1590-093 Note Mat. 3 01 no., 1 7. doi:10.185/i1590093v3n1 Congruences modulo 3 for two interesting artitions arising from two theta function identities Kuwali Das
More informationMAZUR 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 informationBent Functions of maximal degree
IEEE TRANSACTIONS ON INFORMATION THEORY 1 Bent Functions of maximal degree Ayça Çeşmelioğlu and Wilfried Meidl Abstract In this article a technique for constructing -ary bent functions from lateaued functions
More informationWe 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 informationCONGRUENCE PROPERTIES OF TAYLOR COEFFICIENTS OF MODULAR FORMS
CONGRUENCE PROPERTIES OF TAYLOR COEFFICIENTS OF MODULAR FORMS HANNAH LARSON AND GEOFFREY SMITH Abstract. In their work, Serre and Swinnerton-Dyer study the congruence roerties of the Fourier coefficients
More informationHOMEWORK # 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 informationRECIPROCITY 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 informationMultiplicative group law on the folium of Descartes
Multilicative grou law on the folium of Descartes Steluţa Pricoie and Constantin Udrişte Abstract. The folium of Descartes is still studied and understood today. Not only did it rovide for the roof of
More informationPrimes - Problem Sheet 5 - Solutions
Primes - Problem Sheet 5 - Solutions Class number, and reduction of quadratic forms Positive-definite Q1) Aly the roof of Theorem 5.5 to find reduced forms equivalent to the following, also give matrices
More informationCommutators on l. D. Dosev and W. B. Johnson
Submitted exclusively to the London Mathematical Society doi:10.1112/0000/000000 Commutators on l D. Dosev and W. B. Johnson Abstract The oerators on l which are commutators are those not of the form λi
More informationIDENTIFYING CONGRUENCE SUBGROUPS OF THE MODULAR GROUP
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 24, Number 5, May 996 IDENTIFYING CONGRUENCE SUBGROUPS OF THE MODULAR GROUP TIM HSU (Communicated by Ronald M. Solomon) Abstract. We exhibit a simle
More informationSums of independent random variables
3 Sums of indeendent random variables This lecture collects a number of estimates for sums of indeendent random variables with values in a Banach sace E. We concentrate on sums of the form N γ nx n, where
More informationEstimation of the large covariance matrix with two-step monotone missing data
Estimation of the large covariance matrix with two-ste monotone missing data Masashi Hyodo, Nobumichi Shutoh 2, Takashi Seo, and Tatjana Pavlenko 3 Deartment of Mathematical Information Science, Tokyo
More informationSome sophisticated congruences involving Fibonacci numbers
A tal given at the National Center for Theoretical Sciences (Hsinchu, Taiwan; July 20, 2011 and Shanghai Jiaotong University (Nov. 4, 2011 Some sohisticated congruences involving Fibonacci numbers Zhi-Wei
More informationNumber 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 informationElliptic Curves Spring 2015 Problem Set #1 Due: 02/13/2015
18.783 Ellitic Curves Sring 2015 Problem Set #1 Due: 02/13/2015 Descrition These roblems are related to the material covered in Lectures 1-2. Some of them require the use of Sage, and you will need to
More informationNumbers and functions. Introduction to Vojta s analogy
Numbers and functions. Introduction to Vojta s analogy Seminar talk by A. Eremenko, November 23, 1999, Purdue University. Absolute values. Let k be a field. An absolute value v is a function k R, x x v
More informationEötvös Loránd University Faculty of Informatics. Distribution of additive arithmetical functions
Eötvös Loránd University Faculty of Informatics Distribution of additive arithmetical functions Theses of Ph.D. Dissertation by László Germán Suervisor Prof. Dr. Imre Kátai member of the Hungarian Academy
More informationGOOD 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 informationBy 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 informationThe inverse Goldbach problem
1 The inverse Goldbach roblem by Christian Elsholtz Submission Setember 7, 2000 (this version includes galley corrections). Aeared in Mathematika 2001. Abstract We imrove the uer and lower bounds of the
More information2 K. ENTACHER 2 Generalized Haar function systems In the following we x an arbitrary integer base b 2. For the notations and denitions of generalized
BIT 38 :2 (998), 283{292. QUASI-MONTE CARLO METHODS FOR NUMERICAL INTEGRATION OF MULTIVARIATE HAAR SERIES II KARL ENTACHER y Deartment of Mathematics, University of Salzburg, Hellbrunnerstr. 34 A-52 Salzburg,
More informationOn the Solutions of the Equation x + Ax = B in with Coefficients from 3
Alied Mathematics 14 5 5-46 Published Online January 14 (htt://wwwscirorg/ournal/am) htt://ddoiorg/146/am14515 On the Solutions of the Equation + A = B in with Coefficients from I M Rihsiboev 1 A Kh Khudoyberdiyev
More informationOn the irreducibility of a polynomial associated with the Strong Factorial Conjecture
On the irreducibility of a olynomial associated with the Strong Factorial Conecture Michael Filaseta Mathematics Deartment University of South Carolina Columbia, SC 29208 USA E-mail: filaseta@math.sc.edu
More informationDistribution of Matrices with Restricted Entries over Finite Fields
Distribution of Matrices with Restricted Entries over Finite Fields Omran Ahmadi Deartment of Electrical and Comuter Engineering University of Toronto, Toronto, ON M5S 3G4, Canada oahmadid@comm.utoronto.ca
More informationf(r) = a d n) d + + a0 = 0
Math 400-00/Foundations of Algebra/Fall 07 Polynomials at the Foundations: Roots Next, we turn to the notion of a root of a olynomial in Q[x]. Definition 8.. r Q is a rational root of fx) Q[x] if fr) 0.
More informationPractice 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