• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Permutações caóticas e aplicações / Chaotic permutation and applications

Santos Júnior, Edson Praxedes dos 07 March 2014 (has links)
Submitted by Erika Demachki (erikademachki@gmail.com) on 2014-11-11T17:41:45Z No. of bitstreams: 2 Dissertação - Edson Praxedes dos Santos Junior - 2014.pdf: 13478577 bytes, checksum: b27d0c248d9fab2b9ccbb4c02b7d2b63 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Erika Demachki (erikademachki@gmail.com) on 2014-11-11T17:46:05Z (GMT) No. of bitstreams: 2 Dissertação - Edson Praxedes dos Santos Junior - 2014.pdf: 13478577 bytes, checksum: b27d0c248d9fab2b9ccbb4c02b7d2b63 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2014-11-11T17:46:05Z (GMT). No. of bitstreams: 2 Dissertação - Edson Praxedes dos Santos Junior - 2014.pdf: 13478577 bytes, checksum: b27d0c248d9fab2b9ccbb4c02b7d2b63 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2014-03-07 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / This study aimed to systematize a formula that gives the number of chaotic permutations of n objects by means of the principle of inclusion and exclusion. To do so, are developed and validated, throughout the text, basic and advanced tools of combinatorics. There is also a section devoted to problems which can be solved by the formula outa obtained and in which approaches the formula for obtaining the number of chaotic permutations by means of recurrence. / O presente trabalho teve como objetivo principal, sistematizar uma fórmula que fornece o número de permutações caóticas de n objetos por meio do princípio da inclusão e exclusão. Para isso, são desenvolvidas e validadas, ao longo do texto, ferramentas básicas e avançadas da análise combinatória. Há também uma seção destinada a problemas, que podem ser solucionados por meio da fórmula obtida e outra na qual aborda a fórmula da obtenção do número de permutações caóticas por meio de recorrência.

Page generated in 0.1721 seconds