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

Similar documents
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,

THE DIOPHANTINE EQUATION x 4 +1=Dy 2

Diophantine Equations and Congruences

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

Fadwa S. Abu Muriefah. ON THE DIOPHANTINE EQUATION x fc = y n

Generalized Lebesgue-Ramanujan-Nagell Equations

MATH 3240Q Introduction to Number Theory Homework 7

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

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

Aliquot sums of Fibonacci numbers

MATH342 Practice Exam

Arithmetic Consequences of Jacobi s Two-Squares Theorem

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

Practice Final Solutions

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

Infinitely Many Insolvable Diophantine Equations

CONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN

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

arxiv: v2 [math.nt] 9 Oct 2018

Practice Final Solutions

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

By Evan Chen OTIS, Internal Use

#A9 INTEGERS 12 (2012) PRIMITIVE PRIME DIVISORS IN ZERO ORBITS OF POLYNOMIALS

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

When do Fibonacci invertible classes modulo M form a subgroup?

Verifying Two Conjectures on Generalized Elite Primes

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

MA3H1 TOPICS IN NUMBER THEORY PART III

Indivisibility of Class Numbers and Iwasawa l-invariants of Real Quadratic Fields

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS

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

RINGS OF INTEGERS WITHOUT A POWER BASIS

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

Small Zeros of Quadratic Forms Mod P m

An Estimate For Heilbronn s Exponential Sum

#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC

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

Class Numbers and Iwasawa Invariants of Certain Totally Real Number Fields

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

Primes - Problem Sheet 5 - Solutions

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

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

A parametric family of quartic Thue equations

p 4 )(α p ) p 5 p

Legendre polynomials and Jacobsthal sums

A CLASS OF ALGEBRAIC-EXPONENTIAL CONGRUENCES MODULO p. 1. Introduction

Characteristics of Fibonacci-type Sequences

Research Article New Mixed Exponential Sums and Their Application

On Character Sums of Binary Quadratic Forms 1 2. Mei-Chu Chang 3. Abstract. We establish character sum bounds of the form.

EXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES

A Curious Property of the Decimal Expansion of Reciprocals of Primes

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

GAUSSIAN INTEGERS HUNG HO

MATH 361: NUMBER THEORY EIGHTH LECTURE

Primes of the form ±a 2 ± qb 2

March 4, :21 WSPC/INSTRUCTION FILE FLSpaper2011

When do the Fibonacci invertible classes modulo M form a subgroup?

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

Distribution of Matrices with Restricted Entries over Finite Fields

ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER

ABSTRACT. In this note, we find all the solutions of the Diophantine equation x k = y n, 1, y 1, k N, n INTRODUCTION

Almost All Palindromes Are Composite

On the irreducibility of a polynomial associated with the Strong Factorial Conjecture

Two Diophantine Approaches to the Irreducibility of Certain Trinomials

Mersenne and Fermat Numbers

On the Multiplicative Order of a n Modulo n

Chapter 2 Even Exponents

Algebraic Number Theory

Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China

A FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE

#A6 INTEGERS 15A (2015) ON REDUCIBLE AND PRIMITIVE SUBSETS OF F P, I. Katalin Gyarmati 1.

Congruences and exponential sums with the sum of aliquot divisors function

Research Article A New Sum Analogous to Gauss Sums and Its Fourth Power Mean

A LLT-like test for proving the primality of Fermat numbers.

arxiv:math/ v1 [math.nt] 3 Dec 2004

Jacobi symbols and application to primality

Math 104B: Number Theory II (Winter 2012)

SIGN CHANGES OF COEFFICIENTS OF HALF INTEGRAL WEIGHT MODULAR FORMS

University of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): 10.

Quadratic Residues, Quadratic Reciprocity. 2 4 So we may as well start with x 2 a mod p. p 1 1 mod p a 2 ±1 mod p

Pythagorean triples and sums of squares

Asymptotically exact heuristics for prime divisors of the sequence {a k +b k } k=1

arxiv: v1 [math.nt] 9 Sep 2017

Fibonacci numbers of the form p a ± p b

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

#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS

The inverse Goldbach problem

arxiv: v2 [math.nt] 29 Jul 2017

6 Binary Quadratic forms

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

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

Congruences modulo 3 for two interesting partitions arising from two theta function identities

New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review

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

1. 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

SQUAREFREE VALUES OF QUADRATIC POLYNOMIALS COURSE NOTES, 2015

arxiv: v2 [math.ho] 24 Nov 2014

Some sophisticated congruences involving Fibonacci numbers

arxiv:math/ v2 [math.nt] 21 Oct 2004

THUE-VINOGRADOV AND INTEGERS OF THE FORM x 2 + Dy 2. Contents. Introduction Study of an Elementary Proof

Transcription:

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 study the title equation with q any rime and n > m 0, and we give a comlete solution when m > 0. Keywords: Diohantine equation, rimitive divisor, Lehmer air. Introduction In 1913 the Indian mathematician S. Ramanujan [1] conjectured that the equation x = n 7, had the only following solutions: n = 3 4 5 7 15 x = 1 3 5 11 181 This conjecture was first roved by Nagell [] in 1948. There followed during the eriod 1950-1970, a number of roofs based on a variety of methods (see for examle [3,4] ). Ramanujan equation has the general form x q n q D = 4 4 m +, where D is any odd integer. The urose of this aer is to solve n m x q q = 4 4 + 9 (1) with x > 0, n m 0, where q is any rime, it is clear that x is an odd integer. To solve equation (1) we will use unique factorization of ideals along with linear recurrences and congruences and the BHV Theorem [5]. We start with the case n = 1 and m = 0. 135

