No description available.

In this thesis a heuristic method for factoring semiprimes by multiagent depth-limited search of PG2N graphs is presented. An analysis of PG2N graph connectivity is used to generate heuristics for multiagent search. Further analysis is presented including the requirements on choosing prime numbers to generate 'hard' semiprimes; the lack of connectivity in PG1N graphs; the counts of spanning trees in PG2N graphs; the upper bound of a PG2N graph diameter and a conjecture on the frequency distribution of prime numbers on Hamming distance. We further demonstrated the feasibility of the HD2 breadth first search of PG2N graphs for factoring small semiprimes. We presented the performance of different multiagent search heuristics in PG2N graphs showing that the heuristic of most connected seedpick outperforms least connected or random connected seedpick heuristics on small PG2N graphs of size N

Thesis (Ph.D. (Mathematics)) -- University of Limpopo, 2021 / A finite group G is called (l, m, n)-generated, if it is a quotient group of the triangle group T(l, m, n) = x, y, z|xl = ym = zn = xyz = 1-. In [43], Moori posed the question of finding all the (p, q, r) triples, where p, q and r are prime numbers, such that a non-abelian finite simple group G is a (p, q, r)-generated. In this thesis, we will establish all the (p, q, r)-generations of the following groups, the Mathieu sporadic simple group M23, the alternating group A11 and the symplectic group Sp(6, 2). Let X be a conjugacy class of a finite group G. The rank of X in G, denoted by rank(G : X), is defined to be the minimum number of elements of X generating G. We investigate the ranks of the non-identity conjugacy classes of the above three mentioned finite simple groups. The Groups, Algorithms and Programming (GAP) [26] and the Atlas of finite group representatives [55] are used in our computation / University of Limpopo

Au cours de cette thèse nous nous intéressons à des orthogonalités asymptotiques (au sens ou le produit scalaire dans le tore discret de taille N tend vers 0 lorsque N tend vers l’infini) entre certaines fonctions liées aux blocs des chiffres des entiers et la fonction de Möbius (ainsi qu’avec la fonction de von Mangoldt). Ces travaux prolongent ceux de Mauduit et Rivat et répondent partiellement à une question de Kalai posée en 2012. Au cours du Chapitre 1 nous établissons ces estimations asymptotiques dans le cas où la fonction étudiée est une fonction exponentielle d’une fonction qui compte les blocs de chiffres consécutifs ou espacés de taille k fixé dans l’écriture de n en base q. Nous donnons aussi une grande classe de polynômes agissant sur les blocs de chiffres qui nous fournissent un théorème des nombres premiers et une orthogonalité asymptotique avec la fonction de Möbius. Dans le Chapitre 2, nous obtenons un principe d’aléa de Möbius avec dans le cas où notre fonction est une fonction exponentielle d’une fonction qui compte les blocs de ‘1’ consécutifs dans l’écriture de n en base 2, où la taille du bloc est une application croissante tendant vers l’infini, mais avec une certaine restriction de croissance. Dans le cas extrémal, que nous ne pouvons pas traiter, ce problème est lié à l’estimation du nombre de nombres premiers dans la suite des nombres de Mersenne. Dans le Chapitre 3, nous donnons des estimations dans le cas où la fonction est l’exponentielle d’une fonction qui compte les blocs de k ‘1’ dans l’écriture de n en base 2 où k est grand par rapport à log N. Une conséquence du Chapitre 3 est que les résultats du Chapitre 1 sont quasi optimaux. / Throughout this thesis, we are interested in asymptotic orthogonality (in the sense that the scale product of the discrete torus of length N tends to zero as N tend to infinity) between some functions related to the blocks of digits of integers and the Möbius function (and also the von Mangoldt function). Our work extends previous results of Mauduit and Rivat, and gives a partial answer to a question posed by Kalai in 2012. Chapter 1 provides estimates in the case of the function is the exponential of a function taking values on the blocks (with and without wildcards) of length k (k fixed) in the digital expansion of n in base q. We also give a large class of polynomials acting on the digital blocks that allow to get a prime number theorem and asymptotic orthogonality with the Möbius function. In Chapter 2, we get an asymptotic formula in the case of our function is the exponential of the function which counts blocks of consecutive ‘1’s in the expansion of n in base 2, where the length of the block is an increasing function that tends (slowly) to infinity. In the extremal case, which we cannot handle, this problem is connected to estimating the number of primes in the sequences of Mersenne numbers. In Chapter 3, we provides estimates on the case of the function is the exponential of a function which count the blocks of k ‘1’s in the expansion of n in base 2 where k is large with respect to log N. A consequence of Chapter 3 is that the results of Chapter 1 are quasi-optimal.

