DOCSLIB.ORG

Tetrahedral and Pentatopic Sum Labeling of Graphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Tetrahedral and Pentatopic Sum Labeling of Graphs International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868 Foundation of Computer Science FCS, New York, USA Volume 5 - No. 6, April 2013 - www.ijais.org Tetrahedral and Pentatopic Sum Labeling of Graphs S. Murugesan D. Jayaraman J. Shiama Department of Mathematics Department of Mathematics Department of Mathematics, C. B. M. College, Kovaipudur, C. B. M. College, Kovaipudur, C. M. S. College of Science and Commerce, Coimbatore - 641 042, Coimbatore - 641 042, Tamil Nadu, INDIA. Coimbatore- 641 049,Tamil Nadu, INDIA. Tamil Nadu, INDIA. ABSTRACT DEFINITION 4. A tetrahedral number(or triangular pyrami- dal number) is a figurative number that represents a pyramid A (p; q) graph G is said to admit tetrahedral or pentatopic sum la- with a triangular base and three sides, called a tetrahedron. beling if its vertices can be labeled by non negative integers such The nth tetrahedral number is the sum of the first n triangu- that the induced edge labels obtained by the sum of the labels of end th lar numbers. If the n tetrahedral number is denoted by Bn, vertices are the first q tetrahedral or pentatope numbers. A graph G 1 then Bn = 6 n(n + 1)(n + 2). The tetrahedral numbers are which admits tetrahedral or pentatopic sum labeling is called tetra- 1; 4; 10; 20; 35; 56; 84; 120; 165; 220; 286; 364; 455; 560; 680; hedral or pentatopic sum graph. In this paper we prove that paths, 816; 969;... combs, stars, subdivision of stars and Bm;n admit tetrahedral and pentatopic sum labeling. DEFINITION 5. A tetrahedral sum labeling of a graph G is a one-to-one function f : V (G) ! N that induces a bijection Keywords: + f : E(G) ! fB1;B2; :::; Bqg of the edges of G defined by Tetrahedral sum labeling, pentatopic sum labeling. f +(uv) = f(u) + f(v); 8e = uv 2 E(G). The graph which admits such labeling is called a tetrahedral sum graph. 1. INTRODUCTION EXAMPLE 1. A tetrahedral sum graph with 8 vertices is The graphs considered here are finite, connected, undirected and shown below. simple. The vertex set and edge set of a graph G are denoted by V (G) and E(G) respectively. For various graph theoretic no- tations and terminology we follow Harary [1] and for number theory we follow Burton [2]. We will give the brief summary of definitions which are useful for the present investigations. 1 4 DEFINITION 1. If the vertices of the graph are assigned val- r ues subject to certain conditions it is known as graph labeling. 1 4 r 10 10 A dynamic survey on graph labeling is regularly updated by Gal- r lian [3] and it is published by Electronic Journal of Combina- 20 020 35 torics. Vast amount of literature is available on different types of 35 graph labeling and more than 1000 research papers have been r r r published so far in last four decades. 8456 Most important labeling problems have three important ingredi- ents. * A set of numbers from which vertex labels are chosen; * A rule that assigns a value to each edge; 36120 84 * A condition that these values must satisfy. r r The present work is to aimed to discuss two such labelings known as tetrahedral sum labeling and pentatopic sum labeling. DEFINITION 2. A triangular number is a number obtained DEFINITION 6. A pentatope number is a figurative num- 1 by adding all positive integers less than or equal to a given pos- ber given by P topn = 4 Bn(n + 3) where Bn is th th th itive integer n. If the n triangular number is denoted by An, the n tetrahedral number. The n pentatope number 1 then An = n(n + 1). is the sum of the first n tetrahedral numbers. If the 2 th n pentatope number is denoted by Cn, then Cn = The triangular numbers are 1,3,6,10,15,21,28,36,45,55,... 1 24 n(n + 1)(n + 2)(n + 3). The pentatopic numbers are 1,5,15,35,70,126,210,330,495,715,1001,1365,1820,2380,3060, DEFINITION 3. A triangular sum labeling of a graph G is a 3876,4845,... one-to-one function f : V (G) ! N (where N is the set of all + non-negative integers) that induces a bijection f : E(G) ! DEFINITION 7. A pentatopic sum labeling of a graph G is + fA1;A2; :::; Aqg of the edges of G defined by f (uv) = f(u)+ a one-to-one function f : V (G) ! N that induces a bijection + f(v); 8e = uv 2 E(G). The graph which admits such labeling f : E(G) ! fC1;C2; :::; Cqg of the edges of G defined by is called a triangular sum graph. f +(uv) = f(u) + f(v); 8e = uv 2 E(G). The graph which admits such labeling is called a pentatopic sum graph. This concept was introduced by Hegde and Shankaran [4]. Mo- tivated by the concept of triangular sum labeling, we introduce two new types of labeling called tetrahedral sum labeling and EXAMPLE 2. A pentatopic sum graph with 13 vertices is pentatopic sum labeling. shown below. 31 International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868 Foundation of Computer Science FCS, New York, USA Volume 5 - No. 6, April 2013 - www.ijais.org Case(ii): i is even For 1 ≤ i ≤ n − 1, 35 126 1 1 f(u ) + f(u ) = i(i + 2)(2i − 1) + i(i + 2)(2i + 5) 15 210 i i+1 24 24 1 r r = i(i + 1)(i + 2) 535 495 r15 126 r 6 15 210 1001 = Bi r r + 1 495 = f (vi) r r 1001 Thus the induced edge labels are the first n − 1 tetrahedral num- 0 bers. 70r 1365 Hence path Pn admits tetrahedral sum labeling. 70 1365 EXAMPLE 3. The tetrahedral sum labeling of P11 is shown below. r r 330 1820 0 1 3 7 13 22 34 50 70 95 125 260715 455 1 4 10 20 35 56 84 120 165 220 r r rrrrrrrrrrr THEOREM 2. The comb Pn K1 admits tetrahedral sum 2. MAIN RESULTS labeling. Here we prove that paths, combs, stars, double stars and bistars PROOF. Let Pn : u1u2:::un be the path and let vi = admit tetradedral and pentatopic sum labeling. uiui+1(1 ≤i≤n-1) be the edges. Let w1; w2; :::; wn be the pen- dant vertices adjacent to u1; u2; :::; un respectively and ti = uiwi(1 ≤i≤n-1) be the edges. THEOREM 1. The path Pn admits tetrahedral sum labeling. For i=1,2,...,n, define ( PROOF. Let Pn : u1u2:::un be the path and let vi = 1 (i − 1)(i + 1)(2i + 3) if i is odd u u (1 ≤i≤n-1) be the edges. f(u ) = 24 i i+1 i 1 i(i + 2)(2i − 1) if i is even For i=1,2,...,n, define 24 and 8 h 8 > 1 2i3 + (12n − 3)i2 1 > 24 > (i − 1)(i + 1)(2i + 3) if i is odd > i <> 24 <>+(12n2 − 2)i + (4n3 − 4n + 3) ; if i is odd f(ui) = f(wi) = h 1 2i3 + (12n − 3)i2 > 1 > 24 :> i(i + 2)(2i − 1) if i is even > 24 > 2 2 i :>+(12n − 2)i + 4n(n − 1) ; if i is even: + We will prove that the induced edge labels obtained by the Then f(ui) + f(ui+1) = f (vi) for 1 ≤ i ≤ n − 1 sum of the labels of end vertices are the first n − 1 tetrahedral + numbers. and f(ui) + f(wi) = f (ti) for 1 ≤ i ≤ n. Case(i): i is odd Thus the induced edge labels are the first 2n−1 tetrahedral num- For 1 ≤ i ≤ n − 1, bers. Hence comb admits tetrahedral sum labeling. 1 EXAMPLE 4. The tetrahedral sum labeling of P K is f(u ) + f(u ) = (i − 1)(i + 1)(2i + 3) 6 1 i i+1 24 shown below. 1 + (i + 1)(i + 3)(2i + 1) 24 1 h = (i + 1) (i − 1)(2i + 3) 0 1 3 7 13 22 24 i 1 4 10 20 35 + (i + 3)(2i + 1) r r r r r r 1 56 84 120 165 220 286 = i(i + 1)(i + 2) 6 = Bi = f +(v 56 83 117 158 207 264 i) r r r r r r 32 International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868 Foundation of Computer Science FCS, New York, USA Volume 5 - No. 6, April 2013 - www.ijais.org THEOREM 3. The star graph K1;n admits tetrahedral sum labeling. 83 84 r PROOF. Let v be the apex vertex and let v1; v2; :::; vn be the pendant vertices of the star K1;n. Define 1 120 308 364 116 r 1 r r 4 f(v) = 0 56 56 4 1 rr andf(v ) = i(i + 1)(i + 2); 1 ≤ i ≤ n: i 6 35 0 10 r 286 20 35 10 165 rr 20 We see that the induced edge labels are the first n tetrahedral 251 155 numbers. r r r 220 Hence K1;n admits tetrahedral sum labeling. 200 EXAMPLE 5. The tetrahedral sum labeling of K1;8 is shown r below. THEOREM 5. The bistar Bm;n admits tetrahedral sum la- beling. 1 PROOF. Let V (Bm;n) = fu; v; ui; vj : 1 ≤i≤m; 1 ≤j≤ng and 4 E(B ) = fuv; uu ; vv : 1 ≤i≤m; 1 ≤j≤ng. 120 r m;n i j @ Define f by 1 r @120 r @ 4 f(u) = 0; 84 @ f(v) = 1; 84 0 10 @ 10 1 f(u ) = (i + 1)(i + 2)(i + 3); 1 ≤ i ≤ m 56 rr@ r i 6 @ 20 1 35 @ andf(vj ) = (m + j + 1)(m + j + 2)(m + j + 3) − 1; 1 ≤ j ≤ n: @ 6 56 20 r r We see that the induced edge labels are the first m + n + 1 35 tetrahedral numbers.
Load more

Recommended publications
  • Induction for Tetrahedral Numbers
    Induction for Tetrahedral Numbers Teacher Notes and Answers 7 8 9 10 11 12 TI-84PlusCE™ Investigation Student 50 min Teacher Notes: “Inductive Tetrahedrals” is part two of this three-part series. [Refer to Inductive Whole Numbers for Part One]. Part two follows a similar format to part one but is slightly more challenging from an algebraic perspective. Teachers can use part two in this series as a more independent environment for students focusing on providing feedback rather than instruction. A set of Power Point slides is provided that can be used to enhance the visual aspect of this lesson, the ability to visualise solutions can give problems more meaning. “Cubes and Squares” is part three of this three-part series. This section is designed as an assessment tool, marks have been allocated to each question. The questions are more reflective of the types of questions that students might experience in the short answer section of an examination where calculators may be used to derive answers or to simply verify by-hand solutions. A set of Power Point slides is provided that can be used to introduce students to this task. Introduction The purpose of this activity is to use exploration and observation to establish a rule for the sum of the first n tetrahedral numbers then use proof by mathematical induction to show that the rule is true for all whole numbers. What are the Tetrahedral numbers? The prefix ‘tetra’ refers to the quantity four, so it is not surprising that a tetrahedron consists of four faces, each face is a triangle.
    [Show full text]
  • Tetrahedral Numbers
    Tetrahedral Numbers Student Worksheet TI-30XPlus Activity Student 50 min 7 8 9 10 11 12 MathPrint™ Finding Patterns What are the Tetrahedral numbers? The prefix ‘tetra’ refers to the quantity four, so it is not surprising that a tetrahedron consists of four faces, each face is a triangle. This triangular formation can sometimes be found in stacks of objects. The series of diagrams below shows the progression from one layer to the next for a stack of spheres. Row Number 1 2 3 4 5 Items Added Complete Stack Question: 1. Create a table of values for the row number and the corresponding quantity of items in a complete stack. Question: 2. Create a table of values for the row number and the corresponding quantity of items that are added to the stack. Question: 3. The calculator screen shown here illustrates how to determine the fifth tetrahedral number. The same command could be used to determine any of the tetrahedral numbers. Explain how this command is working. Question: 4. Verify that the calculation shown opposite is the same as the one generated in Question 3. Question: 5. Enter the numbers 1, 2 … 10 in List 1 on the calculator. Enter the first 10 tetrahedral numbers in List 2. Once the values have been entered try the following: a) Quadratic regression using List 1 and List 2. Check the validity of the result via substitution. b) Cubic regression using List 1 and List 2. Check the validity of the result via substitution. Texas Instruments 2021. You may copy, communicate and modify this material for non-commercial educational purposes Author: P.
    [Show full text]
  • ~Umbers the BOO K O F Umbers
    TH E BOOK OF ~umbers THE BOO K o F umbers John H. Conway • Richard K. Guy c COPERNICUS AN IMPRINT OF SPRINGER-VERLAG © 1996 Springer-Verlag New York, Inc. Softcover reprint of the hardcover 1st edition 1996 All rights reserved. No part of this publication may be reproduced, stored in a re­ trieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the publisher. Published in the United States by Copernicus, an imprint of Springer-Verlag New York, Inc. Copernicus Springer-Verlag New York, Inc. 175 Fifth Avenue New York, NY lOOlO Library of Congress Cataloging in Publication Data Conway, John Horton. The book of numbers / John Horton Conway, Richard K. Guy. p. cm. Includes bibliographical references and index. ISBN-13: 978-1-4612-8488-8 e-ISBN-13: 978-1-4612-4072-3 DOl: 10.l007/978-1-4612-4072-3 1. Number theory-Popular works. I. Guy, Richard K. II. Title. QA241.C6897 1995 512'.7-dc20 95-32588 Manufactured in the United States of America. Printed on acid-free paper. 9 8 765 4 Preface he Book ofNumbers seems an obvious choice for our title, since T its undoubted success can be followed by Deuteronomy,Joshua, and so on; indeed the only risk is that there may be a demand for the earlier books in the series. More seriously, our aim is to bring to the inquisitive reader without particular mathematical background an ex­ planation of the multitudinous ways in which the word "number" is used.
    [Show full text]
  • The Frobenius Number for Sequences of Binomial Coefficients
    The Frobenius number for sequences of binomial coefficients Aureliano M. Robles-Perez´ Universidad de Granada A talk based on a joint work with Jose´ Carlos Rosales (J. Number Theory 186 (2018) 473–492.) INdAM meeting: International meeting on numerical semigroups - Cortona 2018 3-7th September 2018 A. M. Robles-Perez´ (UGR) Frobenius number and binomial sequences IMNS-2018 1 / 29 Frobenius coin problem I Given relatively prime positive integers a1;:::;an, n ≥ 2, find a formula to compute the largest integer that is not representable as a non-negative integer linear combination of a1;:::;an. I F(a1;:::;an) (the Frobenius number of the set fa1;:::;ang) denotes the solution of the previous problem. I F(a1;a2) = a1a2 − a1 − a2: I Frobenius problem is open for n ≥ 3. ∗ Curtis: it is impossible to find a polynomial formula that computes the Frobenius number if n = 3. ∗ Ram´ırez Alfons´ın: the problem is NP-hard for n variables. A. M. Robles-Perez´ (UGR) Frobenius number and binomial sequences IMNS-2018 2 / 29 Particular cases I Arithmetic and almost arithmetic sequences (A. Brauer; M. Lewin; J. B. Roberts; E. S. Selmer), I Fibonacci sequences (J. M. Mar´ın, J. L. Ram´ırez Alfons´ın and M. P. Revuelta), I geometric sequences (D. C. Ong and V. Ponomarenko), I Mersenne, repunit, and Thabit sequences (J. C. Rosales, M. B. Branco, D. Torrao),˜ I squares and cubes sequences (M. Lepilov, J. O’Rourke and I. Swanson; A. Moscariello), I ... A. M. Robles-Perez´ (UGR) Frobenius number and binomial sequences IMNS-2018 3 / 29 Particular cases: motivations (i) I Brauer: n − 2 F(n;n + 1;:::;n + k − 1) = + 1 n − 1: k − 1 I Baker (conjecture): If Tn is the nth triangular (or triangle) number, then 8 3 2 > 6n +18n +12n−8 if n is even; <> 8 F(Tn;Tn+1;Tn+2) = :> 6n3+12n2−6n−20 8 if n is odd.
    [Show full text]
  • Pascal's Triangle
    PASCAL’S TRIANGLE Todd Cochrane 1 / 29 Robert’s Dream In his dream, Robert and the Number Devil build a giant pyramid of blocks. Being two-dimensional they agree to call it a triangle of blocks. Then they start marking the blocks with a felt pen, labeling the top block 1, the next two 1,1, and then each block thereafter the sum of the two values above it. Thus, the third row is 1,2,1, the fourth 1,3,3,1 and so on. 2 / 29 Pascal’s Triangle 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 ; 1 5 10 10 5 1 1 6 15 20 15 6 1 1 7 21 35 35 21 7 1 1 8 28 56 70 56 28 8 1 Rule: Each term in Pascal’s triangle is the sum of the two terms above it. Pascal’s triangle is named after Blaise Pascal, who put together many of its properties in 1653. 3 / 29 Triangle Numbers. Diagonal 3: 1; 3; 6; 10; 15; 21;::: Diagonal 4: 1; 4; 10; 20; 35; 56;::: Tetrahedral Numbers. Diagonal’s of Pascal’s Triangle 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 ; 1 5 10 10 5 1 1 6 15 20 15 6 1 1 7 21 35 35 21 7 1 1 8 28 56 70 56 28 8 1 Diagonals: Note, the Southwesterly and Southeasterly diagonals are the same. Diagonal 1: 1; 1; 1; 1;::: (yawn) Diagonal 2: 1; 2; 3; 4; 5; : : : ::: Natural Numbers .
    [Show full text]
  • The Personality of the Integers from One to One Gross
    ETY CI O O F S The Dozenal Society of America E 0 1 A L X 2 M A 9 3 E The Personality of the Integers N R E 8 4 I Z 7 5 C from One to One Gross A O 6 D Jay Schiffman S Introduction n his fascinating paperback entitled The Lore of integer that lends a special personality to them es- I Large Numbers,1 author Philip J. Davis devotes a pecially when one resorts to duodecimals. Finally, detailed chapter to The Personality of Numbers and my goal is to furnish number theoretic characteris- provides a list entitled Who’s Who Among The Inte- tics related to each of the integers that are perhaps gers from One to One Hundred in the decimal base. omitted from the average list. Our initial task is to The purpose of my paper is to expand his list to the present the reader with a dictionary which is termed first gross and present additional characteristics of A Glossary of Symbols and Terms. These symbols these integers. It is indeed the uniqueness of each and terms will be illustrated in this section. A Glossary of Symbols and Terms 1. n! The factorial of the positive integer n. We de- 6. Ln The nth Lucas Number. n is a Lucas Number fined n!, known as n factorial, recursively as if n satisfied the Lucas Sequence defined recur- follows: 0! = 1 and (n + 1)! = (n + 1)(n!). sively as follows: L1 = 1, L2 = 3, and Ln = Hence 1! = (0 + 1)(0!) = (1)(1) = 1 and Ln−2 + Ln−1 for n ≥ 3.
    [Show full text]
  • Math Ontological Basis of Quas
    Math Ontological Basis of Quasi Fine-Tuning in Ghc Cosmologies Mark Thomas To cite this version: Mark Thomas. Math Ontological Basis of Quasi Fine-Tuning in Ghc Cosmologies. 2015. hal- 01232022v5 HAL Id: hal-01232022 https://hal.archives-ouvertes.fr/hal-01232022v5 Preprint submitted on 23 Jul 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Math Ontological Basis of Quasi Fine-Tuning in Ghc Cosmologies 1 M. A. Thomas The subject of fine tuning in physics is a long contentious issue especially now as it has hitched a ride on the Multiverse bandwagon. The maths of quadratic forms are predominately featured and relate the physics parameters G h c, which in turn are weighted during the Planck Era(s) determined by relative Planck time clocking. This simplifies the search to these three values as being the important apparent fine-tuned parameters (quasi fine tuning) for determining the gravitational build structures restricted to SM-4D type Universes. Two gravitational coupling constants (dimensionless) are prescribed within the Ghc complex. Both describe the relative rigidity of gravitational physics in the low energy build of our Universe (General Relativity toward endpoint neutron star, black hole formation).
    [Show full text]
  • Half Companion Sequences of Special Dio 3-Tuples Involving Centered Square Numbers
    International Journal of Recent Technology and Engineering (IJRTE) ISSN: 2277-3878, Volume-8 Issue-3, September 2019 Half Companion Sequences of Special Dio 3-Tuples Involving Centered Square Numbers C.Saranya , G.Janaki Abstract: In this paper, we construct a sequence of Special Dio IV. METHOD OF ANALYSIS: 3-tuples for centered square numbers involving half companion Case 1: sequences under 3 cases with the properties D(-2), D(-11) & Forming sequence of Special dio 3-tuples for centered D(-26). square numbers of consecutive ranks n and n 1 2 2 Keywords : Diophantine Triples, special dio-tuples,Centered Let a1 CSn n (n 1) & square Number, Integer Sequences. 2 2 a2 CSn1 (n 1) n be Centered Square numbers of rank n and n 1 I. INTRODUCTION respectively such that a1a2 a1 a2 2 is a perfect In Number theory, a Diophantine equation is a polynomial square say 2 . equation, usually in two or more unknowns, with the end goal that solitary the integer solutions are looked for or Let p3 be any non-zero whole number such that contemplated [1-4]. The word Diophantine alludes to the 2 a a a a 2 (1) Greek mathematician of the third century, Diophantus of 1 3 1 3 1 Alexandria, who made an investigation of such conditions and 2 a2a3 a2 a3 2 1 (2) was one of the primary mathematician to bring symbolism Assume x a y an x a y , into variable based mathematics. 1 1 1 1 1 1 2 1 2 2 Various mathematicians considered the problem of the it becomes x a 1a 1y 3 (3) occurrence of Dio triples and quadruples with the property 1 1 2 1 2 D(n) for any integer n and besides for any linear polynomial in Therefore, 1 4n 2n 3 n[5-7].
    [Show full text]
  • Painting a Pyramid.Pdf
    Delving deeper christopher M. Kribs-Zaleta Painting the Pyramid ne hallmark of a mathematician is the can measure or count about a cube: numbers of ver- instinct to extend and generalize. This article tices, edges, and faces, surface area, and volume. In Otakes a common high school problem relating particular, the unit cubes at the vertices of the large algebra, geometry, and patterns and extends it. The cube are those that have paint on 3 faces (for n > 1). extension seems simple enough at first glance but The remaining unit cubes along the edges of the large proves to have a number of interesting complications. cube are those that have paint on 2 faces, and the cor- Painting the Cube (NCTM 1989; Reys 1988) is a responding formula 12(n – 2) that emerges from the popular and mathematically rich problem used in mid- data is formed by measuring the length of one edge, dle and high school mathematics courses (as well as discounting the two corner cubes, and then multiply- some courses for preservice teachers). In that problem, ing by the number of edges. The remaining unit a large cube is assembled from small unit cubes, and cubes on the faces of the large cube are those with the exposed faces of the large cube are then painted one painted face, and they are counted by measuring (see fig. 1). The problem asks how many of the unit the area of a face, discounting the edges and corners, cubes will have paint on 0, 1, 2, . faces, as a func- and multiplying by the number of faces.
    [Show full text]
  • Notations Used 1
    NOTATIONS USED 1 NOTATIONS ⎡ (n −1)(m − 2)⎤ Tm,n = n 1+ - Gonal number of rank n with sides m . ⎣⎢ 2 ⎦⎥ n(n +1) T = - Triangular number of rank n . n 2 1 Pen = (3n2 − n) - Pentagonal number of rank n . n 2 2 Hexn = 2n − n - Hexagonal number of rank n . 1 Hep = (5n2 − 3n) - Heptagonal number of rank n . n 2 2 Octn = 3n − 2n - Octagonal number of rank n . 1 Nan = (7n2 − 5n) - Nanogonal number of rank n . n 2 2 Decn = 4n − 3n - Decagonal number of rank n . 1 HD = (9n 2 − 7n) - Hendecagonal number of rank n . n 2 1 2 DDn = (10n − 8n) - Dodecagonal number of rank n . 2 1 TD = (11n2 − 9n) - Tridecagonal number of rank n . n 2 1 TED = (12n 2 −10n) - Tetra decagonal number of rank n . n 2 1 PD = (13n2 −11n) - Pentadecagonal number of rank n . n 2 1 HXD = (14n2 −12n) - Hexadecagonal number of rank n . n 2 1 HPD = (15n2 −13n) - Heptadecagonal number of rank n . n 2 NOTATIONS USED 2 1 OD = (16n 2 −14n) - Octadecagonal number of rank n . n 2 1 ND = (17n 2 −15n) - Nonadecagonal number of rank n . n 2 1 IC = (18n 2 −16n) - Icosagonal number of rank n . n 2 1 ICH = (19n2 −17n) - Icosihenagonal number of rank n . n 2 1 ID = (20n 2 −18n) - Icosidigonal number of rank n . n 2 1 IT = (21n2 −19n) - Icositriogonal number of rank n . n 2 1 ICT = (22n2 − 20n) - Icositetragonal number of rank n . n 2 1 IP = (23n 2 − 21n) - Icosipentagonal number of rank n .
    [Show full text]
  • Analogues Between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by CSUSB ScholarWorks California State University, San Bernardino CSUSB ScholarWorks Electronic Theses, Projects, and Dissertations Office of aduateGr Studies 6-2019 Analogues Between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle Lacey Taylor James California State University - San Bernardino, [email protected] Follow this and additional works at: https://scholarworks.lib.csusb.edu/etd Part of the Algebra Commons, Discrete Mathematics and Combinatorics Commons, and the Other Mathematics Commons Recommended Citation James, Lacey Taylor, "Analogues Between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle" (2019). Electronic Theses, Projects, and Dissertations. 835. https://scholarworks.lib.csusb.edu/etd/835 This Thesis is brought to you for free and open access by the Office of aduateGr Studies at CSUSB ScholarWorks. It has been accepted for inclusion in Electronic Theses, Projects, and Dissertations by an authorized administrator of CSUSB ScholarWorks. For more information, please contact [email protected]. Analogues Between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle A Thesis Presented to the Faculty of California State University, San Bernardino In Partial Fulfillment of the Requirements for the Degree Master of Arts in Mathematics by Lacey Taylor James June 2019 Analogues Between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle A Thesis Presented to the Faculty of California State University, San Bernardino by Lacey Taylor James June 2019 Approved by: Joseph Chavez, Committee Chair Charles Stanton, Committee Member Rolland Trapp, Committee Member Shawnee McMurran, Chair, Department of Mathematics Corey Dunn, Graduate Coordinator iii Abstract This paper will discuss the analogues between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle by utilizing mathematical proving techniques like partial sums, com- mittees, telescoping, mathematical induction and applying George P´olya's perspective.
    [Show full text]
  • Construction of the Diophantine Triple Involving Pentatope Number
    6 III March 2018 http://doi.org/10.22214/ijraset.2018.3535 International Journal for Research in Applied Science & Engineering Technology (IJRASET) ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor: 6.887 Volume 6 Issue III, March 2018- Available at www.ijraset.com Construction of The Diophantine Triple involving Pentatope Number G. Janaki 1, C. Saranya 2 1 Associate Professor, Department of Mathematics, Cauvery College for Women, Trichy-18 2 Assistant Professor, Department of Mathematics, Cauvery College for Women, Trichy-18 Abstract: We search for three distinct polynomials with integer coefficients such that the product of any two numbers increased by a non-zero integer (or polynomials with integer coefficients) is a perfect square. Keywords: Diophantine triples, Pentatope number, Polynomials & Perfect square. 2010 Mathematics Subject Classification: 11D25. I. INTRODUCTION In Mathematics, a Diophantine equation is a polynomial equation, usually in two or more unknowns, such that only the integer solutions are sought or studied (an integer solution is a solution such that all the unknowns take integer values).The word Diophantine refers to the Hellenistic mathematician of the 3rd century, Diophantus of Alexandria, who made a study of such equations and was one of the first mathematician to introduce symbolism into algebra. The mathematical study of Diophantine problems that Diophantus initiated is now called Diophantine analysis.While individual equations present a kind of puzzle and have been considered throughout history, the formulation of general theories of Diophantine equations (beyond the theory of quadratic forms) was an achievement of the twentieth century. In [1-6], theory of numbers were discussed.
    [Show full text]