Log in

Relevant bibliographies by topics / Prime numbers theory / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Prime numbers theory.

Dissertations / Theses on the topic 'Prime numbers theory'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Prime numbers theory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Ho, Kwan-hung, and 何君雄. "On the prime twins conjecture and almost-prime k-tuples." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B29768421.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Anderson, Crystal Lynn. "An Introduction to Number Theory Prime Numbers and Their Applications." Digital Commons @ East Tennessee State University, 2006. https://dc.etsu.edu/etd/2222.

Full text

Abstract:

The author has found, during her experience teaching students on the fourth grade level, that some concepts of number theory haven't even been introduced to the students. Some of these concepts include prime and composite numbers and their applications. Through personal research, the author has found that prime numbers are vital to the understanding of the grade level curriculum. Prime numbers are used to aide in determining divisibility, finding greatest common factors, least common multiples, and common denominators. Through experimentation, classroom examples, and homework, the author has i

APA, Harvard, Vancouver, ISO, and other styles

3

Chan, Ching-yin, and 陳靖然. "On k-tuples of almost primes." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hdl.handle.net/10722/195967.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Maynard, James. "Topics in analytic number theory." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:3bf4346a-3efe-422a-b9b7-543acd529269.

Full text

Abstract:

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 s

APA, Harvard, Vancouver, ISO, and other styles

5

Shahabi, Majid. "The distribution of the classical error terms of prime number theory." Thesis, Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2012, 2012. http://hdl.handle.net/10133/3252.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kong, Yafang, and 孔亚方. "On linear equations in primes and powers of two." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hub.hku.hk/bib/B50533769.

Full text

Abstract:

It is known that the binary Goldbach problem is one of the open problems on linear equations in primes, and it has the Goldbach-Linnik problem, that is, representation of an even integer in the form of two odd primes and powers of two, as its approximate problem. The theme of my research is on linear equations in primes and powers of two. Precisely, there are two cases: one pair of linear equations in primes and powers of two, and one class of pairs of linear equations in primes and powers of two, in this thesis. In 2002, D.R. Heath-Brown and P.C. Puchta obtained that every sufficiently lar

APA, Harvard, Vancouver, ISO, and other styles

7

Rada, Ion Kolster Manfred. "The Lichtenbaum conjecture at the prime 2 /." *McMaster only, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bronder, Justin S. "The AKS Class of Primality Tests: A Proof of Correctness and Parallel Implementation." Fogler Library, University of Maine, 2006. http://www.library.umaine.edu/theses/pdf/BronderJS2006.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wodzak, Michael A. "Entire functions and uniform distribution /." free to MU campus, to others for purchase, 1996. http://wwwlib.umi.com/cr/mo/fullcit?p9823328.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Wilson, Keith Eirik. "Factoring Semiprimes Using PG2N Prime Graph Multiagent Search." PDXScholar, 2011. https://pdxscholar.library.pdx.edu/open_access_etds/219.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

11

Domingues, Riaal. "A polynomial time algorithm for prime recognition." Diss., Pretoria : [s.n.], 2006. http://upetd.up.ac.za/thesis/available/etd-08212007-100529.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Padilha, José Cleiton Rodrigues. "Números primos." Universidade Federal da Paraíba, 2013. http://tede.biblioteca.ufpb.br:8080/handle/tede/7534.

Full text

Abstract:

Submitted by Susiquine Silva (susi.bibliotecaufpb@hotmail.com) on 2015-10-20T13:41:36Z No. of bitstreams: 2 Arquivototal.pdf: 1918900 bytes, checksum: faffe2a0b39bb0b14b7718f5a5b1b326 (MD5) license_rdf: 22190 bytes, checksum: 19e8a2b57ef43c09f4d7071d2153c97d (MD5)<br>Rejected by Susiquine Silva (susi.bibliotecaufpb@hotmail.com), reason: Corrigir título. on 2015-10-20T14:44:19Z (GMT)<br>Submitted by Susiquine Silva (susi.bibliotecaufpb@hotmail.com) on 2015-10-20T14:46:20Z No. of bitstreams: 2 Arquivototal.pdf: 1918900 bytes, checksum: faffe2a0b39bb0b14b7718f5a5b1b326 (MD5) license_rdf: 22

