Primes and Bivariate Polynomials without Constant Terms: A Recursive Algorithm

TL;DR

This paper presents a recursive, elementary algorithm to determine whether bivariate polynomials with non-negative coefficients and no constant term can produce prime values, improving understanding of prime-representing polynomial forms.

Contribution

Introduces a new recursive algorithm that efficiently certifies when certain bivariate polynomials cannot produce prime values, surpassing classical necessary conditions.

Findings

Algorithm effectively certifies non-prime-producing polynomials

Applicable to a wide class of polynomial forms, including transformations

Analyzes complexity and discusses connections to conjectures

Abstract

We investigate the computational problem of determining whether a bivariate polynomial with non-negative coefficients and no constant term can attain a prime value. While classical conjectures such as Bouniakowsky's provide necessary conditions for univariate prime-representing polynomials, we introduce a new recursive algorithm that efficiently certifies when a bivariate polynomial form can produce no prime values at all. Our method is elementary and constructive, based on analyzing gcd-divisibility patterns arising from recursive substitutions into the polynomial. The obstruction criterion obtained leads to an efficient and elementary algorithm that certifies when a polynomial form cannot produce any prime values. The result is stronger than what is implied by the negation of Bouniakowsky's condition and applies to a wide class of polynomials, including transformations of univariate forms. We provide illustrative examples, analyze the complexity of the method, and discuss its connections to existing conjectures and possible generalizations.