Related papers: On the difference between squares and integral $S$…

We obtain a new bound on exponential sums over integers without large prime divisors, improving that of Fouvry and Tenenbaum (1991). For a fixed integer $\nu\ne 0$, we also obtain new bounds on exponential sums with $\nu$-th powers of such…

Motivated by the classical Theorems of Picard and Siegel and their generalizations, we define the notion of an {\it essentially large} effective divisor and derive some of its geometric and arithmetic consequences. We then prove that on a…

Let $S$ be a fixed set of primes and let $(X_{l})_{l\geq 1}$ be the $X$-coordinates of the positive integer solutions $(X, Y)$ of the Pell equation $X^2-dY^2 = 1$ corresponding to a non-square integer $d>1$. We show that there are only a…

Let $\mathcal S=\{s_1<s_2<s_3<\ldots\}$ be the sequence of all natural numbers which can be represented as a sum of two squares of integers. For $X\ge2$ we denote by $g(X)$ the largest gap between consecutive elements of $\mathcal S$ that…

We demonstrate that there are infinitely many integers that cannot be expressed as the sum of two squares of integers and up to two non-negative integer powers of 2.

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…

We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992).…

We show asymptotic upper and lower bounds for the greatest common divisor of N and $\sigma(N)$. We also show that there are infinitely many integers N with fairly large g.c.d. of N and $\sigma(N)$.

We show that any proper symmetric two dimensional arithmetic progression contained in the interval $[-T,T]$ which avoids non-zero perfect squares has at most $O_\varepsilon(T^{20/27+\varepsilon})$ elements. This improves on a result of…

Let $M_{n,r}=(\sum_{i=1}^{n}q_ix_i^r)^{\frac {1}{r}}, r \neq 0$ and $M_{n,0}=\lim_{r \rightarrow 0}M_{n,r}$ be the weighted power means of $n$ non-negative numbers $x_i$ with $q_i > 0$ satisfying $\sum^n_{i=1}q_i=1$. For a real number…

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main…

A unitary divisor $c$ of a positive integer $n$ is a positive divisor of $n$ that is relatively prime to $\displaystyle{\frac{n}{c}}$. For any integer $k$, the function $\sigma_k^*$ is a multiplicative arithmetic function defined so that…

We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.

If $N = {q^k}{n^2}$ is an odd perfect number, where $q$ is the Euler prime, then we show that $n < q$ is sufficient for Sorli's conjecture that $k = \nu_{q}(N) = 1$ to hold. We also prove that $q^k < 2/3{n^2}$, and that $I(q^k) < I(n)$,…

We study the Frobenius problem: given relatively prime positive integers a_1,...,a_d, find the largest value of t (the Frobenius number g(a_1,...,a_d)) such that m_1 a_1 + ... m_d a_d = t has no solution in nonnegative integers m_1,...,m_d.…

For any integer $l\geq 1$, let $p_1, p_2, \ldots, p_{l+2}$ be distinct prime numbers $\geq 5.$ For all real numbers $X>1,$ we let $N_{3,l}(X)$ denote the number of real quadratic fields $K$ whose absolute discriminant $d_K\leq X$ and $d_K$…

We present lower bounds on the sum and product of the distinct prime factors of an odd perfect number, which provide a lower bound on the size of the odd perfect number as a function of the number of its distinct prime factors.

In the number $373$ all subwords ($3$, $7$, $37$, $73$, and $373$) are prime. Similarly, in $9719$ all subwords are divisible by at most one prime. And similarly again in $7319797913$ all subwords are divisible by at most two primes. These…

Let $\mathbf H_2$ denote the set of even integers $n \not\equiv 1 \pmod 3$. We prove that when $H \ge X^{0.33}$, almost all integers $n \in \mathbf H_2$, $X < n \le X + H$ can be represented as the sum of a prime and the square of a prime.…

We prove new arithmetic results for parametric linear recurrence sequences specialized at roots of unity, denoted by $(U_n(\zeta))_{n\geq 0}$. In particular, we obtain exponential lower bounds for the largest prime ideal divisor and norm of…