Related papers: A search for Wilson primes

Monier and Rabin proved that an odd composite can pass the Strong Probable Prime Test for at most $\frac 14$ of the possible bases. In this paper, a probable prime test is developed using quadratic polynomials and the Frobenius…

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard's $p-1$ algorithm, which finds in random polynomial time the prime…

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

We report on the results of a computer search for primes $p$ which divide an Harmonic number $H_{\lfloor p/N \rfloor}$ with small $N > 1$.

Let $p>3$ be a prime and $b\ge 2$ an integer such that $p$ does not divide $b$. Then $1/p$ has a periodic digit expansion with respect to the basis $b$. The length $q$ of the period is the (multiplicative) order of $b$ mod $p$. In the case…

We analyze algorithms for computing the $n$th prime $p_n$ and establish asymptotic bounds for several approaches. Using existing results on the complexity of evaluating the prime-counting function $\pi(x)$, we show that the binary search…

We compute all primes up to $6.25\times 10^{28}$ of the form $m^2+1$. Calculations using this list verify, up to our bound, a less famous conjecture of Goldbach. We introduce `Goldbach champions' as part of the verification process and…

We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.

We investigate the existence of primes $p > 5$ for which the residues of $2!$, $3!$, \dots, $(p-1)!$ modulo $p$ are all distinct. We describe the connection between this problem and Kurepa's left factorial function, and report that there…

Let n be a positive integer and let p be a prime. We calculate the probability that a random monic polynomial of degree n with coefficients in the ring Z_p of p-adic integers splits over Z_p into linear factors.

The Baillie-PSW primality test combines Fermat and Lucas probable prime tests. It reports that a number is either composite or probably prime. No odd composite integer has been reported to pass this combination of primality tests if 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…

Wilson's Theorem states that the product of all nonzero elements of a finite field ${\mathbb F}_q$ is $-1$. In this article, we define some natural subsets $S \subset {\mathbb F}_q^\times$ and find formulas for the product of the elements…

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…

We establish a Wiman-Valiron theory for a polynomial series based on the Wilson operator $\mathcal{D}_\mathrm{W}$. For an entire function $f$ of order smaller than $\frac13$, this theory includes (i) an estimate which shows that $f$ behaves…

An open problem about two new families of orthogonal polynomials was posed by Alhaidari. Here we will identify one of them as Wilson polynomials. The other family seems to be new but we show that they are discrete orthogonal polynomials on…

We introduce a new class of pseudoprimes-so called "overpseudoprimes" which is a special subclass of super-Poulet pseudoprimes. Denoting via h(n) the multiplicative order of 2 modulo n, we show that odd number n is overpseudoprime iff value…

Let $p$ be an odd prime, and let $a$ be a rational $p$-adic integer with $a\not\equiv 0\pmod p$. In this paper, using WZ method we establish the congruences for $\sum_{k=0}^{p-1} \binom ak^2(-1)^k(1-\frac 2ak)$ modulo $p^2$ and…