DOCSLIB.ORG

Pronic Heron Mean Graphs 1R

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Pronic Heron Mean Graphs 1R The International journal of analytical and experimental modal analysis ISSN NO:0886-9367 Pronic Heron Mean Graphs 1R. Sophia Porchelvi [email protected] 2S. Akila Devi [email protected] 1;2 A. D. M College For Women, Nagapattinam, Tamil Nadu, India. Abstract: In this paper we introduce a new type of labeling of graphs using pronic numbers called Pronic Heron Mean Labeling and discuss the existence and non-existence of such labeling for certain classes of graphs. Keywords−Heron Mean Labeling, P-Heron Mean Labeling I.Introduction 1. Preliminaries and Definitions: Throughout this paper, by a graph we mean a finite, undirected, simple and connected graph. Let G (p; q) be a graph with p vertices and q edges. For standard notations and terminology in graph theory, we follow [2]. For a detailed survey of mean labeling and Heron mean labeling, we refer to [1] and [3]. A pronic number is a number which is the product of two number of the form n (n + 1). The nth pronic number is the sum of the first n even integers. 2 is the only prime pronic number and is the only pronic number in the Fibonacci sequence. Let G (p; q) be a simple, finite, connected and undirected graph with p ≥ 2. A pronic heron mean labeling of a graph G is a bijectionpf : V (G) ! f0; 2; 6; 12; :::; p (p +p 1)g such that the resulting edge labels ∗ f(u)+f(v)+ f(u)f(v) ∗ f(u)+f(v)+ f(u)f(v) obtained by f (uv) = d 3 e or f (uv) = b 3 c for every uv 2 E(G) are all distinct. A graph G (p; q) obtained from a path Pm by attaching exactly two pendant edges to each of its internal vertices of the path is called a twig graph and it is denoted by Tm. In general Tm has 3m−4 vertices and 3m − 5 edges. A triangular snake TSn is obtained from the path Pn with vertices fu1; u2; u3; :::; ung by joining a new vertex vi to uiui+1 for (0 ≤ i ≤ (n − 1)). TSn has (2n − 1) vertices and (3n − 3) edges. The corona product of two graphs G1 and G2 is the graph formed by taking one copy of G1 and V (G1) copies of th th G2 where i vertex of G1 is adjacent to every vertex in the i copy of G2. II. Main Theorems 2. For certain connected graphs Theorem 2.1 Path graph Pn, n ≥ 3, admits pronic heron mean labeling. Proof: Let fv1; v2:::; vng be the vertices of Pn, n ≥ 3 and let ei = vivi+1. Define a bijection f : V (G) ! ∗ fp1; :::; png by f(vi) = pi; i = 1; 2; :::; n. For the vertex labeling above, the induced function f : E(G) ! 2 2 2 ∗ 2 f2 ; 3 ; :::n g is defined by f (vivi+1) = (i + 1) ; i = 1; 2; :::n − 1: In the view of above defined labeling, the path graph admits pronic heron mean labeling. Theorem 2.2 Cycle graph Cn, n ≥ 3 admits pronic graceful labeling. Proof: Let f v;v2:::; vng be the vertices of Cn, n ≥ 3 and ei = vivi+1. Consider Cn,for n = 4, the vertex labeling and the edge labeling are given by f(v1) = p1 f(v2) = p2 f(v3) = p4 f(v4) = p5 ∗ ∗ ∗ ∗ f (v1v2) = 4 f (v2v3) = 12 f (v3v4) = 16 f (v1v4) = 6 Volume XII, Issue III, March/2020 1 Page No:2207 The International journal of analytical and experimental modal analysis ISSN NO:0886-9367 Consider Cn,for other n 2 N: Define a bijection f : V (G) ! fp1; p2; :::; png by f(vi) = pi; i = 1; 2; :::; n and the induced function f ∗ : E(G) ! N is defined by n2 + n + 2 + p2(n)2 + 2n f ∗(v v ) = (i + 1)2; i = 1; 2; :::; n − 1 f ∗(v v ) = d e i i+1 1 n 3 In the view of above defined labeling, the cycle graph admits pronic graceful labeling. Theorem 2.3 Complete graph Kn, n ≥ 4 does not admit pronic graceful labeling. Proof: Let f v0; v1; v2:::; vn−1g be the vertices of Kn, n ≥ 4. Since any pair of vertices of Kn are adjacent, the edge label 9 appears twice for the pronic pairs (p2; p3) and (p1; p4). Hence the complete graph does not admit pronic graceful labeling. Theorem 2.4 Comb graph Pn K1, n ≥ 3, admits pronic heron mean labeling. Proof: 0 0 0 Let fv1; v2:::; vng be the vertices of Pn, n ≥ 3 Let fv1; v2; :::; vng be the pendant edges attached to the corresponding vertices of Pn. Define a bijection f : V (G) ! fp1; p2; :::; p2ng by 0 f(vi) = p2i−1; i = 1; 2; :::n f(vi) = p2i; i = 1; 2; :::n For the vertex labeling above, the induced edge function f ∗ : E(G) ! N is defined by ∗ ∗ 0 2 f (vivi+1) = 2i(2i + 1); i = 1; 2; 3; :::n − 1 f (vivi) = (2i) ; i = 1; 2; 3; :::n In the view of above defined labeling, the comb graph admits pronic heron mean labeling. Theorem 2.5 Twig graph Tn, n ≥ 3, admits pronic heron mean labeling. Proof: 0 0 0 " " " Let fv1; v2:::; vng be the vertices of Pn, n ≥ 3: Let fv2; v3; :::; vn−2g and fv2; v3; :::; vn−2g be the pendant edges attached to each of the corresponding internal vertices of Pn. Define a bijection f : V (G) ! fp4; p5; :::; p3n−4g by 0 f(vi) = pi; i = 1; 2 f(vi+2) = p3i+3; i = 0; 1; 2; :::n − 3 " f(vi) = p3i−4; i = 3; 4; ::; n f(vi+2) = p3i+4; i = 0; 1; 2; :::n − 3 For the above vertex labeling, the induced edge function f ∗ : E(G) ! N is defined by ∗ 2 ∗ 2 f (vivi+1) = (2i) ; i = 1 f (vivi+1) = (3i − 2) ; i = 2; 3; :::n − 1 ∗ 0 2 ∗ " f (vivi) = (3i − 3) ; i = 2; 3; :::n − 1 f (vivi ) = 3(i − 1)(3i − 2); i = 2; 3; :::n − 1 In the view of above defined labeling, the twig graph admits pronic heron mean labeling. Theorem 2.6 Triangular Snake TSn admits pronic heron mean labeling. Proof: Let fv1; v2:::; vng be the vertices of the path Pn, n ≥ 3 and ui for 1 ≤ i ≤ n − 1 be the vertices of TSn to which the edges uiui+1 are joining to. Define a bijection f : V (G) ! fp1; p2; :::; p2n−1g by f(vi) = p2i−1; i = 1; 2; :::n f(ui) = p2i; i = 1; 2; :::n − 1 Volume XII, Issue III, March/2020 2 Page No:2208 The International journal of analytical and experimental modal analysis ISSN NO:0886-9367 For the vertex labeling above, the induced edge function f ∗ : E(G) ! N is defined by ∗ ∗ 2 f (vivi+1) = 2i(2i + 1)i = 1; 2; 3:::n − 1 f (uivi+1) = (2i + 1) ; i = 1; 2; 3:::n − 1 ∗ 2 f (viui) = (2i) ; i = 1; 2; 3:::n − 1 In the view of above defined labeling, the triangular snake admits pronic heron mean labeling. Theorem 2.7 Corona product of Cn K1 admits pronic graceful labeling. Proof: 0 0 0 Let fv1; v2:::; vng be the vertices of Cn, n ≥ 3: Let fv1; v2; :::; vng be the pendant edges attached to the correponding vertices Cn. Define a bijection f : V (G) ! fp1; p2; :::; p2ng by 0 f(vi) = p2i−1; i = 1; 2; :::n f(vi) = p2i; i = 1; 2; :::n For the vertex labeling above, the induced edge function f ∗ : E(G) ! N is defined by 2 + 2n(2n − 1) + p4n(2n − 1) f ∗(v v ) = 2i(2i + 1); i = 1; 2; 3; :::n − 1 f ∗(v v ) = d e i i+1 1 n 3 ∗ 0 2 f (vivi) = (2i) ; i = 1; 2; 3; :::n In the view of above defined labeling, the snake Cn K1 admits pronic heron mean labeling. Theorem 2.8 Corona product of Cn 2K1 admits pronic graceful labeling. Proof: 0 0 0 " " " Let fv1; v2:::; vng be the vertices of Cn, n ≥ 3 Let fv1; v2; :::; vn−2g and fv1; v2; :::; vn−2g be the pendant edges attached to the correponding vertices of Cn. Define a bijection f : V (G) ! fp1; p2; :::; p3ng by 0 " f(vi) = p3i−2; i = 1; 2; :::n; f(vi) = p3i−1; i = 1; 2; :::n; f(vi ) = p3i; i = 1; 2:::n: For the vertex labeling above, the induced edge function f ∗ : E(G) ! N is defined by ∗ 2 ∗ 0 2 f (vivi+1) = (3i) ; i = 1; 2; 3; :::n − 1 f (vivi) = (3i − 1) ; i = 1; 2; 3; :::n 2 + (3n − 1)(3n − 2) + p2(3n − 1)(3n − 2) f ∗(v v ) = d e f ∗(v v") = 3i(3i − 1); i = 1; 2; 3; :::n 1 n 3 i i In the view of above defined labeling, the snake Cn 2K1 admits pronic heron mean labeling. Theorem 2.9 Generalized Peterson graph P (n; 1) admits pronic graceful labeling. Proof: Let fv0; v1; v2; v3; :::; vn−1g be the inner vertices and fu0; u1; u2; u3; :::; un−1g be the outer vertices of P (n; 1). Deifne a bijection f : V (G) ! fp1; p2; :::; p2ng as follows: f(ui) = p2i+2; i = 0; 1; 2; :::n − 1 f(vi) = p2i+1; i = 0; 1; 2; :::n − 1 For the vertex labeling above, the induced edge function f ∗ : E(G) ! N is defined below and hence the edge labels are distinct. 2 + (2n + 1)(2n + 2) + p2(2n + 1)(2n + 2) f ∗(v v ) = (2i + 2)(2i + 3); i = 0; 1; 2; :::n − 1; f ∗(v v ) = d e i i+1 0 n 3 6 + (2n + 2)(2n + 3) + p6(2n + 2)(2n + 3) f ∗(u u ) = (2i + 3)(2i + 4); i = 0; 1; 2; :::n − 1; f ∗(v v ) = d e i i+1 0 n 3 ∗ 2 f (uivi) = (2i + 2) ; i = 0; 1; 2; :::n − 1 Volume XII, Issue III, March/2020 3 Page No:2209 The International journal of analytical and experimental modal analysis ISSN NO:0886-9367 3.
Load more

