THE SOLUTION OF 3y2 ± 2" = x3
|
|
- Sibyl Morgan
- 6 years ago
- Views:
Transcription
1 PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 69, Number, May 978 Abstract. THE SOLUTION OF y ± " = x The diophantine equation STANLEY RABINO WITZ (») y + "y = x, with y = ± is solved. Let 9 = /, where E Reals. Then fi = {a + b + c9\a, b, c E Z) is the ring of integers of Q(9), is the fundamental unit of Ü and ñ is a unique factorization domain (U.F.D.) (see e.g. []). All English letters (except Z, Q and N) will represent elements of Z and all lower case Greek letters elements of ñ. a\aß and (a, ß)Q are read (respectively) as "a divides ß in ti" and "the greatest common divisor of a and ß in ß". Table I is taken from []. Table I The solution of y + v = x for some values of v. v: Solutions (x, y > - v: Solutions (x, y > : no solutions : <, > 4: no solutions 4: < -, 4>, <, 5>, <, >, <858, 76844) 7:<,> 7:<-,> 54: <7, 7> 54: <, 9> 8: no solutions 8: < -, 9>, < -, ), <6, 8>, <66, 7> 6: <6, >, <, 8>, <, 89> 6: < - 6, > 4 : <, 6> 4 : no solutions Note that if (*) holds, then n >, since " = y(x y). Proposition. // (*) holds with n = k and xy odd, then <y,, x, y ) = <,,,>. Proof. Since n = k, (9y) + 7 *y = (x). Using Table I we may assume that k >. By (*), y = ab, where a = x - ky and b = x + *yx + k. Since x is odd, b is odd. b > [, Lemma ] and therefore a >. Received by the editors October 8, 976. AMS (MOS) subject classifications (97). Primary B. Key words and phrases. Ring of integers, norm. 'This material forms a part of the author's doctoral dissertation ("On Mordell's equation y + k = x, with 7c = ±"""') completed in 97 at the City University of New York/Graduate Center. American Mathematical Society 978
2 4 STANLEY RABINOWTTZ a = x -ky Hence x = *y (Mod ), which implies that = x - A:y = y = (Mod ). b = x + *yx + * = * + k + k = (Mod ). Thus 9 a? = y, implying that \y. Also (a, b)\ k [, Lemma ]. Since b is odd, (a, b) =. Since (y/) = (a/)(z?/), [, Lemma ] proves that <a/,?/> = (r, s) or <r, 5>. If <a/, Z?/> = <r, s>, then x = r + *y and we obtain (i - V - Ia) = k, which cannot hold. Therefore <a/, Z?/> = <r, s>. Hence s is odd, x = 9r + *y, and 7r4 + 9 *yr + (* - s) =. 8j - 7 * = d [, Lemma 4]. Consequently a", since k >. Thus d = 8Z> and s - D = k~. Therefore D is odd and it follows that 5 - D = -(Mod 8). But 4 *". Proposition.f(*) holds with n = k + and xy odd, then <y,«,x, y > = <-l,,, >,<-,7, -5, > or <-,, 95, 488). Proof. If k =, then (9y) + 54y = (x). We may assume that k > by using Table I. (x, ) =, for otherwise ". Thus by [, Lemma 5], y = x _ *+iy = ± i ± (Mod 9). Hence (y, ) =. By (*), y = aß, where a = x - kyb and ß = x + ky9x + (k9). ß > [, Lemma ] and thus a >. (a, ß)a\a(k9) [, Lemma ]. Since (aß, )ß = [, Lemma 6], (a, ß)a\a = ( + 9)(- + 9). By [4, (), p. ] and [, Theorem -, p. 48] the norm N of fi (over Z) is A(a + b9 + c9) = a + b + 4c - 6abc. Now A(l + 9) =. Thus + 9 is a prime of ß [, Theorem -, -5, pp. 49, 5]. Also x + *y = x + *y = x - *+y = y = (Mod ). Let w = (x + *y)/. Then a = ( + )(w - ky - w9 + w9). Therefore + 9\aa. If ( + f?) ßa, then 9 = A((l + )) A(a) = y, contradicting ( v, ) =. Since Q is a U.F.D. and is a unit of, (a/(\ + 9), ß)u =. Also ((I + 9)yf= (a/ (\ + 9))(ß/ (-\ + 9)). a/(\ + 9) = p(a + b9 + c9), where p = or [, Lemma ]. We may assume that a - b >, since (a + b9 + c9) = (- a - b9 - c9). If jn =, then since, 9 and 9 are linearly independent over Q, x = a + 4bc + b + 4ac and -*y = a + 4bc + c + az?.
3 THE SOLUTION OF y ± " = X 5 The first equation implies that a is odd and the second that a is even (since k > ). Thus p. = I + and we have the following: () x = -a - 4bc + 4c + 4ab, () -*~'y = -c - ab + b + ac, and () = a + 4»c - t - ac. By (), a is odd. From () it follows that b is odd and (4) c(a - b) = a - b. Multiplying () by 4(a - b) and using (4) we have (5) -*+y(a - A) = (a - b)(a - ab + ab - 5b). Let g = (a, b)>,a = a/g and B - b/g. Thus gb is odd, A - B > and (A, B) =\.(A - B, A - B)=\, since (A - B) - (A - B) = A, and (A - B)-(A - B) = B. (5) yields (6) -k+xy(a - B)= g(a - B)(A - AB + AB - 5B). Hence g (^ - fi). Thus g\a - B. Therefore (A - B, ) = and A + B = A - B = (Mod ). Consequently (A - B, A + B) =, since (A - B) + (A + B) = A and (A + B) - (A - B) = B. It follows from (4) that c (A - B)/g = (A - B)-(A + B)/. Hence A - B = ±g. By (6), (7) - * + y = (A - B)(A - AB + AB - 5B). Therefore A B = r, where < r < k +. (7) implies that - *+-'y = (A - B)- 4B = r - 4B. Thus /-^O. Therefore r >. Hence k + - r = [, Lemma 7] and we have (8) r" + y = B. If r = t, then ('") + y = B. There are no solutions in this case by Table I. Thus r = t + and by (8), (,+f+4y = (B). Using Table I, y = - and (B,,+> = < -, 4> or <, >. If <B,,+> = < -, 4>, then B-, t =, r = t + I = \,A = B + r =, k = + r = and n = k + = 7. Since ±g = A - B = and g >, g =, a = g/4 = and b = gß = -. By (4), () and (*), c =, x = -5 and y =. If (B,,+> = <, ) we obtain similarly, k - 4, x - 95 and y = 488. Proposition. // (*) fows w/ia «= k + and xy odd, then (y,n,x, y > = <-l,, -, > or <-l, 8,, >.
4 6 STANLEY RABINO WITZ Proof. If k =, then (9y) + 8y = (x). The solution of this equation is given in Table I. Thus we may assume that k >. (x, ) =. By [, Lemma 5], v = x - *+y = ± ± 4 (Mod 9). Thus (y, ) =. By (*), y = aß, where a = x-ky9 and ß = x + ky9x + (k9 f. As in Proposition, a > and (a, ß)a\a = ( + 9)(- + 9). Also x - *y = x - *y s x - *+y = y = (Mod ). Let u = (x - *y)/. Then a = ( + 9)(x - u + (m - x)9 + u9). Following the argument of Proposition we see that since N(a) = y, a/(\ + 9) = p(a + b9 + c9), where p = or - + 9, and c >. If p =, then x = a + 4bc +? + 4ac and = a + 4bc + c + ab. The first equation implies that a is odd and the second that a is even. Hence p = + 9. Consequently (9) x = - a - 4bc + 4c + 4ab, () = - c - ab + b + ac, and () -ky = a + 4bc - b - ac. a is odd by (9). Therefore since k >, b is odd by (). () implies () a(b - c) = b- c. Multiplying () by -(b - c) and applying () yields () *y(? - c)= c(c - 6?c + 6?c - Z?). Let g = (b, c) >, B = b/g and C = c/g. Therefore gb is odd, C >, (B, C) = and by (), (4) ky(b -C)= gc(c - 6BC + 6BC - B). As in Proposition, (B - C, B - C) =, g\b - C, and (B - C, B + C) =. Thus (C, ) =. It follows from () that a (B - C)/g = (B - C)(B+ Therefore B - C = ±g. By (4), C)/. *y = C(C - 6BC + 6BC - B). Hence C = r, where < r < k. Thus (5) *"ry = r - r+fi + r+5-5. r =, since k >. Therefore r > r + I > r + I >. By (5), k - r = and (6) r~x +y = (r - B). If r = t, then ('+) + 4y = ((r - B)). There are no solutions of this equation by Table I. Thus r = t + and (6) becomes
5 n _ v THE SOLUTION OF y ± " = X 7 ('+x) + y = (r - B). Using Table I we find that y = -,,+ =, and r - B =. Therefore / =, r = It + =, B = r - =, C = ' =, /c = r + =, and ±g = B - C = -. Hence g =, b = gb =, c = gc =, and by (), a =. By (9), x = and finally y = x - k+y = (). Theorem. /<// iac solutions of (*) are g/uew in Table II, vvaere x = ge and y = ±hf. Explanation of Table II. is given modulo 6 and is nonnegative. If / =, the value of A is irrelevant. The solutions are numbered for reference in the proof y n (modulo 6) 4 (n>l) (n > ) ( > 8) g Table II A - n n «- -8 n n f Solution number Proof. By direct calculation the above can be shown to be solutions of (*). Suppose now that (*) holds. Obviously x ^. If y =, then x /ly and therefore t7. Thus solution,, 5 or holds. Assume that y J=. Therefore x = % and y = hf, where efis odd. By (*), (7) A/ + "y = ge. It follows from [, Lemma 7] that (8) A = g < n, (9) A = < g, or () g = < A. If (8), then A = g = 6w. By (7), / + "-6my = e. Propositions, and imply that solution, 6, 7, 8, 9 or must hold. If (9), then n = 6w + i, where i =, or. By (7),(9 J/) + 7 iy = ( g~we). By Table I, solution 4, or holds.
6 8 STANLEY RABINOWITZ If (), then n = 6w + /', wherey = or. By (7), (9 h-wff+ 7 jv = ( Jef. There are no solutions by Table I. Note added in proof. I wish to thank Professor N. M. Stephens for informing me that the results of my doctoral dissertation, from which this paper and [] are taken, were also determined by Professor F. B. Coghlan in his doctoral dissertation "Elliptic curves with conductor N = mn" completed in 967 at Manchester. References. O. Hemer, On the Diophantine equation y k = x, Thesis, Univ. of Uppsala, Almqvist & Wiksells, Uppsala, 95. MR 4, 54.. W. J. LeVeque, Topics in number theory, Vol. II, Addison-Wesley, Reading, Mass., 96.. S. Rabinowitz, ie solution ofy ± " = x, Proc. Amer. Math. Soc. 6 (9), B. L. van der Waerden, Modern algebra, Vol. I, Ungar, New York, 949. Department of Mathematics and Computer Science, Kjngsborough Community College/ CUNY, Brooklyn, New York 5
Math Homework # 4
Math 446 - Homework # 4 1. Are the following statements true or false? (a) 3 5(mod 2) Solution: 3 5 = 2 = 2 ( 1) is divisible by 2. Hence 2 5(mod 2). (b) 11 5(mod 5) Solution: 11 ( 5) = 16 is NOT divisible
More informationON A THEOREM OF TARTAKOWSKY
ON A THEOREM OF TARTAKOWSKY MICHAEL A. BENNETT Dedicated to the memory of Béla Brindza Abstract. Binomial Thue equations of the shape Aa n Bb n = 1 possess, for A and B positive integers and n 3, at most
More informationEXAMPLES OF MORDELL S EQUATION
EXAMPLES OF MORDELL S EQUATION KEITH CONRAD 1. Introduction The equation y 2 = x 3 +k, for k Z, is called Mordell s equation 1 on account of Mordell s long interest in it throughout his life. A natural
More informationOn a Generalization of the Coin Exchange Problem for Three Variables
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 9 (006), Article 06.4.6 On a Generalization of the Coin Exchange Problem for Three Variables Amitabha Tripathi Department of Mathematics Indian Institute
More informationON SOME DIOPHANTINE EQUATIONS (I)
An. Şt. Univ. Ovidius Constanţa Vol. 10(1), 2002, 121 134 ON SOME DIOPHANTINE EQUATIONS (I) Diana Savin Abstract In this paper we study the equation m 4 n 4 = py 2,where p is a prime natural number, p
More informationGaussian integers. 1 = a 2 + b 2 = c 2 + d 2.
Gaussian integers 1 Units in Z[i] An element x = a + bi Z[i], a, b Z is a unit if there exists y = c + di Z[i] such that xy = 1. This implies 1 = x 2 y 2 = (a 2 + b 2 )(c 2 + d 2 ) But a 2, b 2, c 2, d
More informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More informationJu-Si Lee 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 1, No. 5, pp. 1191-1199, August 008 This paper is available online at http://www.tjm.nsysu.edu.tw/ THE RESTRICTED SOLUTIONS OF ax + by =gcd(a, b) Ju-Si Lee Abstract.
More information1. Suppose that a, b, c and d are four different integers. Explain why. (a b)(a c)(a d)(b c)(b d)(c d) a 2 + ab b = 2018.
New Zealand Mathematical Olympiad Committee Camp Selection Problems 2018 Solutions Due: 28th September 2018 1. Suppose that a, b, c and d are four different integers. Explain why must be a multiple of
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationOn a special case of the Diophantine equation ax 2 + bx + c = dy n
Sciencia Acta Xaveriana Vol. 2 No. 1 An International Science Journal pp. 59 71 ISSN. 0976-1152 March 2011 On a special case of the Diophantine equation ax 2 + bx + c = dy n Lionel Bapoungué Université
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationHomework 6 Solution. Math 113 Summer 2016.
Homework 6 Solution. Math 113 Summer 2016. 1. For each of the following ideals, say whether they are prime, maximal (hence also prime), or neither (a) (x 4 + 2x 2 + 1) C[x] (b) (x 5 + 24x 3 54x 2 + 6x
More informationRings, Integral Domains, and Fields
Rings, Integral Domains, and Fields S. F. Ellermeyer September 26, 2006 Suppose that A is a set of objects endowed with two binary operations called addition (and denoted by + ) and multiplication (denoted
More informationREDUCTION OF ELLIPTIC CURVES OVER CERTAIN REAL QUADRATIC NUMBER FIELDS
MATHEMATICS OF COMPUTATION Volume 68, Number 228, Pages 1679 1685 S 0025-5718(99)01129-1 Article electronically published on May 21, 1999 REDUCTION OF ELLIPTIC CURVES OVER CERTAIN REAL QUADRATIC NUMBER
More information(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d
The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers
More informationTwo Diophantine Approaches to the Irreducibility of Certain Trinomials
Two Diophantine Approaches to the Irreducibility of Certain Trinomials M. Filaseta 1, F. Luca 2, P. Stănică 3, R.G. Underwood 3 1 Department of Mathematics, University of South Carolina Columbia, SC 29208;
More informationTHE RESULTANT OF SEVERAL HOMOGENEOUS POLYNOMIALS IN TWO INDETERMINATES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 54, January 1976 THE RESULTANT OF SEVERAL HOMOGENEOUS POLYNOMIALS IN TWO INDETERMINATES KUNIO KAKIE Abstract. We give one method of determining the
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationDONG QUAN NGOC NGUYEN
REPRESENTATION OF UNITS IN CYCLOTOMIC FUNCTION FIELDS DONG QUAN NGOC NGUYEN Contents 1 Introduction 1 2 Some basic notions 3 21 The Galois group Gal(K /k) 3 22 Representation of integers in O, and the
More informationOn a Theorem of Dedekind
On a Theorem of Dedekind Sudesh K. Khanduja, Munish Kumar Department of Mathematics, Panjab University, Chandigarh-160014, India. E-mail: skhand@pu.ac.in, msingla79@yahoo.com Abstract Let K = Q(θ) be an
More informationOn the Rank of the Elliptic Curve y 2 = x 3 nx
International Journal of Algebra, Vol. 6, 2012, no. 18, 885-901 On the Rank of the Elliptic Curve y 2 = x 3 nx Yasutsugu Fujita College of Industrial Technology, Nihon University 2-11-1 Shin-ei, Narashino,
More information1 x i. i=1 EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA
Volume, Number 2, Pages 63 78 ISSN 75-0868 ON THE EQUATION n i= = IN DISTINCT ODD OR EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA Abstract. In this paper we combine theoretical
More informationNOTES ON INTEGERS. 1. Integers
NOTES ON INTEGERS STEVEN DALE CUTKOSKY The integers 1. Integers Z = {, 3, 2, 1, 0, 1, 2, 3, } have addition and multiplication which satisfy familar rules. They are ordered (m < n if m is less than n).
More informationDivisibility. Def: a divides b (denoted a b) if there exists an integer x such that b = ax. If a divides b we say that a is a divisor of b.
Divisibility Def: a divides b (denoted a b) if there exists an integer x such that b ax. If a divides b we say that a is a divisor of b. Thm: (Properties of Divisibility) 1 a b a bc 2 a b and b c a c 3
More informationOn a Sequence of Nonsolvable Quintic Polynomials
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 1 (009), Article 09..8 On a Sequence of Nonsolvable Quintic Polynomials Jennifer A. Johnstone and Blair K. Spearman 1 Mathematics and Statistics University
More informationEXAMPLES OF MORDELL S EQUATION
EXAMPLES OF MORDELL S EQUATION KEITH CONRAD 1. Introduction The equation y 2 = x 3 +k, for k Z, is called Mordell s equation 1 on account of Mordell s long interest in it throughout his life. A natural
More informationARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS
ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS TIMO ERKAMA It is an open question whether n-cycles of complex quadratic polynomials can be contained in the field Q(i) of complex rational numbers
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
More informationProof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have
Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.
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 operations defined on them, addition and multiplication,
More informationNIL DERIVATIONS AND CHAIN CONDITIONS IN PRIME RINGS
proceedings of the american mathematical society Volume 94, Number 2, June 1985 NIL DERIVATIONS AND CHAIN CONDITIONS IN PRIME RINGS L. O. CHUNG AND Y. OBAYASHI Abstract. It is known that in a prime ring,
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationAdvances in Applied Mathematics 48(2012), Constructing x 2 for primes p = ax 2 + by 2
Advances in Applied Mathematics 4(01, 106-10 Constructing x for primes p ax + by Zhi-Hong Sun School of Mathematical Sciences, Huaiyin Normal University, Huaian, Jiangsu 3001, P.R. China E-mail: zhihongsun@yahoo.com
More informationCommutative Rings and Fields
Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two
More informationOn integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1
ACTA ARITHMETICA LXXXII.1 (1997) On integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1 by P. G. Walsh (Ottawa, Ont.) 1. Introduction. Let d denote a positive integer. In [7] Ono proves that if the number
More informationMINIMAL POLYNOMIALS AND CHARACTERISTIC POLYNOMIALS OVER RINGS
JP Journal of Algebra, Number Theory and Applications Volume 0, Number 1, 011, Pages 49-60 Published Online: March, 011 This paper is available online at http://pphmj.com/journals/jpanta.htm 011 Pushpa
More informationNecessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1
Necessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1 R.A. Mollin Abstract We look at the simple continued
More informationUnit 3 Factors & Products
1 Unit 3 Factors & Products General Outcome: Develop algebraic reasoning and number sense. Specific Outcomes: 3.1 Demonstrate an understanding of factors of whole number by determining the: o prime factors
More informationSEMIRINGS SATISFYING PROPERTIES OF DISTRIBUTIVE TYPE
proceedings of the american mathematical society Volume 82, Number 3, July 1981 SEMIRINGS SATISFYING PROPERTIES OF DISTRIBUTIVE TYPE ARIF KAYA AND M. SATYANARAYANA Abstract. Any distributive lattice admits
More informationExplicit solution of a class of quartic Thue equations
ACTA ARITHMETICA LXIV.3 (1993) Explicit solution of a class of quartic Thue equations by Nikos Tzanakis (Iraklion) 1. Introduction. In this paper we deal with the efficient solution of a certain interesting
More informationA NOTE ON THE DIOPHANTINE EQUATION a x b y =c
MATH. SCAND. 107 010, 161 173 A NOTE ON THE DIOPHANTINE EQUATION a x b y =c BO HE, ALAIN TOGBÉ and SHICHUN YANG Abstract Let a,b, and c be positive integers. We show that if a, b = N k 1,N, where N,k,
More informationPrecalculus Chapter P.1 Part 2 of 3. Mr. Chapman Manchester High School
Precalculus Chapter P.1 Part of 3 Mr. Chapman Manchester High School Algebraic Expressions Evaluating Algebraic Expressions Using the Basic Rules and Properties of Algebra Definition of an Algebraic Expression:
More informationCommunications in Algebra Publication details, including instructions for authors and subscription information:
This article was downloaded by: [Professor Alireza Abdollahi] On: 04 January 2013, At: 19:35 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered
More informationA GENERALIZATION OF BI IDEALS IN SEMIRINGS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 8(2018), 123-133 DOI: 10.7251/BIMVI1801123M Former BULLETIN
More informationUniversity of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. February 9, :30 pm Duration: 1:50 hs. Closed book, no calculators
University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura February 9, 2010 11:30 pm Duration: 1:50 hs Closed book, no calculators Last name: First name: Student number: There are 5 questions and
More informationRight Tetrahedra and Pythagorean Quadruples
The Minnesota Journal of Undergraduate Mathematics Right Tetrahedra and Pythagorean Quadruples Shrijana Gurung Minnesota State University Moorhead The Minnesota Journal of Undergraduate Mathematics Volume
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationMODEL ANSWERS TO THE FIRST HOMEWORK
MODEL ANSWERS TO THE FIRST HOMEWORK 1. Chapter 4, 1: 2. Suppose that F is a field and that a and b are in F. Suppose that a b = 0, and that b 0. Let c be the inverse of b. Multiplying the equation above
More informationCONTENTS COLLEGE ALGEBRA: DR.YOU
1 CONTENTS CONTENTS Textbook UNIT 1 LECTURE 1-1 REVIEW A. p. LECTURE 1- RADICALS A.10 p.9 LECTURE 1- COMPLEX NUMBERS A.7 p.17 LECTURE 1-4 BASIC FACTORS A. p.4 LECTURE 1-5. SOLVING THE EQUATIONS A.6 p.
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime
More information. In particular if a b then N(
Gaussian Integers II Let us summarise what we now about Gaussian integers so far: If a, b Z[ i], then N( ab) N( a) N( b). In particular if a b then N( a ) N( b). Let z Z[i]. If N( z ) is an integer prime,
More informationRunning Modulus Recursions
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 (2010), Article 10.1.6 Running Modulus Recursions Bruce Dearden and Jerry Metzger University of North Dakota Department of Mathematics Witmer Hall
More informationBENT POLYNOMIALS OVER FINITE FIELDS
BENT POLYNOMIALS OVER FINITE FIELDS ROBERT S COULTER AND REX W MATTHEWS Abstract. The definition of bent is redefined for any finite field. Our main result is a complete description of the relationship
More informationMODEL ANSWERS TO HWK #10
MODEL ANSWERS TO HWK #10 1. (i) As x + 4 has degree one, either it divides x 3 6x + 7 or these two polynomials are coprime. But if x + 4 divides x 3 6x + 7 then x = 4 is a root of x 3 6x + 7, which it
More information4.4 Solving Congruences using Inverses
4.4 Solving Congruences using Inverses Solving linear congruences is analogous to solving linear equations in calculus. Our first goal is to solve the linear congruence ax b pmod mq for x. Unfortunately
More informationON MONIC BINARY QUADRATIC FORMS
ON MONIC BINARY QUADRATIC FORMS JEROME T. DIMABAYAO*, VADIM PONOMARENKO**, AND ORLAND JAMES Q. TIGAS*** Abstract. We consider the quadratic form x +mxy +ny, where m n is a prime number. Under the assumption
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationLecture 7.5: Euclidean domains and algebraic integers
Lecture 7.5: Euclidean domains and algebraic integers Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley
More informationSang-baek Lee*, Jae-hyeong Bae**, and Won-gil Park***
JOURNAL OF THE CHUNGCHEONG MATHEMATICAL SOCIETY Volume 6, No. 4, November 013 http://d.doi.org/10.14403/jcms.013.6.4.671 ON THE HYERS-ULAM STABILITY OF AN ADDITIVE FUNCTIONAL INEQUALITY Sang-baek Lee*,
More informationREGULAR CLOSURE MOIRA A. MCDERMOTT. (Communicated by Wolmer V. Vasconcelos)
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 127, Number 7, Pages 1975 1979 S 0002-9939(99)04756-5 Article electronically published on March 17, 1999 REGULAR CLOSURE MOIRA A. MCDERMOTT (Communicated
More informationQUOTIENTS OF PROXIMITY SPACES
proceedings of the american mathematical society Volume 37, Number 2, February 1973 QUOTIENTS OF PROXIMITY SPACES LOUIS FRIEDLER Abstract. A characterization of the quotient proximity is given. It is used
More informationSOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM
Acta Arith. 183(018), no. 4, 339 36. SOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM YU-CHEN SUN AND ZHI-WEI SUN Abstract. Lagrange s four squares theorem is a classical theorem in number theory. Recently,
More informationNumber Theory Homework.
Number Theory Homewor. 1. The Theorems of Fermat, Euler, and Wilson. 1.1. Fermat s Theorem. The following is a special case of a result we have seen earlier, but as it will come up several times in this
More informationREVIEW Chapter 1 The Real Number System
REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }
More informationWhat Numbers Are of the Form a 2 +3b 2?
What Numbers Are of the Form a +3b? Aryeh Zax 03/7/7 Fix an ambient UFD S. Forp S aprimeandn S \{0}, Denotebyv p (n) theexponent of p in the prime factorization of n, i.e. thelargestk such that p k n.
More informationand A", where (1) p- 8/+ 1 = X2 + Y2 = C2 + 2D2, C = X=\ (mod4).
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 87, Number 3. March 1983 THE Odie PERIOD POLYNOMIAL RONALD J. EVANS1 Abstract. The coefficients and the discriminant of the octic period polynomial
More information(3,1) Methods of Proof
King Saud University College of Sciences Department of Mathematics 151 Math Exercises (3,1) Methods of Proof 1-Direct Proof 2- Proof by Contraposition 3- Proof by Contradiction 4- Proof by Cases By: Malek
More informationDiophantine Equations and Hilbert s Theorem 90
Diophantine Equations and Hilbert s Theorem 90 By Shin-ichi Katayama Department of Mathematical Sciences, Faculty of Integrated Arts and Sciences The University of Tokushima, Minamijosanjima-cho 1-1, Tokushima
More informationMath Theory of Number Homework 1
Math 4050 Theory of Number Homework 1 Due Wednesday, 015-09-09, in class Do 5 of the following 7 problems. Please only attempt 5 because I will only grade 5. 1. Find all rational numbers and y satisfying
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationDetermining elements of minimal index in an infinite family of totally real bicyclic biquadratic number fields
Determining elements of minimal index in an infinite family of totally real bicyclic biquadratic number fields István Gaál, University of Debrecen, Mathematical Institute H 4010 Debrecen Pf.12., Hungary
More informationShort proofs of the universality of certain diagonal quadratic forms
Arch. Math. 91 (008), 44 48 c 008 Birkhäuser Verlag Basel/Switzerland 0003/889X/010044-5, published online 008-06-5 DOI 10.1007/s00013-008-637-5 Archiv der Mathematik Short proofs of the universality of
More informationINFINITELY MANY ELLIPTIC CURVES OF RANK EXACTLY TWO. 1. Introduction
INFINITELY MANY ELLIPTIC CURVES OF RANK EXACTLY TWO DONGHO BYEON AND KEUNYOUNG JEONG Abstract. In this note, we construct an infinite family of elliptic curves E defined over Q whose Mordell-Weil group
More informationarxiv:math/ v2 [math.qa] 22 Jun 2006
arxiv:math/0601181v [mathqa] Jun 006 FACTORIZATION OF ALTERNATING SUMS OF VIRASORO CHARACTERS E MUKHIN Abstract G Andrews proved that if n is a prime number then the coefficients a k and a k+n of the product
More informationStrongly Nil -Clean Rings
Strongly Nil -Clean Rings Abdullah HARMANCI Huanyin CHEN and A. Çiğdem ÖZCAN Abstract A -ring R is called strongly nil -clean if every element of R is the sum of a projection and a nilpotent element that
More informationTRIVIAL EXTENSION OF A RING WITH BALANCED CONDITION
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 77, Number 1, October 1979 TRIVIAL EXTENSION OF A RING WITH BALANCED CONDITION HIDEAKI SEKIYAMA Abstract. A ring R is called QF-1 if every faithful
More information(IV.C) UNITS IN QUADRATIC NUMBER RINGS
(IV.C) UNITS IN QUADRATIC NUMBER RINGS Let d Z be non-square, K = Q( d). (That is, d = e f with f squarefree, and K = Q( f ).) For α = a + b d K, N K (α) = α α = a b d Q. If d, take S := Z[ [ ] d] or Z
More informationRecognising nilpotent groups
Recognising nilpotent groups A. R. Camina and R. D. Camina School of Mathematics, University of East Anglia, Norwich, NR4 7TJ, UK; a.camina@uea.ac.uk Fitzwilliam College, Cambridge, CB3 0DG, UK; R.D.Camina@dpmms.cam.ac.uk
More informationSummary Slides for MATH 342 June 25, 2018
Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.
More informationOn a Diophantine Equation 1
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 2, 73-81 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.728 On a Diophantine Equation 1 Xin Zhang Department
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationMULTIPLICATIVE SUBGROUPS OF FINITE INDEX IN A DIVISION RING GERHARD TURNWALD. (Communicated by Maurice Auslander)
PROCEEDINGS of the AMERICAN MATHEMATICAL SOCIETY Volume 120, Number 2, February 1994 MULTIPLICATIVE SUBGROUPS OF FINITE INDEX IN A DIVISION RING GERHARD TURNWALD (Communicated by Maurice Auslander) Abstract.
More informationProof by Contradiction
Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving
More informationON INTEGERS NONREPRESENTABLE BY A GENERALIZED ARITHMETIC PROGRESSION
ON INTEGERS NONREPRESENTABLE BY A GENERALIZED ARITHMETIC PROGRESSION Gretchen L. Matthews 1 Department of Mathematical Sciences, Clemson University, Clemson, SC 9634-0975, USA gmatthe@clemson.edu Received:
More informationDepartment of Mathematics, Nanjing University Nanjing , People s Republic of China
Proc Amer Math Soc 1382010, no 1, 37 46 SOME CONGRUENCES FOR THE SECOND-ORDER CATALAN NUMBERS Li-Lu Zhao, Hao Pan Zhi-Wei Sun Department of Mathematics, Naning University Naning 210093, People s Republic
More informationA NOTE ON THE SIMULTANEOUS PELL EQUATIONS x 2 ay 2 = 1 AND z 2 by 2 = 1. Maohua Le Zhanjiang Normal College, P.R. China
GLASNIK MATEMATIČKI Vol. 47(67)(2012), 53 59 A NOTE ON THE SIMULTANEOUS PELL EQUATIONS x 2 ay 2 = 1 AND z 2 by 2 = 1 Maohua Le Zhanjiang Normal College, P.R. China Abstract. Let m,n be positive integers
More informationa the relation arb is defined if and only if = 2 k, k
DISCRETE MATHEMATICS Past Paper Questions in Number Theory 1. Prove that 3k + 2 and 5k + 3, k are relatively prime. (Total 6 marks) 2. (a) Given that the integers m and n are such that 3 (m 2 + n 2 ),
More informationCoding Theory ( Mathematical Background I)
N.L.Manev, Lectures on Coding Theory (Maths I) p. 1/18 Coding Theory ( Mathematical Background I) Lector: Nikolai L. Manev Institute of Mathematics and Informatics, Sofia, Bulgaria N.L.Manev, Lectures
More informationDENSITY RELATIVE TO A TORSION THEORY
PROCEEDINGS of the AMERICAN MATHEMATICAL SOCIETY Volume 82, Number 4, August 1981 DENSITY RELATIVE TO A TORSION THEORY PAUL BLAND AND STEPHEN RILEY Abstract. If (9", 5) is a torsion theory on Mod R, then
More informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
More informationGROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION
Chapter-1 GROUPS 1.1. INTRODUCTION The theory of groups arose from the theory of equations, during the nineteenth century. Originally, groups consisted only of transformations. The group of transformations
More informationIdeals Of The Ring Of Higher Dimensional Dual Numbers
Journal of Advances in Algebra (AA). ISSN 0973-6964 Volume 9, Number 1 (2016), pp. 1 8 Research India Publications http://www.ripublication.com/aa.htm Ideals Of The Ring Of Higher Dimensional Dual Numbers
More informationArithmetic Funtions Over Rings with Zero Divisors
BULLETIN of the Bull Malaysian Math Sc Soc (Second Series) 24 (200 81-91 MALAYSIAN MATHEMATICAL SCIENCES SOCIETY Arithmetic Funtions Over Rings with Zero Divisors 1 PATTIRA RUANGSINSAP, 1 VICHIAN LAOHAKOSOL
More informationHOMEWORK ASSIGNMENT 5
HOMEWORK ASSIGNMENT 5 ACCELERATED PROOFS AND PROBLEM SOLVING [MATH08071] Each problem will be marked out of 4 points. Exercise 1 [1, Exercise 10.4]). Show that for all positive integers n, hcf6n + 8, 4n
More informationDICKSON POLYNOMIALS OVER FINITE FIELDS. n n i. i ( a) i x n 2i. y, a = yn+1 a n+1 /y n+1
DICKSON POLYNOMIALS OVER FINITE FIELDS QIANG WANG AND JOSEPH L. YUCAS Abstract. In this paper we introduce the notion of Dickson polynomials of the k + 1)-th kind over finite fields F p m and study basic
More informationComputations/Applications
Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x
More information