The Eulerian numbers and a Pascal-like triangle
Date of Publication
1995
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
In this study, a number pattern similar to Pascal's triangle is presented. This number pattern referred to as the Pascal-like Triangle could be generated using three different methods. The first method generates the entries of the triangle by taking the weighted sum of its overhead entries. The second method generates the entries of the triangle by using a recurrence relation defined by the Eulerian Numbers. The third method generates the entries of the triangle by solving for the permanents of n x n circulant matrices. It shows also that the Eulerian numbers could be used in evaluating the series nm x n and in solving for the sum of the powers of the first n integers.
Abstract Format
html
Language
English
Format
Accession Number
TU07036
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
68 leaves
Keywords
Euler's numbers; Pascal's triangle; Matrices; Sequences (Mathematics)
Recommended Citation
Ang, J. C., & Aguilar, M. C. (1995). The Eulerian numbers and a Pascal-like triangle. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16236
