Related papers: On Excess of the Odious Primes
For an irrational $\alpha\in \mathbb{R}$, we consider additive problems with the set of primes satisfying $\lVert\alpha p\rVert\leq \frac{1}{p^\tau}$ for some fixed $\tau>0$. In particular, we show that there exist infinitely many…
An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over…
In this paper we will propose a strategy to prove Goldbach's conjecture: every even integer greater than 2 can be written as the sum of two primes.
We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…
A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof of the more…
We study the distribution of primes from a topological viewpoint. Certain conjecture is introduced, and we show that it is equivalent to the Riemann Hypothesis.
Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…
The article provides a counterexample to a conjecture by Blocki-Zwonek.
In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…
In the paper, we establish a new estimate for Kloosterman sum over primes with respect to an arbitrary modulus $q$. This estimate together with some recent results of the second author are applied to the problem of solvability of the…
Argumentation is a promising model for reasoning with uncertain knowledge. The key concept of acceptability enables to differentiate arguments and counterarguments: The certainty of a proposition can then be evaluated through the most…
We study an extension of Montgomery's pair-correlation conjecture and its relevance in some problems on the distribution of prime numbers.
I present a new property of prime numbers that leads to a generalization of Cramer's conjecture. The study of the gap between consecutive primes is treated as a special case of the gap between consecutive terms of sequences having a certain…
We show that the $abc$ conjecture of Masser-Oesterl\'{e}-Szpiro for number fields implies that there are infinitely many non-Fibonacci-Wieferich primes. We also provide a new heuristic for the number of such primes beneath a certain value.
We provide two new proofs of the infinitude of prime numbers, using the additive Ramsey-theoretic result known as Folkman's theorem (alternatively, one can think of these proofs as using Hindman's theorem). This adds to the existing…
In this paper, we prove the cohomological Lichtenbaum conjecture of abelian extensions of imaginary quadratic fields up to a finite set of bad primes.
We consider a generalization of Euclid's proof of the infinitude of primes and show that it leads to variants of the Euclid-Mullin sequence that provably contain every prime number.
This paper investigates the doubly exponential ideal membership property of the Mayr-Meyer ideals from the point of view of their associated primes. A doubly-exponential upper bound on the set of associated primes is proved. In the paper a…
We prove the existence of certain rationally rigid triples E8 in good characteristic and thereby show that these groups over the prime field occur as Galois groups over the field of rational numbers. We show that these triples give rise to…
We establish a conjecture of Mumford characterizing rationally connected complex projective manifolds in several cases.