Related papers: Largest Prime Factors of Polynomials

Let M denote the maximal function along the polynomial curve p(t)=(t,t^2,...,t^d) in R^d: M(f)=sup_{r>0} (1/2r) \int_{|t|<r} |f(x-p(t))| dt. We show that the L^2-norm of this operator grows at most logarithmically with the parameter d:…

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Suppose that an infinite set $A$ occupies at most $\frac{1}{2}(p+1)$ residue classes modulo $p$, for every sufficiently large prime $p$. The squares, or more generally the integer values of any quadratic, are an example of such a set. By…

Let $\mathbf{X}_p=(\mathbf{s}_1,...,\mathbf{s}_n)=(X_{ij})_{p \times n}$ where $X_{ij}$'s are independent and identically distributed (i.i.d.) random variables with $EX_{11}=0,EX_{11}^2=1$ and $EX_{11}^4<\infty$. It is showed that the…

By recent work of the author, Wilson's theorem as well as the Wilson quotient can be described by supercongruences of power sums of Fermat quotients modulo every higher prime power. We translate these congruences into congruences of power…

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

Under the assumption of Heath-Brown's conjecture on the first prime in an arithmetic progression, we prove that there are infinitely many Carmichael numbers $n$ such that the number of prime factors of $n$ is prime.

We attempt to quantify the exact proportion of monic $p$-adic polynomials of degree $n$ which are irreducible. We find an exact answer to this when $n$ is prime and $p \neq n$, and also when $n = 4$ and $p \neq 2$. Our answers are rational…

We prove that for every positive integer $k$ there exist an inclusion-exclusion polynomial $Q_{\{q_1,q_2,...,q_k\}}$ with the height at least $c^{2^k}\prod_{j=1}^{k-2}q_j^{2^{k-j-1}-1}$, where $c$ is a positive constant and…

For $x\geq 3$, we define $w(x)$ as the highest integer $w$ for which there exist integers $m, y\geq 1$ and $1\leq n_1<\dots<n_m\leq x$ such that $n_1\cdots n_m=y^w$. We show that \[w(x)=x\exp\big(-(\sqrt{2}+o(1))\sqrt{\log x\log\log…

It has been conjectured that if the number of distinct irreducible constituents of the product of two faithful irreducible characters of a finite $p$-group, for $p\geq5$, is bigger than $(p+1)/2$, then it is at least $p$. We give a…

This note presents a result on the maximal prime gap of the form p_(n+1) - p_n <= C(log p_n)^(1+e), where C > 0 is a constant, for any arbitrarily small real number e > 0, and all sufficiently large integer n > n_0. Equivalently, the result…

D.H. Lehmer found a quadratic polynomial such that 326 is a primitive root for the first 206 primes represented by this polynomial. It is shown that this is related to the class number one problem and prime producing quadratics. An…

For two matrices $A$ and $B$, and large $n$, we show that most products of $n$ factors of $e^{A/n}$ and $n$ factors of $e^{B/n}$ are close to $e^{A + B}$. This extends the Lie-Trotter formula. The elementary proof is based on the relation…

Polignac [1] conjectured that for every even natural number $2k (k\geq1)$, there exist infinitely many consecutive primes $p_n$ and $p_{n+1}$ such that $p_{n+1}-p_n=2k$. A weakened form of this conjecture states that for every $k\geq1$,…

Let $p\equiv3\pmod{4}$ be a prime and $r$ a positive integer. We show that $$ \prod_{k=1}^{(p^{2r}-1)/2}\frac{4k-1}{4k+1}\equiv1\pmod{p^2}. $$ This confirms a recent conjecture of Guo.

This paper introduces a number of new techniques in the study of the famous question from numerical linear algebra: what is the largest possible growth factor when performing Gaussian elimination with complete pivoting? This question is…

We show that if $\frac{L}{\varphi(q)\log X}\to\infty$ as $X\to\infty$, almost all $(a, x)\in (\mathbb Z/q\mathbb Z)^\times\times [X, 2X]$ are such that there exists a product of at most two primes in $[x, x + L]$ congruent to $a\mod{q}$.

In this paper, we prove the twin prime conjecture showing that \begin{align} \sum \limits_{\substack{p\leq x\\p,p+2\in \mathbb{P}}}1\geq (1+o(1))\frac{x}{2\mathcal{C}\log^2 x}\nonumber \end{align} where $\mathcal{C}:=\mathcal{C}(2)>0$ fixed…

What is the maximum possible value of the lead coefficient of a degree $d$ polynomial $Q(x)$ if $|Q(1)|,|Q(2)|,\ldots,|Q(k)|$ are all less than or equal to one? More generally we write $L_{d,[x_k]}(x)$ for what we prove to be the unique…