Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 108 for “"Prime number"”.

  1. The prime number theorem

    … 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 …

    bu Repository record for The prime number theorem (opens in a new tab)

  2. The prime number theorem

    Thesis (M.A.)--Boston University

    bu Repository record for The prime number theorem (opens in a new tab)

  3. Microcomputer Algorithms for Prime Number Testing

    This paper gives a survey of different methods of prime number testing. Emphasis has been given to algorithms based upon Fermat's Theorem: if p is an odd prime number, then p divides ap-a. All of the computer programs described in this paper have been written for use on microcomputers and so the …

    utahstate Repository record for Microcomputer Algorithms for Prime Number Testing (opens in a new tab)

  4. Prime and Quasi-Prime Number Races

    "We review the body of work done on prime number races, specifically the results involving infinitely many lead changes in prime number races. We describe a computational way of showing that any race has infinitely many lead changes and greatly expand the known results in this area. An extension of …

    uiuc Repository record for Prime and Quasi-Prime Number Races (opens in a new tab)

  5. The prime number theorem: Analytic and elementary proofs

    Three proofs of the prime number theorem are presented. The �rst is a heavily analytic proof based on early accounts. Cauchy's residue theorem and various results relating to the Riemann zeta function play a vital role. A weaker result than the prime number theorem is used for the proof, namely …

    maynooth Download PDF for The prime number theorem: Analytic and elementary proofs (opens in a new tab)

  6. Prime number-based hierarchical data labeling scheme for relational databases

    … relationships between nodes. There exist a number of different ways to capture and manage hierarchical data while preserving such relationships. For instance, one may use a custom system designed for a specific kind of hierarchy. Object oriented databases may also be used to model …

    ku Repository record for Prime number-based hierarchical data labeling scheme for relational databases (opens in a new tab)

  7. Prime Number-Based Hierarchical Data Labeling Scheme for Relational Databases

    … relationships between nodes. There exist a number of different ways to capture and manage hierarchical data while preserving such relationships. For instance, one may use a custom system designed for a specific kind of hierarchy. Object oriented databases may also be used to model …

    ku Repository record for Prime Number-Based Hierarchical Data Labeling Scheme for Relational Databases (opens in a new tab)

  8. A Detailed Proof of the Prime Number Theorem for Arithmetic Progressions

    … 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 …

    unt Repository record for A Detailed Proof of the Prime Number Theorem for Arithmetic Progressions (opens in a new tab)

  9. The distribution of the classical error terms of prime number theory

    [Please see thesis for abstract.]

    lethbridge Repository record for The distribution of the classical error terms of prime number theory (opens in a new tab)

  10. The Least Prime Number That Splits Completely In S3-Sextic Number Fields

    In number theory, an integer n is quadratic residue modulo an odd prime p if n is congruent to a perfect square modulo p. Otherwise, n is is called a quadratic nonresidue. Bounding the least prime quadratic residue and the least quadratic nonresidue are two very classical problems in number theory. …

    mississippi Repository record for The Least Prime Number That Splits Completely In S3-Sextic Number Fields (opens in a new tab)

  11. Various Topics in Analytic Number Theory

    … count and study the asymptotic behaviour of the number of distinct conjugacy classes of matrix solutions a given polynomial has. We also formulate the dimension of the conjugacy class of a given matrix as a manifold and study the asymptotic behaviour of the average dimension among classes of …

    unsw Repository record for Various Topics in Analytic Number Theory (opens in a new tab)

  12. Historic development of prime numbers

    … of this thesis is to investigate the history of prime numbers and development of prime number theory. There are three major sections to this thesis, Ancient times, Dark Ages, and Modern times. The ancient time's section has topics on the `Ishango Bone', `Rhine Papyrus' with an investigation of …

    twu Repository record for Historic development of prime numbers (opens in a new tab)

  13. Systematic Composition and Intuition in a Concerto for Organ and Orchestra

    … of decimals that are created from certain prime-number denominators, and focuses on the prime number 17. Shows how these decimals can be transformed by converting them to different number bases. Looks at the Golden Proportion and its use in creating formal structures. Examines compositional …

    unt Repository record for Systematic Composition and Intuition in a Concerto for Organ and Orchestra (opens in a new tab)

  14. Lygiakraščio trikampio dalijimas į lygius trikampius /

    Let N > 3 be any prime number. This paper presents proof according to the work of [2], that it is impossible to cut equilateral triangle into N tiles.

    vilnius Repository record for Lygiakraščio trikampio dalijimas į lygius trikampius / (opens in a new tab)

  15. On the Theory of Zeta-functions and L-functions

    … formulations and approaches to the proof of the Prime Number Theorem and the Riemann Hypothesis. These two topics constitute the main theme of this thesis. For the Prime Number Theorem, we provide a thorough discussion that compares and contrasts Norbert Wiener's proof with that of Newman's short …

    ucf Repository record for On the Theory of Zeta-functions and L-functions (opens in a new tab)

  16. Explicit Estimates for Functions of Primes in Arithmetic Progressions

    … numerical estimates for the error term in the prime number theorem for arithmetic progressions, and Waring's problem for cubes.

    uiuc Repository record for Explicit Estimates for Functions of Primes in Arithmetic Progressions (opens in a new tab)

  17. Isolated Curves for Hyperelliptic Curve Cryptography

    … and give conditions under which the index is a prime number or an almost prime number for three different categories of quartic CM fields. We also derived heuristic asymptotic results on the densities and distributions of isolated genus two curves with CM by any fixed quartic CM field. …

    washington Repository record for Isolated Curves for Hyperelliptic Curve Cryptography (opens in a new tab)

  18. Elioto tipo ribinė teorema Dirichlė L funkcijoms analizinių funkcijų erdvėje /

    … space of analytic functions when q →∞ (q is a prime number).

    vilnius Repository record for Elioto tipo ribinė teorema Dirichlė L funkcijoms analizinių funkcijų erdvėje / (opens in a new tab)

Page 1 of 6