Related papers: Random primes in arithmetic progressions

In this paper we study some structure properties of primitive weird numbers in terms of their factorization. We give sufficient conditions to ensure that a positive integer is weird. Two algorithms for generating weird numbers having a…

Let $\mathcal{A}'$ be the set of integers missing any three fixed digits from their decimal expansion. We produce primes in a thin sequence by proving an asymptotic formula for counting primes of the form $p = m^2 + \ell^2$, with $\ell \in…

While the sequence of primes is very well distributed in the reduced residue classes (mod $q$), the distribution of pairs of consecutive primes among the permissible $\phi(q)^2$ pairs of reduced residue classes (mod $q$) is surprisingly…

We study solutions to the Egyptian fractions equation with the prime factors of the denominators constrained to lie in a fixed set of primes. We evaluate the effectiveness of the greedy algorithm in establishing bounds on such solutions.…

By using the matrix formulation of the two-step approach to distributions of patterns in random sequences, recurrence and explicit formulas for the generating functions of successions in random permutations of arbitrary multisets are…

Let a,f and g be integers, with a and f coprime. Under the generalized Riemann hypothesis it follows from work of Hooley and Lenstra that the set of primes p such that p=a(mod f) and g is primitive root mod p has a natural density. In this…

A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…

This note presents an elementary version of Sims's algorithm for computing strong generators of a given perm group, together with a proof of correctness and some notes about appropriate low-level data structures. Upper and lower bounds on…

A classical problem in analytic number theory is to study the distribution of $\alpha p$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is…

We find a lower bound for the number of Chen primes in the arithmetic progression $a \bmod q$, where $(a,q)=(a+2,q)=1$. Our estimate is uniform for $q \leq \log^M x$, where $M>0$ is fixed.

We study semiorders induced by points drawn from a uniform random distribution. Of particular interest in this paper are the probabilities of generating specific semiorders and the equivalence classes they produce. We present a method for…

We discuss $Q(n)$, the number of ways a given integer $n$ may be written as a sum of distinct primes, and study its asymptotic form $Q_{as}(n)$ valid in the limit $n\to\infty$. We obtain $Q_{as}(n)$ by Laplace inverting the fermionic…

Using only undergraduate-level methods, we classify all groups of order $p^4$, where $p$ is an odd prime.

An integer $a$ is a quadratic nonresidue for a prime $p$ if $x^2 \equiv a \bmod p$ has no solution. Quadratic nonresidues may be found by probabilistic methods in polynomial time. However, without assuming the Generalized Riemann…

We show that if the Sylow $p$-subgroup of a finite group $G$ is of order $p$, then the normalized unit group of the integral group ring of $G$ contains a normalized unit of order $pq$ if and only if $G$ contains an element of order $pq$,…

In the present work the existence of some patterns of primes is shown which generalize the celebrated result of Green and Tao according to which there are arbitrarily long arithmetic progressions in the sequence of primes

An elementary method for computing various prime sequences using the sequence of Farey sequences is described.

Let $H$ be a Hardy field (a field consisting of germs of real-valued functions at infinity that is closed under differentiation) and let $f \in H$ be a subpolynomial function. Let $\mathcal{P} = \{2, 3, 5, 7, \dots \}$ be the (naturally…

We categorify one half of the small quantum sl(2) at a prime root of unity. An extension of this construction to an arbitrary simply-laced case is proposed.

In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…