DOCSLIB.ORG

Some Polygonal Sum Labeling of Bistar

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Some Polygonal Sum Labeling of Bistar International Journal of Scientific & Engineering Research, Volume 7, Issue 5, May-2016 34 ISSN 2229-5518 Some Polygonal Sum Labeling of Bistar 1.Dr.K.Amuthavalli, 2. S.Dineshkumar, ABSTRACT- A (p, q) graph G is said to admit a polygonal sum labeling if its vertices can be labeled by non -negative integers such that the induced edge labels obtained by the sum of the labels of end vertices are the first q polygonal numbers. A graph G which admits a polygonal sum labeling is called a polygonal sum graph. In this paper we have proved that the Bistar (Bn,n) admit Pentagonal, Hexagonal, Heptagonal, Octagonal, Nonagonal and Decagonal Sum Labeling. Keywords: Polygonal sum labeling and polygonal sum graph. —————————— —————————— 1. INTRODUCTION A pentagonal sum labeling of a graph G is one to one + All graphs in this paper are finite, simple and undirected. function f: V(G)→ N that induces a bijection f : E(G) → + Terms not defined here are used in the sense of Harary [2]. {A1, A2, . , Aq} of the edges of G defined by f (uv) = A graph labeling is an assignment of integers to the vertices f(u) + f(v) for every e = uv є E(G). The graph which admits or edges or both subjects to certain conditions. If the such labeling is called a pentagonal sum graph. domain of the mapping is the set of vertices (or edges) then 2.4 Definition the labeling is called a vertex labeling (or an edge labeling). Hexagonal numbers are numbers that create a hexagon. In Graph labeling was first introduced in the late 1960’s. other words 1, 6, 15, 28, 45, 66, 91, 120, 153, 190, 231, Many studies in graph labeling refer to Rosa’s research in 276, . are hexagonal numbers. 1967 [5]. In the recent years, dozens of graph labeling th techniques have been studied in over 1500 papers [3]. The n hexagonal number is denoted by Bn, then Triangular sum labeling was discussed in [6]. In [4] some Bn = nn()21 − . polygonal sum labeling of paths were discussed. In this paper we have proved that the graph B admit Pentagonal, n, n 2.5 Definition Hexagonal, Heptagonal, Octagonal, Nonagonal and A hexagonal sum labeling of a graph G is a one-to-one Decagonal sum labeling. function f : V(G) → N that induces a bijection f+ : E(G) → {B , B , . B } of the edges of G defined by f+(uv) = 2. DEFINITIONS 1 2 q f(u) + f(v) for every e= uv є E(G). The graph which admits such labeling is called a hexagonal sum graph. 2.1 Definition Polygonal numbers are just the number of vertices 2.6 Definition formed by a certain polygon. The first number in any group Heptagonal numbers are numbers that create a heptagon. of polygonal numbers is always one or a point. The second In other words 1, 7, 18, 34, 55, 81, 112, 148, 189, 235, 286, number is equal to the numberIJSER of vertices of the polygon. 342, 403, 469, 540, 616, 697, . are heptagonal The third number is made by extending two of the sides of numbers. the polygon from the second polygonal number, completing the larger polygon and placing vertices and other points The nth heptagonal number is denoted by C , wherever necessary. The third polygonal number is found n nn()53− by adding all the vertices and points in the resulting. then C = . n 2 2.2 Definition 2.7 Definition Pentagonal numbers are numbers that create a pentagon. A Heptagonal sum labeling of a graph G is a one-to-one In other words 1, 5, 12, 22, 35, 51, 70, 92, 117, 145 . function f : V(G) → N that induces a bijection f+ : E(G) → + are pentagonal numbers. {C1, C2, . , Cq} of the edges of G defined by f (uv) = f(u) + f(v) for every e= uv є E(G). The graph which admits th The n pentagonal number is denoted by A n, such labeling is called a heptagonal sum graph. nn()31− then An = . 2.8 Definition 2 Octagonal numbers are numbers that create an octagon. ____________________________________________ In other words 1, 8, 21, 40, 65, 96, 133,176,225,280,341,408,481,560, 645, 736, 833, 936, • Assistant Professor, PG & Research Department of Mathematics, 1045, 1160, 1281, 1408, 1541, . are octagonal numbers. Government Arts College, Ariyalur, Tamilnadu. [email protected] • Assistant Professor, Department of Mathematics, Roever College of th The n octagonal number is denoted by Dn, then Engineering and Technology, Perambalur, Tamilnadu. [email protected] = − Dn nn()3 2. 2.9 Definition 2.3 Definition An octagonal sum labeling of a graph G is a one-to-one IJSER © 2016 http://www.ijser.org International Journal of Scientific & Engineering Research, Volume 7, Issue 5, May-2016 35 ISSN 2229-5518 function f : V(G) → N that induces a bijection f+ : E(G) → + {D1, D2, . , Dq} of the edges of G defined by f (uv) = f(u) + f(v) for every e= uv є E(G). The graph which admits such labeling is called an octagonal sum graph. 2.10 Definition u1 v1 Nonagonal numbers are numbers that create a nonagon. u2 en+2 e1 In other words: 1, 9, 24,46, 75, 111, 154, 204, 261, 325, v2 e2 en+3 396, 474, 559, 651, 750, 856, 969, 1089, 1216, 1350, 1491, . 1639, 1794,1956, 2125, 2301, 2484, 2674, 2871, 3075, . u e v e n+1 n-1 e2n-1 . are nonagonal numbers. th en e2n The n nonagonal number is denoted by E , then un-1 vn-1 n nn()75− E = un vn n 2 2.11 Definition Fig.1: Ordinary labeling of Bn, n A nonagonal sum labeling of a graph G is a one-to-one function f : V(G) → N that induces a bijection f+ : E(G) → + First we label the vertices of Bn, n as follows: {E1, E2,. , Eq} of the edges of G defined by f (uv) = f(u) + Define f: V (Bn, n) →N by f(v) for every e= uv є E(G). The graph which admits such labeling is called a nonagonal sum graph. fu( )= 0, ii(3− 1) 2.12 Definition fu( )= ,1 ≤≤i n Decagonal numbers are numbers that create a decagon. In i 2 other words:1, 10, 27, 52, 85, 126, 175, 232, 297, 370, 451, ()()nn++13 1 540, 637, 742, 855, 976, 1105, 1242, 1387, 1540, 1701, fv()= , 1870, 2047, 2232, 2425, 2626, 2835, . are decagonal 2 numbers. 3ii (− 1) th fv(i )=() 3 n + 4 i + ,1 ≤≤i n The n decagonal number is denoted by Fn, then 2 Fn = nn()4 − 3. Then the induced edge labels are, 2.13 Definition ii(3− 1) fe( )= , 1 ≤≤i 2 n + 1, A decagonal sum labeling of a graph G is a one-to-one i 2 function f : V(G) → N that induces a bijection f+ : E(G) → + Therefore, {F1, F2, . , Fq} of the edges of G defined by f (uv) = f(u) + + f(v) for every e= uv є E(G). The graph which admits such f() EB()nn, = {1, 5, 12, 22, 35, 51, 70, 92, 117,...} labeling is called a decagonal sum graph. IJSERTherefore, f is a pentagonal sum labeling and hence Bn, n is a pentagonal sum graph. Pentagonal 1sum labeling of B7, 7 is shown 25in Fig. 253 5 3. MAIN RESULTS Here we have proved that the graph Bn,n admit Pentagonal, Hexagonal, Heptagonal, Octagonal, Nonagonal 12 145 84 117 and Decagonal Sum Labeling. 1 5 176 12 3.1 Theorem 92 22 0 92 210 The graph Bn, n is a pentagonal sum graph for n ≥ 2 . 22 118 Proof: 35 247 Let VB()nn, ={}{} u i,1 ≤≤ in ∪ vi,1 ≤≤ in ∪{}{} u ∪ v 51 70 287 EB()nn, ={ e i,1 ≤≤ i 2 n + 1} (See Fig.1) 35 330 155 51 238 195 70 Fig.2: Pentagonal sum labeling of B7, 7 IJSER © 2016 http://www.ijser.org International Journal of Scientific & Engineering Research, Volume 7, Issue 5, May-2016 36 ISSN 2229-5518 3.2 Theorem Define f: V (Bn, n) →N The graph Bn, n is a hexagonal sum graph for n ≥ 2 . Proof: fu( )= 0, Let VB()nn, ={}{} u i,1 ≤≤ in ∪ vi,1 ≤≤ in ∪{}{} u ∪ v ii(5− 3) fu( )= ,1 ≤≤i n i 2 EB()nn, ={ e i,1 ≤≤ i 2 n + 1} (See Fig.1) ()()nn++15 2 fv()= , First we label the vertices of Bn, n as follows: 2 Define f: V (B ) →N by 5ii (− 1) n, n fv( )=() 5 n + 6 i + ,1 ≤≤i n i 2 fu( )= 0, fu( )= i (2 i − 1), 1 ≤≤ i n Then the induced edge labels are, i =++ fv()()() n 1 2 n 1, ii(3− 1) fe(i )= , 1 ≤≤i 2 n + 1, fv(i )=() 4 n + 9 i − 4, 1 ≤≤ i n 2 Therefore, Then the induced edge labels are, + f() EB()nn, = {1, 7, 18, 34, 55, 81, 112, 148, 189, 235,...} fe( )= i (2 i − 1), 1 ≤≤ i 2 n + 1, i Therefore, Therefore, f is a heptagonal sum labeling and hence Bn, n is + a heptagonal sum graph. f() EB()nn, = {1, 6, 15, 28, 45, 66, 91, 120,...} Therefore f is a hexagonal sum labeling and hence Bn, n is a Heptagonal labeling of B10, 10 is shown in Fig.4 hexagonal sum graph. Hexagonal labeling of B is shown in Fig.3 7 1 4,4 56 117 21 18 183 1 7 1 1 403 18 469 6 66 46 254 6 34 91 342 34 540 0 45 45 15 IJSER 120 55 330 55 616 75 0 286 286 15 28 697 153 81 411 108 81 783 28 112 874 Fig.3: Hexagonal labeling of B 4,4 148 189 970 497 112 235 1071 3.3 Theorem The graph Bn, n is a heptagonal sum graph for n ≥ 2 .
Load more