APA, Harvard, Vancouver, ISO, and other styles

13

Clark, John. "On a conjecture involving Fermat's Little Theorem." [Tampa, Fla] : University of South Florida, 2008. http://purl.fcla.edu/usf/dc/et/SFE0002485.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Klembalski, Katharina. "Cryptography and number theory in the classroom -- Contribution of cryptography to mathematics teaching." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-80390.

Full text

Abstract:

Cryptography fascinates people of all generations and is increasingly presented as an example for the relevance and application of the mathematical sciences. Indeed, many principles of modern cryptography can be described at a secondary school level. In this context, the mathematical background is often only sparingly shown. In the worst case, giving mathematics this character of a tool reduces the application of mathematical insights to the message ”cryptography contains math”. This paper examines the question as to what else cryptography can offer to mathematics education. Using the RSA cry

APA, Harvard, Vancouver, ISO, and other styles

15

Buchanan, Dan Matthews. "Analytic Number Theory and the Prime Number Theorem." Youngstown State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1525451327211365.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Rigoti, Marcio Dominicali. "Números primos: os átomos dos números." Universidade Tecnológica Federal do Paraná, 2014. http://repositorio.utfpr.edu.br/jspui/handle/1/1075.

Full text

Abstract:

CAPES<br>Este trabalho apresenta um estudo sobre os Números Primos que passa por resultados básicos, como a infinitude dos números primos e o Teorema Fundamental da Aritmética, e resultados mais sofisticados, como o Teorema de Wilson e a consequente função geradora de primos. Além dos resultados teóricos apresenta-se uma interpretação geométrica para os números primos. Essa interpretação e aplicada na ilustração de alguns dos resultados relacionados a primos abordados no ensino básico. Atividades envolvendo a interpretação geométrica apresentada são sugeridas no capítulo final.<br>This work pr

APA, Harvard, Vancouver, ISO, and other styles

17

Vlasic, Andrew. "A Detailed Proof of the Prime Number Theorem for Arithmetic Progressions." Thesis, University of North Texas, 2004. https://digital.library.unt.edu/ark:/67531/metadc4476/.

Full text

Abstract:

We follow a research paper that J. Elstrodt published in 1998 to prove the Prime Number Theorem for arithmetic progressions. We will review basic results from Dirichlet characters and L-functions. Furthermore, we establish a weak version of the Wiener-Ikehara Tauberian Theorem, which is an essential tool for the proof of our main result.

APA, Harvard, Vancouver, ISO, and other styles

18

Hendi, Yacoub. "On The Prime Number Theorem." Thesis, Uppsala universitet, Analys och sannolikhetsteori, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-441288.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Fonseca, Rubens Vilhena. "Números primos e o Teorema Fundamental da Aritmética: uma investigação entre estudantes de licenciatura em Matemática." Pontifícia Universidade Católica de São Paulo, 2015. https://tede2.pucsp.br/handle/handle/11036.

Full text

Abstract:

Made available in DSpace on 2016-04-27T16:57:37Z (GMT). No. of bitstreams: 1 Rubens Vilhena Fonseca.pdf: 1601945 bytes, checksum: 9bd5a69dcacb920b758afcd188c86010 (MD5) Previous issue date: 2015-04-22<br>This work aims to analyze a didactic sequence directly linked to the research question, which sought to provide students an investigative route in order to find solutions to the problems raised, which are in the field of number theory, and are related to prime numbers and Fundamental Theorem of Arithmetic, objects of this research, developed with students of the degree course in mathematics

APA, Harvard, Vancouver, ISO, and other styles

20

Alazmi, Amal Abdullah. "The Prime Number Theorem: Elementary Results." Kent State University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1564916947385846.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Mullen, Woodford Roger. "Partitions into prime powers and related divisor functions." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/1246.

Full text

Abstract:

In this thesis, we will study a class of divisor functions: the prime symmetric functions. These are polynomials over Q in the so-called elementary prime symmetric functions, whose values lie in Z. The latter are defined on the nonnegative integers and take the values of the elementary symmetric functions applied to the multi-set of prime factors (with repetition) of an integer n. Initially we look at basic properties of prime symmetric functions, and consider analogues of questions posed for the usual sum of proper divisors function, such as those concerning perfect numbers or Aliquot sequen

