Counting irreducible binomials over finite fields

DOI10.1016/j.ffa.2015.12.001zbMath1371.11150arXiv1504.01172OpenAlexW2962798769MaRDI QIDQ2634386

Randell Heyman, Igor E. Shparlinski

Publication date: 9 February 2016

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.01172

zbMATH Keywords

finite fieldsprimes in arithmetic progressionsirreducible binomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Related Items (1)

The estimated number of irreducible binomials

Cites Work

• Explicit factorization of \(x^n-1\in \mathbb {F}_q[x\)]
• A low complexity probabilistic test for integer multiplication
• Explicit theorems on generator polynomials
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• An elementary method in prime number theory
• Sur une somme liée à la fonction de Möbius.
• On the Brun–Titchmarsh theorem
• Permutation binomials over finite fields
• ON PERMUTATION BINOMIALS OVER FINITE FIELDS
• Kloosterman sums in residue rings
• Irreducible polynomials with several prescribed coefficients
• On primes in arithmetic progressions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting irreducible binomials over finite fields