Made available in DSpace on 2017-07-21T20:56:28Z (GMT). No. of bitstreams: 1 Jose Robyson Aggio Molinari.pdf: 837254 bytes, checksum: a577b2742ab4df347179d61529e63767 (MD5) Previous issue date: 2016-02-03 / This study presents some of the encryption methods used in antiquity as well as the advance in the way of encrypting. The main objective of this work is the study of RSA Method: its Historical context, the importance of prime numbers, the inefficiency of factorization algorithms, coding, decoding, its security and a study of the Euler function. Some activities with mathematical content related to encryption have been developed. Thus, it is expected that this research can present an auxiliary methodology for teaching certain math content, linked to the utilization of cryptography. / Este trabalho apresenta alguns métodos de criptografia utilizados na antiguidade e também o avanço na maneira de criptografar. O objetivo principal é o estudo do Método RSA: contextualização histórica, a importância dos números primos, a ineficiência dos algoritmos de fatoração, codificação, decodificação, a segurança e um estudo sobre a função de Euler. Desenvolveu-se algumas atividades com conteúdos matemáticos relacionadas à criptografia. Desta maneira, espera-se que esta pesquisa possa apresentar uma metodologia auxiliar para o ensino de certos conteúdos da matemática, articulados com a utilização da criptografia.

Estudamos a criptografia RSA como uma importante aplicação dos números primos e da aritmética modular. Apresentamos algumas sugestões de atividades relacionadas ao tema a serem desenvolvidas em sala de aula nas séries finais do ensino fundamental / We studied RSA cryptography as an important application to prime numbers and modular arithmetic. We present some suggestions of activities related to the subject to be developed in classrooms of the final years of elementary school vii

No description available.

The goal of this thesis is to present the pretentious approach to analytic number theory recently developed by Granville, Soundararajan, and others. In the first four chapters, we show the classical proof of the prime number theo- rem. We then develop the pretentious approach, explain its differences, advan- tages, and disadvantages and present another proof of the prime number theorem based on Hal'asz's theorem. This theorem is then proven using new techniques of Granville, Harper, and Soundararajan, which are substantially easier than the previous proofs. In the last chapter, we show how pretentious techniques can be used to obtain more intuitive proofs of other classical theorems or obtain new results. 1

Submitted by Natalia Ojeda Mastronicola null (naty.mastronicola@yahoo.com.br) on 2016-03-14T01:37:28Z No. of bitstreams: 1 Dissertação Natalia Ojeda Mastronicola com ficha catalografica.pdf: 2397628 bytes, checksum: dcd1a480f60fabba28224e1631cdfc2c (MD5) / Approved for entry into archive by Ana Paula Grisoto (grisotoana@reitoria.unesp.br) on 2016-03-15T12:16:55Z (GMT) No. of bitstreams: 1 mastronicola_no_me_sjrp.pdf: 2397628 bytes, checksum: dcd1a480f60fabba28224e1631cdfc2c (MD5) / Made available in DSpace on 2016-03-15T12:16:55Z (GMT). No. of bitstreams: 1 mastronicola_no_me_sjrp.pdf: 2397628 bytes, checksum: dcd1a480f60fabba28224e1631cdfc2c (MD5) Previous issue date: 2016-02-15 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Neste trabalho, utilizamos aplicativos para smartphones e tablets (apps) no ensino da Aritmética, abordando tópicos como divisibilidade através da decomposição em fatores primos; mínimo múltiplo comum e máximo divisor comum. Este trabalho foi desenvolvido junto aos alunos do Ensino Fundamental. Além disso, tratamos também de temas normalmente não trabalhados no Ensino Básico como Teorema de Bézout e Função de Euler. O uso desses aplicativos aproveita-se dessa crescente tecnologia em poder dos alunos, auxiliando a aprendizagem de forma inovadora e tornando-a mais atraente. / In this work, we use some special apps for smartphones and tablets to teach Arithmetic, covering topics such as divisibility, prime decomposition of numbers, least common multiple and greatest common divisor. This study was developed with the students of elementary school. We also treat topics which are not normally worked in basic Education as Bézout's theorem and Euler function. We notice the use of these apps in the classroom brought more enthusiasm for students.

Submitted by ANA KARLA PEREIRA RODRIGUES (anakarla_@hotmail.com) on 2017-08-29T15:44:42Z No. of bitstreams: 1 arquivototal.pdf: 691607 bytes, checksum: 68ddd45857d5c0c6e60229a957089adf (MD5) / Approved for entry into archive by Fernando Souza (fernandoafsou@gmail.com) on 2017-08-29T15:47:36Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 691607 bytes, checksum: 68ddd45857d5c0c6e60229a957089adf (MD5) / Made available in DSpace on 2017-08-29T15:47:36Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 691607 bytes, checksum: 68ddd45857d5c0c6e60229a957089adf (MD5) Previous issue date: 2014-08-01 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / This work presents a study of prime numbers, how they are distributed, how many prime numbers are there between 1 and a real number x, formulas that generate primes, and a generalization to Bertrand's Postulate. Six proofs that there are in nitely many primes using reductio ad absurdum, Fermat numbers, Mersenne numbers, Elementary Calculus and Topology are discussed. / Este trabalho apresenta um estudo sobre os números primos, como estão distribu ídos, quantos números primos existem entre 1 e um número real x qualquer, fórmulas que geram primos, além de uma generalização para o Postulado de Bertrand. São abordadas seis demonstrações que mostram que existem in nitos números primos usando redução ao absurdo, Números de Fermat, Números de Mersenne, Cálculo Elementar e Topologia.