Add to ORKGKnowledge about discrete mathematics, number theory and polynomialsIn 1857, Bouniakowsky conjectured that if f(x) is an irreducible polynomial, f(x)/g.c.d(f(0),f(1)) generates an infinite number of primes. Dirichlet proved the conjecture for ax+b. Beyond that, neither proofs nor counterexamples are known. Here, a signed logplot is given for a variety of polynomials, with red dots indicating primesComponente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemátic
integer a # * 1, or a perfect square, there exist infinitely many primes p for which a is a primiti...
AbstractLet q be a prime power and Fq the finite field with q elements. We examine the existence of ...
International audienceThe Schinzel hypothesis essentially claims that finitely many irreducible poly...
Knowledge about discrete mathematics, number theory and polynomialsIn 1857, Bouniakowsky conjectured...
Any irreducible polynomial f(x) in [special characters omitted][x] such that the set of values f([sp...
AbstractA classical conjecture of Bouniakowsky says that a non-constant irreducible polynomial in Z[...
AbstractWe consider absolutely irreducible polynomialsf∈Z[x, y] with degxf=m, degyf=n, and heightH. ...
Dirichlet’s 1837 theorem that every coprime arithmetic progression a mod m contains infinitely many ...
Abstract. Schinzel’s Hypothesis H predicts that a family of irre-ducible polynomials over the intege...
Dirichlet in 1837 proved that for any a, q with (a, q) = 1 there are infinitely many primes p with ...
In this paper we prove the existence of infinite unit irreducible prime polynomials on the finite fi...
AbstractA conjecture of Chowla on the number of integers a between 1 and p − 1 for which the polynom...
The paper examines the conditions under which a second degree polynomial generates primes variable ...
I s there some polynomial f(z) in a variable z, with integer coefficients, that always generates pri...
summary:In this paper we generalize the method used to prove the Prime Number Theorem to deal with f...
integer a # * 1, or a perfect square, there exist infinitely many primes p for which a is a primiti...
AbstractLet q be a prime power and Fq the finite field with q elements. We examine the existence of ...
International audienceThe Schinzel hypothesis essentially claims that finitely many irreducible poly...
Knowledge about discrete mathematics, number theory and polynomialsIn 1857, Bouniakowsky conjectured...
Any irreducible polynomial f(x) in [special characters omitted][x] such that the set of values f([sp...
AbstractA classical conjecture of Bouniakowsky says that a non-constant irreducible polynomial in Z[...
AbstractWe consider absolutely irreducible polynomialsf∈Z[x, y] with degxf=m, degyf=n, and heightH. ...
Dirichlet’s 1837 theorem that every coprime arithmetic progression a mod m contains infinitely many ...
Abstract. Schinzel’s Hypothesis H predicts that a family of irre-ducible polynomials over the intege...
Dirichlet in 1837 proved that for any a, q with (a, q) = 1 there are infinitely many primes p with ...
In this paper we prove the existence of infinite unit irreducible prime polynomials on the finite fi...
AbstractA conjecture of Chowla on the number of integers a between 1 and p − 1 for which the polynom...
The paper examines the conditions under which a second degree polynomial generates primes variable ...
I s there some polynomial f(z) in a variable z, with integer coefficients, that always generates pri...
summary:In this paper we generalize the method used to prove the Prime Number Theorem to deal with f...
integer a # * 1, or a perfect square, there exist infinitely many primes p for which a is a primiti...
AbstractLet q be a prime power and Fq the finite field with q elements. We examine the existence of ...
International audienceThe Schinzel hypothesis essentially claims that finitely many irreducible poly...