Related papers: Squarefree smooth numbers and Euclidean prime gene…

Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds…

In [J. Algebra 452 (2016), 372-389], we characterise when the sequence of free subgroup numbers of a finitely generated virtually free group $\Gamma$ is ultimately periodic modulo a given prime power. Here, we show that, in the remaining…

Given a negative $D>-(\log X)^{\log 2-\delta}$, we give a new upper bound on the number of square free integers $<X$ which are represented by some but not all forms of the genus of a primitive positive definite binary quadratic form $f$ of…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the…

Let p>3 be a prime, f a positive integer and Q_{p^f} the unramified extension of Q_p of degree f. After Breuil and Paskunas, to a generic semi-simple continue modulo p representation of the absolute Galois group of Q_{p^f}, we can associate…

Using an explicit version of Selberg's upper sieve, we obtain explicit upper bounds for the number of $n\leq x$ such that a non-empty set of irreducible polynomials $F_i(n)$ with integer coefficients are simultaneously prime; this set can…

Let $q$ be a power of a prime $p$, $G$ be a finite abelian group, where $p$ does not divide $|G|$,and let $n$ be a positive integer. In this paper we find a formula for the number of irreducible representations of $G$ of a given dimension…

Let p be an odd prime number. Using some previous work of the two authors, we determine the socle filtration of all irreducible smooth mod p representations of SL(2,Q_{p}).

It is proved that for each prime field $GF(p)$, there is an integer $f(p)$ such that a 4-connected matroid has at most $f(p)$ inequivalent representations over $GF(p)$. We also prove a stronger theorem that obtains the same conclusion for…

The problem of finding the largest finite group with a certain class number (number of conjugacy classes), $k(G)$, has been investigated by a number of researchers since the early 1900's and has been solved by computer for $k(G) \leq 9$.…

Let $p$ be a prime. We define $S(p)$ the smallest number $k$ such that every positive integer is a sum of at most $k$ squares of integers that are not divisible by $p$. In this article, we prove that $S(2)=10$, $S(3)=6$, $S(5)=5$, and…

We consider words $w$ over the alphabet $\Sigma=\{0,1,2\}$. It is shown that there are irreducibly square-free words of all lengths $n$ except 4,5,7 and 12. Such a word is square-free (i.e., it has no repetitions $uu$ as factors), but by…

In this paper, we prove that for any fixed $205/243<\gamma\leqslant1$, every sufficiently large $N$ satisfying $N\equiv 5 \pmod {24}$ can be represented as five squares of primes with one prime in $\mathcal{P}_\gamma$, which improves the…

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

An exponent of distribution 1/16 is established for square-free palindromes. The main input is an upper bound for the number of palindromes, in arithmetic progressions to large moduli, divisible by large squares. Our argument combines a…

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…

For irreducible integer polynomials $f(n)=n^d+c$ we prove an asymptotic formula for the number of $k$-th power free values taken by $f(n)$, for $n$ running up to $x$, subject to the condition $k\ge (5d+3)/9$. This improves earlier results…

The main purpose of this paper is to find all the prime numbers p for which whenever we add to p an odd square less than p we obtain a number which has at most two different prime factors. We solve completely the cases $p\equiv 1,3,5 \pmod…

We prove that every sufficiently large odd integer is a sum of two positive squares and a prime. Let R(n) be the number of representations n = x^2 + y^2 + p with x, y >= 1 and p prime. We show that R(n) > 0 for all odd n >= n0 and obtain…

Let $A\subset [1,N]$ be a set of positive integers with $|A|\gg \sqrt N$. We show that if avoids about $p/2$ residue classes modulo $p$ for each prime $p$, the $A$ must correlate additively with the squares $S=\{n^2:1\leq n\leq \sqrt N\}$,…