DOCSLIB.ORG

Art Classes Art Classes: Cathy Milner Is Giving Art Classes to Adults and High School Children at Her Studio on Natte Valleij Farm in Klapmuts

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Art Classes Art Classes: Cathy Milner Is Giving Art Classes to Adults and High School Children at Her Studio on Natte Valleij Farm in Klapmuts COLLEGE NEWS No 1 www.bridgehouse.org.za 15 January 2016 #Headspace: 21 – Key to the Future Firstly, Happy New Year to all Bridge House families! Welcome back to all returning families and a special welcome to those joining us for the first time. May 2016 be a wonderful year for all of you, and for our nation. Here at bridge House, it’s going to be a really special twelve months indeed! Wikipedia is an amazing resource, always interesting, if not always 100% accurate! If you look up “21”, the following information (and a whole lot more) pours onto the screen: “Twenty-one is the fifth discrete semiprime and the second in the (3 × q) family. With 22 it forms the second discrete Semiprime pair. As it is a semiprime with both its prime factors being Gaussian primes, 21 is then a Blum integer. Twenty-one is a Fibonacci number, a Harshad number, a Motzkin number, a triangular number and an octagonal number, as well as a composite number, its proper divisors being 1, 3 and 7. 21 is the sum of the first six natural numbers (1 + 2 + 3 + 4 + 5 + 6 = 21), making it a triangular number. 21 appears in the Padovan sequence, preceded by the terms 9, 12, 16 (it is the sum of the first two of these). The sum of divisors for the integers 1 through 6 is 21. 21 is the smallest non-trivial example of a Fibonacci number whose digits are Fibonacci numbers and whose digit sum is also a Fibonacci number. 21 is a repdigit in base 4 (1114). 21 is the smallest natural number that is not close to a power of 2, 2n, where the range of closeness is ±n. 21 is the smallest number of differently sized squares needed to square the square.[1] Age 21 In several countries 21 is the age of majority. See also: Coming of age. In some countries it is the voting age. 21 is: The number of spots on a standard cubical (six-sided) die (1+2+3+4+5+6) The number of firings in a 21-gun salute honouring Royalty or leaders of countries There are 21 trump cards of the tarot deck if one does not consider The Fool to be a proper trump card. The standard TCP/IP port number for FTP connection 21 grams is the weight of the soul, according to research by Duncan MacDougall, generally regarded as meaningless. The key value and highest-winning point total of the popular casino game Blackjack The number of shillings in a guinea.” I’m not sure I need to know all that, even if I could understand any of the Mathematical stuff or that bit about the “TCP/IP port”, but possibly there’s some useful stuff here for when your dinner-party conversations go quiet… What I do know, though, is that the number 21 has special significance for us at Bridge House this year. We celebrate our 21st birthday, and therefore come of age. Also, in this 21st year, we have committed to 21st Century Learning, irreversibly stepping into a very different space. Our 1:1 iPad programme has generated much excitement and much personal and professional growth already, and it is going to be incredibly exciting to watch this process develop and just keep on improving the delivery of more than just the curriculum. I cannot adequately capture the progress made by our teachers during 2015, in terms of exploring and exploiting what e-learning has to offer. In addition to this teaching and learning paradigm-shift, 2016 is a year of extremely rapid physical growth and development on the campus. By January 2017, we’ll have completed a hockey season on our own astro-turf. By January 2017, we’ll have completed a fourth boarding-house – and it will have a new name. By January 2017, there will be a new dining-room to cater for boarders at the southern (Huguenot House) side of the campus, and we’ll have added six new teaching spaces for the College. In the space of 10 or so months, we will have leapt from being a growing school to becoming just about fully grown: a young adult with a strong identity and real confidence, on the threshold of fully-fledged adulthood, just like a 21-year-old. It is indeed exciting, and that these developments should happen in our 21st year has an almost serendipitous feel to it! By January 2017, we will all have celebrated our Founders’ Dream in some style at a series of events dotted through the terms. Watch this space for details. In the first-ever Bridge House school magazine in 2001, the then Head, Allan Graham wrote: “So, to the dreamers – the Friedmans, Rands and Huxter families – to our Founding Headmaster Lloyd Smuts, and to our Founding Parents, Staff and Pupils, thank you for your courage and foresight. Thank you for making Bridge House happen!” I can only echo Allan’s words. Thank you for making Bridge House happen. Thank you for the support and guidance and trust and belief that has seen and continues to see the dream unfold. It is almost beyond one’s capacity to imagine what those first exploratory, tentative discussions of 1994 must have been like, and to look now at our school and be able to see your dream reach this coming-of-age milestone. To think that you had the faith and courage to pursue this dream at a time of great uncertainty about the future of South Africa, as our country took its first exploratory, tentative steps towards democracy, is even more testament to the inspirational power of vision. Thank you for making Bridge House happen! Mr Mike Russell Matric Results Congratulations to the Class of 2015 on outstanding results in the Independent Examinations Board (IEB) Matric exams. You will find detailed information about the Bridge House results on our webpage http://www.bridgehouse.org.za/college/academics/matric-results We are proud that two Bridge House students (out of six in the Western Cape) appeared on the IEB Outstanding Achievers List. They are Aimee Fuller and Kaila Fourie with the following outstanding results: AIMEE FULLER – 9 Distinctions KAILA FOURIE – 9 Distinctions Aimee did 9 subjects including Advanced Kaila did 9 subjects including Advanced Programme English and Advanced Programme English and Advanced Programme Programme Mathematics. She achieved 9 Mathematics. She achieved 9 Distinctions Distinctions with 6 subjects over 90% with 5 subjects over 90% (Accounting 94%, (Accounting 91%, Afrikaans 92%, English Afrikaans 92%, Economics 95%, Maths 96%, 95%, Maths 96%, Physical Science 91% Physical Science 93%). She came in the top and Visual Art 96%). She came in the top 1% in SA in Afrikaans and Economics. 1% in SA in Afrikaans, English and Visual Arts. Further outstanding results from the top students JOSH FERREIRA CHRISTINA LOUW JANIE DE LANGE NINA CONDÉ 7 Distinctions including 7 Distinctions including 92% 6 Distinctions including 95% 6 Distinctions including 91% 94% for Economics. for Mathematics for Accounting, 98% for for Economics and 91% for Top 1% in the country in Economics, 92% for French, English & 90% for French. Economics. 92% for Life Orientation & Top 1% in the country in 91% for Mathematics. Top English. 1% in the country in Accounting, Economics & Life Orientation. COSIMA BABL GEMMA MAUGER SEAN OOSTHUIZEN 5 Distinctions 5 Distinctions 5 Distinctions including 96% for Economics Top 1% in the country in Economics. CHARLOTTE BARLOW ALEXANDRA BOREL-SALADIN CIMÓN SAAYMAN 4 Distinctions 4 Distinctions 4 Distinctions Class of 2015 Reunion On Tuesday, the Matrics of 2015 returned to school for a reunion with their classmates and teachers. They were presented with past pupils scarves and ties and Aimee Fuller, the Dux student for 2015, was presented with a trophy and certificate. Congratulations on this excellent achievement, Aimee. It was a very happy occasion and we enjoyed having the Class of 2015 back so soon! Philippolis Community Partnership Every December, volunteers from Bridge House visit the tiny Southern Free State town of Philippolis where they give of their time, love and labour to interact and assist the community with renovations to the facilities there. In the first week of the holidays, while everyone else was relaxing, a group of seventeen Bridge House pupils with Mr Jones and Ms Hutton-Squire headed off to Philippolis where hard work awaited them. They began work at 4:45am every morning working on the crèche at a local community centre which has had no maintenance done for a decade. They fixed the playground, replaced the ceilings, painted window frames with enamel, fixed the doors and scraped and then painted the walls with educational drawings. As if this was not hard enough work, there was a crowd of curious children to entertain throughout the day. The group managed to do all of this with a happy, positive attitude every day. Well done, Mr James Jones, Ms Megan Hutton-Squire, Aimee Otto, Camille de Villiers, Chelsea Rowland, Ella van Niekerk, Faith Hathorn, Hestia Brink, Isabella Dower, Jordan Michel, Konrad Blümers, Lara Wessels, Marceleen Marx, Matthew Browne, Meeka Cohen, Meghan Gomes, Natasha Glazer, Nicole Meyer and Victoria Macfie for your commitment, jokes, squad spirit and hard work. Swimming Star On Tuesday, star swimmer, Migael Adams (Grade 8), who won a total of 9 medals for South Africa at the CANA Zone 3 Swimming Championships in Uganda during the holidays was filmed going about his daily routine at school and he was interviewed by the SABC for a programme on TV. His fantastic results at the Championships were as follows: - 4 individual medals (1 gold in 50m breaststroke, 3 bronze in 100m & 200m breaststroke & 50m backstroke) - 5 relay medals (2 gold and 3 silver).
Load more

