• On prime representing polynomials

    • Fulltext


        Click here to view fulltext PDF

      Permanent link:

    • Keywords


      Primes; polynomials

    • Abstract


      A heuristic method is presented to determine the number of primesp ≤x, represented by an irreducible polynomialf(n), without non-trivial fixed factor (f(y)<∈Z[y]; n∈Z. The method is applied to two specific polynomials and the results are compared with those of the heuristic approach of Hardy and Littlewood.

    • Author Affiliations


      Emil Grosswald1

      1. Department of Mathematics, Temple University, Computer Building 038-16, Philadelphia, Pennsylvania - 19122, USA
    • Dates

  • Proceedings – Mathematical Sciences | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2017-2019 Indian Academy of Sciences, Bengaluru.