Thesis (Ph. D.)--University of Wisconsin, 1964. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Bibliography: leaves 124-128.

Our main result is that there are infinitely many primes of the form a² + b² such that a² + 4b² has at most 5 prime factors. We prove this by first developing the theory of $L$-functions for Gaussian primes by using standard methods. We then give an exposition of the Siegel--Walfisz Theorem for Gaussian primes and a corresponding Prime Number Theorem for Gaussian Arithmetic Progressions. Finally, we prove the main result by using the developed theory together with Sieve Theory and specifically a weighted linear sieve result to bound the number of prime factors of a² + 4b². For the application of the sieve, we need to derive a specific version of the Bombieri--Vinogradov Theorem for Gaussian primes which, in turn, requires a suitable version of the Large Sieve. We are also able to get the number of prime factors of a² + 4b² as low as 3 if we assume the Generalised Riemann Hypothesis.

In 1972, professor Grigore Moisil, the most famous Romanian academician for Mathematics, said about Combinatorics, that it is “an opportunity of a renewed gladness”, because “each problem in the domain asks for its solving, an expenditure without any economy of the human intelligence”. More, the research methods, used in Combinatorics, are different from a problem to the other! This is the explanation for the existence of my actual paper, in which I propose to teach Combinatorics, using selected problems. MS classification: 05A05, 97D50.

In 1972, professor Grigore Moisil, the most famous Romanian academician for Mathematics, said about Combinatorics, that it is “an opportunity of a renewed gladness”, because “each problem in the domain asks for its solving, an expenditure without any economy of the human intelligence”. More, the research methods, used in Combinatorics, are different from a problem to the other! This is the explanation for the existence of my actual paper, in which I propose to teach Combinatorics, using selected problems. MS classification: 05A05, 97D50.

Submitted by ANA KARLA PEREIRA RODRIGUES (anakarla_@hotmail.com) on 2017-09-05T16:47:02Z No. of bitstreams: 1 arquivototal.pdf: 1153647 bytes, checksum: a384e4d5e2acf05cec52ece972237c23 (MD5) / Approved for entry into archive by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2017-09-06T10:49:22Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 1153647 bytes, checksum: a384e4d5e2acf05cec52ece972237c23 (MD5) / Made available in DSpace on 2017-09-06T10:49:22Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 1153647 bytes, checksum: a384e4d5e2acf05cec52ece972237c23 (MD5) Previous issue date: 2016-08-17 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / The process of teaching and learning of mathematics is closely related to the resolution of theoretical and practical problems, which often involve situations of everyday life in our society. This work aims to present the Inclusion and Exclusion Principle as a tool for solving many problems involving counting elements, especially those that appear double, triple counting, among others. It also seeks to relate it with the determination of prime numbers of a number and the Sieve of Eratosthenes, use it to systematize the Formula of the function Fi ( Phi) Euler, as well as for determining the number of permutations Chaotic and number of Sobrejetoras functions. / O processo de ensino aprendizagem da Matemática está intimamente relacionado com a resolução de problemas teóricos e práticos, os quais geralmente envolvem situações do cotidiano de nossa sociedade. Esse trabalho tem como objetivo apresentar o Princípio da Inclusão e Exclusão como ferramenta para resolução de vá- rios modelos de problemas que envolvem a contagem de elementos, principalmente aquelas que aparecem contagem duplas, triplas, dentre outras. Além disso, busca relacioná-lo com a determinação de números primos de um número e com o Crivo de Eratóstenes, utilizá-lo para sistematizar a Fórmula da Função Fi ( ) de Euler, bem como para a determinação do Número de Permutações Caóticas e do Número de Funções Sobrejetoras.