On Jeśmanowicz Conjecture Concerning Pythagorean Triples
|
|
- Sheena Harrell
- 5 years ago
- Views:
Transcription
1 Journal of Mathematical Research with Applications Mar., 2015, Vol. 35, No. 2, pp DOI: /j.issn: On Jeśmanowicz Conjecture Concerning Pythagorean Triples Cuifang SUN, Zhi CHENG School of Mathematics and Computer Science, Anhui Normal University, Anhui , P. R. China Abstract Let (a, b, c) be a primitive Pythagorean triple. Jeśmanowicz conjectured in 1956 that for any positive integer n, the Diophantine equation (an) x + (bn) y = (cn) z has only the positive integer solution (x, y, z) = (2, 2, 2). Let p 3 (mod 4) be a prime and s be some positive integer. In the paper, we show that the conjecture is true when (a, b, c) = (4p 2s 1, 4p s, 4p 2s + 1) and certain divisibility conditions are satisfied. Keywords Jeśmanowicz conjecture; Diophantine equation MR(2010) Subject Classification 11D61 1. Introduction Let a, b, c be a primitive Pythagorean triple, that is, a, b, c are relatively prime positive integers such that a 2 + b 2 = c 2. integer n, the Diophantine equation has no positive integer solutions other than (x, y, z) = (2, 2, 2). In 1956, Jeśmanowicz [2] conjectured that for any positive (an) x + (bn) y = (cn) z (1) Whether there are other solutions has been investigated by many authors. Sierpiński [7] showed that Eq. (1) has no other positive integer solutions when n = 1 and (a, b, c) = (3, 4, 5). Jeśmanowicz [2] further proved the same conclusion for n = 1 and (a, b, c) = (5, 12, 13), (7, 24, 25), (9, 40, 41), (11, 60, 61). For any positive integer k, Lu [4] showed that Eq.(1) has only the positive integer solution (x, y, z) = (2, 2, 2) if n = 1 and (a, b, c) = (4k 2 1, 4k, 4k 2 + 1). Recently, Tang and Weng [9] proved that for any positive integer m, if c = 2 2m + 1 is a Fermat number, then Eq. (1) has only the positive integer solution (x, y, z) = (2, 2, 2). Deng [1] showed that if k = 2 s for some positive integer s and certain divisibility conditions are satisfied, then Jeśmanowicz conjecture is true. For related problems, we refer to [3,5,6,8,10]. For any positive integer N with N > 1, let P (N) denote the product of distinct prime factors of N and let ( ) denote the Legendre symbol. If qe is a prime power, we write p e N to mean that p e N while p e+1 N. Let p 3 (mod 4) be a prime and s be some positive integer. Received August 26, 2014; Accepted November 24, 2014 Supported by the Research Culture Fundation of Anhui Normal University (Grant Nos. 2012xmpy009; 2014xmp y11) and the Natural Science Foundation of Anhui Province (Grant No QA02). * Corresponding author address: cuifangsun@163.com (Cuifang SUN); chengzhimath@126.com (Zhi CHENG)
2 144 Cuifang SUN and Zhi CHENG In this paper, we consider the case k = p s and the following results will be proved. Theorem 1.1 Let p 3 (mod 4) be a prime and s be some positive integer. Let (a, b, c) = (4p 2s 1, 4p s, 4p 2s + 1) be a primitive Pythagorean triple. Suppose that the positive integer n is such that either P (a) n or P (n) a. Then Eq. (1) has only the positive integer solution (x, y, z) = (2, 2, 2). Corollary 1.2 Let s be some positive integer and (a, b, c) = (4 3 2s 1, 4 3 s, 4 3 2s + 1) be a primitive Pythagorean triple. If a has only two distinct prime divisors, then for any positive integer n, Eq.(1) has only the positive integer solution (x, y, z) = (2, 2, 2). 2. Proofs We shall begin with the following two Lemmas. Lemma 2.1 ([4, Theorem]) Let (a, b, c) = (4k 2 1, 4k, 4k 2 + 1) and n = 1. Then Eq. (1) has only the positive integer solution (x, y, z) = (2, 2, 2). Lemma 2.2 ([1, Corollary]) Let (a, b, c) be any primitive Pythagorean triple such that the Diophantine equation a x + b y = c z has only the positive integer solution (x, y, z) = (2, 2, 2). If (x, y, z) is a solution of Eq.(1) with (x, y, z) (2, 2, 2), then one of the following conditions is satisfied: (i) x > z > y and P (n) b; (ii) y > z > x and P (n) a. Proof of Theorem 1.1 By Lemma 2.1, we may suppose that n 2. We also suppose that (x, y, z) is a solution of Eq. (1) with (x, y, z) (2, 2, 2). Case 1 P (n) a. By Lemma 2.2, we have x > z > y and P (n) b. Then a x n x y + b y = c z n z y. Since b = 2 2 p s, we can write n = 2 α p β with α + β 1. Thus 2 α(x y) p β(x y) a x + 2 2y p sy = 2 α(z y) p β(z y) c z. (2) Subcase 1.1 α = 0, β 1. Then p β(x y) a x + 2 2y p sy = p β(z y) c z. Since β(x y) > β(z y), we have sy = β(z y). Thus p β(x z) a x = c z 2 2y. (3) If p = 3, then ( 1) x+β(x z) 1 (mod 4), and then x + β(x z) 0 (mod 2). Thus taking modulo 8 in (3), we have 5 z 2 2y + 1 (mod 8) (4) If y = 1, then z 1 (mod 2) and 3 β(x z) a x = c z 4. Since 3 c z 4 and 3 a, we have
3 On Jeśmanowicz conjecture concerning Pythagorean triples 145 β(x z) = 1, thus x is even, x + β(x z) 1 (mod 2), a contradiction. Thus y 2. By (4) we have 5 z 1 (mod 8) and z 0 (mod 2). If p > 3, then a = 4p 2s 1 0 (mod 3), c = 4p 2s (mod 3). Thus 2 z 1 (mod 3) and z 0 (mod 2). Now we can write z = 2z 1. By (3), p β(x z) (2p s + 1) x (2p s 1) x = p β(x z) a x = (c z 1 2 y )(c z y ). Noting that gcd(c z1 2 y, c z1 + 2 y ) = 1, we can write a = a 1 a 2 with gcd(a 1, a 2 ) = 1, a x 1 c z1 + 2 y and a x 2 c z 1 2 y. Then either a 1 2p s + 1 or a 2 2p s + 1. Otherwise, if a 1 < 2p s + 1 and a 2 < 2p s + 1, then a 1 2p s 1 and a 2 2p s 1 by a 1 a 2 = 4p 2s 1. Thus a = a 1 a 2 (2p s 1) 2 < (2p s 1)(2p s + 1) = a, which is impossible. If a 1 2p s + 1, then a 2 1 (2p s + 1) 2 = c + 4p s > c + 4, thus a x 1 > (a 2 1) z 1 > (c + 4) z 1 c z z 1 > c z y, but a x 1 c z y, a contradiction. If a 2 2p s + 1, we similarly get a x 2 > c z y > c z 1 2 y, but a x 2 c z1 2 y, a contradiction. Subcase 1.2 α 1, β = 0. Then by (2) we have 2 α(x y) a x + 2 2y p sy = 2 α(z y) c z. Since α(x y) > α(z y), we have 2y = α(z y). Thus 2 α(x z) a x = c z p sy. (5) If p = 3, then ( 1) x+α(x z) 1 (mod 3), thus x + α(x z) 0 (mod 2). Moreover, ( 1) x 2 α(x z) 1 3 sy (mod 4) and ( 1) x 2 α(x z) 1 3 sy (mod 9). If sy 1 (mod 2), then 1 3 sy 2 (mod 4), thus α(x z) = 1, x 1 (mod 2). It follows that α = 1, z 0 (mod 2), y 1 (mod 2), but 2y = α(z y), a contradiction. Then sy 0 (mod 2) and ( 1) x 2 α(x z) 1 (mod 9). Hence α(x z) 3. Further, 5 z 1 (mod 8), thus z 0 (mod 2). If p > 3, then ( 1) x 2 α(x z) 1 (mod p). Since p 3 (mod 4) and p > 3, we have α(x z) 3. Moreover, ( 1) sy 1 (mod 4) and 5 z 1 (mod 8), thus sy 0 (mod 2), z 0 (mod 2). Now we can write z = 2z 1, sy = 2y 1. By (5), 2 α(x z) a x = (c z 1 p y 1 )(c z 1 + p y 1 ). Let a = a 1 a 2 with gcd(a 1, a 2 ) = 1, a x 1 c z1 + p y1 and a x 2 c z1 p y1. Then either a 1 2p s + 1 or a 2 2p s + 1. Otherwise, if a 1 2p s 1 and a 2 2p s 1, then a = a 1 a 2 (2p s 1) 2 < (2p s 1)(2p s + 1) = a,
4 146 Cuifang SUN and Zhi CHENG which is impossible. If a 1 2p s + 1, then a 2 1 (2p s + 1) 2 = c + 4p s > c + p s. Further, we have a x 1 > (a 2 1) z1 > (c + p s ) z1 c z1 + p sz1 > c z1 + p y1, but a x 1 c z 1 + p y 1, a contradiction. If a 2 2p s + 1, we similarly get a x 2 > c z 1 + p y 1 > c z 1 p y 1, but a x 2 c z1 p y1, a contradiction. Subcase 1.3 α 1, β 1. Then α(x y) > α(z y), β(x y) > β(z y), so 2y = α(z y), sy = β(z y), thus 2 α(x z) p β(x z) a x = c z 1. (6) Since 4 c z 1 and p 2s c z 1, we have α(x z) 2 and β(x z) 2s. Then α(x z) 3. Otherwise, if α(x z) = 2, then α = 1, x z = 2 or α = 2, x z = 1. By 2y = α(z y), we have z = 3y or z = 2y. By sy = β(z y), we have s = 2β or s = β, but β(x z) 2s, it is impossible. Taking modulo 8 in (6), we have 5 z 1 (mod 8), thus z 0 (mod 2). Write z = 2z 1, we have 2 α(x z) p β(x z) a x = (c z 1 1)(c z 1 + 1). Let a = a 1 a 2 with gcd(a 1, a 2 ) = 1, a x 1 c z and a x 2 c z 1 1. Then either a 1 2p s + 1 or a 2 2p s + 1. Otherwise, if a 1 2p s 1 and a 2 2p s 1, then a = a 1 a 2 (2p s 1) 2 < (2p s 1)(2p s + 1) = a, which is impossible. If a 1 2p s + 1, then a 2 1 (2p s + 1) 2 = c + 4p s > c + 1. Further, we have a x 1 > (a 2 1) z1 > (c + 1) z1 c z1 + 1, but a x 1 c z 1 + 1, a contradiction. If a 2 2p s + 1, we similarly get a x 2 > c z > c z 1 1, but a x 2 c z 1 1, a contradiction. Case 2 P (a) n. By Lemma 2.2, we have y > z > x. Then a x + b y n y x = c z n z x. Since y x > z x > 0, we have P (n) a and n z x a x, which means that P (n) = P (a) and n z x = a x. Thus b y n y z = c z 1. (7) It follows that 5 z 1 (mod 8), so z 0 (mod 2). Write z = 2z 1. Since c 1 (mod b), c z (mod b), we have gcd(c z 1 + 1, b) = 2. Then by (7), we have by 2 cz 1 1. But which is impossible. b y 2 > b2z1 2 = (c (c + a) a)z1 z1 2 c z 1 + a z 1 > c z 1 1,
5 On Jeśmanowicz conjecture concerning Pythagorean triples 147 This completes the proof of Theorem 1.1 Proof of Corollary 1.2 By Lemma 2.1, we may suppose that n 2 and suppose that (x, y, z) is a solution of (1) with (x, y, z) (2, 2, 2). By Case 2 of Theorem 1.1 and Lemma 2.2, we may suppose that y > z > x, P (n) a and P (n) < P (a). Since a = 4 3 2s 1 has only two distinct prime divisors and gcd(2 3 s 1, 2 3 s + 1) = 1, we can write 2 3 s 1 = q α1 1, 2 3s + 1 = q α2 2, where q 1 and q 2 are distinct odd primes and α 1, α 2 1. Then we have either n = q α 1 or n = q β 2 with α, β 1. If n = q α 1, then we have q α 1x 1 q α 2x 2 + (4 3 s ) y q α(y x) 1 = (4 3 2s + 1) z q α(z x) 1. Since α(y x) > α(z x), we have α 1 x = α(z x) and (4 3 s ) y q α(y z) 1 = (4 3 2s + 1) z q α 2x 2 = (4 3 2s + 1) z (2 3 s + 1) x. (8) If s is even, then 3 x 1 (mod 4) and 5 z 3 x (mod 8), thus x and z are both even. If s is odd, then 5 z 7 x (mod 8), thus x and z are both even. Now write z = 2z 1, x = 2x 1. By (8), (4 3 s ) y q α(y z) 1 = ( (4 3 2s + 1) z 1 (2 3 s + 1) x 1 )( (4 3 2s + 1) z 1 + (2 3 s + 1) x 1 ). (9) Noting that gcd((4 3 2s + 1) z1 (2 3 s + 1) x1, (4 3 2s + 1) z1 + (2 3 s + 1) x1 ) = 2 and (4 3 s ) y = by 2 2 > bz 2 = b2z 1 2 = (c + a) 2z1 z1 (c + a) z1 c z1 + a z1 2 > (4 3 2s + 1) z 1 + (2 3 s + 1) x 1 > (4 3 2s + 1) z 1 (2 3 s + 1) x 1, we deduce that (9) cannot hold. If n = q β 2, then we have q α1x 1 q α2x 2 + (4 3 s ) y q β(y x) 2 = (4 3 2s + 1) z q β(z x) 2. Since β(y x) > β(z x), we have α 2 x = β(z x) and (4 3 s ) y q β(y z) 2 = (4 3 2s + 1) z q α 1x 1 = (4 3 2s + 1) z (2 3 s 1) x. (10) It follows that x is even since ( 1) x 1 (mod 3) and z is even since 5 z 1 (mod 8). Now write z = 2z 1, x = 2x 1. By (10), (4 3 s ) y q β(y z) 2 = ( (4 3 2s + 1) z 1 (2 3 s 1) x 1 )( (4 3 2s + 1) z 1 + (2 3 s 1) x 1 ). (11) Noting that gcd((4 3 2s + 1) z1 (2 3 s 1) x1, (4 3 2s + 1) z1 + (2 3 s 1) x1 ) = 2 and b y 2 > b2z 1 2 (c + a)z1 c z1 + a z1 > (4 3 2s + 1) z1 + (2 3 s 1) x1 > (4 3 2s + 1) z1 (2 3 s 1) x1, we deduce that (11) cannot hold. This completes the proof of Corollary 1.2 Acknowledgements We thank the referees for their valuable suggestions which improved the presentation of this paper.
6 148 Cuifang SUN and Zhi CHENG References [1] Moujie DENG. A note on the Dionphantine equation (na) x + (nb) y = (nc) z. Bull. Aust. Math. Soc., 2014, 89(2): [2] L. JÉSMANOWICZ. Several remarks on Pythagorean numbers. Wiadom. Mat. (2), 1955/1956, 1: [3] Maohua LE. A note on Jeśmanowicz conjecture concerning Pythagorean triples. Bull. Aust. Math. Soc., 1999, 59(3): [4] Wenduan LU. On the Pythagorean numbers 4n 2 1, 4n and 4n Acta Sci. Natur. Univ. Szechuan, 1959, 2: (in Chinese) [5] T. MIYAZAKI. Generalizations of classical results on Jeśmanowicz conjecture concerning pythagorean triples. J. Number Theory, 2013, 133(2): [6] T. MIYAZAKI, A. TOGBÉ. The Diophantine equation (2am 1)x + (2m) y = (2am + 1) z. Int. J. Number Theory, 2012, 8(8): [7] W. SIERPIŃSKI. On the equation 3x + 4 y = 5 z. Wiadom. Mat. (2), 1955/1956, 1: [8] Min TANG, Zhijuan YANG. Jeśmanowicz conjecture revisited. Bull. Aust. Math. Soc., 2013, 88(3): [9] Min TANG, Jianxin WENG. Jeśmanowicz conjecture with Fermat numbers. Taiwanese J. Math., 2014, 18(3): [10] Zhijuan YANG, Min TANG. On the Diophantine equation (8n) x + (15n) y = (17n) 2. Bull. Aust. Math. Soc., 2012, 86(2):
1 Elementary number theory
Math 215 - Introduction to Advanced Mathematics Spring 2019 1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...},
More informationMath Introduction to Advanced Mathematics
Math 215 - Introduction to Advanced Mathematics Number Theory Fall 2017 The following introductory guide to number theory is borrowed from Drew Shulman and is used in a couple of other Math 215 classes.
More information1 Elementary number theory
1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...}, along with their most basic arithmetical and ordering properties.
More informationAdjacent Vertex Distinguishing Incidence Coloring of the Cartesian Product of Some Graphs
Journal of Mathematical Research & Exposition Mar., 2011, Vol. 31, No. 2, pp. 366 370 DOI:10.3770/j.issn:1000-341X.2011.02.022 Http://jmre.dlut.edu.cn Adjacent Vertex Distinguishing Incidence Coloring
More informationLemma (x, y, z) is a Pythagorean triple iff (y, x, z) is a Pythagorean triple.
Chapter Pythagorean Triples.1 Introduction. The Pythagorean triples have been known since the time of Euclid and can be found in the third century work Arithmetica by Diophantus [9]. An ancient Babylonian
More informationHashing. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong
Department of Computer Science and Engineering Chinese University of Hong Kong In this lecture, we will revisit the dictionary search problem, where we want to locate an integer v in a set of size n or
More informationTopic 10 Part 2 [474 marks]
Topic Part 2 [474 marks] The complete graph H has the following cost adjacency matrix Consider the travelling salesman problem for H a By first finding a minimum spanning tree on the subgraph of H formed
More informationCalculation of extended gcd by normalization
SCIREA Journal of Mathematics http://www.scirea.org/journal/mathematics August 2, 2018 Volume 3, Issue 3, June 2018 Calculation of extended gcd by normalization WOLF Marc, WOLF François, LE COZ Corentin
More informationON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE**
Chin. Ann. of Math. 23B:(2002),87-9. ON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE** XU Changqing* DING Ren* Abstract The authors discuss the partition of a finite set of points in the plane
More informationMath 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)
Math 30 Introduction to Proofs via Number Theory Robert Jewett (with small modifications by B. Ćurgus) March 30, 009 Contents 1 The Integers 3 1.1 Axioms of Z...................................... 3 1.
More informationThe Crossing Numbers of Join of a Subdivision of K 2,3 with P n and C n
Journal of Mathematical Research with Applications Nov., 2017, Vol.37, No.6, pp.649 656 DOI:10.3770/j.issn:2095-2651.2017.06.002 Http://jmre.dlut.edu.cn The Crossing Numbers of Join of a Subdivision of
More informationComponent Connectivity of Generalized Petersen Graphs
March 11, 01 International Journal of Computer Mathematics FeHa0 11 01 To appear in the International Journal of Computer Mathematics Vol. 00, No. 00, Month 01X, 1 1 Component Connectivity of Generalized
More informationOn vertex-coloring edge-weighting of graphs
Front. Math. China DOI 10.1007/s11464-009-0014-8 On vertex-coloring edge-weighting of graphs Hongliang LU 1, Xu YANG 1, Qinglin YU 1,2 1 Center for Combinatorics, Key Laboratory of Pure Mathematics and
More informationLine Graphs and Circulants
Line Graphs and Circulants Jason Brown and Richard Hoshino Department of Mathematics and Statistics Dalhousie University Halifax, Nova Scotia, Canada B3H 3J5 Abstract The line graph of G, denoted L(G),
More informationIntegers and Mathematical Induction
IT Program, NTUT, Fall 07 Integers and Mathematical Induction Chuan-Ming Liu Computer Science and Information Engineering National Taipei University of Technology TAIWAN 1 Learning Objectives Learn about
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationThe Connectivity and Diameter of Second Order Circuit Graphs of Matroids
Graphs and Combinatorics (2012) 28:737 742 DOI 10.1007/s00373-011-1074-6 ORIGINAL PAPER The Connectivity and Diameter of Second Order Circuit Graphs of Matroids Jinquan Xu Ping Li Hong-Jian Lai Received:
More informationDISTRIBUTIVE LATTICES
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(2017), 317-325 DOI: 10.7251/BIMVI1702317R Former BULLETIN
More informationVariation of Graceful Labeling on Disjoint Union of two Subdivided Shell Graphs
Annals of Pure and Applied Mathematics Vol. 8, No., 014, 19-5 ISSN: 79-087X (P), 79-0888(online) Published on 17 December 014 www.researchmathsci.org Annals of Variation of Graceful Labeling on Disjoint
More informationAn Improved Upper Bound for the Sum-free Subset Constant
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 (2010), Article 10.8.3 An Improved Upper Bound for the Sum-free Subset Constant Mark Lewko Department of Mathematics University of Texas at Austin
More informationChapter 4. Triangular Sum Labeling
Chapter 4 Triangular Sum Labeling 32 Chapter 4. Triangular Sum Graphs 33 4.1 Introduction This chapter is focused on triangular sum labeling of graphs. As every graph is not a triangular sum graph it is
More informationPROOF OF THE COLLATZ CONJECTURE KURMET SULTAN. Almaty, Kazakhstan. ORCID ACKNOWLEDGMENTS
PROOF OF THE COLLATZ CONJECTURE KURMET SULTAN Almaty, Kazakhstan E-mail: kurmet.sultan@gmail.com ORCID 0000-0002-7852-8994 ACKNOWLEDGMENTS 2 ABSTRACT This article contains a proof of the Collatz conjecture.
More informationProperly Colored Paths and Cycles in Complete Graphs
011 ¼ 9 È È 15 ± 3 ¾ Sept., 011 Operations Research Transactions Vol.15 No.3 Properly Colored Paths and Cycles in Complete Graphs Wang Guanghui 1 ZHOU Shan Abstract Let K c n denote a complete graph on
More informationStrong Dominating Sets of Some Arithmetic Graphs
International Journal of Computer Applications (09 888) Volume 8 No, December 01 Strong Dominating Sets of Some Arithmetic Graphs MManjuri Dept of Applied Mathematics, SPWomen s University, Tirupati-10,
More informationFormally Self-Dual Codes Related to Type II Codes
Formally Self-Dual Codes Related to Type II Codes Koichi Betsumiya Graduate School of Mathematics Nagoya University Nagoya 464 8602, Japan and Masaaki Harada Department of Mathematical Sciences Yamagata
More informationSEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Copyright Cengage Learning. All rights reserved. SECTION 5.5 Application: Correctness of Algorithms Copyright Cengage Learning. All rights reserved.
More informationEuclid's Algorithm. MA/CSSE 473 Day 06. Student Questions Odd Pie Fight Euclid's algorithm (if there is time) extended Euclid's algorithm
MA/CSSE 473 Day 06 Euclid's Algorithm MA/CSSE 473 Day 06 Student Questions Odd Pie Fight Euclid's algorithm (if there is time) extended Euclid's algorithm 1 Quick look at review topics in textbook REVIEW
More informationHeron Quadrilaterals with Sides in Arithmetic or Geometric Progression
Heron Quadrilaterals with Sides in Arithmetic or Geometric Progression R.H.Buchholz & J.A.MacDougall Abstract We study triangles and cyclic quadrilaterals which have rational area and whose sides form
More informationChapter 4. square sum graphs. 4.1 Introduction
Chapter 4 square sum graphs In this Chapter we introduce a new type of labeling of graphs which is closely related to the Diophantine Equation x 2 + y 2 = n and report results of our preliminary investigations
More informationThe crossing number of K 1,4,n
Discrete Mathematics 308 (2008) 1634 1638 www.elsevier.com/locate/disc The crossing number of K 1,4,n Yuanqiu Huang, Tinglei Zhao Department of Mathematics, Normal University of Hunan, Changsha 410081,
More informationFRUCHT S THEOREM FOR THE DIGRAPH FACTORIAL
Discussiones Mathematicae Graph Theory 33 (2013) 329 336 doi:10.7151/dmgt.1661 FRUCHT S THEOREM FOR THE DIGRAPH FACTORIAL Richard H. Hammack Department of Mathematics and Applied Mathematics Virginia Commonwealth
More informationTilings of Parallelograms with Similar Right Triangles
Discrete Comput Geom (2013) 50:469 473 DOI 10.1007/s00454-013-9522-0 Tilings of Parallelograms with Similar Right Triangles Zhanjun Su Chan Yin Xiaobing Ma Ying Li Received: 1 October 2012 / Revised: 29
More informationMath 5593 Linear Programming Lecture Notes
Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................
More informationIntroduction to Programming in C Department of Computer Science and Engineering\ Lecture No. #02 Introduction: GCD
Introduction to Programming in C Department of Computer Science and Engineering\ Lecture No. #02 Introduction: GCD In this session, we will write another algorithm to solve a mathematical problem. If you
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
More informationLATIN SQUARES AND TRANSVERSAL DESIGNS
LATIN SQUARES AND TRANSVERSAL DESIGNS *Shirin Babaei Department of Mathematics, University of Zanjan, Zanjan, Iran *Author for Correspondence ABSTRACT We employ a new construction to show that if and if
More informationComputable Euclidean Domains
Computable Euclidean Domains Asher M. Kach (Joint Work with Rod Downey and with Paul Ellis and Reed Solomon) Southern Wisconsin Logic Colloquium 9 October 2012 Asher M. Kach Computable Euclidean Domains
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
More informationDecreasing the Diameter of Bounded Degree Graphs
Decreasing the Diameter of Bounded Degree Graphs Noga Alon András Gyárfás Miklós Ruszinkó February, 00 To the memory of Paul Erdős Abstract Let f d (G) denote the minimum number of edges that have to be
More informationCHAPTER 8. Copyright Cengage Learning. All rights reserved.
CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation
More informationPrimes in Classes of the Iterated Totient Function
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 11 (2008), Article 08.1.2 Primes in Classes of the Iterated Totient Function Tony D. Noe 14025 NW Harvest Lane Portland, OR 97229 USA noe@sspectra.com
More informationStrong and Semi Strong Outer Mod Sum Graphs
Int. Journal of Math. Analysis, Vol. 7, 013, no., 73-83 Strong and Semi Strong Outer Mod Sum Graphs M. Jayalakshmi and B. Sooryanarayana Dept.of Mathematical and Computational Studies Dr.Ambedkar Institute
More informationNumerical Optimization
Convex Sets Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Let x 1, x 2 R n, x 1 x 2. Line and line segment Line passing through x 1 and x 2 : {y
More informationOn the maximum rank of completions of entry pattern matrices
Linear Algebra and its Applications 525 (2017) 1 19 Contents lists available at ScienceDirect Linear Algebra and its Applications wwwelseviercom/locate/laa On the maximum rank of completions of entry pattern
More informationMath 126 Number Theory
Math 16 Number Theory Prof. D. Joyce, Clark University 8 Mar 006 Due Friday. Page 155: exercises 1,, 7. Choose one of the three and write it up completely. Whichever one you choose, find all those solutions
More informationMatching and Factor-Critical Property in 3-Dominating-Critical Graphs
Matching and Factor-Critical Property in 3-Dominating-Critical Graphs Tao Wang a,, Qinglin Yu a,b a Center for Combinatorics, LPMC Nankai University, Tianjin, China b Department of Mathematics and Statistics
More informationON SWELL COLORED COMPLETE GRAPHS
Acta Math. Univ. Comenianae Vol. LXIII, (1994), pp. 303 308 303 ON SWELL COLORED COMPLETE GRAPHS C. WARD and S. SZABÓ Abstract. An edge-colored graph is said to be swell-colored if each triangle contains
More informationComplete Bipartite Graphs with No Rainbow Paths
International Journal of Contemporary Mathematical Sciences Vol. 11, 2016, no. 10, 455-462 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2016.6951 Complete Bipartite Graphs with No Rainbow
More informationStar Decompositions of the Complete Split Graph
University of Dayton ecommons Honors Theses University Honors Program 4-016 Star Decompositions of the Complete Split Graph Adam C. Volk Follow this and additional works at: https://ecommons.udayton.edu/uhp_theses
More informationSharp lower bound for the total number of matchings of graphs with given number of cut edges
South Asian Journal of Mathematics 2014, Vol. 4 ( 2 ) : 107 118 www.sajm-online.com ISSN 2251-1512 RESEARCH ARTICLE Sharp lower bound for the total number of matchings of graphs with given number of cut
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics SOME BOAS-BELLMAN TYPE INEQUALITIES IN -INNER PRODUCT SPACES S.S. DRAGOMIR, Y.J. CHO, S.S. KIM, AND A. SOFO School of Computer Science and Mathematics
More informationA NOTE ON MORPHISMS DETERMINED BY OBJECTS
A NOTE ON MORPHISMS DETERMINED BY OBJECTS XIAO-WU CHEN, JUE LE Abstract. We prove that a Hom-finite additive category having determined morphisms on both sides is a dualizing variety. This complements
More informationPrime Labeling for Some Cycle Related Graphs
Journal of Mathematics Research ISSN: 1916-9795 Prime Labeling for Some Cycle Related Graphs S K Vaidya (Corresponding author) Department of Mathematics, Saurashtra University Rajkot 360 005, Gujarat,
More informationNote A further extension of Yap s construction for -critical graphs. Zi-Xia Song
Discrete Mathematics 243 (2002) 283 290 www.elsevier.com/locate/disc Note A further extension of Yap s construction for -critical graphs Zi-Xia Song Department of Mathematics, National University of Singapore,
More informationSoft regular generalized b-closed sets in soft topological spaces
Journal of Linear and Topological Algebra Vol. 03, No. 04, 2014, 195-204 Soft regular generalized b-closed sets in soft topological spaces S. M. Al-Salem Department of Mathematics, College of Science,
More informationUNIT-II NUMBER THEORY
UNIT-II NUMBER THEORY An integer n is even if, and only if, n equals twice some integer. i.e. if n is an integer, then n is even an integer k such that n =2k An integer n is odd if, and only if, n equals
More informationEDGE MAXIMAL GRAPHS CONTAINING NO SPECIFIC WHEELS. Jordan Journal of Mathematics and Statistics (JJMS) 8(2), 2015, pp I.
EDGE MAXIMAL GRAPHS CONTAINING NO SPECIFIC WHEELS M.S.A. BATAINEH (1), M.M.M. JARADAT (2) AND A.M.M. JARADAT (3) A. Let k 4 be a positive integer. Let G(n; W k ) denote the class of graphs on n vertices
More informationAlgorithmic number theory Cryptographic hardness assumptions. Table of contents
Algorithmic number theory Cryptographic hardness assumptions Foundations of Cryptography Computer Science Department Wellesley College Fall 2016 Table of contents Introduction Primes and Divisibility Modular
More informationProduct Cordial Labeling for Some New Graphs
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 3, No. ; May 011 Product Cordial Labeling for Some New Graphs S K Vaidya (Corresponding author) Department of Mathematics, Saurashtra University
More informationON A WEAKER VERSION OF SUM LABELING OF GRAPHS
ON A WEAKER VERSION OF SUM LABELING OF GRAPHS IMRAN JAVAID, FARIHA KHALID, ALI AHMAD and M. IMRAN Communicated by the former editorial board In this paper, we introduce super weak sum labeling and weak
More informationApplied Mathematical Sciences, Vol. 5, 2011, no. 49, Július Czap
Applied Mathematical Sciences, Vol. 5, 011, no. 49, 437-44 M i -Edge Colorings of Graphs Július Czap Department of Applied Mathematics and Business Informatics Faculty of Economics, Technical University
More informationConstructions of k-critical P 5 -free graphs
1 2 Constructions of k-critical P 5 -free graphs Chính T. Hoàng Brian Moore Daniel Recoskie Joe Sawada Martin Vatshelle 3 January 2, 2013 4 5 6 7 8 Abstract With respect to a class C of graphs, a graph
More informationVertex-Colouring Edge-Weightings
Vertex-Colouring Edge-Weightings L. Addario-Berry a, K. Dalal a, C. McDiarmid b, B. A. Reed a and A. Thomason c a School of Computer Science, McGill University, University St. Montreal, QC, H3A A7, Canada
More informationSome Properties of Intuitionistic. (T, S)-Fuzzy Filters on. Lattice Implication Algebras
Theoretical Mathematics & Applications, vol.3, no.2, 2013, 79-89 ISSN: 1792-9687 (print), 1792-9709 (online) Scienpress Ltd, 2013 Some Properties of Intuitionistic (T, S)-Fuzzy Filters on Lattice Implication
More informationOn Rainbow Cycles in Edge Colored Complete Graphs. S. Akbari, O. Etesami, H. Mahini, M. Mahmoody. Abstract
On Rainbow Cycles in Edge Colored Complete Graphs S. Akbari, O. Etesami, H. Mahini, M. Mahmoody Abstract In this paper we consider optimal edge colored complete graphs. We show that in any optimal edge
More informationA 2k-Kernelization Algorithm for Vertex Cover Based on Crown Decomposition
A 2k-Kernelization Algorithm for Vertex Cover Based on Crown Decomposition Wenjun Li a, Binhai Zhu b, a Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha
More informationInternational Journal of Pure and Applied Mathematics Volume 50 No ,
International Journal of Pure and Applied Mathematics Volume 50 No. 4 2009, 523-528 FUZZY MAGNIFIED TRANSLATION IN RINGS Sanjib Kumar Datta Department of Mathematics University of North Bengal Raja Rammohunpur,
More informationParametric and Inverse Parametric Sequence Alignment
Parametric and Inverse Parametric Sequence Alignment Nan Lu, nlu@math.gatech.edu School of Mathematics, Georgia Institute of Technology School of Mathematics, Georgia Institute of Technology 22:36, April
More informationNote on list star edge-coloring of subcubic graphs
Note on list star edge-coloring of subcubic graphs Borut Lužar, Martina Mockovčiaková, Roman Soták October 5, 018 arxiv:1709.0393v1 [math.co] 11 Sep 017 Abstract A star edge-coloring of a graph is a proper
More informationCollapsible biclaw-free graphs
Collapsible biclaw-free graphs Hong-Jian Lai, Xiangjuan Yao February 24, 2006 Abstract A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected
More informationKey words. graph algorithms, chromatic number, circular arc graphs, induced cycles
SIAM J. COMPUT. Vol. 0, No. 0, pp. 000 000 c XXXX Society for Industrial and Applied Mathematics REVISITING TUCKER S ALGORITHM TO COLOR CIRCULAR ARC GRAPHS MARIO VALENCIA-PABON Abstract. The circular arc
More informationRestricted edge connectivity and restricted connectivity of graphs
Restricted edge connectivity and restricted connectivity of graphs Litao Guo School of Applied Mathematics Xiamen University of Technology Xiamen Fujian 361024 P.R.China ltguo2012@126.com Xiaofeng Guo
More informationOn graph decompositions modulo k
On graph decompositions modulo k A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, 16 Mill Lane, Cambridge, CB2 1SB, England. Abstract. We prove that, for
More informationarxiv: v1 [math.co] 5 Jan 2018
Neighborhood-Prime Labelings of Trees and Other Classes of Graphs Malori Cloys Austin Peay State University mcloys@my.apsu.edu arxiv:1801.0180v1 [math.co] 5 Jan 018 N. Bradley Fox Austin Peay State University
More informationCategorical equivalence of some algebras
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 16, Number 2, 2012 Available online at www.math.ut.ee/acta/ Categorical equivalence of some algebras Oleg Košik Abstract. We show that
More informationBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
Iranian Journal of Mathematical Sciences and Informatics Vol. 13, No. 2 (2018), pp 1-13 DOI: 10.7508/ijmsi.2018.13.001 Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
More informationProduct Cordial Labeling of Some Cycle Related Graphs
Product Cordial Labeling of Some Cycle Related Graphs A. H. Rokad 1, G. V. Ghodasara 2 1 PhD Scholar, School of Science, RK University, Rajkot - 360020, Gujarat, India 2 H. & H. B. Kotak Institute of Science,
More informationTwo Upper Bounds for the Erdős Szekeres Number with Conditions
Discrete Comput Geom (2013) 49:183 188 DOI 10.1007/s00454-012-9474-9 Two Upper Bounds for the Erdős Szekeres Number with Conditions Florian Strunk Received: 8 July 2011 / Revised: 2 July 2012 / Accepted:
More informationA NEW PROOF OF THE SMOOTHNESS OF 4-POINT DESLAURIERS-DUBUC SCHEME
J. Appl. Math. & Computing Vol. 18(2005), No. 1-2, pp. 553-562 A NEW PROOF OF THE SMOOTHNESS OF 4-POINT DESLAURIERS-DUBUC SCHEME YOUCHUN TANG, KWAN PYO KO* AND BYUNG-GOOK LEE Abstract. It is well-known
More informationGENERALIZED TRACEABILITY CODES
U.P.B. Sci. Bull., Series A, Vol. 78, Iss. 2, 2016 ISSN 1223-7027 GENERALIZED TRACEABILITY CODES Majid MAZROOEI 1, Ali ZAGHIAN 2 In this paper, we introduce generalizations of frameproof, secure frameproof,
More informationA Reduction of Conway s Thrackle Conjecture
A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854
More informationWinning Positions in Simplicial Nim
Winning Positions in Simplicial Nim David Horrocks Department of Mathematics and Statistics University of Prince Edward Island Charlottetown, Prince Edward Island, Canada, C1A 4P3 dhorrocks@upei.ca Submitted:
More informationGracefulness of a New Class from Copies of kc 4 P 2n and P 2 * nc 3
International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 2, Number 1 (2012), pp. 75-81 Research India Publications http://www.ripublication.com Gracefulness of a New Class from Copies
More information1. Chapter 1, # 1: Prove that for all sets A, B, C, the formula
Homework 1 MTH 4590 Spring 2018 1. Chapter 1, # 1: Prove that for all sets,, C, the formula ( C) = ( ) ( C) is true. Proof : It suffices to show that ( C) ( ) ( C) and ( ) ( C) ( C). ssume that x ( C),
More informationAXIOMS FOR THE INTEGERS
AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,
More informationOn vertex types of graphs
On vertex types of graphs arxiv:1705.09540v1 [math.co] 26 May 2017 Pu Qiao, Xingzhi Zhan Department of Mathematics, East China Normal University, Shanghai 200241, China Abstract The vertices of a graph
More informationCombinatorial Enumeration of Partitions of a Convex Polygon
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 18 2015, Article 15.9.4 Combinatorial Enumeration of Partitions of a Convex Polygon Dong Zhang and Dongyi Wei Peking University Beijing 100871 P. R.
More informationRSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È.
RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. Let Ò Ô Õ. Pick ¾ ½ ³ Òµ ½ so, that ³ Òµµ ½. Let ½ ÑÓ ³ Òµµ. Public key: Ò µ. Secret key Ò µ.
More information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
More informationMultiple Vertex Coverings by Cliques
Multiple Vertex Coverings by Cliques Wayne Goddard Department of Computer Science University of Natal Durban, 4041 South Africa Michael A. Henning Department of Mathematics University of Natal Private
More informationPick s Theorem and Lattice Point Geometry
Pick s Theorem and Lattice Point Geometry 1 Lattice Polygon Area Calculations Lattice points are points with integer coordinates in the x, y-plane. A lattice line segment is a line segment that has 2 distinct
More informationDubna 2018: lines on cubic surfaces
Dubna 2018: lines on cubic surfaces Ivan Cheltsov 20th July 2018 Lecture 1: projective plane Complex plane Definition A line in C 2 is a subset that is given by ax + by + c = 0 for some complex numbers
More informationThe Kannan s Fixed Point Theorem in a Cone Hexagonal Metric Spaces
Advances in Research 7(1): 1-9, 2016, Article no.air.25272 ISSN: 2348-0394, NLM ID: 101666096 SCIENCEDOMAIN inteational www.sciencedomain.org The Kannan s Fixed Point Theorem in a Cone Hexagonal Metric
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 7: Direct Proof Introduction 1. The statement below is true. Rewrite the
More informationAMICABLE PAIRS OF THE FORM (i, 1)
mathematics of computation volume 56, number 194 april 1991, pages 859-865 AMICABLE PAIRS OF THE FORM (i, 1) PATRICK COSTELLO Abstract. A method is given for finding amicable pairs of a certain type. When
More informationPythagorean Triples. Chapter 2. Exercises
Chapter Pythagorean Triples Exercises.1. (a) We showed that in any primitive Pythagorean triple (a, b, c), either a or b is even. Use the same sort of argument to show that either a or b must be a multiple
More informationSome fixed fuzzy point results using Hausdorff metric in fuzzy metric spaces
Annals of Fuzzy Mathematics and Informatics Volume 13, No 5, (May 017), pp 641 650 ISSN: 093 9310 (print version) ISSN: 87 635 (electronic version) http://wwwafmiorkr @FMI c Kyung Moon Sa Co http://wwwkyungmooncom
More information31.6 Powers of an element
31.6 Powers of an element Just as we often consider the multiples of a given element, modulo, we consider the sequence of powers of, modulo, where :,,,,. modulo Indexing from 0, the 0th value in this sequence
More informationGeneralized Convex Set-Valued Maps
Generalized Convex Set-Valued Maps September 20, 2008 Joël Benoist Department of Mathematics LACO URA-CNRS 1586 University of Limoges 87060 Limoges, France E-mail: benoist@unilim.fr Nicolae Popovici Faculty
More informationComponent connectivity of crossed cubes
Component connectivity of crossed cubes School of Applied Mathematics Xiamen University of Technology Xiamen Fujian 361024 P.R.China ltguo2012@126.com Abstract: Let G = (V, E) be a connected graph. A r-component
More information