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

For each $m\geq 1$, there exist infinitely many primes $p_1<p_2<\ldots<p_{m+1}$ such that $p_{m+1}-p_1=O(m^4e^{8m})$ and $p_j+2$ has at most $\frac{16m}{\log 2}+\frac{5\log m}{\log 2}+37$ prime divisors for each $j$.

We prove that every sufficiently large integer $n$ can be written as the sum of a prime and an integer that is not square-free. In addition, we expect this result holds for every $n > 24$ and prove two results to support this claim. First,…

We survey the potential for progress in additive number theory arising from recent advances concerning major arc bounds associated with mean value estimates for smooth Weyl sums. We focus attention on the problem of representing large…

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

A partition of the positive integers into sets $A$ and $B$ {\em avoids} a set $S\subset\N$ if no two distinct elements in the same part have a sum in $S$. If the partition is unique, $S$ is {\em uniquely avoidable.} For any irrational…

Given a prime number $l$ and a finite set of integers $S=\{a_1,...,a_m\}$ we find out the exact degree of the extension $\mathbb{Q}(a_1^{\frac{1}{l}},...,a_m^{\frac{1}{l}})/\mathbb{Q}$. We give an algorithm to compute this degree and then…

We analyze the inequality $\sqrt{P_{k+1}}-\sqrt{P_{k}}<1,\ k\in\mathbb{N}$, discuss the existence of primes on arbitrary intervals $(r,s),\ r<s,\ r,s\in\mathbb{R}$, and finally address the issue of primes between squares of naturals.

We use Maynard's methods to show that there are bounded gaps between primes in the sequence $\{\lfloor n\alpha\rfloor\}$, where $\alpha$ is an irrational number of finite type. In addition, given a superlinear function $f$ satisfying some…

Let $C_n=n2^n+1$ denote the $n$th Cullen number. There has been recent interest in finding all Cullen numbers having a given Diophantine property. We prove that, for a fixed integer $k$ and bounded integers $a_1,\ldots,a_k$, the greatest…

We study the Frobenius problem: given relatively prime positive integers $a_1,...,a_d$, find the largest value of t (the Frobenius number) such that $\sum_{k=1}^d m_k a_k = t$ has no solution in nonnegative integers $m_1,...,m_d$. Based on…

Let $c$ be a positive odd integer and $R$ a set of $n$ primes coprime with $c$. We consider equations $X + Y = c^z$ in three integer unknowns $X$, $Y$, $z$, where $z > 0$, $Y > X > 0$, and the primes dividing $XY$ are precisely those in…

We consider the distribution of the largest prime divisor of the integers in the interval $[2,x]$, and investigate in particular the mode of this distribution, the prime number(s) which show up most often in this list. In addition to giving…

When the sequences of squares of primes is coloured with $K$ colours, where $K \geq 1$ is an integer, let $s(K)$ be the smallest integer such that each sufficiently large integer can be written as a sum of no more than $s(K)$ squares of…

The purpose of this paper is twofold: 1) Applications of Gallagher's larger sieve modulo prime squares do not work. In some relevant cases we can transform the residue class information modulo $p^2$ to more suitable residue information…

It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…

We prove that for all $n\geq 1$ there exists a number between $n^2$ and $(n+1)^2$ with at most 4 prime factors. This is the first result of this kind that holds for every $n\geq 1$ rather than just sufficiently large $n$. Our approach…

Let $\sigma(n)$ and $\gamma(n)$ denote the sum of divisors and the product of distinct prime divisors of $n$ respectively. We shall show that, if $n\neq 1, 1782$ and $\sigma(n)=(\gamma(n))^2$, then there exist odd (not necessarily distinct)…

Let $\alpha$ be a real number greater than $1$. We establish an effective lower bound for the distance between an integral power of $\alpha$ and its nearest integer.

We give an optimal necessary and sufficient condition for the quotient polynomial and remainder in the division algorithm to have positive coefficients.

Let $Q$ be a positive-definite quaternary quadratic form with integer coefficients. We study the problem of giving bounds on the largest positive integer $n$ that is locally represented by $Q$ but not represented. Assuming that $n$ is…