APA, Harvard, Vancouver, ISO, and other styles

22

Siu, Wai-chuen. "Small prime solutions of some ternary equations /." Hong Kong : University of Hong Kong, 1995. http://sunzi.lib.hku.hk/hkuto/record.jsp?B17538191.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Alexander, Anita Nicole. "A HISTORY OF THE PRIME NUMBER THEOREM." Kent State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=kent1416827548.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Alghamdi, Maha Mosaad. "ANALYTIC PROOF OF THE PRIME NUMBER THEOREM." Kent State University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1550224160190008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Kawaguchi, Yuki. "Near Miss abc-Triples in General Number Fields." Kyoto University, 2019. http://hdl.handle.net/2433/242576.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Suresh, Arvind. "On the Characterization of Prime Sets of Polynomials by Congruence Conditions." Scholarship @ Claremont, 2015. http://scholarship.claremont.edu/cmc_theses/993.

Full text

Abstract:

This project is concerned with the set of primes modulo which some monic, irreducible polynomial over the integers has a root, called the Prime Set of the polynomial. We completely characterise these sets for degree 2 polynomials, and develop sufficient machinery from algebraic number theory to show that if the Galois group of a monic, irreducible polynomial over the integers is abelian, then its Prime Set can be written as the union of primes in some congruence classes modulo some integer.

APA, Harvard, Vancouver, ISO, and other styles

27

Henderson, Cory. "Exploring the Riemann Hypothesis." Kent State University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=kent1371747196.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

蕭偉泉 and Wai-chuen Siu. "Small prime solutions of some ternary equations." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1995. http://hub.hku.hk/bib/B31213595.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

BATTISTONI, FRANCESCO. "APPLICATIONS OF PRIME DENSITIES IN NUMBER THEORY AND CLASSIFICATION OF NUMBER FIELDS WITH BOUNDED INVARIANTS." Doctoral thesis, Università degli Studi di Milano, 2020. http://hdl.handle.net/2434/703505.

Full text

Abstract:

This Ph.D. thesis collects the author's works and interests in several parts of Number Theory, from algebraic problems related to relations between number fields which are based on the factorization of prime numbers in the rings of integers, up to the application of tools concerning the density of primes with given splitting type in number fields to the computation of the average rank of specific families of elliptic curves, concluding finally with the classification and estimate of the main invariants of a number field, like the discriminant and the regulator, pursued by means of analytic for

APA, Harvard, Vancouver, ISO, and other styles

30

Burns, Jonathan. "Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5193.

Full text

Abstract:

Recursion is a fundamental tool of mathematics used to define, construct, and analyze mathematical objects. This work employs induction, sieving, inversion, and other recursive methods to solve a variety of problems in the areas of algebraic number theory, topological and combinatorial graph theory, and analytic probability and statistics. A common theme of recursively defined functions, weighted sums, and cross-referencing sequences arises in all three contexts, and supplemented by sieving methods, generating functions, asymptotics, and heuristic algorithms. In the area of number theory, this

APA, Harvard, Vancouver, ISO, and other styles

31

Olofsson, Rikard. "Problems in Number Theory related to Mathematical Physics." Doctoral thesis, Stockholm : Engineering sciences, Kungliga Tekniska högskolan, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-9514.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Price, Jason. "Popescu's Conjecture in Multiquadratic Extensions." ScholarWorks @ UVM, 2009. http://library.uvm.edu/dspace/bitstream/123456789/213/1/Price%20Dissertation.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Richardson, Robert. "On the Number of Integers Expressible as the Sum of Two Squares." Connect to resource online, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1265123768.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Segarra, Elan. "An Exploration of Riemann's Zeta Function and Its Application to the Theory of Prime Distribution." Scholarship @ Claremont, 2006. https://scholarship.claremont.edu/hmc_theses/189.

Full text

Abstract:

Identified as one of the 7 Millennium Problems, the Riemann zeta hypothesis has successfully evaded mathematicians for over 100 years. Simply stated, Riemann conjectured that all of the nontrivial zeroes of his zeta function have real part equal to 1/2. This thesis attempts to explore the theory behind Riemann’s zeta function by first starting with Euler’s zeta series and building up to Riemann’s function. Along the way we will develop the math required to handle this theory in hopes that by the end the reader will have immersed themselves enough to pursue their own exploration and research in

