Related papers: On Excess of the Odious Primes

We study the framework of abductive logic programming extended with integrity constraints. For this framework, we introduce a new measure of the simplicity of an explanation based on its degree of \emph{arbitrariness}: the more arbitrary…

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…

We provide a new proof of the inverse theorem for the Gowers $U^{s+1}$-norm over groups $H=\mathbb Z/N\mathbb Z$ for $N$ prime. This proof gives reasonable quantitative bounds (the worst parameters are double-exponential), and in particular…

We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.

For a given elliptic curve $E$ defined over the rationals, we study the density of primes $p$ satisfying $\mathrm{gcd}(\#E(\mathbb{F}_p),p-1)=1$ and give a conjectural value for this density with strong heuristic evidence for most elliptic…

In this paper we derive congruences expressing Bell numbers and derangement numbers in terms of each other modulo any prime.

We show that the higher-order matching problem is decidable using a game-theoretic argument.

In this paper, we prove a few lemmas concerning Fibonacci numbers modulo primes and provide a few statements that are equivalent to Wall-Sun-Sun Prime Conjecture. Further, we investigate the conjecture through heuristic arguments and…

The paper presents a counterexample to the Hodge conjecture.

The ternary Goldbach conjecture (or three-prime conjecture) states that every odd number greater than 5 can be written as the sum of three primes. The purpose of this book is to give the first proof of the conjecture, in full.

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

The proliferation of probable prime tests in recent years has produced a plethora of definitions with the word ``pseudoprime'' in them. Examples include pseudoprimes, Euler pseudoprimes, strong pseudoprimes, Lucas pseudoprimes, strong Lucas…

In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…

We give some results on a priori estimates and on estimates of type sup+inf and sup*inf.

As a corollary to the recent extraordinary theorem of Maynard and Tao, we re-prove, in a stronger form, a result of Shiu concerning "strings" of consecutive, congruent primes.

We explain a conjecture relating the monster simple group to an algebraic variety that was discovered in a non-monstrous context.

We study an extension of \g propositional logic whose corresponding algebra is an ordered Abelian group. Then we expand the ideas to first-order case of this logic.

We introduce a new conjecture on products of two distinct primes that would provide a partial answer to a conjecture of McIntosh. Also, $\binom{2p-1}{p-1}-1$ is written in terms of a polynomial in prime $p$ over the integers and we discuss…

We improve Bombieri's asymptotic sieve to localise the variables. As a consequence, we prove, under a Elliott-Halberstam conjecture, that there exists an infinity of twins almost prime. Those are prime numbers $p$ such that for all…