This report explores the historical development of three areas of study regarding prime numbers. The attempt to find an efficient and useful function to generate primes could be a helpful tool in the improvement of encryption. The difficulty of factoring large numbers allows the Rivest, Shamir and Adleman algorithm to be effective for public key cryptography. The distribution of primes is examined through discussion of the prime number theorem and the Riemann hypothesis. A brief case for integrating elementary number theory in secondary curriculum is also included. / text

No description available.

Thesis (M.A.)--Boston University

Thesis (M.A.)--Boston University. / In Chapter 1 of this thesis we give some elementary definitions and prove the following three theorems: 1.1 Every positive integer n greater than one can be expressed in the form n=p1p2...pk where each of the pi is a prime number. 1.2 Every integer n greater than one can be expressed in standard form in one and only one way. If we write n=(p1^a1)(p2^a2).....(pj^aj), where p1< p2 <...< pj and each ai is greater than 0, then n is expressed in standard form. 1.3 The number of prime numbers is infinite [TRUNCATED]

Submitted by Maria Suzana Diniz (msuzanad@hotmail.com) on 2015-11-25T14:11:47Z No. of bitstreams: 1 arquivototal.pdf: 21722062 bytes, checksum: bb67c86f0d2ae8a89632226cb61b3636 (MD5) / Made available in DSpace on 2015-11-25T14:11:47Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 21722062 bytes, checksum: bb67c86f0d2ae8a89632226cb61b3636 (MD5) Previous issue date: 2015-02-24 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / The present work is a study of Teodoro spiral, for the geometric aspects of the curve. At rst, the construction of Teodoro spiral in two and three dimensions is made. And through the softwares, GeoGebra and wxMaxima were developed respectively, the geometric constructions and the necessary calculations. With the possession of the spiral of concatenation, observe the pattern of behavior of growth and position, the collared peccary in the n - th triangle. Going through measurements of Teodoro spiral with other spirals such as the Archimedean, we come to denote behavior patterns in expanding spiral. The following is an arithmetic study on the spiral obtained by the length of the branches of the same, both perfect and imperfect hits with square also spaced apart relationship between them allows us to observe numbers as the . The distribution of prime numbers is seen as the nal part of this study, where you see speculatively allowing the formation of new curves on the spiral, as parabolas. / O presente trabalho faz um estudo da espiral de Teodoro, no tocante aos aspectos geométricos da curva. De início, é feita a construção da espiral de Teodoro em duas e três dimensões. E por meio dos softwares, GeoGebra e wxMaxima, foram desenvolvidas respectivamente, as construções geométricas e os cálculos necessários. Com a posse da concatenação da espiral, observa-se o comportamento do padrão de crescimento e posição, do cateto no enésimo triângulo. Passando por aferições da espiral de Teodoro com outras espirais, como por exemplo a arquimediana, chega-se a denotar padrões de comportamento na expansão da espiral. A seguir, é mostrado um estudo aritmético na espiral, obtido através do comprimento dos ramos da mesma, que tanto atinge quadrados perfeitos e imperfeitos como também a relação de afastamento entre eles nos permite observar números como o . A distribuição dos números primos é vista como parte fi nal desse estudo, onde se vê de forma especulativa, possibilitando a formação de novas curvas sobre a espiral, como parábolas.

This thesis presents a series of theorems along with proofs to establish a theory of congruences.

Prime numbers play an integral part in many upper level mathematics courses, most notably in Number Theory. Can a course or section on prime numbers be introduced at the secondary (high school) level? This report outlines a possible course in a manner suitable for grade level instruction. These topics include: an extended section on the complete number system, a brief history of primes, their cardinality, and both the Fundamental Theorem of Arithmetic and Prime Number Theorem, the applications of primes, and the impact of primes within perfect numbers will all be explored. A brief discussion on questions that still remain relating to prime numbers will conclude this report. / text

In this article we will deal with the prime numbers and its current use in encryption algorithms. Encryption algorithms make possible the exchange of sensible data in internet, such as bank transactions, email correspondence and other internet transactions where privacy is important.

