Related papers: Irregular primes to two billion

Weird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the existence of odd weird numbers has been an open problem. In this work, we describe our computational effort to search for odd weird numbers, which…

We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

We present an improved algorithm for tabulating class groups of imaginary quadratic fields of bounded discriminant. Our method uses classical class number formulas involving theta-series to compute the group orders unconditionally for all…

Fix m >= 1 and let E be an elliptic curve over Q with complex multiplication. We formulate conjectures on the density of primes p (congruent to one modulo m) for which the pth Fourier coefficient of E is an mth power modulo p; often these…

Let $f(x) \in \mathbb{F}_p[x]$, and define the orbit of $x\in \mathbb{F}_p$ under the iteration of $f$ to be the set \[ \mathcal{O}(x):=\{x,f(x),(f\circ f)(x),(f\circ f\circ f)(x),\dots\}. \] An orbit is a $k$-cycle if it is periodic of…

A famous theorem of Zudilin states that at least one of the Riemann zeta values $\zeta(5), \zeta(7), \zeta(9), \zeta(11)$ is irrational. In this paper, we establish the $p$-adic analogue of Zudilin's theorem. As a weaker form of our result,…

We calculate the precise number of r-regular elements in the finite exceptional groups. As a corollary we find that the proportion of r-regular elements is at least 3577/18432 and for all \epsilon>0, there are infinitely finite simple…

Under the generalized Riemann hypothesis, we illustrate that the ratio of the set of primes $p$ such that $\langle -1, 2 \rangle$ has an odd prime index in $\mathbb{F}_p^*$ to the set of primes $p$ such that the subgroup has index greater…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

We construct a new infinite family of pairs of imaginary cyclic fields of degree $(p-1)/2$ explicitly with both class numbers divisible by a given prime number $p$. For the proof, we use the fundamental unit of $\mathbb Q(\sqrt{p})$,…

Let $\omega(n)$ denote the number of distinct prime factors of $n$. Assuming a suitably uniform version of the prime $k$-tuples conjecture, we show that the number \begin{align*} \sum_{n=1}^\infty \frac{\omega(n)}{2^n} \end{align*} is…

We shall give an explicit upper bound for the smallest prime factor of multiperfect numbers of the form $N=p_1^{\alpha_1}\cdots p_s^{\alpha_s} q_1^{\beta_1}\cdots q_t^{\beta_t}$ with $\beta_1, \ldots, \beta_t$ bounded by a given constant.…

Let $K=\mathbb{Q}(\sqrt[4]{pd^{2}})$ be a real pure quartic number field and $k=\mathbb{Q}(\sqrt{p})$ its real quadratic subfield, where $p\equiv 5\pmod 8$ is a prime integer and $d$ an odd square-free integer coprime to $p$. In this work,…

Let $K\geq 2$ be a natural number and $a_i,b_i\in\mathbb{Z}$ for $i=1,\ldots,K-1$. We use the large sieve to derive explicit upper bounds for the number of prime $k$-tuplets, i.e., for the number of primes $p\leq x$ for which all $a_ip+b_i$…

We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…

The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…

Let $K_i$ be a number field for all $i \in \mathbb{Z}_{> 0}$ and let $\mathcal{E}$ be a family of elliptic curves containing infinitely many members defined over $K_i$ for all $i$. Fix a rational prime $p$. We give sufficient conditions for…

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

We prove that the average of the $k$-th smallest prime quadratic non-residue modulo a prime approximates the $2k$-th smallest prime.