ON SOME DIOPHANTINE EQUATIONS (II)
|
|
- Joseph Poole
- 6 years ago
- Views:
Transcription
1 An. Şt. Univ. Ovidius Constanţa Vol. 10(), 00, ON SOME DIOPHANTINE EQUATIONS (II) Diana Savin Abstract In [7] we have studied the equation m n = py, where p is a prime natural number p 3. Using the above result, in this paper, we study the equations c k (x + 6px y +p y ) + pd k (x 3 y + pxy 3 ) = 3z with p {5, 13, 9, 37}, where (c k, d k ) is a solution of the Pell equation c pd = Preliminaries. In order to solve our problems, we need some auxiliary results. Proposition 1.1. ([3], pag.7) The integer solutions of the Diophantine equation x 1 +x x k = x k+1 are the following ones: x 1 = ±(m 1 + m m k 1 m k ) x = m 1 m k...,... x k = m k 1 m k x k+1 = ±(m 1 + m m k 1 + m k ), with m 1,..., m k integer number. From the geometrical point of view, the elements x 1, x,..., x k are the sizes of an orthogonal hyper-parallelipiped in the space R k and x k+1 is the length of its diagonal. Proposition 1.. ([1], pag.150) For the quadratic field Q( d), where d N, d is square free, its ring of integers A is Euclidian with respect to the norm N, in the cases d {, 3, 5, 6, 7, 11, 13, 17, 19, 1, 9, 33, 37, 1, 57, 73}. Proposition 1.3.([1], pag11) Let K=Q( d) be a quadratic field with A as its ring of integers. For a A, a U(A) if and only if N(a)=1. Key Words: Diophantine equation; Pell equation. 79
2 80 Diana Savin Proposition 1.. ([7],Theorem 3..). Let p be a natural prime number greater than 3.If the equation m n = py has a solution m, n, y Z, then it has an infinity of integer solutions. Results. Proposition.1. The equation m n = 5y solutions. has an infinity of integer Proof. The equation m n = 5y has nontrivial integer solutions, for example m = 5, n = 155, y = 600. Following Proposition 1.., the equation m n = 5y has an infinity of integer solutions. Proposition.. The equation m n = 13y solutions. has an infinity of integer Proof. It is sufficient to show that the equation m n = 13y has nontrivial integer solutions. In deed m = 1779, n = 8099, y = is such a solution.by Proposition 1.., the equation m n = 13y has an infinity of integer solutions. Now, we study our equations for p {5, 13}. Proposition.3. The equations c k (x + 6px y +p y ) + pd k (x 3 y + pxy 3 ) = 3z, with p {5, 13}, where (c k, d k ) is a solution of the Pell equation c pd = =1, have an infinity of integer solutions. Proof. If p {5, 13}, then p 5 (mod 8). By Proposition 1.., the ring A of the integers of the quadratic field Q( p) is Euclidian with respect ] to the norm N. But p 5 (mod 8) implies p 1 (mod )and A=Z. [ 1+ p We shall study the equation m n = py, where p is a prime number, p 5 (mod 8) and ( m, n ) = 1, in the ring A. The equation m n = py is equivalent with (m y p)(m + y p) = n. Let α A be a common divisor of m py and m + py. As α A, α = c + d p, c, d Z, and c, d are simultaneously even or odd. As α/(m + y p) and α/(m y p), we have α/m and α/y p, therefore N(α)/m (in Z) and N(α)/py (in Z), hence N(α)/(m, py ). (m, n) = 1 implies (m, y) = 1 (if (m, y) = d > 1 then m
3 On Some Diophantine Equations (II) 81 and n would not be relatively prime). Analogously, (m, p) = 1 implies in turn that (m, py ) =, hence N(α) {1,, }. If N(α) =, then c p d =. If c d p =, then c pd = 8, c, d Z and c, d are simultaneously even or odd. If c and d are odd numbers, then c, d 1 ( mod 8). But p 5 ( mod 8). Then c pd ( mod 8), which implies that the equation c pd = 8 does not have integer solutions. If c and d are even numbers, then let us take them c = c, d = d,with c, d Z. We get c pd = 8, then (c ) p(d ) =. But p 5 ( mod 8) implies: (c ) p(d ) ( mod 8), if c, d are odd numbers, (c ) p(d ) 0 or ( mod 8), if c, d are even numbers, (c ) p(d ) = an odd number, if c, d are one even and the other odd. Therefore the equation (c ) p(d ) = does not have integer solutions. If c d p =, that means c pd = 8, with c, d Z + 1 or c, d Z. If c and d are odd numbers, then c, d 1 ( mod 8). As p 5 ( mod 8), this implies c pd ( mod 8), which gives us that the equation c pd = 8 does not have integer solutions. If c and d are even numbers, then c = c, d = d, c, d Z. We get c pd = 8,which means that (c ) p(d ) =. But, as above, p 5 ( mod 8) implies that the equation (c ) p(d ) = does not have integer solutions.we get N(α). If N(α) =, then c p d c =. If p d =, then c pd = 16, where c, d Z and c, d are simultaneously either even or odd. If c and d are odd numbers, then c, d 1 ( mod 8), and, since p 5 ( mod 8), c pd ( mod 8),which implies that the equation c pd = 16 does not have integer solutions. If c and d are even numbers, then c = c, d = d, with c, d Z, therefore (c ) p(d ) =. This equation may have integer solutions only if c, d are simultaneously either even or odd. The equation (c ) p(d = ( ) ( ) ( c is equivalent with d = 1. If we denote α c = + ) d p A, with c, d Z + 1 or c, d Z, we get α U (A).From α = c + d p, we obtain that α = α, α U (A). Supposing that is reducible in A,hence there exist a1 + b1 p, a + b p A ( a1, a, b 1, b Z, a 1, b 1, as well as, a, b being simultaneounsly odd or even) such that = ( a1 +. b1 p)( a + b p),hence N() = N( a 1 + b1 p)n( a + b p). This is equivalent with = N( a1 + b1 p)n( a + b p). But we have previously proved that there aren t elements in A having the norm equal with. We get N( a1 + b1 p) = 1
4 8 Diana Savin or N( a + b p) = 1, therefore a 1 + b1 p U (A)or a + b p U (A), hence is irreducible in A. We come back to the fact that α/(m + y p and α/(m y p. This implis α /(m + y p) and α /(m y p), then /(m + y p) and /(m y p),therefore /(m py ). This means /n. As is irreducible in A, we get /n ( in A), hence /n. This is equivalent with /(m + y p) (m y p) ( in A), which implies k /(m + y p)or k /(m y p), k N,k. As k /(m + y p), k N,k, implies /(m + y p), hence there exists ( a + ) b p A ( either a, b Z + 1 or a, b Z ) such that m + y p = ( a + ) b p, hence m = a and y = b (in Z), then /m and /y (in Z). As m n = py, this implies /n (in Z), in contradiction with the fact that (m, n) = 1. Analogously we get to contradiction in the case of the equation c p d =. Therefore N(α). From the previously proved, N(α) and N(α), hence N(α) = 1 and α U (A). We obtained that (m + y p) and (m y p) are relatively prime elements in A, but (m y p)(m + y p) = n, therefore there exists ( f + g ) p A with the property: m +y p = ( c k + d ( k p) f + g ) p, ( c k + d k p) U (A) ( here ck, d k Z, c k, d k are simultaneously odd or even, N( c k + d k p) = 1).This is equivalent to m + py = = ( c k + d ) ( k f 16 + f 3 g p + 3f g p 8 + fg3 p ) p + g p 16, which is equivalent to 3(m + y p) = (c k + d k p)(f + f 3 g p + 6f g p + fg 3 p p + g p ), implying the system: { 3m = c k f + 6pc k f g + p c k g + pf 3 gd k + p fg 3 d k 3y = c k f 3 g + pc k fg 3 + d k f + 6pd k f g + p d k g, equivalently { 3 m = c k (f + 6pf g + p g ) + pd k (f 3 g + pfg 3 ) 3y = d k (f + 6pf g + p g ) + c k (f 3 g + pfg 3 ). We have already proved that the equation m n = py, where p {5, 13} has an infinity of integer solutions. Therefore, if the system: { 3 m = c k (f + 6pf g + p g ) + pd k (f 3 g + pfg 3 ) 3y = d k (f + 6pf g + p g ) + c k (f 3 g + pfg 3 ) has an infinity of integer solutions and hence the equation 3 m = c k (f + 6pf g + p g ) + pd k (f 3 g + pfg 3 ) has an infinity of integer solutions.
5 On Some Diophantine Equations (II) 83 We do not know if the Diophantine equation m n = py has nontrivial solutions for p {9, 37}, but we may prove the following result. Proposition.. If the equations c k (x + 6px y +p y ) + pd k (x 3 y+ +pxy 3 ) = 3z,with p {9, 37}, where (c k, d k ) is a solution of the Pell equation c pd = 1,have a solution x, y, z Z, then they have an infinity of integer solutions. Proof. In our case again p 5 (mod 8) and the ring A of the integers of the quadratic field Q( p) is Euclidian with respect to the norm N, A ] being Z. We study the equation m n = py, where p is prime [ 1+ p number, p 5 (mod 8) in the ring A.The given equation is equivalent to (m y p)(m + y p) = n. Let α A be a common divisor of m y p and m + y p. Then α = c + d p, with c, d Z + 1 or c, d Z. As α/(m + y p) and α/(m y p), we have α/m and α/y p, so N(α)/m and N(α)/py ( in Z ), hence N(α)/(m, py ).(m, n) = 1 implies (m, y) = 1 (if (m, y) = d > 1, then m and n are not relatively prime). Analogously, (m, p) = 1 implies in turn that (m, py ) = 1, (m, py ) =, hence N(α) {1,, }. If N(α) =, we have c p d =. If c d p =, that means c pd = 8, c, d Z and c, d are simultaneously even or odd. If c and d are odd numbers, then c, d 1 ( mod 8). As p 5 ( mod 8),then c pd ( mod 8 ), which implies that the equation c pd = 8 does not have integer solutions. If c and d are even numbers then c = c, d = d, c, d Z. We get c pd = 8, therefore (c ) p(d ) =. But p 5 ( mod 8) implies:(c ) p(d ) ( mod 8), if c, d are odd numbers,(c ) p(d ) 0 or ( mod 8), if c, d are even numbers, (c ) p(d ) = an odd number, if c, d are one even and another odd, and the equation (c ) p(d ) = does not have integer solutions. If c p d =, then c pd = 8, c, d Z or c, d Z + 1. If c and d are odd numbers, then c, d 1 ( mod 8). But p 5 ( mod 8) impliesc pd ( mod 8), which gives us that the equation c pd = 8 does not haveinteger solutions. If c and d are even numbers, then c = c, d = d, c, d Z. We get the equation (c ) p(d ) =, which does not have integer solutions. We get N(α). In the same way as
6 8 Diana Savin above, we prove that N(α). It remains only α U (A) and m + y p, m y p are relatively prime elements in A. As (m y p)(m + y ( p) = n, there exists f + g ) p A such that: m +y p = ( c k + d k p) ( f + g p ), ( c k + d k p) U (A) (ck, d k Z, c k, d k are simultaneously even or odd, N( c k + d k p) = 1), which is equivalent tom + y ( p = ( c k + d k ) f 16 + f 3 g p + 3f g p 8 + fg3 p ) p + g p 16,which is equivalent to 3(m + y p) = (c k + d k p)(f + f 3 g p + 6f g p + fg 3 p p + g p ). This implies the system: { 3m = c k f + 6pc k f g + p c k g + pf 3 gd k + p fg 3 d k 3y = c k f 3 g + pc k fg 3 + d k f + 6pd k f g + p d k g, which implies the system: { 3 m = c k (f + 6pf g + p g ) + pd k (f 3 g + pfg 3 ) 3y = d k (f + 6pf g + p g ) + c k (f 3 g + pfg 3 ). We have already proved that, if the equation m n = py has a nontrivial solution inz, it has an infinity of integer solutions. Therefore, if the system { 3 m = c k (f + 6pf g + p g ) + pd k (f 3 g + pfg 3 ) 3y = d k (f + 6pf g + p g ) + c k (f 3 g + pfg 3 ), has a nontrivial solution in Z, it has an infinity of integer solutions. Therefore, if the equation 3 m = c k (f + 6pf g + p g ) + pd k (f 3 g + pfg 3 ) has a nontrivial solution in Z, it has an infinity of integer solutions. References [1] T. Albu, I.D.Ion, Chapters of the algebraic theory of numbers ( in Romanian), Ed. Academiei, Bucureşti, 198. [] V. Alexandru, N.M. Goşoniu, The elements of the theory of numbers ( in Romanian), Ed.Universităţii Bucureşti, [3] T. Andreescu, D. Andrica, An Introduction in the Study of Diophantine Equations (in Romanian), Ed. Gil, Zalău, 00. [] L.J. Mordell, Diophantine Equations, Academic Press, New York,1969.
7 On Some Diophantine Equations (II) 85 [5] L. Panaitopol, A. Gica, An introduction in arithmetic and the theory of numbers( in Romanian),Ed. Universităţii Bucureşti, 001. [6] Ireland, M. Rosen, A Classical Introduction to Modern Number Theory,Springer- Verlag, 199. [7] D. Savin, On Some Diophantine Equations ( I )Analele Universităţii Övidius,Constanţa, ser. Matematica, 11 (00), fasc.1, pag [8] W.Sierpinski, What we know and what we do not know about prime numbers( in Romanian), ( transl. from the Polish edition,196), Bucureşti. [9] C. Vraciu, M. Vraciu, The elements of Arithmetic, Ed. All, Bucureşti, Ovidius University of Constanta Department of Mathematics and Informatics, Constanta, Bd. Mamaia, 1 Romania Savin.Diana@univ-ovidius.ro
8 86 Diana Savin
ON 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 informationBulletin of the Transilvania University of Braşov Vol 7(56), No Series III: Mathematics, Informatics, Physics, 59-64
Bulletin of the Transilvania University of Braşov Vol 756), No. 2-2014 Series III: Mathematics, Informatics, Physics, 59-64 ABOUT QUATERNION ALGEBRAS AND SYMBOL ALGEBRAS Cristina FLAUT 1 and Diana SAVIN
More informationarxiv: v1 [math.nt] 2 Jul 2009
About certain prime numbers Diana Savin Ovidius University, Constanţa, Romania arxiv:0907.0315v1 [math.nt] 2 Jul 2009 ABSTRACT We give a necessary condition for the existence of solutions of the Diophantine
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 informationINDICATIVE PROPOSITIONS
An. Şt. Univ. Ovidius Constanţa Vol. 9(1), 2001, 89 94 INDICATIVE PROPOSITIONS Ioan Purdea and Nicolae Both Abstract Two new problems of bivalent propositional logic are proposed here: firstly, to distinguish
More informationOn a theorem of Ziv Ran
INSTITUTUL DE MATEMATICA SIMION STOILOW AL ACADEMIEI ROMANE PREPRINT SERIES OF THE INSTITUTE OF MATHEMATICS OF THE ROMANIAN ACADEMY ISSN 0250 3638 On a theorem of Ziv Ran by Cristian Anghel and Nicolae
More informationARITHMETIC PROGRESSIONS IN THE POLYGONAL NUMBERS
#A43 INTEGERS 12 (2012) ARITHMETIC PROGRESSIONS IN THE POLYGONAL NUMBERS Kenneth A. Brown Dept. of Mathematics, University of South Carolina, Columbia, South Carolina brownka5@mailbox.sc.edu Scott M. Dunn
More informationNumber Theory. Final Exam from Spring Solutions
Number Theory. Final Exam from Spring 2013. Solutions 1. (a) (5 pts) Let d be a positive integer which is not a perfect square. Prove that Pell s equation x 2 dy 2 = 1 has a solution (x, y) with x > 0,
More informationStatistical simulation and prediction in software reliability
An. Şt. Univ. Ovidius Constanţa Vol. 16(1), 2008, 81 90 Statistical simulation and prediction in software reliability Alexei Leahu and Carmen Elena Lupu Abstract On the base of statistical simulation (Monte
More informationLEGENDRE S THEOREM, LEGRANGE S DESCENT
LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +
More information(1) Let G be a finite group and let P be a normal p-subgroup of G. Show that P is contained in every Sylow p-subgroup of G.
(1) Let G be a finite group and let P be a normal p-subgroup of G. Show that P is contained in every Sylow p-subgroup of G. (2) Determine all groups of order 21 up to isomorphism. (3) Let P be s Sylow
More informationA Classical Introduction to Modern Number Theory
Kenneth Ireland Michael Rosen A Classical Introduction to Modern Number Theory Second Edition Springer Contents Preface to the Second Edition Preface v vii CHAPTER 1 Unique Factorization 1 1 Unique Factorization
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 informationJust like the ring of Gaussian integers, the ring of Eisenstein integers is a Unique Factorization Domain.
Fermat s Infinite Descent PMATH 340 Assignment 6 (Due Monday April 3rd at noon). (0 marks) Use Femtat s method of infinite descent to prove that the Diophantine equation x 3 + y 3 = 4z 3 has no solutions
More informationSolving Diophantine Equations With Unique Factorization
Solving Diophantine Equations With Unique Factorization February 17, 2016 1 Introduction In this note we should how unique factorization in rings like Z[i] and Z[ 2] can be used to find integer solutions
More informationSome New Facts in Discrete Asymptotic Analysis
Mathematica Balkanica New Series Vol 2, 2007, Fasc 3-4 Some New Facts in Discrete Asymptotic Analysis Cristinel Mortici, Andrei Vernescu Presented by P Boyvalenkov This paper is closely related to [7]
More informationWeaker hypotheses for the general projection algorithm with corrections
DOI: 10.1515/auom-2015-0043 An. Şt. Univ. Ovidius Constanţa Vol. 23(3),2015, 9 16 Weaker hypotheses for the general projection algorithm with corrections Alexru Bobe, Aurelian Nicola, Constantin Popa Abstract
More informationActa Academiae Paedagogicae Agriensis, Sectio Mathematicae 31 (2004) 19 24
Acta Academiae Paedagogicae Agriensis, Sectio Mathematicae 31 (2004) 19 24 PRIMITIVE DIVISORS OF LUCAS SEQUENCES AND PRIME FACTORS OF x 2 + 1 AND x 4 + 1 Florian Luca (Michoacán, México) Abstract. In this
More informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
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 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 informationLecture 7.4: Divisibility and factorization
Lecture 7.4: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)
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 informationRelative Densities of Ramified Primes 1 in Q( pq)
International Mathematical Forum, 3, 2008, no. 8, 375-384 Relative Densities of Ramified Primes 1 in Q( pq) Michele Elia Politecnico di Torino, Italy elia@polito.it Abstract The relative densities of rational
More informationOn the metrical theory of a non-regular continued fraction expansion
DOI: 0.55/auom-205-0032 An. Şt. Univ. Ovidius Constanţa Vol. 23(2),205, 47 60 On the metrical theory of a non-regular continued fraction expansion Dan Lascu, George Cîrlig Abstract We introduced a new
More information1. Factorization Divisibility in Z.
8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that
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 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 informationTripotents: a class of strongly clean elements in rings
DOI: 0.2478/auom-208-0003 An. Şt. Univ. Ovidius Constanţa Vol. 26(),208, 69 80 Tripotents: a class of strongly clean elements in rings Grigore Călugăreanu Abstract Periodic elements in a ring generate
More informationARITHMETIC OF POSITIVE INTEGERS HAVING PRIME SUMS OF COMPLEMENTARY DIVISORS
Math. J. Okayama Univ. 60 (2018), 155 164 ARITHMETIC OF POSITIVE INTEGERS HAVING PRIME SUMS OF COMPLEMENTARY DIVISORS Kenichi Shimizu Abstract. We study a class of integers called SP numbers (Sum Prime
More informationCullen Numbers in Binary Recurrent Sequences
Cullen Numbers in Binary Recurrent Sequences Florian Luca 1 and Pantelimon Stănică 2 1 IMATE-UNAM, Ap. Postal 61-3 (Xangari), CP 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn
More informationA Note on Powers in Finite Fields
Downloaded from orbit.dtu.dk on: Jul 11, 2018 A Note on Powers in Finite Fields Aabrandt, Andreas; Hansen, Vagn Lundsgaard Published in: International Journal of Mathematical Education in Science and Technology
More informationON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM. 1. Introduction
ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM A. DUBICKAS and A. NOVIKAS Abstract. Let E(4) be the set of positive integers expressible by the form 4M d, where M is a multiple of the product ab and
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 informationWeaker assumptions for convergence of extended block Kaczmarz and Jacobi projection algorithms
DOI: 10.1515/auom-2017-0004 An. Şt. Univ. Ovidius Constanţa Vol. 25(1),2017, 49 60 Weaker assumptions for convergence of extended block Kaczmarz and Jacobi projection algorithms Doina Carp, Ioana Pomparău,
More informationChuck Garner, Ph.D. May 25, 2009 / Georgia ARML Practice
Some Chuck, Ph.D. Department of Mathematics Rockdale Magnet School for Science Technology May 25, 2009 / Georgia ARML Practice Outline 1 2 3 4 Outline 1 2 3 4 Warm-Up Problem Problem Find all positive
More informationTHE SOLUTION OF 3y2 ± 2" = x3
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
More informationBulletin of the Transilvania University of Braşov Vol 9(58), No Series III: Mathematics, Informatics, Physics, 67-82
Bulletin of the Transilvania University of Braşov Vol 9(58), No. 1-016 Series III: Mathematics, Informatics, Physics, 67-8 TYPES OF INTEGER HARMONIC NUMBERS (II) Adelina MANEA 1 and Nicuşor MINCULETE Abstract
More informationON VALUES OF CYCLOTOMIC POLYNOMIALS. V
Math. J. Okayama Univ. 45 (2003), 29 36 ON VALUES OF CYCLOTOMIC POLYNOMIALS. V Dedicated to emeritus professor Kazuo Kishimoto on his seventieth birthday Kaoru MOTOSE In this paper, using properties of
More informationTHUE S LEMMA AND IDONEAL QUADRATIC FORMS
THUE S LEMMA AND IDONEAL QUADRATIC FORMS PETE L. CLARK Introduction Recently I learned about Thue s Lemma, an elementary result on congruences due to the Norwegian mathematician Axel Thue (1863-1922).
More informationM381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
More informationarxiv: v1 [math.nt] 9 Sep 2017
arxiv:179.2954v1 [math.nt] 9 Sep 217 ON THE FACTORIZATION OF x 2 +D GENERALIZED RAMANUJAN-NAGELL EQUATION WITH HUGE SOLUTION) AMIR GHADERMARZI Abstract. Let D be a positive nonsquare integer such that
More informationAlgebraic number theory
Algebraic number theory F.Beukers February 2011 1 Algebraic Number Theory, a crash course 1.1 Number fields Let K be a field which contains Q. Then K is a Q-vector space. We call K a number field if dim
More informationQUADRATIC RINGS PETE L. CLARK
QUADRATIC RINGS PETE L. CLARK 1. Quadratic fields and quadratic rings Let D be a squarefree integer not equal to 0 or 1. Then D is irrational, and Q[ D], the subring of C obtained by adjoining D to Q,
More informationA Note on Indefinite Ternary Quadratic Forms Representing All Odd Integers. Key Words: Quadratic Forms, indefinite ternary quadratic.
Bol. Soc. Paran. Mat. (3s.) v. 23 1-2 (2005): 85 92. c SPM ISNN-00378712 A Note on Indefinite Ternary Quadratic Forms Representing All Odd Integers Jean Bureau and Jorge Morales abstract: In this paper
More informationQUADRATIC RESIDUES OF CERTAIN TYPES
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 36, Number 6, 2006 QUADRATIC RESIDUES OF CERTAIN TYPES ALEXANDRU GICA ABSTRACT. The main purpose of the paper is to show that if p is a prime different from
More informationSelected exercises from Abstract Algebra by Dummit and Foote (3rd edition).
Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Bryan Félix Abril 12, 2017 Section 2.1 Exercise (6). Let G be an abelian group. Prove that T = {g G g < } is a subgroup of G.
More informationarxiv: v1 [math.nt] 13 May 2018
Fields Q( 3 d, ζ 3 ) whose 3-class group is of type (9, 3) arxiv:1805.04963v1 [math.nt] 13 May 2018 Siham AOUISSI, Mohamed TALBI, Moulay Chrif ISMAILI and Abdelmalek AZIZI May 15, 2018 Abstract: Let k
More informationChapter 14: Divisibility and factorization
Chapter 14: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Summer I 2014 M. Macauley (Clemson) Chapter
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 informationA Pellian equation with primes and applications to D( 1)-quadruples
A Pellian equation with primes and applications to D( 1)-quadruples Andrej Dujella 1, Mirela Jukić Bokun 2 and Ivan Soldo 2, 1 Department of Mathematics, Faculty of Science, University of Zagreb, Bijenička
More informationPrime Decomposition. Adam Gamzon. 1 Introduction
Prime Decomposition Adam Gamzon 1 Introduction Let K be a number field, let O K be its ring of integers, and let p Z be a prime. Since every prime of O K lies over a prime in Z, understanding how primes
More informationAlgebraic Number Theory and Representation Theory
Algebraic Number Theory and Representation Theory MIT PRIMES Reading Group Jeremy Chen and Tom Zhang (mentor Robin Elliott) December 2017 Jeremy Chen and Tom Zhang (mentor Robin Algebraic Elliott) Number
More informationarxiv: v2 [math.nt] 29 Jul 2017
Fibonacci and Lucas Numbers Associated with Brocard-Ramanujan Equation arxiv:1509.07898v2 [math.nt] 29 Jul 2017 Prapanpong Pongsriiam Department of Mathematics, Faculty of Science Silpakorn University
More information5.1 Commutative rings; Integral Domains
5.1 J.A.Beachy 1 5.1 Commutative rings; Integral Domains from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 23. Let R be a commutative ring. Prove the following
More informationFACTORIZATION OF IDEALS
FACTORIZATION OF IDEALS 1. General strategy Recall the statement of unique factorization of ideals in Dedekind domains: Theorem 1.1. Let A be a Dedekind domain and I a nonzero ideal of A. Then there are
More informationInfinitely many maximal primitive positive clones in a diagonalizable algebra
BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Numbers 2(72) 3(73), 2013, Pages 47 52 ISSN 1024 7696 Infinitely many maximal primitive positive clones in a diagonalizable algebra Andrei
More informationOn cohomology groups H 1 of G modules of finite type over cyclic groups
arxiv:1507.02370v2 [math.nt] 18 May 2016 On cohomology groups H 1 of G modules of finite type over cyclic groups Derong Qiu (School of Mathematical Sciences, Capital Normal University, Beijing 100048,
More informationPrimal, completely irreducible, and primary meet decompositions in modules
Bull. Math. Soc. Sci. Math. Roumanie Tome 54(102) No. 4, 2011, 297 311 Primal, completely irreducible, and primary meet decompositions in modules by Toma Albu and Patrick F. Smith Abstract This paper was
More informationGAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT
Journal of Prime Research in Mathematics Vol. 8 202, 28-35 GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT JORGE JIMÉNEZ URROZ, FLORIAN LUCA 2, MICHEL
More informationTHUE S LEMMA AND IDONEAL QUADRATIC FORMS
THUE S LEMMA AND IDONEAL QUADRATIC FORMS PETE L. CLARK Abstract. The representation of integers by binary quadratic forms is one of the oldest problems in number theory, going back at least to Fermat s
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 informationElliptic curves and Hilbert s Tenth Problem
Elliptic curves and Hilbert s Tenth Problem Karl Rubin, UC Irvine MAA @ UC Irvine October 16, 2010 Karl Rubin Elliptic curves and Hilbert s Tenth Problem MAA, October 2010 1 / 40 Elliptic curves An elliptic
More informationApplication of the Euler Phi Function in the Set of Gaussian Integers
University of North Georgia Nighthawks Open Institutional Repository Honors Theses Honors Program 2015 Application of the Euler Phi Function in the Set of Gaussian Integers Catrina A. May University of
More informationDepth of some square free monomial ideals
Bull. Math. Soc. Sci. Math. Roumanie Tome 56(104) No. 1, 2013, 117 124 Depth of some square free monomial ideals by Dorin Popescu and Andrei Zarojanu Dedicated to the memory of Nicolae Popescu (1937-2010)
More informationTOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS. 1. Introduction
TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS KEITH CONRAD A (monic) polynomial in Z[T ], 1. Introduction f(t ) = T n + c n 1 T n 1 + + c 1 T + c 0, is Eisenstein at a prime p when each coefficient
More informationA Note on Cyclotomic Integers
To the memory of Alan Thorndike, former professor of physics at the University of Puget Sound and a dear friend, teacher and mentor. A Note on Cyclotomic Integers Nicholas Phat Nguyen 1 Abstract. In this
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationREGULAR TETRAHEDRA WHOSE VERTICES HAVE INTEGER COORDINATES. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXX, 2 (2011), pp. 161 170 161 REGULAR TETRAHEDRA WHOSE VERTICES HAVE INTEGER COORDINATES E. J. IONASCU Abstract. In this paper we introduce theoretical arguments for
More informationON THE SINGULAR DECOMPOSITION OF MATRICES
An. Şt. Univ. Ovidius Constanţa Vol. 8, 00, 55 6 ON THE SINGULAR DECOMPOSITION OF MATRICES Alina PETRESCU-NIŢǍ Abstract This paper is an original presentation of the algorithm of the singular decomposition
More informationI Foundations Of Divisibility And Congruence 1
Contents I Foundations Of Divisibility And Congruence 1 1 Divisibility 3 1.1 Definitions............................. 3 1.2 Properties Of Divisibility..................... 5 1.3 Some Basic Combinatorial
More informationSchool of Mathematics
School of Mathematics Programmes in the School of Mathematics Programmes including Mathematics Final Examination Final Examination 06 22498 MSM3P05 Level H Number Theory 06 16214 MSM4P05 Level M Number
More informationZsigmondy s Theorem. Lola Thompson. August 11, Dartmouth College. Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, / 1
Zsigmondy s Theorem Lola Thompson Dartmouth College August 11, 2009 Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, 2009 1 / 1 Introduction Definition o(a modp) := the multiplicative order
More informationIntroduction to Algebraic Number Theory Part I
Introduction to Algebraic Number Theory Part I A. S. Mosunov University of Waterloo Math Circles November 7th, 2018 Goals Explore the area of mathematics called Algebraic Number Theory. Specifically, we
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More information(k, l)-universality OF TERNARY QUADRATIC FORMS ax 2 + by 2 + cz 2
#A20 INTEGERS 18 (2018) (k, l)-universality OF TERNARY QUADRATIC FORMS ax 2 + by 2 + cz 2 Lerna Pehlivan Department of Mathematics and Statistics, Acadia University, Wolfville, Nova Scotia, Canada lerna.pehlivan@acadiau.ca
More informationQuadratic Diophantine Equations x 2 Dy 2 = c n
Irish Math. Soc. Bulletin 58 2006, 55 68 55 Quadratic Diophantine Equations x 2 Dy 2 c n RICHARD A. MOLLIN Abstract. We consider the Diophantine equation x 2 Dy 2 c n for non-square positive integers D
More informationON DIRICHLET S CONJECTURE ON RELATIVE CLASS NUMBER ONE
ON DIRICHLET S CONJECTURE ON RELATIVE CLASS NUMBER ONE AMANDA FURNESS Abstract. We examine relative class numbers, associated to class numbers of quadratic fields Q( m) for m > 0 and square-free. The relative
More information32 Divisibility Theory in Integral Domains
3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible
More informationA characteristic property of self-orthogonal codes and its application to lattices
A characteristic property of self-orthogonal codes and its application to lattices Zhe-Xian Wan Abstract Let p be an odd prime, ζ = e 2πi/p, D be the ring of algebraic integers in the field Q(ζ), and P
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 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 information1 2 1 = = =
IAP 07 Daniel W Stroock Traditional method for computing square roots: The traditional method for computing square roots is based on the identity (a + b) a + (a + b)b For example to compute one begins
More informationExercises MAT2200 spring 2014 Ark 5 Rings and fields and factorization of polynomials
Exercises MAT2200 spring 2014 Ark 5 Rings and fields and factorization of polynomials This Ark concerns the weeks No. (Mar ) andno. (Mar ). Status for this week: On Monday Mar : Finished section 23(Factorization
More informationTHE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - FALL SESSION ADVANCED ALGEBRA I.
THE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - FALL SESSION 2006 110.401 - ADVANCED ALGEBRA I. Examiner: Professor C. Consani Duration: take home final. No calculators allowed.
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 informationON DIFFERENCES OF TWO SQUARES IN SOME QUADRATIC FIELDS
ON DIFFERENCES OF TWO SQUARES IN SOME QUADRATIC FIELDS ANDREJ DUJELLA AND ZRINKA FRANUŠIĆ Abstract. It this paper, we study the problem of determining the elements in the rings of integers of quadratic
More informationarxiv: v2 [math.gm] 23 Feb 2017
arxiv:1603.08548v2 [math.gm] 23 Feb 2017 Tricomplex dynamical systems generated by polynomials of even degree Pierre-Olivier Parisé 1, Thomas Ransford 2, and Dominic Rochon 1 1 Département de mathématiques
More informationOn non-tabular m-pre-complete classes of formulas in the propositional provability logic
An. Şt. Univ. Ovidius Constanţa Vol. 14(1), 2006, 91 98 On non-tabular m-pre-complete classes of formulas in the propositional provability logic Olga Izbaş and Andrei Rusu Abstract In the present paper
More informationn = p 1 p 2 p r = q 1 q 2 q m, then r = m (i.e. the number of primes in any prime decomposition
Department of Mathematical Sciences Instructor: Daiva Pucinskaite Discrete Mathematics Factoring Recall. Fundamental Theorem of Arithmetic. Let n be a positive integer n > 1. Then n can be represented
More informationRings With Topologies Induced by Spaces of Functions
Rings With Topologies Induced by Spaces of Functions Răzvan Gelca April 7, 2006 Abstract: By considering topologies on Noetherian rings that carry the properties of those induced by spaces of functions,
More informationON THE SUBGROUP LATTICE OF AN ABELIAN FINITE GROUP
ON THE SUBGROUP LATTICE OF AN ABELIAN FINITE GROUP Marius Tărnăuceanu Faculty of Mathematics Al.I. Cuza University of Iaşi, Romania e-mail: mtarnauceanu@yahoo.com The aim of this paper is to give some
More informationOn the diophantine equations of type a x + b y = c z
General Mathematics Vol. 13, No. 1 (2005), 67 72 On the diophantine equations of type a x + b y = c z Dumitru Acu Dedicated to Professor Emil C. Popa on his 60th birthday Abstract In this paper we study
More informationHilbert s theorem 90, Dirichlet s unit theorem and Diophantine equations
Hilbert s theorem 90, Dirichlet s unit theorem and Diophantine equations B. Sury Stat-Math Unit Indian Statistical Institute 8th Mile Mysore Road Bangalore - 560 059 India. sury@isibang.ac.in Introduction
More informationA Note on Subgroup Coverings of Finite Groups
Analele Universităţii de Vest, Timişoara Seria Matematică Informatică XLIX, 2, (2011), 129 135 A Note on Subgroup Coverings of Finite Groups Marius Tărnăuceanu Abstract. In this note we determine the finite
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 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 informationSQUARES FROM SUMS OF FIXED POWERS. Mark Bauer and Michael A. Bennett University of Calgary and University of British Columbia, Canada
SQUARES FROM SUMS OF FIXED POWERS Mark Bauer and Michael A. Bennett University of Calgary and University of British Columbia, Canada Abstract. In this paper, we show that if p and q are positive integers,
More informationAlgebraic Cryptography Exam 2 Review
Algebraic Cryptography Exam 2 Review You should be able to do the problems assigned as homework, as well as problems from Chapter 3 2 and 3. You should also be able to complete the following exercises:
More informationPell Equation x 2 Dy 2 = 2, II
Irish Math Soc Bulletin 54 2004 73 89 73 Pell Equation x 2 Dy 2 2 II AHMET TEKCAN Abstract In this paper solutions of the Pell equation x 2 Dy 2 2 are formulated for a positive non-square integer D using
More information