Submitted by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2015-05-27T15:49:59Z No. of bitstreams: 1 arquivototal.pdf: 791381 bytes, checksum: 38dd57e91539c2f7bfdaf6d1092eff37 (MD5) / Approved for entry into archive by Leonardo Americo (leonardo@sti.ufpb.br) on 2015-05-27T17:33:15Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 791381 bytes, checksum: 38dd57e91539c2f7bfdaf6d1092eff37 (MD5) / Made available in DSpace on 2015-05-27T17:33:15Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 791381 bytes, checksum: 38dd57e91539c2f7bfdaf6d1092eff37 (MD5) Previous issue date: 2013-08-13 / In this work we present the concept of cryptography, highlighting the differences between symmetric encryption and asymmetric encryption. We also show how RSA encryption works. Moreover, we study the main mathematical results that justify the operation of this cryptosystem and its security, such as: congruences, Euler's theorem, Fermat's Little Theorem, Wilson's Theorem, Euler's criterion for quadratic residues, Law of Quadratic Reciprocity and primality tests. / Neste trabalho apresentamos o conceito de criptografia, diferenciamos a criptogra fia simétrica da criptografia assimétrica e mostramos como funciona a criptografia RSA. Além disso, destacamos os principais resultados matemáticos que justificam o funcionamento desse criptossistema e sua segurança, tais como: congruências, Teorema de Euler, Pequeno Teorema de Fermat, Teorema de Wilson, Critério de Euler para resíduos quadráticos, Lei de Reciprocidade Quadrática e testes de primalidade.

Orientador: Emerson Alexandre de Oliveira Lima / Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica / Made available in DSpace on 2018-08-13T21:19:45Z (GMT). No. of bitstreams: 1 Silva_FilardesdeJesusFreitasda_M.pdf: 678989 bytes, checksum: 49b0b13ce88d8aa64141c17e237d85fe (MD5) Previous issue date: 2009 / Resumo: Neste trabalho focalizamos os principais conceitos da teoria elementar dos números objetivando uma melhor compreensão das Equações Diofantinas Clássicas e suas aplicações e para isto explicitamos os conceitos de Números primos, Algoritmo de Euclides, Máximo divisor comum e Mínimo múltiplo comum, assim como a teoria das Congruências, uma abordagem sobre a Criptografica RSA e Soma de Inteiros. Palavras-Chave: Congruências Lineares, Soma de Inteiros, Equação de Fermat, Soma de Quadrados / Abstract: In this work we focus the main concepts of the elementary theory of numbers seeking a better understanding of Classical diophantine equations and their applications for this and explained the concepts of prime numbers, algorithms of Euclid, maximum common divisor and least common multiple and the theory of congruence , an approach on the RSA encryption and Sum of Integers. Keywords: Linear congruence, Sum of Integers, equation of Fermat, Sum of Squares / Mestrado / Teoria dos Numeros / Mestre em Matemática

Este trabalho descreve as soluções de algumas equações diofantinas em duas e três variáveis. O objetivo é apresentar a análise de alguns casos simples e de outros mais difíceis relativos ao Último Teorema de Fermat. Primeiramente são apresentados os pré-requisitos necessários dentre os quais incluímos a noção de número primo, máximo divisor comum, congruência, o Algoritmo de Euclides e o Teorema Fundamental da Aritmética. Este material é desenvolvido primeiramente no anel dos inteiros racionais e posteriormente em duas extensões algébricas conhecidas como os inteiros de Gauss e de Eisenstein. A estrutura dos últimos é indispensável na resolução do primeiro caso não trivial do Último Teorema de Fermat, a saber, da equação diofantina x3 + y3 = z3. O último capítulo apresenta algumas aplicações de problemas diofantinos e do Algoritmo de Euclides que podem ser desenvolvidos em sala de aula com alunos do sexto e do oitavo ano. / This work describes the solutions to some diophantine equations in two and three variables. The objective is to present the analysis of some simple and other more difficult cases related to Fermats Last Theorem. First, we present the necessary prerequisites which include the notion of a prime number, the maximum common divisor, congruences, Euclids Algorithm and the Fundamental Theorem of Arithmetic. This material is first developed by using the rational integers and then presented for two algebraic extensions known as Gauss and Eisenstein integers. The structure of the latter is indispensable for the first non-trivial case of Fermats Last Theorem, namely, the diophantine equation x3 + y3 = z3. The last chapter presents some applications of simple diophantine equations and Euclids algorithm which can be developed in the classroom with sixth and eight grade students.