APA, Harvard, Vancouver, ISO, and other styles

35

Green, Nathan Eric. "Integral Traces of Weak Maass Forms of Genus Zero Odd Prime Level." BYU ScholarsArchive, 2013. https://scholarsarchive.byu.edu/etd/4161.

Full text

Abstract:

Duke and Jenkins defined a family of linear maps from spaces of weakly holomorphic modular forms of negative integral weight and level 1 into spaces of weakly holomorphic modular forms of half integral weight and level 4 and showed that these lifts preserve the integrality of Fourier coefficients. We show that the generalization of these lifts to modular forms of genus 0 odd prime level also preserves the integrality of Fourier coefficients.

APA, Harvard, Vancouver, ISO, and other styles

36

Jacobsson, Mattias. "Bitwise relations between n and φ(n) : A novel approach at prime number factorization". Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-16655.

Full text

Abstract:

Cryptography plays a crucial role in today’s society. Given the influence, cryptographic algorithms need to be trustworthy. Cryptographic algorithms such as RSA relies on the problem of prime number factorization to provide its confidentiality. Hence finding a way to make it computationally feasible to find the prime factors of any integer would break RSA’s confidentiality. The approach presented in this thesis explores the possibility of trying to construct φ(n) from n. This enables factorization of n into its two prime numbers p and q through the method presented in the original RSA paper. T

APA, Harvard, Vancouver, ISO, and other styles

37

Fávaro, Eduardo Rogério [UNESP]. "Corpos cujo condutor é potência de primo: caracterização e reticulados ideais associados." Universidade Estadual Paulista (UNESP), 2012. http://hdl.handle.net/11449/100063.

Full text

Abstract:

Made available in DSpace on 2014-06-11T19:30:27Z (GMT). No. of bitstreams: 0 Previous issue date: 2012-08-02Bitstream added on 2014-06-13T18:40:35Z : No. of bitstreams: 1 favaro_er_dr_sjrp.pdf: 449730 bytes, checksum: 66f6b6e8876e035dcd2e6aa8db337bbd (MD5)<br>Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)<br>Este trabalho esta relacionado com a Teoria Algébrica dos Números e aplicações em Reticulados Ideais. Descrevemos os corp os cujo condutor e potência de primo. Quando o primo e dois, descrevemos tamb em o anel de inteiros. Quando o primo e mpar calculamos o discriminante d

APA, Harvard, Vancouver, ISO, and other styles

38

Gopalan, Parikshit. "Computing with Polynomials over Composites." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/11564.

Full text

Abstract:

In the last twenty years, algebraic techniques have been applied with great success to several areas in theoretical computer science. However, for many problems involving modular counting, there is a huge gap in our understanding depending on whether the modulus is prime or composite. A prime example is the problem of showing lower bounds for circuits with Mod gates in circuit complexity. Proof techniques that work well for primes break down over composites. Moreover, in some cases, the problem for composites turns out to be very different from the prime case. Making progress on these problem

APA, Harvard, Vancouver, ISO, and other styles

39

Fávaro, Eduardo Rogério. "Corpos cujo condutor é potência de primo : caracterização e reticulados ideais associados /." São José do Rio Preto : [s.n.], 2012. http://hdl.handle.net/11449/100063.

Full text

Abstract:

Orientador: Antonio Aparecido de Andrade<br>Coorientador: Trajano Pires da Nobrega Neto<br>Banca: Cleonice Fátima Bracciali<br>Banca: Reginaldo Palazzo Jr<br>Banca: Sueli Irene Rodrigues Costa<br>Banca: Carlile Campos Lavor<br>Resumo: Este trabalho esta relacionado com a Teoria Algébrica dos Números e aplicações em Reticulados Ideais. Descrevemos os corp os cujo condutor e potência de primo. Quando o primo e dois, descrevemos tamb em o anel de inteiros. Quando o primo e mpar calculamos o discriminante de um modo alternativo ao existente na literatura. Neste caso, e quando o corpo tem como grau

APA, Harvard, Vancouver, ISO, and other styles

40

Schlackow, Waldemar. "A sieve problem over the Gaussian integers." Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:b7d4ff88-1f93-41b4-9f81-055f8f1b1c51.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

41

