Search Results - "Algorithms in number theory"

  • Showing 1 - 4 results of 4
Refine Results
  1. 1

    Algorithms in number theory by Sorenson, Jonathan Paul

    ISBN: 9798207607184
    Published: ProQuest Dissertations & Theses 01.01.1991
    “…This thesis discusses four sets of results on number theoretic algorithms. A positive integer $n$ is a perfect power if there exist integers $a,b$ $>$ 1 such…”
    Get full text
    Dissertation
  2. 2

    A constructive proof of scherk's theorem on the representation of primes by Shapiro, Jacob, Waxman, Jerry

    ISSN: 0020-7160, 1029-0265
    Published: Abingdon Gordon and Breach Science Publishers S.A 01.01.1994
    “…All of the known proofs of Scherk's theorem are existence proofs which are non-constructive, and don't provide a procedure for choosing the signs in Scherk's…”
    Get full text
    Journal Article
  3. 3

    THE GENERAL QUASI-ORDER ALGORITHM IN NUMBER THEORY by Hilton, Peter, Pedersen, Jean

    ISSN: 0161-1712, 1687-0425
    Published: Hindawi Limiteds 1986
    “…This paper deals with a generalization of the Binary Quasi-Order Theorem. This generalization involves a more complicated algorithm than (0.2)_t. Some remarks…”
    Get full text
    Journal Article
  4. 4

    Area-Delay-Efficeint FPGA Design of 32-bit Euclid's GCD based on Sum of Absolute Difference by Nabipour, Saeideh, Gholizade, Masoume, Nabipour, Nima

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 17.11.2022
    Published in arXiv.org (17.11.2022)
    “… This makes the GCD a fundamental algorithm in number theory, so a number of methods have been discovered to efficiently compute…”
    Get full text
    Paper