136 Case I Let (n, m) = (1,0), in equation (1), then we have x 5 q =. 4 Since x is odd, let x = c + 1, then we get q c c = + 1, () where c is a ositive integer. It is not known if equation () has infinitely many solutions. Case II Let d = g.c.d(m,n), q 1 = q d, n 1 = n/d, m 1 = m/d, in equation (1), then we get the same kind of equation (1) n m 1 1 x q q 1 1 = 4 4 + 9, with n 1,m 1 are corime. So we shall suose (n, m) = 1, which means that n m. Case III If m = 0, and n is an even, then equation (1) has no solutions. So we shall exclude all the above cases. Now we suose the case m > 0, and get the following: Theorem The diohantine equation n m x q q has the following two cases: = 4 4 + 9, n > m, (3) i. m =1: When q=, then it has a unique solution given by (x,n) = (3,1), otherwise it has at most two solutions

On the Diohantine Equation x =4q n -4q m +9 137 ii. m > 1: (a) When m is odd, it has solutions only if q = 3, and these solutions are given by (x,n,m) = (93,7,3), (.3 m 1 3, (m-1), m). (b) When m is even, it has solutions only if q = and m =, and these solutions are given by (x,n) = (1,1), (3,), (5,3), (11,5), (181,13). Proof (i) Let m = 1 in (3). If q =, then we get equation x 1= n + solution (x,q) = (3,). If q, then the equation at most two solutions [6]. (ii) Let m > 1 in (3). We start by writing m n, which is clear has a unique x q n q = 4 4 + 9, has 4q 9= 4q x = Aa. (4) Where A 1 is an odd square free. Suose divides m, where m is odd and ut q 1 =q m/, we get: 1 4q 9= Aa (5) If A = 1, then a 1(mod 4), but 1 is not quadratic residuce modulo 4, therefore A 1. Now if A = 3, then q = 3, and dividing equation (4) by 3, we get the equation y =4q n 4q m +1, which have been solved by Luca [7], and the only solution in our case (q = 3) is n = 7, m = 3 and y = 31, so x = 93. Also Luca refer to the case n = (m ) as the trivial solution of this equation, and this will give us the solution x =.3 m 1 3, as desired. Hence we shall suose that q 1 5, therefore A 5 and A / 0(mod 3). We write (5) as

138 Suose q 1 (3 + Aa) (3 Aa) q =. (6) 1 = ππ, where π is a rime ideal, therefore the two algebraic integers aearing in the right-hand side of (6) are corime in the ring Q( A). Then This imlies that π 3+ Aa 3 π π Aa =. 3+ Aa = and 3 π Aa =. So π is a rincial ideal which imlies O(π ), hence π is a rincial ideal. and Let c+ b A z =, where c b(mod ), is a generator of π then we get q = z z z 3+ Aa =, 3 Aa z =. Since the units in the field Q( A) are ± 1, therefore Hence 3 + Aa 3 Aa ± z =, ± z =. u u = z + z =± 3. (7) From (7) we get that u =± 3 u which imlies that u has no rimitive divisors.

On the Diohantine Equation x =4q n -4q m +9 139 Let = 3 in equation (7), then we get Or 3 3 3 c ± = z + z = Acb. 4 ± 1 = cc ( 3 Ab) (8) If c is even, then so b is even, and in this case the right-hand side of (8) is a multile of 8, which is imossible. Thus c is an odd divisor of 1, therefore c = ± 3, ± 1. From equation (8) we now conclude that 3Ab = 5, 11, ±13, which is obviously imossible. Assume now that 5, in this case, u has no rimitive divisors. From Table and 3 in [5] and a few excetional values of z. None of the excetional Lehmer terms from that Table leads to a value of z Q( A). Thus equation (3) has no solutions when m is odd and q 5. Now let us suose that m is even, say m = k, and k is a ositive integer. From equation (4), we get 9 4 n 4 k x = q q, which imlies that x + 3 x 3 = k n k. q ( q 1). Since the two factors in the left hand side are corime we get q = and m =. Substituting in (4) we find the famous equation of Ramanujan x = n+ 7, which has only the following solutions [] This concludes the roof. (x,n) = (1,1), (3,), (5,3), (11,5), (181,13). References [1] Ramanujan, S., Collected Paers of Ramanujan, (Cambridge Univ. Press, Cambridge, (197). [] Nagell, T., "The diohantine equation x + 7 = n ", Nordisk. Mat. Tidsker, 30, 6-64, Ark. Mat., 4 (1960), 185-187. [3] Mordell, L. J., Diohantine Equations, (Academic Press, London, (1969)). [4] Skolem, Th., Chowla, S. and Lewis, J., "The diohantine equation x = n+ 7 and related roblems", Proc. Amer. Math. Soc., 10 (1959), 663-669.

140 [5] Bilu, Y., Hanrot, G. and Voutier, P.M., "Existence of rimitive divisor of Lucas and Lehmer numbers", J. Reine Angew. Math., 539 (001), 75-1. [6] Maohua, L., "On the diohantine equation x + D = 4 n ", J. Number Theory, 41 (199), 87-97. [7] Luca, F., "On the diohantine equation x = 4q n 4q m +1, Proc. Amer. Math. Soc., 131 (00), 1339-1345.

On the Diohantine Equation x =4q n -4q m +9 141 x =4q n -4q m +9 abumuriefah@yahoo.com :. x =4q n -4q m +9 n > m 0 q. m>0