All Questions
13 questions
5
votes
1
answer
392
views
Divergence of primes dividing polynomials
Let $Q : \mathbb{Z} \rightarrow \mathbb{Z}$ be a polynomial. Form the set
$$M_{Q} := \{p:\text{ }p\text{ is prime, }\exists n_{p}\in \mathbb{Z}\text{ so that }p|Q(n_{p})\}$$
Is $$\sum_{s \in M_{Q}}\...
- 227
5
votes
0
answers
205
views
Is there a polynomial version of Wilson's theorem which can avoid Cramer flavored conjectures?
Wilson's theorem states that a natural number $n > 1$ is a prime number if and only if the product of all the positive integers less than $n$ is one less than a multiple of $n$.
Is there a version ...
- 13.9k
-2
votes
1
answer
181
views
Polynomials of minimum degree that interpolate primes in intervals
Given an interval $[a,b]$ what is the minimum degree of univariate polynomials in $\mathbb Q[x]$ that passes through all primes between $a$ and $b$ (denoted by $\mathbb P[a,b]$ with total number of ...
- 1,826
2
votes
0
answers
84
views
quadratic residues and cubic polynomials [closed]
I'm really not sure about this, but I've heard somewhere that for any prime $p$,
$|\sum_{x=0}^{p-1} (\frac{ax^3 +bx^2 +cx +d}{p} ) |\le \sqrt{2p}$ holds.
Does anyone know a proof for this inequality ...
- 141
0
votes
1
answer
356
views
A sufficient condition for a set of primes to be the set of reducibility of an integer polynomial
Let $P$ be the set of all positive primes. Let $S$ an arbitrary infinite subset of $P$ satisfying the following assumption: there exists a finite Galois extension $K$ of $\mathbb{Q}$ and a conjugacy ...
user145520
0
votes
1
answer
137
views
A density zero set of primes dividing the values of a non-constant integer polynomial
For a given $P\in \mathbb{Z}[x]$ call a positive prime $p$ good if there exists $n\in \mathbb{Z}$ such that $p$ divides $P(n)$. Does there exist a non-constant $P$ such that the set of good primes has ...
user145520
2
votes
0
answers
121
views
How to choose a prime p s.t. n-th cyclotomic polynomial splits into as much as possible irreducible polynomials while p is almost constant size?
The reason I ask this question is that cyclotomic polynomial is critical to the construction of lattice-based cryptography. In most of the existing lattice-based cryptographic schemes, $n$ is usually ...
- 33
1
vote
0
answers
202
views
Prime generating polynomials
Continuation to this previous question.
According to Lemke-Oliver, an irreducible polynomial $G$ of degree $g$ with positive leading coefficient and $\Gamma_G\neq0$ (with $\Gamma_G$ a certain factor ...
- 195
9
votes
0
answers
324
views
Semi-primes represented by quadratic polynomials
According to Lemke-Oliver, irreducible quadratic polynomials $G$ with positive leading coefficient and $\rho(2)<2$, (where $\rho(m)$ denotes the number of incongruent solutions to the congruence $G(...
- 195
6
votes
1
answer
665
views
On the distribution of roots modulo primes of an integral polynomial
For motivation and related questions, see below.
Rough sketch of the question.
View $\bigsqcup_{p \text{ prime}} (\mathbb{Z}/p\mathbb{Z})$ as a ‘subset’ of the unit circle, via $a\pmod{p} \mapsto e^{...
- 83
8
votes
1
answer
1k
views
An elementary lower bound on the number of primes
Recall the second Chebyshev function: $$\psi(x) = \sum_{p \leq x} \lfloor \log_p x \rfloor \log p$$ where $x$ is a positive integer, and $p$ runs over all primes $\leq x$.
In a hunt for an "...
- 11.3k
17
votes
3
answers
2k
views
About the prime divisors of values of polynomials
Let $P$ be a polynomial having integer coefficients (and degree $\geq 3$), and let $\mathscr P_P$ be the set of prime numbers dividing some value $P(n)$ with $n \in \mathbb Z$.
Is it true that $\...
- 3,866
12
votes
1
answer
1k
views
Least prime $p$ such that an irreducible polynomial of degree $n$ has no root modulo $p$?
This question is inspired by an old question of Greg Kuperberg, about how small is the first prime $p$ which makes a given monic polynomial $P$ with integral coefficient have a (simple) root modulo $p$...
- 26k