Recommended publications
  • ~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]
  • Special Pythagorean Triangle in Relation with Pronic Numbers
    International Journal of Mathematics Trends and Technology (IJMTT) – Volume 65 Issue 8 - August 2019 Special Pythagorean Triangle In Relation With Pronic Numbers S. Vidhyalakshmi1, T. Mahalakshmi2, M.A. Gopalan3 1,2,3(Department of Mathematics, Shrimati Indra Gandhi College, India) Abstract: 2* Area This paper illustrates Pythagorean triangles, where, in each Pythagorean triangle, the ratio Perimeter is a Pronic number. Keywords: Pythagorean triangles,Primitive Pythagorean triangle, Non primitive Pythagorean triangle, Pronic numbers. Introduction: It is well known that there is a one-to-one correspondence between the polygonal numbers and the sides of polygon. In addition to polygon numbers, there are other patterns of numbers namely Nasty numbers, Harshad numbers, Dhuruva numbers, Sphenic numbers, Jarasandha numbers, Armstrong numbers and so on. In particular, refer [1-17] for Pythagorean triangles in connection with each of the above special number patterns. The above results motivated us for searching Pythagorean triangles in connection with a new number pattern. This paper 2* Area illustrates Pythagorean triangles, where, in each Pythagorean triangle, the ratio is a Pronic number. Perimeter Method of Analysis: Let Tx, y, z be a Pythagorean triangle, where x 2pq , y p2 q2 , z p2 q2 , p q 0 (1) Denote the area and perimeter of Tx, y, z by A and P respectively. The mathematical statement of the problem is 2A nn 1 , pronic number of rank n (2) P qp q nn 1 (3) It is observed that (3) is satisfied by the following two sets of values of p and q: Set 1: p 2n 1, q n Set 2: p 2n 1, q n 1 However, there are other choices for p and q that satisfy (3).
    [Show full text]
  • Generalized Sum of Stella Octangula Numbers
    DOI: 10.5281/zenodo.4662348 Generalized Sum of Stella Octangula Numbers Amelia Carolina Sparavigna Department of Applied Science and Technology, Politecnico di Torino A generalized sum is an operation that combines two elements to obtain another element, generalizing the ordinary addition. Here we discuss that concerning the Stella Octangula Numbers. We will also show that the sequence of these numbers, OEIS A007588, is linked to sequences OEIS A033431, OEIS A002378 (oblong or pronic numbers) and OEIS A003154 (star numbers). The Cardano formula is also discussed. In fact, the sequence of the positive integers can be obtained by means of Cardano formula from the sequence of Stella Octangula numbers. Keywords: Groupoid Representations, Integer Sequences, Binary Operators, Generalized Sums, OEIS, On-Line Encyclopedia of Integer Sequences, Cardano formula. Torino, 5 April 2021. A generalized sum is a binary operation that combines two elements to obtain another element. In particular, this operation acts on a set in a manner that its two domains and its codomain are the same set. Some generalized sums have been previously proposed proposed for different sets of numbers (Fibonacci, Mersenne, Fermat, q-numbers, repunits and others). The approach was inspired by the generalized sums used for entropy [1,2]. The analyses of sequences of integers and q-numbers have been collected in [3]. Let us repeat here just one of these generalized sums, that concerning the Mersenne n numbers [4]. These numbers are given by: M n=2 −1 . The generalized sum is: M m⊕M n=M m+n=M m+M n+M m M n In particular: M n⊕M 1=M n +1=M n+M 1+ M n M 1 1 DOI: 10.5281/zenodo.4662348 The generalized sum is the binary operation which is using two Mersenne numbers to have another Mersenne number.
    [Show full text]
  • Some Links of Balancing and Cobalancing Numbers with Pell and Associated Pell Numbers
    Bulletin of the Institute of Mathematics Academia Sinica (New Series) Vol. 6 (2011), No. 1, pp. 41-72 SOME LINKS OF BALANCING AND COBALANCING NUMBERS WITH PELL AND ASSOCIATED PELL NUMBERS G. K. PANDA1,a AND PRASANTA KUMAR RAY2,b 1 National Institute of Technology, Rourkela -769 008, Orissa, India. a E-mail: gkpanda nit@rediffmail.com 2 College of Arts Science and Technology, Bandomunda, Rourkela -770 032, Orissa, India. b E-mail: [email protected] Abstract Links of balancing and cobalancing numbers with Pell and associated Pell numbers th th are established. It is proved that the n balancing number is product of the n Pell th number and the n associated Pell number. It is further observed that the sequences of balancing and cobalancing numbers are very closely related to the Pell sequence whereas, the sequences of Lucas-balancing and Lucas-cobalancing numbers constitute the associated Pell sequence. The solutions of some Diophantine equations including Pythagorean and Pythagorean-type equations are obtained in terms of these numbers. 1. Introduction The study of number sequences has been a source of attraction to the mathematicians since ancient times. From that time many mathematicians have been focusing their attention on the study of the fascinating triangu- lar numbers (numbers of the form n(n + 1)/2 where n Z+ are known as ∈ triangular numbers). Behera and Panda [1], while studying the Diophan- tine equation 1 + 2 + + (n 1) = (n + 1) + (n +2)+ + (n + r) on · · · − · · · triangular numbers, obtained an interesting relation of the numbers n in Received April 28, 2009 and in revised form September 25, 2009.
    [Show full text]
  • Integer Sequences
    UHX6PF65ITVK Book > Integer sequences Integer sequences Filesize: 5.04 MB Reviews A very wonderful book with lucid and perfect answers. It is probably the most incredible book i have study. Its been designed in an exceptionally simple way and is particularly just after i finished reading through this publication by which in fact transformed me, alter the way in my opinion. (Macey Schneider) DISCLAIMER | DMCA 4VUBA9SJ1UP6 PDF > Integer sequences INTEGER SEQUENCES Reference Series Books LLC Dez 2011, 2011. Taschenbuch. Book Condition: Neu. 247x192x7 mm. This item is printed on demand - Print on Demand Neuware - Source: Wikipedia. Pages: 141. Chapters: Prime number, Factorial, Binomial coeicient, Perfect number, Carmichael number, Integer sequence, Mersenne prime, Bernoulli number, Euler numbers, Fermat number, Square-free integer, Amicable number, Stirling number, Partition, Lah number, Super-Poulet number, Arithmetic progression, Derangement, Composite number, On-Line Encyclopedia of Integer Sequences, Catalan number, Pell number, Power of two, Sylvester's sequence, Regular number, Polite number, Ménage problem, Greedy algorithm for Egyptian fractions, Practical number, Bell number, Dedekind number, Hofstadter sequence, Beatty sequence, Hyperperfect number, Elliptic divisibility sequence, Powerful number, Znám's problem, Eulerian number, Singly and doubly even, Highly composite number, Strict weak ordering, Calkin Wilf tree, Lucas sequence, Padovan sequence, Triangular number, Squared triangular number, Figurate number, Cube, Square triangular
    [Show full text]
  • Observations on Icosagonal Pyramidal Number
    International Refereed Journal of Engineering and Science (IRJES) ISSN (Online) 2319-183X, (Print) 2319-1821 Volume 2, Issue 7 (July 2013), PP. 32-37 www.irjes.com Observations On Icosagonal Pyramidal Number 1M.A.Gopalan, 2Manju Somanath, 3K.Geetha, 1Department of Mathematics, Shrimati Indira Gandhi college, Tirchirapalli- 620 002. 2Department of Mathematics, National College, Trichirapalli-620 001. 3Department of Mathematics, Cauvery College for Women, Trichirapalli-620 018. ABSTRACT:- We obtain different relations among Icosagonal Pyramidal number and other two, three and four dimensional figurate numbers. Keyword:- Polygonal number, Pyramidal number, Centered polygonal number, Centered pyramidal number, Special number MSC classification code: 11D99 I. INTRODUCTION Fascinated by beautiful and intriguing number patterns, famous mathematicians, share their insights and discoveries with each other and with readers. Throughout history, number and numbers [2,3,7-15] have had a tremendous influence on our culture and on our language. Polygonal numbers can be illustrated by polygonal designs on a plane. The polygonal number series can be summed to form “solid” three dimensional figurate numbers called Pyramidal numbers [1,4,5 and 6] that can be illustrated by pyramids. In this communication we 32 20 65n n n deal with Icosagonal Pyramidal numbers given by p and various interesting relations n 2 among these numbers are exhibited by means of theorems involving the relations. Notation m pn = Pyramidal number of rank n with sides m tmn, = Polygonal number of rank n with sides m jaln = Jacobsthal Lucas number ctmn, = Centered Polygonal number of rank n with sides m m cpn = Centered Pyramidal number of rank n with sides m gn = Gnomonic number of rank n with sides m pn = Pronic number carln = Carol number mern = Mersenne number, where n is prime culn = Cullen number Than = Thabit ibn kurrah number II.
    [Show full text]
  • PRONIC FIBONACCI NUMBERS Wayne L. Mcdanie!
    PRONIC FIBONACCI NUMBERS Wayne L. McDanie! University of Missouri-St. Louis, St. Louis, MO 63121 (Submitted April 1996-Final Revision June 1996) 1. INTRODUCTION Tronic" is an old-fashioned term meaning "the product of two consecutive integers." (The reader will find the term indexed in [1], referring to some half-dozen articles.) In this paper we show that the only Fibonacci numbers that are the product of two consecutive integers are F0 - 0 andi^3 = 2. The referee of this paper has called the author's attention to the prior publication (December 1996) of this result in Chinese (see Ming Luo [3]). However, because of the relative inaccessi- bility of the earlier result, the referee recommended publication of this article in the Quarterly. If Fn = r(r +1), then 4Fn +1 is a square. Our approach is to show that Fn, for n'& 0, ±3, is not a pronic number by finding an integer w(ri) such that 4Fn +1 is a quadratic nonresidue modulo w(ri). There is a sense in which this paper may be considered a companion paper to Ming Luo's article on triangular numbers in the sequence of Fibonacci numbers: If Fn is a pronic number, then Fn is two times a triangular number. We shall use two results from Luo's paper, and take advan- tage of the periodicity of the sequence modulo an appropriate integer w(ri), enabling us to prove our result through use of the Jacobi symbol (4Fn +1 \w(n)) in a finite number of cases. Our main result is the following theorem.
    [Show full text]
  • Sum of the Reciprocals of Famous Series: Mathematical Connections with Some Sectors of Theoretical Physics and String Theory
    1Torino, 14/04/2016 Sum of the reciprocals of famous series: mathematical connections with some sectors of theoretical physics and string theory 1,2 Ing. Pier Franz Roggero, Dr. Michele Nardelli , P.i. Francesco Di Noto 1Dipartimento di Scienze della Terra Università degli Studi di Napoli Federico II, Largo S. Marcellino, 10 80138 Napoli, Italy 2 Dipartimento di Matematica ed Applicazioni “R. Caccioppoli” Università degli Studi di Napoli “Federico II” – Polo delle Scienze e delle Tecnologie Monte S. Angelo, Via Cintia (Fuorigrotta), 80126 Napoli, Italy Abstract In this paper it has been calculated the sums of the reciprocals of famous series. The sum of the reciprocals gives fundamental information on these series. The higher this sum and larger numbers there are in series and vice versa. Furthermore we understand also what is the growth factor of the series and that there is a clear link between the sums of the reciprocal and the "intrinsic nature" of the series. We have described also some mathematical connections with some sectors of theoretical physics and string theory 2Torino, 14/04/2016 Index: 1. KEMPNER SERIES ........................................................................................................................................................ 3 2. SEXY PRIME NUMBERS .............................................................................................................................................. 6 3. TWIN PRIME NUMBERS .............................................................................................................................................
    [Show full text]
  • Numbers 1 to 100
    Numbers 1 to 100 PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Tue, 30 Nov 2010 02:36:24 UTC Contents Articles −1 (number) 1 0 (number) 3 1 (number) 12 2 (number) 17 3 (number) 23 4 (number) 32 5 (number) 42 6 (number) 50 7 (number) 58 8 (number) 73 9 (number) 77 10 (number) 82 11 (number) 88 12 (number) 94 13 (number) 102 14 (number) 107 15 (number) 111 16 (number) 114 17 (number) 118 18 (number) 124 19 (number) 127 20 (number) 132 21 (number) 136 22 (number) 140 23 (number) 144 24 (number) 148 25 (number) 152 26 (number) 155 27 (number) 158 28 (number) 162 29 (number) 165 30 (number) 168 31 (number) 172 32 (number) 175 33 (number) 179 34 (number) 182 35 (number) 185 36 (number) 188 37 (number) 191 38 (number) 193 39 (number) 196 40 (number) 199 41 (number) 204 42 (number) 207 43 (number) 214 44 (number) 217 45 (number) 220 46 (number) 222 47 (number) 225 48 (number) 229 49 (number) 232 50 (number) 235 51 (number) 238 52 (number) 241 53 (number) 243 54 (number) 246 55 (number) 248 56 (number) 251 57 (number) 255 58 (number) 258 59 (number) 260 60 (number) 263 61 (number) 267 62 (number) 270 63 (number) 272 64 (number) 274 66 (number) 277 67 (number) 280 68 (number) 282 69 (number) 284 70 (number) 286 71 (number) 289 72 (number) 292 73 (number) 296 74 (number) 298 75 (number) 301 77 (number) 302 78 (number) 305 79 (number) 307 80 (number) 309 81 (number) 311 82 (number) 313 83 (number) 315 84 (number) 318 85 (number) 320 86 (number) 323 87 (number) 326 88 (number)
    [Show full text]
  • Infosys Drives Aptitude Questions
    Courses covered on InfyTQ under the Foundation Courses section are Programming Fundamentals, Object-Oriented Programming, Data Structures and Algorithms using Python, and Learning DBMS and SQL. 1. Programming Fundamentals using Python a. Introduction to Programming b. Algorithms c. Pseudocode d. Control Structures e. Eclipse Plug-in f. Debugging g. Collections h. Functions i. Exception Handling j. Recursion k. Libraries and Functions l. File Handling 2. Object-Oriented Programming Retail a. Introduction b. OOP Basics c. Encapsulation d. Using Objects e. Eclipse tips f. Static g. Relationships h. Inheritance i. Abstract class j. Exception Handling 3. Data Structures and Algorithms a. Introduction to Data Structures b. List Data Structure c. Stack d. Queue e. Non-linear Data structures f. Hashing and hash table g. Search algorithm h. Sort algorithm i. Algorithm technique 4. Learning DBMS and SQL a. Entities and Relationships diagram b. SQL basics c. DDL statements d. DML statements e. Joins f. Subquery g. Transactions h. Modular query writing i. Normalization j. No SQL databases Test-I –Infy DBMS The below table holds the result of an assessment of 3 students. Table: Assessment StudentId Marks 1001 99 1002 33 1003 88 A requirement is given to 3 developers Tom, Dick and Harry to generate a report as follows: StudentId Marks 1001 99 1002 FAIL 1003 88 If a student has scored less than 50, his status must be shown as ‘FAIL’. Otherwise, his mark must be displayed. The 3 developers wrote the following queries: Tom: SELECT STUDENTID,CASE WHEN
    [Show full text]
  • Math Dictionary
    Math Dictionary Provided by printnpractice.com Tips For Using This Dictionary: 1) Click on the Bookmark Icon on the left and look for a term there. 2) Or use the search bar at the top of the page. Math Dictionary A A.M. - the period of time from midnight to just before noon; morning. Abacus - an oriental counting device and calculator; a rack of ten wires with ten beads on each wire. Abelian group - a group in which the binary operation is commutative, that is, ab=ba for all elements a abd b in the group. Abscissa - the x-coordinate of a point in a 2-dimensional coordinate system. Absolute Value - a number’s distance from zero on the number line. Abstract Number - used without reference to any particular unit. Abundant Number - a positive integer that is smaller than the sum of its proper divisors. Acceleration - the rate of change of velocity with respect to time. Accute Triangle - a triangle of which the largest angle measures more than 0o and less than 90o. Acre - a unit of measure used for measuring land in the United States. An acre is 43,560 square feet or 4,840 square yards. Acute Angle - an angle whose measure is less than 90 degrees. Addend - the numbers added in an addition problem, the operation of combining two or more numbers to form a sum. Addition - the operation of calculating the sum of two numbers or quantities. Additive Identity - the number 0... Zero can be added to any number and that number keeps its identity (it stays the same.) Additive Inverse - the number that when added to the original number will result in a sum of zero.
    [Show full text]
  • [Project Work] 2016-17 Icse Computer Applications Assignment -2
    [PROJECT WORK] 2016-17 ICSE COMPUTER APPLICATIONS ASSIGNMENT -2 Question 1: Write a Program in Java to input a number and check whether it is a Pronic Number or Heteromecic Number or not. Pronic Number : A pronic number, oblong number, rectangular number or heteromecic number, is a number which is the product of two consecutive integers, that is, n (n + 1). The first few pronic numbers are: 0, 2, 6, 12, 20, 30, 42, 56, 72, 90, 110, 132, 156, 182, 210, 240, 272, 306, 342, 380, 420, 462 … etc. Question 2: Write a Program in Java to input a number and check whether it is a Harshad Number or Niven Number or not.. Harshad Number : In recreational mathematics, a Harshad number (or Niven number), is an integer (in base 10) that is divisible by the sum of its digits. Let’s understand the concept of Harshad Number through the following example: The number 18 is a Harshad number in base 10, because the sum of the digits 1 and 8 is 9 (1 + 8 = 9), and 18 is divisible by 9 (since 18 % 9 = 0) The number 1729 is a Harshad number in base 10, because the sum of the digits 1 ,7, 2 and 9 is 19 (1 + 7 + 2 + 9 = 19), and 1729 is divisible by 19 (1729 = 19 * 91) The number 19 is not a Harshad number in base 10, because the sum of the digits 1 and 9 is 10 (1 + 9 = 10), and 19 is not divisible by 10 (since 19 % 10 = 9) The first few Harshad numbers in base 10 are: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 18, 20, 21, 24, 27, 30, 36, 40, 42, 45, 48, 50, 54, 60, 63, 70, 72, 80, 81, 84, 90, 100, 102, 108, 110, 111, 112, 114, 117, 120, 126, 132, 133, 135, 140, 144, 150, 152, 153, 156, 162, 171, 180, 190, 192, 195, 198, 200 etc.
    [Show full text]