Neste trabalho é apresentado um breve levantamento da história dos números primos e de que maneira o assunto acerca desses números aparecem no novo cenário trazido pela BNCC. Provamos o Teorema Fundamental da Aritmética e apresentamos duas ferramentas importantes de cálculo, que são as Congruências e o Pequeno Teorema de Fermat. Apresentamos ainda uma proposta didática e um material diferenciado para ser utilizado em sala de aula. / In the present work is presented a brief data collection about the history of prime numbers and how this subject is shown in the new scenario brought by BNCC (Common Curricular National Base) . It was proved the Fundamental Arithmetic Theorem and it was presented two important ways to calculate that are the Congruence and the Fermet Theorem. It is given a teaching method and a differentiated material to be used in class.

Une variété algébrique est dite unirationnelle si elle est dominée par un espace projectif ; elle est dite séparablement unirationnelle si on peut prendre le morphisme précédent séparable. Cette dernière propriété n'a d'intérêt qu'en caractéristique positive. En reprenant la démonstration de Paranjape et Srinivas de l'unirationalité des hypersurfaces de degré très petit devant la dimension, nous remarquons qu'elle montre en fait l'unirationalité séparable. Nous nous intéressons aussi à la séparabilité des morphismes fournis par différentes constructions classiques de l'unirationalité des hypersurfaces cubiques.<br /><br />Dans la troisième partie, nous étudions la connexité rationnelle séparable : une variété projective lisse X sur un corps algébriquement clos est dite séparablement rationnellement connexe s'il existe une courbe rationnelle très libre (c'est-à-dire à fibré normal ample) sur X. Nous testons sur les hypersurfaces de Fermat de dimension N-1 et de degré q+1, où q est une puissance de la caractéristique du corps de base, la conjecture que toutes les hypersurfaces lisses de dimension N-1 et de degré plus petit que N sont séparablement rationnellement connexes. Nous montrons que pour N plus grand que 2q-1, l'hypersurface de Fermat de degré q+1 contient une courbe rationnelle très libre définie sur le sous-corps premier ; elle est donc séparablement rationnellement connexe.

From the time of the Greeks, primality testing and factoring have fascinated mathematicians, and for centuries following the Greeks primality testing and factorization were pursued by enthusiasts and professional mathematicians for their intrisic value. There was little practical application. One example application was to determine whether or not the Fermat numbers, that is, numbers of the form F;, = 2'" + 1 were prime. Fermat conjectured that for all n they were prime. For n = 1,2,3,4, the Fermat numbers are prime, but Euler showed that F; was not prime and to date no F,, n 2 5 has been found to be prime. Thus, for nearly 2000 years primality testing and factorization was largely pure mathematics. This all changed in the mid 1970's with the advent of public key cryptography. Large prime numbers are used in generating keys in many public key cryptosystems and the security of many of these cryptosystems depends on the difficulty of factoring numbers with large prime factors. Thus, the race was on to develop new algorithms to determine the primality or otherwise of a given large integer and to determine the factors of given large integers. The development of such algorithms continues today. This thesis develops both of these themes. The first part of this thesis deals with primality testing and after a brief introduction to primality testing a new probabilistic primality algorithm, ALI, is introduced. It is analysed in detail and compared to Fermat and Miller-Rabin primality tests. It is shown that the ALI algorithm is more efficient than the Miller-Rabin algorithm in some aspects. The second part of the thesis deals with factoring and after looking closely at various types of algorithms a new algorithm, RAK, is presented. It is analysed in detail and compared with Fermat factorization. The RAK algorithm is shown to be significantly more efficient than the Fermat factoring algorithm. A number of enhancements is made to the basic RAK algorithm in order to improve its performance. The RAK algorithm with its enhancements is known as IMPROVEDRAK. In conjunction with this work on factorization an improvement to Shor's factoring algorithm is presented. For many integers Shor's algorithm uses a quantum computer multiple times to factor a composite number into its prime factors. It is shown that Shor's alorithm can be modified in a way such that the use of a quantum computer is required just once. The common thread throughout this thesis is the application of factoring and primality testing techniques to integer types which commonly occur in public key cryptosystems. Thus, this thesis contributes not only in the area of pure mathematics but also in the very contemporary area of cryptology.

The target of the this diploma thesis called ''The Napoleon's theorem'' is a detailed concentration on this theorem, where the process of so called ''regularization'' is described. Under the investigation of the Napoleon's theorem this diploma thesis is concerned with a lot of proofs, properties and then their generalization in a plane and in space. Pictures, which can help the reader to understand this problem are supplemented in this diploma thesis.

The aim of this diploma thesis is to describe various methods for examining loci of points of given properties. I have chosen both the classical approach and new technologies such as dynamic geometry software GeoGebra or a programme from CAS (Computer Algebra System). The topic loci of points of given properties is often very difficult for pupils to understand, therefore it is important to look at it from various points of view, to choose interesting application tasks and thus motivate learners in their studies. In this paper I present several suggestions for more attractive and amusing ways of teaching this issue at primary, secondary and university level of education.

Submitted by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2018-04-06T15:56:31Z No. of bitstreams: 2 Dissertação - Daniel Sombra.pdf: 863251 bytes, checksum: 2067dbe00da7848645ffcf735b6a3068 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2018-04-06T15:56:42Z (GMT) No. of bitstreams: 2 Dissertação - Daniel Sombra.pdf: 863251 bytes, checksum: 2067dbe00da7848645ffcf735b6a3068 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2018-04-06T15:56:42Z (GMT). No. of bitstreams: 2 Dissertação - Daniel Sombra.pdf: 863251 bytes, checksum: 2067dbe00da7848645ffcf735b6a3068 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2018-03-22 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Number theory is branch from Mathematics hardly ever explored in elementary and middle school, almost nonexistent in high school. Its implementations and features in elementary and middle school narrow in divisibility principals, greatest common factor (GCF) and Euclidean algorithm. All presented in a plain and timid way. Nevertheless, number theory is a vast field in Mathematics, tightly related to algebra results. It consists of powerful tools to the resolutions of problems such as: Olympics, properties display and indirect implementations in other sciences. In this paper, it will be presented in a fair and concise, the most fundamental outcome related to number theory which do not need further studies to be understood. One familiarity with the properties of integers, the aspects of divisibility seen in elementary and middle school and notions of mathematical proof are sufficient to the knowledge of the main idea of this paper. The major results presented were: Euclidean algorithm, fundamental theorem of arithmetic, Fermat, Wilson and Euler’s theorem and Euler’s totient function . During demos, it will be presented exercises that exemplifies theory. Besides, there are 2 chapters concerning the resolution of Olympics problems, with the intentions to explore, in a smart way, the concepts presented during theory. / A teoria dos números é um ramo da Matemática praticamente inexplorado no ensino básico e quase inexistente Ensino Médio. As aplicações e propriedades no Ensino Fundamental se restringem aos critérios de divisibilidade, ao máximo divisor comum e ao Algoritmo de Euclides, apresentados de forma bastante elementar e tímida. Contudo a teoria dos números é um ramo bastante vasto dentro da Matemática, fortemente relacionada à resultados da Álgebra. Nela constituem-se ferramentas muito poderosas para a resolução de problemas de olimpíadas, demonstração de propriedades e aplicações indiretas em outras ciências. Neste trabalho são apresentados e demonstrados, de forma clara e concisa, os resultados mais fundamentais referentes à teoria dos números, os quais não precisam de estudos avançados na área para serem compreendidos. Uma familiaridade com as propriedades dos números inteiros, os aspectos de divisibilidade vistos na educação básica e noções de demonstração matemática são suficientes para que o leitor compreenda o escopo deste trabalho. Os principais resultados apresentados são: o Algoritmo de Euclides, o Teorema Fundamental da Aritmética, os Teoremas de Fermat, Wilson e Euler e a função de Euler. No transcorrer das demonstrações são apresentados exercícios que exemplificam a teoria. Além disso, são dedicados dois capítulos para resolução de problemas olímpicos, com a intenção de explorar de forma inteligente os conceitos apresentados no transcorrer da teoria.

Paul Tannery (1843-1904) est aujourd'hui considéré, par la communauté des historiens des sciences, comme une de ses figures patrimoniales. En effet, c'est déjà l'ampleur de sa production historique qui lui vaut cette notoriété, alors qu'il mène toute sa carrière dans les Manufactures de l'État. Coéditeur des Œuvres de Fermat et des Œuvres de Descartes, il est aussi un spécialiste des sciences antiques, dont notamment les trois ouvrages (Pour l'histoire de la science hellène, La Géométrie grecque, Recherches sur l'astronomie ancienne) font époque aux côtés de son édition des Opera omnia du mathématicien Diophante d'Alexandrie. À la fin du XIXe siècle, tandis que l'histoire des sciences se manifeste essentiellement en marge des sciences, en philosophie et dans des pratiques érudites, Paul Tannery revendique pleinement le titre d'historien. Et par là même, il appelle à l'autonomie de l'histoire des sciences, comme discours particulier sur la science, avec ses enjeux et ses méthodes propres. Mais, alors qu'il tient cette place au panthéon des historiens des sciences, celle-ci n'a été examinée et critiquée depuis un siècle, que par des études touchant surtout un point particulier de son historiographie, à savoir son plaidoyer pour une histoire générale des sciences. L'enjeu de notre thèse est de montrer la participation de l'œuvre de Tannery à l'invention du métier d'historien des sciences. Par une lecture globale de son œuvre redonnant une place de choix à ses travaux d'érudition, nous cherchons d'une part à éclairer sa pratique historienne de polytechnicien versé dans les humanités, de l'autre à caractériser son action en faveur de l'autonomie de l'histoire des sciences.