Related papers: Largest Prime Factors of Polynomials

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

We consider the equation $[p_{1}^{c}] + [p_{2}^{c}] + [p_{3}^{c}] = N$, where $N$ is a sufficiently large integer, and prove that if $1 < c < \frac{17}{16}$, then it has a solution in prime numbers $p_{1}$, $p_{2}$, $p_{3}$ such that each…

We show that the difference between consecutive terms in sequences of integers whose greatest prime factor grows slowly tends to infinity.

Let $N_{1,B}(n)$ denote the number of ones in the $B$-ary expansion of an integer $n$. Woods introduced the infinite product $P :=\prod_{n \geq 0} (\frac{2n+1}{2n+2})^{(-1)^{N_{1,2}(n)}}$ and Robbins proved that $P = 1/\sqrt{2}$. Related…

Let $p$ be a prime greater than 3. In the paper we mainly determine $\sum_{k=0}^{[p/4]}\binom{4k}{2k}(-1)^k$, $\sum_{k=0}^{[p/3]}\binom{3k}k, \sum_{k=0}^{[p/3]}\binom{3k}k(-1)^k$ and $\sum_{k=0}^{[p/3]}\binom{3k}k(-3)^k$ modulo $p$, where…

Let $F_p$ be the field of a prime order $p.$ For a subset $A\subset F_p$ we consider the product set $A(A+1).$ This set is an image of $A\times A$ under the polynomial mapping $f(x,y)=xy+x:F_p\times F_p\to F_p.$ In the present paper we show…

We parameterize solutions to the equality $\Phi_3(x)=\Phi_3(a_1)\Phi_3(a_2)\cdots\Phi_3(a_n)$ when each $\Phi_3(a_i)$ is prime. Our focus is on the special cases when $n=2,3,4$, as this analysis simplifies and extends bounds on the total…

We estimate the number of primes represented by a general quadratic polynomial with discriminant $\Delta$, assuming that the corresponding real character is exceptional.

Using an elementary identity, we prove that for infinitely many polynomials $P(x)\in \mathbb{Z}[X]$ of fourth degree, the equation $\prod\limits_{k=1}^{n}P(k)=y^2$ has finitely many solutions in $\mathbb{Z}$. We also give an example of a…

Given an odd prime $q$, a natural number $l$ and non-zero $q$-free integers $a_{1}, a_{2}, \ldots, a_{l}$, none of which are equal to $1$ or $-1$, we give necessary and sufficient conditions for the polynomial $\prod_{j=1}^{l} (x^{q} -…

We say that a cyclotomic polynomial Phi_{n}(x) has order three if n is the product of three distinct primes, p<q<r. Let A(n) be the largest absolute value of a coefficient of Phi_{n}(x) and M(p) be the maximum of A(pqr). In 1968, Sister…

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof for the…

We say that a cyclotomic polynomial \Phi_{n}(x) has order three if n is the product of three distinct primes, p<q<r. Let A(n) be the largest absolute value of a coefficient of \Phi_{n}(x) and M(p) be the maximum of A(pqr). In 1968, Sister…

Let $1<c<832/825$. For large real numbers $N>0$ and a small constant $\vartheta>0$, the inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\vartheta \end{equation*} has a solution in prime numbers $p_1,\,p_2,\,p_3,\,p_4$ such that,…

We show that for each prime p > 7, every residue mod p can be represented by a squarefree number with largest prime factor at most p. We give two applications to recursive prime generators akin to the one Euclid used to prove the infinitude…

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…

Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab + cd with min(a, b) > max(c, d) of two ordered products. This gives a new proof Fermat's Theorem expressing primes of the form 1 + 4N as sums of two squares 1 .

We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…

Let $p$ be an odd prime and let $d$ be an integer not divisible by $p$. We prove that $$ \prod_{1\le m,n\le p-1\atop p\nmid m^2-dn^2}\ (x-(m+n\sqrt{d})) \equiv \begin{cases}\sum_{k=1}^{p-2}\frac{k(k+1)}2x^{(k-1)(p-1)}\pmod p &\text{if}\…