Related papers: Wolstenholme and Vandiver primes
We study an LCM-based analogue of Rowland's GCD-based prime-generating recurrence, introduced by the author in 2008. The multiplicative increments of this sequence are conjectured always to be $1$ or prime, but a complete proof requires a…
The Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…
It is well known that the Bernoulli polynomials $\mathbf{B}_n(x)$ have nonintegral coefficients for $n \geq 1$. However, ten cases are known so far in which the derivative $\mathbf{B}'_n(x)$ has only integral coefficients. One may assume…
This article examines the nontrivial solutions of the congruence \[ (p-1)\cdots(p-r) \equiv -1 \pmod p. \] We discuss heuristics for the proportion of primes $p$ that have exactly $N$ solutions to this congruence. We supply numerical…
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…
In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer $n$ there exist primes $p$ and $q$ such that, for all integers $k$ with $1 \leq k \leq n-1$, the binomial coefficient $\binom{n}{k}$ is…
We give elementary proofs for the Apagodu-Zeilberger-Stanton-Amdeberhan-Tauraso congruences $$\sum\limits_{n=0}^{p-1}\dbinom{2n}{n} \equiv\eta_{p}\mod p^{2},$$ $$\sum\limits_{n=0}^{rp-1}\dbinom{2n}{n}…
Bertrand's Postulate ensures existence of prime $p$ between $n$ and $2n$, $n$ an integer $\geq 2$ and the sieve of Eratosthenes, a very simple ancient algorithm, generates all prime numbers up to any given limit. Combining the above two, in…
We define A_n=\sum_{i=1}^n (-1)^i\frac{1}{i} and we show that, for every prime p, there exists a number n such that A_n\equiv 0 (mod p).
We investigate, using the weighted linear sieve, the distribution of almost-primes among the residue classes (mod p) that generate the multiplicative group of reduced residue classes. We are concerned with finding an upper bound for the…
A sieve is constructed for twin primes at distance 4, which are of the form 3(2m+1)+/-2, and are characterized by their twin-4 rank 2m+1. It has no parity problem. Non-ranks are identified as all other odd numbers and counted using odd…
We prove a lower bound expansion on the probability that a random $\pm 1$ matrix is singular, and conjecture that such expansions govern the actual probability of singularity. These expansions are based on naming the most likely, second…
Suppose that $n$ is $0$ or $4$ modulo $6$. We show that there are infinitely many primes of the form $p^2 + nq^2$ with both $p$ and $q$ prime, and obtain an asymptotic for their number. In particular, when $n = 4$ we verify the `Gaussian…
Suppose that $d \in \{ 2, 3, 4, 6 \}$ and $a \in \mathbb{Z}$ with $a\neq -1$ and $a$ is not square. Let $P_{(a,d)}$ be the number of primes $p$ not exceeding $x$ such that $p \equiv 1 \pmod{d}$ and $a^{(p-1)/d} \equiv 1 \pmod{p}$. In this…
By using Beta Dirichlet series and then Eisenstein series we ca represent primes with first a good approximation and an exact expression. This can be done with arbitrary prime (up to 10^101).
A group of order $p^n$ ($p$ prime) has an indecomposable polynomial invariant of degree at least $p^{n-1}$ if and only if the group has a cyclic subgroup of index at most $p$ or it is isomorphic to one of two particular groups of small…
We develop a sieve that can detect primes in multiplicatively structured sets under certain conditions. We apply it to obtain a new $L$-function free proof of Linnik's problem of bounding the least prime $p$ such that $p\equiv a\pmod q$…
The system of equations \[ u_1p_1^2 + \ldots + u_sp_s^2 = 0 \] \[ v_1p_1^3 + \ldots + v_sp_s^3 = 0 \] has prime solutions $(p_1, \ldots, p_s)$ for $s \geq 12$, assuming that the system has solutions modulo each prime $p$. This is proved via…
It is significant to study congruences involving multiple harmonic sums. Let $p$ be an odd prime, in recent years, the following curious congruence $$\sum_{\substack{i+j+k=p \\ i, j, k>0}} \frac{1}{i j k} \equiv-2 B_{p-3}\pmod p$$ has been…
Let E be a real quadratic field with discriminant d and let p be an odd prime not dividing d. For \rho=1 or -1, we determine $\prod_{0<c<d, (d/c)=\rho} binomial coeff.{p-1}{\lfloor pc/d\rfloor}$ modulo p^2 in terms of Lucas numbers, the…