In this thesis we prove several different results about the number of primes represented by linear functions. The Brun-Titchmarsh theorem shows that the number of primes which are less than x and congruent to a modulo q is less than (C+o(1))x/(phi(q)log{x}) for some value C depending on log{x}/log{q}. Different authors have provided different estimates for C in different ranges for log{x}/log{q}, all of which give C>2 when log{x}/log{q} is bounded. We show in Chapter 2 that one can take C=2 provided that log{x}/log{q}> 8 and q is sufficiently large. Moreover, we also produce a lower bound of size x/(q^{1/2}phi(q)) when log{x}/log{q}>8 and is bounded. Both of these bounds are essentially best-possible without any improvement on the Siegel zero problem. Let k>1 and Pi(n) be the product of k linear functions of the form a_in+b_i for some integers a_i, b_i. Suppose that Pi(n) has no fixed prime divisors. Weighted sieves have shown that for infinitely many integers n, the number of prime factors of Pi(n) is at most r_k, for some integer r_k depending only on k. In Chapter 3 and Chapter 4 we introduce two new weighted sieves to improve the possible values of r_k when k>2. In Chapter 5 we demonstrate a limitation of the current weighted sieves which prevents us proving a bound better than r_k=(1+o(1))klog{k} for large k. Zhang has shown that there are infinitely many intervals of bounded length containing two primes, but the problem of bounded length intervals containing three primes appears out of reach. In Chapter 6 we show that there are infinitely many intervals of bounded length containing two primes and a number with at most 31 prime factors. Moreover, if numbers with up to 4 prime factors have `level of distribution' 0.99, there are infinitely many integers n such that the interval [n,n+90] contains 2 primes and an almost-prime with at most 4 prime factors.

Submitted by Jorge Silva (jorgelmsilva@ufrrj.br) on 2017-07-25T20:07:22Z No. of bitstreams: 1 2013 - Kelly Cristina Santos Alexandre de Lima.pdf: 1635869 bytes, checksum: 038861f43fdfe8411b10d93fc0f8533a (MD5) / Made available in DSpace on 2017-07-25T20:07:22Z (GMT). No. of bitstreams: 1 2013 - Kelly Cristina Santos Alexandre de Lima.pdf: 1635869 bytes, checksum: 038861f43fdfe8411b10d93fc0f8533a (MD5) Previous issue date: 2013-04-15 / This study aims to provide a discussion of the concepts involving encryption, through its application of prime numbers, and possible links with education. The criterion used to choose one or other cryptographic system was subjective, many systems have not been addressed, even containing intrinsic relations with the theme. The necessity to exchange confidential information urged the rise of art to encode messages, the virtual network and its millions of users identified the need for a system using public key and at the same time, safe. RSA came to supply the needs of a society that increasingly conducts its banking, commercial and social web. One issue which needs to be thought concerning the way how the contents of the called Number Theory have been presented and learned at school. Something that is traditionally consecrated as boring and meaningless. The art of cryptography brings relevant topics to think about mathematical concepts, providing an education for Troubleshooting. The paths taken, thereafter, provide meaningful experiences for the subject, in emancipatory education, as suggested by Adorno and Ranci?re. Suggested activities from different coding systems intend to instigate students and educators to reconsider the different possibilities of a problem, raising the sensitivity of thinking and find ways to solve and not repeat the mechanisms of a mathematical algorithm, so that the educational act passes by the complex circumstances that present themselves today. / Este trabalho visa estabelecer uma discuss?o sobre os conceitos envolvendo criptografia, atrav?s de sua aplica??o dos n?meros primos, e as poss?veis rela??es com a educa??o. O crit?rio utilizado para optar por este ou aquele sistema criptogr?fico foi subjetivo; muitos sistemas n?o foram abordados, mesmo contendo rela??es intr?nsecas com a tem?tica. A necessidade de troca de informa??es sigilosas instigou o surgimento da arte de codificar mensagens; a rede virtual e seus milh?es de usu?rios apontou a necessidade de um sistema utilizando chave p?blica e, ao mesmo tempo, seguro. O RSA veio para suprir as necessidades de uma sociedade que, cada vez mais, realiza suas transa??es banc?rias, comerciais e sociais via web. Uma quest?o que carece ser pensada diz respeito ? maneira como os conte?dos da chamada Teoria dos N?meros t?m sido apresentados e trabalhados na escola. Algo que ? tradicionalmente consagrado como enfadonho e sem sentido. A arte da criptografia traz consigo temas relevantes para se pensar nos conceitos matem?ticos, propiciando um ensino por Resolu??o de Problemas. Os caminhos percorridos, a partir da?, propiciam experi?ncias significativas para o sujeito, numa educa??o emancipat?ria, como propuseram Adorno e Ranci?re. As atividades sugeridas a partir de diferentes sistemas de codifica??o pretendem instigar os educandos e os educadores a repensar as diferentes possibilidades de um problema, suscitando a sensibilidade do pensar e de buscar maneiras para resolver e n?o repetir os mecanismos de um algoritmo matem?tico, para que o ato educativo perpasse as circunst?ncias complexas que se apresentam na atualidade.