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 1 of 1 for “"Prime-Producing Polynomials"”.

  1. Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability

    … presentation of two binary quadratic forms. Polynomials for which the polynomial-value sieving yields all possible integer factorizations of the polynomial values are called recursively-factorable. The Euler and Legendre prime producing polynomials of the form n2+n+p and 2n2+p, respectively, …

    usf Repository record for Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability (opens in a new tab)