Rezola, Nolberto. "Unique Prime Factorization of Ideals in the Ring of Algebraic Integers of an Imaginary Quadratic Number Field." CSUSB ScholarWorks, 2015. https://scholarworks.lib.csusb.edu/etd/205.

Full text

Abstract:

The ring of integers is a very interesting ring, it has the amazing property that each of its elements may be expressed uniquely, up to order, as a product of prime elements. Unfortunately, not every ring possesses this property for its elements. The work of mathematicians like Kummer and Dedekind lead to the study of a special type of ring, which we now call a Dedekind domain, where even though unique prime factorization of elements may fail, the ideals of a Dedekind domain still enjoy the property of unique prime factorization into a product of prime ideals, up to order of the factors. This

APA, Harvard, Vancouver, ISO, and other styles

42

Carvalho, Leandro Rodrigues de [UNESP]. "O uso de elementos da criptografia como estímulo matemático na sala de aula." Universidade Estadual Paulista (UNESP), 2016. http://hdl.handle.net/11449/138879.

Full text

Abstract:

Submitted by LEANDRO RODRIGUES DE CARVALHO null (leandrorodca@gmail.com) on 2016-05-20T19:48:46Z No. of bitstreams: 1 dissertacao-Leandro-profmat-2016.pdf: 1207301 bytes, checksum: 3605d67341c1a33446dc9c537f6b735e (MD5)<br>Rejected by Juliano Benedito Ferreira (julianoferreira@reitoria.unesp.br), reason: Foram realizadas suas submissões. Favor submeter novamente apenas uma vez com o arquivo correto. on 2016-05-24T14:34:08Z (GMT)<br>Submitted by LEANDRO RODRIGUES DE CARVALHO null (leandrorodca@gmail.com) on 2016-05-25T10:37:49Z No. of bitstreams: 1 dissertacao-Leandro-profmat-2016.pdf: 1207

APA, Harvard, Vancouver, ISO, and other styles

43

Silva, Hércules do Nascimento. "Poliedros Regulares no Ensino Médio." Universidade Federal da Paraíba, 2014. http://tede.biblioteca.ufpb.br:8080/handle/tede/8042.

Full text

Abstract:

Submitted by Maike Costa (maiksebas@gmail.com) on 2016-03-28T12:29:14Z No. of bitstreams: 1 arquivototal.pdf: 800250 bytes, checksum: 42e76ab05ea580b4fd24a3312b9b4212 (MD5)<br>Made available in DSpace on 2016-03-28T12:29:14Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 800250 bytes, checksum: 42e76ab05ea580b4fd24a3312b9b4212 (MD5) Previous issue date: 2014-08-29<br>In this work we present a study of the regular polyhedra, comparing and discussing the concepts and de nitions given in the study of regular polyhedra in textbooks most widely used in Brazilian high schools. We prove the th

APA, Harvard, Vancouver, ISO, and other styles

44

Filho, José Rubens Almeida Leme. "Estudo comparativo dos métodos de determinação e de estimativa dos teores de fibra e de açúcares redutores em cana-de-açúcar (Saccharum spp.)." Universidade de São Paulo, 2006. http://www.teses.usp.br/teses/disponiveis/11/11141/tde-03032006-152805/.

Full text

Abstract:

O objetivo desse trabalho foi estudar os métodos de determinação e de estimativa dos teores de fibra da cana-de-açúcar (Saccharum spp.) e de açúcares redutores no caldo de cana, análises de fundamental importância para o cálculo do teor de açúcar total recuperável (ATR), que é o parâmetro que rege o sistema atual de pagamento de cana do CONSECANA. Quanto ao teor de fibra da cana, foi desenvolvido um novo método, modificado do método original da prensa hidráulica, com o objetivo de corrigir o erro decorrente do uso do brix do caldo extraído como estimativa do teor de sólidos solúveis do caldo n

APA, Harvard, Vancouver, ISO, and other styles

45

Hayani, Mounir. "Répartition probabiliste des nombres et idéaux premiers : conjecture de Hooley et biais de Chebyshev." Electronic Thesis or Diss., Bordeaux, 2025. http://www.theses.fr/2025BORD0065.

Full text

Abstract:

