Counting integers representable as images of polynomials modulo n

2018/12/30 by Arias, Fabián, Borja, Jerson, Rubio, Luis
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1812.11599

Abstract

Given a polynomial f(x₁,x₂,…, x_t) in t variables with integer coefficients and a positive integer n, let α(n) be the number of integers 0≤ a

Related

• Representing integers by multilinear polynomials
• Counting polynomials with positive roots
• A Plethora of Polynomials: A Toolbox for Counting Problems
• Counting Polynomial Roots in Isabelle/HOL: A Formal Proof of the Budan-Fourier Theorem
• Counting factorisations of monomials over rings of integers modulo N