Recommended publications
  • Double-Authentication-Preventing Signatures
    A preliminary version of this paper appears in the proceedings of ESORICS 2014 [PS14]. The full version appears in the International Journal of Information Security [PS15]. This is the author's copy of the full version. The final publication is available at Springer via http://dx.doi.org/10.1007/s10207-015-0307-8. Double-authentication-preventing signatures Bertram Poettering1 and Douglas Stebila2 1 Foundations of Cryptography, Ruhr University Bochum, Germany 2 School of Electrical Engineering and Computer Science and School of Mathematical Sciences, Queensland University of Technology, Brisbane, Australia [email protected] [email protected] January 18, 2016 Abstract Digital signatures are often used by trusted authorities to make unique bindings between a subject and a digital object; for example, certificate authorities certify a public key belongs to a domain name, and time-stamping authorities certify that a certain piece of information existed at a certain time. Traditional digital signature schemes however impose no uniqueness conditions, so a trusted authority could make multiple certifications for the same subject but different objects, be it intentionally, by accident, or following a (legal or illegal) coercion. We propose the notion of a double-authentication-preventing signature, in which a value to be signed is split into two parts: a subject and a message. If a signer ever signs two different messages for the same subject, enough information is revealed to allow anyone to compute valid signatures on behalf of the signer. This double-signature forgeability property discourages signers from misbehaving|a form of self-enforcement|and would give binding authorities like CAs some cryptographic arguments to resist legal coercion.
    [Show full text]
  • 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]
  • Secret Sharing and Perfect Zero Knowledge*
    Secret Sharing and Perfect Zero Knowledge* A. De Santis,l G. Di Crescenzo,l G. Persiano2 Dipartimento di Informatica ed Applicazioni, Universiti di Salerno, 84081 Baronissi (SA), Italy Dipartimento di Matematica, Universitk di Catania, 95125 Catania, Italy Abstract. In this work we study relations between secret sharing and perfect zero knowledge in the non-interactive model. Both secret sharing schemes and non-interactive zero knowledge are important cryptographic primitives with several applications in the management of cryptographic keys, in multi-party secure protocols, and many other areas. Secret shar- ing schemes are very well-studied objects while non-interactive perfect zer-knowledge proofs seem to be very elusive. In fact, since the intro- duction of the non-interactive model for zero knowledge, the only perfect zero-knowledge proof known was for quadratic non residues. In this work, we show that a large class of languages related to quadratic residuosity admits non-interactive perfect zero-knowledge proofs. More precisely, we give a protocol for proving non-interactively and in perfect zero knowledge the veridicity of any “threshold” statement where atoms are statements about the quadratic character of input elements. We show that our technique is very general and extend this result to any secret sharing scheme (of which threshold schemes are just an example). 1 Introduction Secret Sharing. The fascinating concept of Secret Sharing scheme has been first considered in [18] and [3]. A secret sharing scheme is a method of dividing a secret s among a set of participants in such a way that only qualified subsets of participants can reconstruct s but non-qualified subsets have absolutely no information on s.
    [Show full text]
  • Motzkin Paths, Motzkin Polynomials and Recurrence Relations
    Motzkin paths, Motzkin polynomials and recurrence relations Roy Oste and Joris Van der Jeugt Department of Applied Mathematics, Computer Science and Statistics Ghent University B-9000 Gent, Belgium [email protected], [email protected] Submitted: Oct 24, 2014; Accepted: Apr 4, 2015; Published: Apr 21, 2015 Mathematics Subject Classifications: 05A10, 05A15 Abstract We consider the Motzkin paths which are simple combinatorial objects appear- ing in many contexts. They are counted by the Motzkin numbers, related to the well known Catalan numbers. Associated with the Motzkin paths, we introduce the Motzkin polynomial, which is a multi-variable polynomial “counting” all Motzkin paths of a certain type. Motzkin polynomials (also called Jacobi-Rogers polyno- mials) have been studied before, but here we deduce some properties based on recurrence relations. The recurrence relations proved here also allow an efficient computation of the Motzkin polynomials. Finally, we show that the matrix en- tries of powers of an arbitrary tridiagonal matrix are essentially given by Motzkin polynomials, a property commonly known but usually stated without proof. 1 Introduction Catalan numbers and Motzkin numbers have a long history in combinatorics [19, 20]. 1 2n A lot of enumeration problems are counted by the Catalan numbers Cn = n+1 n , see e.g. [20]. Closely related to Catalan numbers are Motzkin numbers M , n ⌊n/2⌋ n M = C n 2k k Xk=0 similarly associated to many counting problems, see e.g. [9, 1, 18]. For example, the number of different ways of drawing non-intersecting chords between n points on a circle is counted by the Motzkin numbers.
    [Show full text]
  • Motzkin Paths
    Discrete Math. 312 (2012), no. 11, 1918-1922 Noncrossing Linked Partitions and Large (3; 2)-Motzkin Paths William Y.C. Chen1, Carol J. Wang2 1Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P.R. China 2Department of Mathematics Beijing Technology and Business University Beijing 100048, P.R. China emails: [email protected], wang [email protected] Abstract. Noncrossing linked partitions arise in the study of certain transforms in free probability theory. We explore the connection between noncrossing linked partitions and (3; 2)-Motzkin paths, where a (3; 2)-Motzkin path can be viewed as a Motzkin path for which there are three types of horizontal steps and two types of down steps. A large (3; 2)-Motzkin path is a (3; 2)-Motzkin path for which there are only two types of horizontal steps on the x-axis. We establish a one-to-one correspondence between the set of noncrossing linked partitions of f1; : : : ; n + 1g and the set of large (3; 2)- Motzkin paths of length n, which leads to a simple explanation of the well-known relation between the large and the little Schr¨odernumbers. Keywords: Noncrossing linked partition, Schr¨oderpath, large (3; 2)-Motzkin path, Schr¨odernumber AMS Classifications: 05A15, 05A18. 1 1 Introduction The notion of noncrossing linked partitions was introduced by Dykema [5] in the study of the unsymmetrized T-transform in free probability theory. Let [n] denote f1; : : : ; ng. It has been shown that the generating function of the number of noncrossing linked partitions of [n + 1] is given by 1 p X 1 − x − 1 − 6x + x2 F (x) = f xn = : (1.1) n+1 2x n=0 This implies that the number of noncrossing linked partitions of [n + 1] is equal to the n-th large Schr¨odernumber Sn, that is, the number of large Schr¨oderpaths of length 2n.
    [Show full text]
  • Some Identities on the Catalan, Motzkin and Schr¨Oder Numbers
    Discrete Applied Mathematics 156 (2008) 2781–2789 www.elsevier.com/locate/dam Some identities on the Catalan, Motzkin and Schroder¨ numbers Eva Y.P. Denga,∗, Wei-Jun Yanb a Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, PR China b Department of Foundation Courses, Neusoft Institute of Information, Dalian 116023, PR China Received 19 July 2006; received in revised form 1 September 2007; accepted 18 November 2007 Available online 3 January 2008 Abstract In this paper, some identities between the Catalan, Motzkin and Schroder¨ numbers are obtained by using the Riordan group. We also present two combinatorial proofs for an identity related to the Catalan numbers with the Motzkin numbers and an identity related to the Schroder¨ numbers with the Motzkin numbers, respectively. c 2007 Elsevier B.V. All rights reserved. Keywords: Catalan number; Motzkin number; Schroder¨ number; Riordan group 1. Introduction The Catalan, Motzkin and Schroder¨ numbers have been widely encountered and widely investigated. They appear in a large number of combinatorial objects, see [11] and The On-Line Encyclopedia of Integer Sequences [8] for more details. Here we describe them in terms of certain lattice paths. A Dyck path of semilength n is a lattice path from the origin (0, 0) to (2n, 0) consisting of up steps (1, 1) and down steps (1, −1) that never goes below the x-axis. The set of Dyck paths of semilength n is enumerated by the n-th Catalan number 1 2n cn = n + 1 n (sequence A000108 in [8]). The generating function for the Catalan numbers (cn)n∈N is √ 1 − 1 − 4x c(x) = .
    [Show full text]
  • Motzkin Numbers of Higher Rank: Generating Function and Explicit Expression
    1 2 Journal of Integer Sequences, Vol. 10 (2007), 3 Article 07.7.4 47 6 23 11 Motzkin Numbers of Higher Rank: Generating Function and Explicit Expression Toufik Mansour Department of Mathematics University of Haifa Haifa 31905 Israel [email protected] Matthias Schork1 Camillo-Sitte-Weg 25 60488 Frankfurt Germany [email protected] Yidong Sun Department of Mathematics Dalian Maritime University 116026 Dalian P. R. China [email protected] Abstract The generating function for the (colored) Motzkin numbers of higher rank intro- duced recently is discussed. Considering the special case of rank one yields the corre- sponding results for the conventional colored Motzkin numbers for which in addition a recursion relation is given. Some explicit expressions are given for the higher rank case in the first few instances. 1All correspondence should be directed to this author. 1 1 Introduction The classical Motzkin numbers (A001006 in [1]) count the numbers of Motzkin paths (and are also related to many other combinatorial objects, see Stanley [2]). Let us recall the definition of Motzkin paths. We consider in the Cartesian plane Z Z those lattice paths starting from (0, 0) that use the steps U, L, D , where U = (1, 1) is× an up-step, L = (1, 0) a level-step and D = (1, 1) a down-step.{ Let} M(n, k) denote the set of paths beginning in (0, 0) and ending in (n,− k) that never go below the x-axis. Paths in M(n, 0) are called Motzkin paths and m := M(n, 0) is called n-th Motzkin number.
    [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]
  • 1 Abelian Group 266 Absolute Value 307 Addition Mod P 427 Additive
    1 abelian group 266 certificate authority 280 absolute value 307 certificate of primality 405 addition mod P 427 characteristic equation 341, 347 additive identity 293, 497 characteristic of field 313 additive inverse 293 cheating xvi, 279, 280 adjoin root 425, 469 Chebycheff’s inequality 93 Advanced Encryption Standard Chebycheff’s theorem 193 (AES) 100, 106, 159 Chinese Remainder Theorem 214 affine cipher 13 chosen-plaintext attack xviii, 4, 14, algorithm xix, 150 141, 178 anagram 43, 98 cipher xvii Arithmetica key exchange 183 ciphertext xvii, 2 Artin group 185 ciphertext-only attack xviii, 4, 14, 142 ASCII xix classic block interleaver 56 asymmetric cipher xviii, 160 classical cipher xviii asynchronous cipher 99 code xvii Atlantic City algorithm 153 code-book attack 105 attack xviii common divisor 110 authentication 189, 288 common modulus attack 169 common multiple 110 baby-step giant-step 432 common words 32 Bell’s theorem 187 complex analysis 452 bijective 14, 486 complexity 149 binary search 489 composite function 487 binomial coefficient 19, 90, 200 compositeness test 264 birthday paradox 28, 389 composition of permutations 48 bit operation 149 compression permutation 102 block chaining 105 conditional probability 27 block cipher 98, 139 confusion 99, 101 block interleaver 56 congruence 130, 216 Blum integer 164 congruence class 130, 424 Blum–Blum–Shub generator 337 congruential generator 333 braid group 184 conjugacy problem 184 broadcast attack 170 contact method 44 brute force attack 3, 14 convolution product 237 bubble sort 490 coprime
    [Show full text]