Cette thèse s'intéresse à deux sujets importants en théorie analytique des nombres : le biais de Chebyshev dans les corps des nombres et la variance des nombres premiers dans les progressions arithmétiques. Le biais de Chebyshev désigne le fait que les nombres premiers tendent à favoriser certaines classes de résidus par rapport à d'autres. Ce phénomène a été observé pour la première fois par Chebyshev dans le cadre classique de la répartition des nombres premiers modulo 4 et a ensuite été étudié de façon systématique par Rubinstein et Sarnak via la notion de distribution limite et les zéros d

APA, Harvard, Vancouver, ISO, and other styles

46

Alvites, José Carlos Valencia. "Hipótese de Riemann e física." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-13042012-084309/.

Full text

Abstract:

Neste trabalho, introduzimos a função zeta de Riemann \'ZETA\'(s), para s \'PERTENCE\' C \\ e apresentamos muito do que é conhecido como justificativa para a hipótese de Riemann. A importância de \'ZETA\' (s) para a teoria analítica dos números é enfatizada e fornecemos uma prova conhecida do Teorema dos Números Primos. No final, discutimos a importância de \'ZETA\'(s) para alguns modelos físicos de interesse e concluimos descrevendo como a hipótese de Riemann pode ser acessada estudando estes sistemas<br>In this work, we introduce the Riemann zeta function \'ZETA\'(s), s \'IT BELONGS\' C \\

APA, Harvard, Vancouver, ISO, and other styles

47

Goudout, Elie. "Étude de la fonction ω : petits intervalles et systèmes translatés". Thesis, Sorbonne Paris Cité, 2019. http://www.theses.fr/2019USPCC040.

Full text

Abstract:

Dans cette thèse, on s’intéresse à l’interaction entre les structures multiplicative et additive des entiers. Pour cela, on étudie notamment la fonction « nombre de facteurs premiers distincts », notée ω, dans de très petits intervalles, mais aussi sur des systèmes translatés. Ce projet est né suite à une importante percée de Matomäki & Radziwiłł dans l’étude des petits intervalles, en 2015. Dans un premier temps, on démontre que le théorème d’Erdős-Kac est vérifié dans presque tous les petits intervalles, dès lors que leur taille tend vers l’infini. On s’intéresse ensuite aux lois locales

APA, Harvard, Vancouver, ISO, and other styles

48

Gozé, Vincent. "Une version effective du théorème des nombres premiers de Wen Chao Lu." Electronic Thesis or Diss., Littoral, 2024. http://www.theses.fr/2024DUNK0725.

Full text

Abstract:

Le théorème des nombres premiers, démontré pour la première fois en 1896 à l'aide de l'analyse complexe, donne le terme principal pour la répartition asymptotique des nombres premiers. Ce n'est qu'en 1949 que la première démonstration dite "élémentaire" fut publiée : elle repose uniquement sur l'analyse réelle. En 1999, Wen Chao Lu a obtenu de manière élémentaire un terme d'erreur dans le théorème des nombres premiers très proche de celui fourni par la région sans zéro de la fonction zêta de Riemann donnée par La Vallée Poussin à la fin du XIXe siècle. Dans cette thèse, nous rendons explicite

APA, Harvard, Vancouver, ISO, and other styles

49

Lewis, Elizabeth Faith. "Peter Guthrie Tait : new insights into aspects of his life and work : and associated topics in the history of mathematics." Thesis, University of St Andrews, 2015. http://hdl.handle.net/10023/6330.

Full text

Abstract:

In this thesis I present new insights into aspects of Peter Guthrie Tait's life and work, derived principally from largely-unexplored primary source material: Tait's scrapbook, the Tait–Maxwell school-book and Tait's pocket notebook. By way of associated historical insights, I also come to discuss the innovative and far-reaching mathematics of the elusive Frenchman, C.-V. Mourey. P. G. Tait (1831–1901) F.R.S.E., Professor of Mathematics at the Queen's College, Belfast (1854–1860) and of Natural Philosophy at the University of Edinburgh (1860–1901), was one of the leading physicists and mathema

APA, Harvard, Vancouver, ISO, and other styles

50

Achuo, George. "Partner satisfaction and renewal likelihood in consumer supported agriculture (CSA) : a case study of The Equiterre CSA network." Thesis, McGill University, 2003. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=19555.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!