Lexicographic ordering of an n-element set / (Record no. 183)

MARC details
000 -LEADER
fixed length control field 01792nam a2200241 4500
001 - CONTROL NUMBER
control field UPMIN-00000009109
003 - CONTROL NUMBER IDENTIFIER
control field UPMIN
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20230209113022.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 230209b |||||||| |||| 00| 0 eng d
040 ## - CATALOGING SOURCE
Original cataloging agency DLC
Transcribing agency UPMin
Modifying agency upmin
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title eng
090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN)
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) LG993.5 2002
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) A64 R356
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Ramonal, Danna Joy S.
9 (RLIN) 2230
245 00 - TITLE STATEMENT
Title Lexicographic ordering of an n-element set /
Statement of responsibility, etc. Danna Joy S. Ramonal
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Date of publication, distribution, etc. 2002
300 ## - PHYSICAL DESCRIPTION
Extent 22 leaves
502 ## - DISSERTATION NOTE
Dissertation note Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2002
520 3# - SUMMARY, ETC.
Summary, etc. Consider all the possible permutations of an n-element set {1,2,..,n} taken k at a time. Suppose these permutations arranged in lexicographic order. How do you determine the rank or position of a given permutation in the list? How do you find the particular permutation given its rank or position? This paper gives a formula for determining the rank or position of a permutation in the list and a formula for obtaining the particular permutation of a given rank or position, for n ranging from 1 to 9, without actually listing all the permutations involved. The lists of permutations is lexicographic order were observed for similar patterns that led to generate the formula. Would it be possible to generate a formula in finding the rank or position of the permutation and the permutation of the position if a certain number in the set of n elements is chosen and allow it to repeat n times? Would it also be possible to generate a formula in finding the rank or position of the permutation and the permutation of the position if a certain number in the set of n elements is chosen to have a fixed repetition?
658 ## - INDEX TERM--CURRICULUM OBJECTIVE
Main curriculum objective Undergraduate Thesis
Curriculum code AMAT200,
Source of term or code BSAM
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN)
a Fi
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN)
a UP
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Thesis
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Status Collection Home library Current library Shelving location Date acquired Source of acquisition Accession Number Total Checkouts Full call number Barcode Date last seen Price effective from Koha item type
    Library of Congress Classification   Not For Loan Preservation Copy University Library University Library Archives and Records 2002-05-27 donation UAR-T-gd115   LG993.5 2002 A64 R356 3UPML00020911 2022-09-21 2022-09-21 Thesis
    Library of Congress Classification   Not For Loan Room-Use Only College of Science and Mathematics University Library Theses 2002-06-20 donation CSM-T-1053   LG993.5 2002 A64 R356 3UPML00010961 2022-09-21 2022-09-21 Thesis
 
University of the Philippines Mindanao
The University Library, UP Mindanao, Mintal, Tugbok District, Davao City, Philippines
Email: library.upmindanao@up.edu.ph
Contact: (082)295-7025
Copyright @ 2022 | All Rights Reserved