Recommended publications
  • M-Gonal Number± N = Nasty Number, N =
    International Journal of Research in Advent Technology, Vol.6, No.11, November 2018 E-ISSN: 2321-9637 Available online at www.ijrat.org M-Gonal number n = Nasty number, n = 1,2 Dr.K.Geetha Assistant Professor, Department of Mathematics, Dr.Umayal Ramanathan College for Women, Karaikudi. [email protected] Abstract: This paper concerns with study of obtaining the ranks of M-gonal numbers along with their recurrence relation such that M-gonal number n = Nasty number where n = 1,2. Key Words: Triangular number, Pentagonal number, Hexagonal number, Octagonal number and Dodecagonal number 1. INTRODUCTION may refer [3-7]. In this communication an attempt is Numbers exhibit fascinating properties, they form made to obtain the ranks of M-gonal numbers like patterns and so on [1]. In [3] the ranks of Triangular, Triangular, Pentagonal, Hexagonal, Octagonal and Pentagonal, Heptagonal, Nanogonal and Tridecagonal Dodecagonal numbers such that each of these M-gonal numbers such that each of these M-gonal number - number n = Nasty number, n = 1,2. Also the 2 = a perfect square and the ranks of Pentagonal and recurrence relations satisfied by the ranks of each of Heptagonal such that each of these M-gonal number + these M-gonal numbers are presented. 2= a perfect square are obtained. In this context one 2. METHOD OF ANALYSIS 2.1.Pattern 1: Let the rank of the nth Triangular number be A, then the identity 2 Triangular number – 2 = 6 x (1) is written as y22 48x 9 (2) where y 2A 1 (3) whose initial solution is x30 , y0 21 (4) Let xyss, be the general solution of the Pellian 22 yx48 1 (5) 1 ss11 where xs 7 48 7 48 2 48 1 ss11 ys 7 48 7 48 , s 0,1,...
    [Show full text]
  • An Heptagonal Numbers
    © April 2021| IJIRT | Volume 7 Issue 11 | ISSN: 2349-6002 An Heptagonal Numbers Dr. S. Usha Assistant Professor in Mathematics, Bon Secours Arts and Science College for Women, Mannargudi, Affiliated by Bharathidasan University, Tiruchirappalli, Tamil Nadu Abstract - Two Results of interest (i)There exists an prime factor that divides n is one. First few square free infinite pairs of heptagonal numbers (푯풎 , 푯풌) such that number are 1,2,3,5,6,7,10,11,13,14,15,17…… their ratio is equal to a non –zero square-free integer and (ii)the general form of the rank of square heptagonal Definition(1.5): ퟑ ퟐ풓+ퟏ number (푯 ) is given by m= [(ퟏퟗ + ퟑ√ퟒퟎ) + 풎 ퟐퟎ Square free integer: ퟐ풓+ퟏ (ퟏퟗ − ퟑ√ퟒퟎ) +2], where r = 0,1,2…….relating to A Square – free Integer is an integer which is divisible heptagonal number are presented. A Few Relations by no perfect Square other than 1. That is, its prime among heptagonal and triangular number are given. factorization has exactly one factors for each prime that appears in it. For example Index Terms - Infinite pairs of heptagonal number, the 10 =2.5 is square free, rank of square heptagonal numbers, square-free integer. But 18=2.3.3 is not because 18 is divisible by 9=32 The smallest positive square free numbers are I. PRELIMINARIES 1,2,3,5,6,7,10,11,13,14,15,17,19,21,22,23……. Definition(1.1): A number is a count or measurement heptagon: Definition(1.6): A heptagon is a seven –sided polygon.
    [Show full text]
  • Deep Algebra Projects: Algebra 1/Algebra 2 Polygon Polynomials
    Deep Algebra Projects: Algebra 1/Algebra 2 Polygon Polynomials Topics • Adding, subtracting, and multiplying polynomials • Factoring common factors out from a polynomial • Proving that polynomials are equivalent • Patterns and formulas for polygonal numbers • Arithmetic sequences and series In the Polygon Polynomials projects, students practice operations on polynomials as they investigate patterns and relationships in polygonal numbers—numbers used to create diagrams of regular polygons. By exploring geometric models built from squares and dots, students create formulas to describe the patterns that they find and prove that the expressions in the formulas are equivalent. I strongly suggest allowing students to share and compare their formulas and strategies in order to help them appreciate the great variety of possibilities and to explore the relationships between them. Sometimes, the greatest benefits of a project lie hidden beneath the surface. Apart from the obvious value in reinforcing and extending students’ content knowledge, the Polygon Polynomials project deepens students’ appreciation for the ways in which numbers, shapes, and algebra can unite to support discovery and understanding. The project also offers students many opportunities to enhance their skills in observation and questioning. There is more to each image than first meets the eye—especially as the images become progressively more complex. Allow plenty of time for open-ended conversation about each image before sharing the directions. Note: Dr. Ron Knott’s website on Polygonal numbers inspired some of the problems and images in this activity, especially in Problems #4 – 6. After students have completed these problems, they may enjoy exploring his site and the additional ideas and challenges that it presents.
    [Show full text]
  • JETIR Research Journal
    © 2018 JETIR March 2018, Volume 5, Issue 3 www.jetir.org (ISSN-2349-5162) ON THE NON-HOMOGENEOUS QUINTIC EQUATION WITH THREE UNKNOWNS 5(x2 y2) 9xy 2(x y) 4 (k2 19s2)n z5 Dr.G.Sumathi M.Sc.,M.Phil.,B.Ed.,Ph.D.,SET Assistant Professorr,Dept.of Mathematics, Shrimati Indira Gandhi College, Trichy-620002,Tamilnadu,India; Abstract : The non-homogeneous quintic equation with five unknowns represented by the diophantine equation 2 2 2 2 n 5 5(x y ) 9xy 2(x y) 4 (k 19s ) z is analyzed for its non-zero distinct integral solutions. Introducing the transformations x u v, y u v and employing the method factorization,three different patterns of non-trival distinct integer solutions to the quintic equation under consideration are obtained. A few interesting properties between the solutions and special numbers namely,Polygonal numbers,,Centered Pyramidal numbers , Thabith-ibn-kurrah number, Gnomic number, Jacobsthal Lucas number , Jacobsthal number and five dimensional numbers are exhibited. Keywords: Integral solutions, lattice points,non- homogeneous quintic equation with five unknowns. 2010 Mathematics Subject Classification: 11D41 NOTATIONS: t : Polygonal number of rank n with size m m,n m Pn : Pyramidal number of rank n with size m j : Jacobsthal Lucas number of rank n n J : Jacobsthal number of rank n GNO : Gnomic number of rank n Tk : Thabith-ibn-kurrah number of rank n Ct : Centered Polygonal number of rank with size m,n Cf3,n.30 : Centered Tricontagonal Pyramidal number of rank F5,n,7 : Fifth Dimensional Figurate Heptagonal number of rank GFn (k, s) : Generalized Fibonacci Sequences of rank GLn (k,s) : Generalized Lucas Sequences of rank ________________________________________________________________________________________________________ I.
    [Show full text]
  • Number Pattern Hui Fang Huang Su Nova Southeastern University, [email protected]
    Transformations Volume 2 Article 5 Issue 2 Winter 2016 12-27-2016 Number Pattern Hui Fang Huang Su Nova Southeastern University, [email protected] Denise Gates Janice Haramis Farrah Bell Claude Manigat See next page for additional authors Follow this and additional works at: https://nsuworks.nova.edu/transformations Part of the Curriculum and Instruction Commons, Science and Mathematics Education Commons, Special Education and Teaching Commons, and the Teacher Education and Professional Development Commons Recommended Citation Su, Hui Fang Huang; Gates, Denise; Haramis, Janice; Bell, Farrah; Manigat, Claude; Hierpe, Kristin; and Da Silva, Lourivaldo (2016) "Number Pattern," Transformations: Vol. 2 : Iss. 2 , Article 5. Available at: https://nsuworks.nova.edu/transformations/vol2/iss2/5 This Article is brought to you for free and open access by the Abraham S. Fischler College of Education at NSUWorks. It has been accepted for inclusion in Transformations by an authorized editor of NSUWorks. For more information, please contact [email protected]. Number Pattern Cover Page Footnote This article is the result of the MAT students' collaborative research work in the Pre-Algebra course. The research was under the direction of their professor, Dr. Hui Fang Su. The ap per was organized by Team Leader Denise Gates. Authors Hui Fang Huang Su, Denise Gates, Janice Haramis, Farrah Bell, Claude Manigat, Kristin Hierpe, and Lourivaldo Da Silva This article is available in Transformations: https://nsuworks.nova.edu/transformations/vol2/iss2/5 Number Patterns Abstract In this manuscript, we study the purpose of number patterns, a brief history of number patterns, and classroom uses for number patterns and magic squares.
    [Show full text]
  • Math Library
    Math Library Version 6.8 Neil Toronto ă[email protected]¡ Jens Axel Søgaard ă[email protected]¡ January 24, 2017 (require math) package: math-lib The math library provides functions and data structures useful for working with numbers and collections of numbers. These include • math/base: Constants and elementary functions • math/flonum: Flonum functions, including high-accuracy support • math/special-functions: Special (i.e. non-elementary) functions • math/bigfloat: Arbitrary-precision floating-point functions • math/number-theory: Number-theoretic functions • math/array: Functional arrays for operating on large rectangular data sets • math/matrix: Linear algebra functions for arrays • math/distributions: Probability distributions • math/statistics: Statistical functions With this library, we hope to support a wide variety of applied mathematics in Racket, in- cluding simulation, statistical inference, signal processing, and combinatorics. If you find it lacking for your variety of mathematics, please • Visit the Math Library Features wiki page to see what is planned. • Contact us or post to one of the mailing lists to make suggestions or submit patches. This is a Typed Racket library. It is most efficient to use it in Typed Racket, so that contracts are checked statically. However, almost all of it can be used in untyped Racket. Exceptions and performance warnings are in bold text. 1 1 Constants and Elementary Functions (require math/base) package: math-lib For convenience, math/base re-exports racket/math as well as providing the values doc- ument below. In general, the functions provided by math/base are elementary functions, or those func- tions that can be defined in terms of a finite number of arithmetic operations, logarithms, exponentials, trigonometric functions, and constants.
    [Show full text]
  • An Approach for Solving Fuzzy Transportation Problem Using
    Applied Mathematical Sciences, Vol. 7, 2013, no. 54, 2661 - 2673 HIKARI Ltd, www.m-hikari.com An Approach for Solving Fuzzy Transportation Problem Using Octagonal Fuzzy Numbers S. U. Malini Research Scholar, Stella Maris College (Autonomous), Chennai Felbin C. Kennedy Research Guide, Associate Professor, Stella Maris College, Chennai. Copyright © 2013 S. U. Malini and Felbin C. Kennedy. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In this paper, a general fuzzy transportation problem model is discussed. There are several approaches by different authors to solve such a problem viz., [1,2,3,6,7,8]. We introduce octagonal fuzzy numbers using which we develop a new model to solve the problem. By defining a ranking to the octagonal fuzzy numbers, it is possible to compare them and using this we convert the fuzzy valued transportation problem (cost, supply and demand appearing as octagonal fuzzy numbers) to a crisp valued transportation problem, which then can be solved using the MODI Method. We have proved that the optimal value for a fuzzy transportation problem, when solved using octagonal fuzzy number gives a much more optimal value than when it is solved using trapezoidal fuzzy number as done by Basirzadeh [3] which is illustrated through a numerical example. Mathematics Subject Classification: 03B52, 68T27, 68T37, 94D05 Keywords: Octagonal Fuzzy numbers, Fuzzy Transportation Problem. 1 Introduction The transportation problem is a special case of linear programming problem, which enable us to determine the optimum shipping patterns between origins and 2662 S.
    [Show full text]
  • Use Style: Paper Title
    Volume 4, Issue 11, November – 2019 International Journal of Innovative Science and Research Technology ISSN No:-2456-2165 On Three Figurate Numbers with Same Values A. Vijayasankar1, Assistant Professor, Department of Mathematics, National College, Affiliated to Bharathidasan University Trichy-620 001, Tamil Nadu, India Sharadha Kumar2, M. A. Gopalan3, Research Scholar, Professor, Department of Mathematics, Department of Mathematics, Shrimati Indira Gandhi College, National College, Affiliated to Bharathidasan University, Affiliated Bharathidasan University, Trichy-620 001, Tamil Nadu, India Trichy-620 002, Tamil Nadu, India Abstract:- Explicit formulas for the ranks of Triangular Centered Octagonal Number of rank M numbers, Hexagonal numbers, Centered Hexagonal ct8,M 4MM 11 numbers, Centered Octagonal numbers, Centered Decagonal numbers and Centered Dodecagonal numbers Centered Decagonal Number of rank M satisfying the relations; ct10,M 5MM 11 t 3, N t 6,h ct 6, H , t3,N t6,h ct 8,M , t 3,N t6,h ct 10,M , t t ct 3,N 6,h 12,D are obtained. Centered Dodecagonal Number of rank D ct12,D 6DD 11 Keywords:- Equality of polygonal numbers, Centered Hexagonal numbers, Centered Octagonal numbers, Triangular Number of rank N Centered Decagonal numbers, Centered Dodecagonal NN 1 numbers, Hexagonal numbers, Triangular numbers. t3, N 2 Mathematics Subject Classification: 11D09, 11D99 Hexagonal Number of rank h 2 I. INTRODUCTION t6,h 2h h The theory of numbers has occupied a remarkable II. METHOD OF ANALYSIS position in the world of mathematics and it is unique among the mathematical sciences in its appeal to natural human 1. Equality of t t ct curiosity.
    [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]
  • Eureka Issue 61
    Eureka 61 A Journal of The Archimedeans Cambridge University Mathematical Society Editors: Philipp Legner and Anja Komatar © The Archimedeans (see page 94 for details) Do not copy or reprint any parts without permission. October 2011 Editorial Eureka Reinvented… efore reading any part of this issue of Eureka, you will have noticed The Team two big changes we have made: Eureka is now published in full col- our, and printed on a larger paper size than usual. We felt that, with Philipp Legner Design and Bthe internet being an increasingly large resource for mathematical articles of Illustrations all kinds, it was necessary to offer something new and exciting to keep Eu- reka as successful as it has been in the past. We moved away from the classic Anja Komatar Submissions LATEX-look, which is so common in the scientific community, to a modern, more engaging, and more entertaining design, while being conscious not to Sean Moss lose any of the mathematical clarity and rigour. Corporate Ben Millwood To make full use of the new design possibilities, many of this issue’s articles Publicity are based around mathematical images: from fractal modelling in financial Lu Zou markets (page 14) to computer rendered pictures (page 38) and mathemati- Subscriptions cal origami (page 20). The Showroom (page 46) uncovers the fundamental role pictures have in mathematics, including patterns, graphs, functions and fractals. This issue includes a wide variety of mathematical articles, problems and puzzles, diagrams, movie and book reviews. Some are more entertaining, such as Bayesian Bets (page 10), some are more technical, such as Impossible Integrals (page 80), or more philosophical, such as How to teach Physics to Mathematicians (page 42).
    [Show full text]
  • MAT 1160 — Mathematics, a Human Endeavor
    MAT 1160 — Mathematics, A Human Endeavor O Syllabus: office hours, grading O Schedule (note exam dates) O Academic Integrity Guidelines O Homework & Quizzes O Course Web Site : www.eiu.edu/˜mathcs/mat1160/ © 2005–09, N. Van Cleave 1 Course Overview Development of mathematical reasoning and problem solving through concentrated study of a limited variety of topics Course Objectives This course should encourage and promote: 1. a positive attitude toward math, 2. successful experiences with math, and 3. greater clarity and precision when writing mathematics. © 2005–09, N. Van Cleave 2 Suggestions for Success O Attend all lectures (and exams!) O Do the assignments, hand in on time — count on spending at least 3 hours studying for every hour in lecture O Seek help at first sign of trouble — don't wait! O Math tutors available – see posted places and times O Obtain a 3–ring binder to organize class handouts, notes, and homework © 2005–09, N. Van Cleave 3 What Causes Good and Bad Grades? Scientific American, January 2005 In one study, researchers had students write down what “went through their minds” when they were trying to get better grades. Students who improved with each test were thinking: O “I need to work harder” O “I can learn this material if I apply myself” O “I can control what happens to me in this class” O “I have what it takes to do this” Students who did not improve were thinking: O “It’s not my fault” O “This test was too hard” O “I’m not good at this” Bottom line: Take personal control of your performance.
    [Show full text]
  • The Secret Code of God
    The Secret Code of God Abul Hassan Copy Rights and 19 19 – The Secret Code of God By: Abul Hassan 1st Edition: 2010 No Part of this book may be reproduced in any form or by any means electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the publisher or author. However any one can download the electronic version of this book, i.e. free eBook from any website on the internet without our permission for the purposes of reading and research or from our website – www.ali-pi.com. Abul Hassan www.ali-pi.com [email protected] [email protected] Price: US$ 19.00/CAN$ 19.00 19 – The Secret Code of God Page 2 Contents and 19 Topics Page 1. Copy Rights and 19 2 2. Abul Hassan’s Desk and 19 5 3. Dedication and 19 7 4. Coding and 19 8 5. Religions of the world and 19 10 6. Bahai’s and 19 11 7. Hinduism and 19 12 8. Symbolism and 19 12 9. Judaism and 19 13 10. Other faiths and 19 16 11. Christianity and 19 17 12. Islam and 19 25 13. Security Code and 19 29 14. Holy Quran and 19 30 15. 99 Names of Allah and 19 73 16. Arabic Alphabets and 19 87 17. Everything and 19 90 18. Mathematics and 19 94 19. Mathematical Properties of 19 97 20. Prime Numbers and 19 102 21. Perfect Numbers and 19 111 22. Powerful Numbers and 19 115 23. Enneadecagon and 19 116 24.
    [Show full text]