Related papers: Hybrid bounds for prime divisors

Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…

We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…

Let $f=a_0+ a_{1}x+\cdots+a_m x^m\in \Bbb{Z}[x]$ be a primitive polynomial. Suppose that there exists a positive real number $\alpha$ such that $|a_m| \alpha^m>|a_0|+|a_1|\alpha+\cdots+|a_{m-1}|\alpha^{m-1}$. We prove that if there exist…

We introduce a sieve for counting twin primes up to a given range. Our method depends on a parameter ${\lambda}_x$ and the estimation of the number of twin primes obtained as a result, is called a fundamental structure of the distribution…

We specify the frontier of decidability for fragments of the first-order theory of ordinal multiplication. We give a NEXPTIME lower bound for the complexity of the existential fragment of $\langle \omega^{\omega^\lambda}; \times, \omega,…

We obtain reasonably tight upper and lower bounds on the sum $\sum_{n \leqslant x} \varphi \left( \left\lfloor{x/n}\right\rfloor\right)$, involving the Euler functions $\varphi$ and the integer parts $\left\lfloor{x/n}\right\rfloor$ of the…

By focusing on the X-matrix part of a density matrix of two qubits we provide an algebraic lower bound for the concurrence. The lower bound is generalized for cases beyond two qubits and can serve as a sufficient condition for…

Let $G$ be a finite group and let $(P_i)_{i=1}^n$ be Sylow subgroups for distinct primes $p_1,\ldots,p_n$. We conjecture that there exists $x \in G$ such that $P_i \cap P_i^x$ is inclusion-minimal in $\{ P_i \cap P_i^g : g \in G\}$ for all…

Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…

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…

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

We present sharp bounds for $\sum_{i=1}^n \alpha_i x_i - \prod_{i=1}^n x_i^{\alpha_i}$ in terms of the variance of the vector $(x_1^{1/2},...,x_n^{1/2})$.

We give degree lower bounds for quotient line bundles of the lowest piece of a Hodge module induced by a complex variation of Hodge structures outside a simple normal crossing divisor, beyond the unipotent variation case. This note aims to…

Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…

Let $\alpha\in]0,1]$ and let $Q_j$ $(1\leqslant j\leqslant r)$ denote distinct irreducible polynomials with integer coefficients. We show that, for vectors with coordinates not exceeding a constant multiple of their mean, the joint local…

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…

Let $a(r,n)$ be $r$th coefficient of $n$th cyclotomic polynomial. Suzuki proved that $\{a(r,n)|r\geq 1,n\geq 1\}=\mathbb{Z}$. If $m$ and $n$ are two natural numbers we prove an analogue of Suzuki's theorem for divisors of $x^n-1$ with…

Let $\sigma(n)$ denote the sum of the positive divisors of $n$. We say that $n$ is perfect if $\sigma(n) = 2 n$. Currently there are no known odd perfect numbers. It is known that if an odd perfect number exists, then it must be of the form…

We obtain global explicit numerical bounds, with best possible constants, for the differences $\frac{1}{n}\sum_{k\leq n}\omega(k)-\log\log n$ and$ \frac{1}{n}\sum_{k\leq n}\Omega(k)-\log\log n$, where $\omega(k)$ and $\Omega(k)$ refer to…

We give a bound on the primes dividing the denominators of invariants of Picard curves of genus 3 with complex multiplication. Unlike earlier bounds in genus 2 and 3, our bound is based not on bad reduction of curves, but on a very explicit…