Related papers: Reasoning about Primes (I)
n 1937 Ivan Vinogradov proved the three prime sum version of the Goldbach Conjecture, often called the weak form of Goldbach Conjecture. And that it holds for "sufficiently large" odd natural numbers. In this work we use Dirichlet Theorem,…
Zaremba's Conjecture concerns the formation of continued fractions with partial quotients restricted to a given alphabet. In order to answer the numerous questions that arrive from this conjecture, it is best to consider a semi-group, often…
We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like…
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…
Using morphic cohomology, we produce a sequence of conjectures, called morphic conjectures, which terminates at the Grothendieck standard conjecture A. A refinement of Hodge structures is given, and with the assumption of morphic…
Let $E/\mathbb{Q}$ an elliptic curve with good supersingular reduction at a prime $p\geq 5$, and $K$ an imaginary quadratic field such that the root number of $E$ over $K$ equals $-1$. When $p$ splits in $K$, Castella and Wan formulated the…
We prove two conjectures on sums of products of Catalan triangle numbers, which were originally conjectured by Miana, Ohtsuka, and Romero [Discrete Math. 340 (2017), 2388--2397]. The first one is proved by using Zeilberger's algorithm, and…
A conjecture of Mordell states that if $p$ is a prime and $p$ is congruent to $3$ mod $4$, then $p$ does not divide $y$ where $(x,y)$ is the fundamental solution to $x^{2}-py^{2}=1$. The conjecture has been verified for primes not exceeding…
A consequence of Bertrand's postulate, proved by L. Greenfield and S. Greenfield in 1998, assures that the set of integers $\{1,2,\cdots, 2n\}$ can be partitioned into pairs so that the sum of each pair is a prime number for any positive…
The coprimary filtration is a basic construction in commutative algebra. In this article, we prove the existence and uniqueness of coprimary filtration of modules (not necessarily finitely generated) over a Noetherian ring. Moreover, we…
This paper represents a step in our program towards the proof of the Pierce--Birkhoff conjecture. In the nineteen eighties J. Madden proved that the Pierce-Birkhoff conjecture for a ring A$is equivalent to a statement about an arbitrary…
The class $\MIP^*$ of promise problems that can be decided through an interactive proof system with multiple entangled provers provides a complexity-theoretic framework for the exploration of the nonlocal properties of entanglement. Little…
Consider a system \Psi of non-constant affine-linear forms \psi_1,...,\psi_t: Z^d -> Z, no two of which are linearly dependent. Let N be a large integer, and let K be a convex subset of [-N,N]^d. A famous and difficult open conjecture of…
We give a triplet of short proofs, each of which answers a question raised by Erd\H{o}s. The first concerns the small prime factors of $\binom{n}{k}$, the second concerns whether an additive basis $A$ can always be split into pieces $A_1$…
It is shown that if every odd integer $n > 5$ is the sum of three primes, then every even integer $n > 2$ is the sum of two primes. A conditional proof of Goldbach's conjecture, based on Cram\'er's conjecture, is presented. Theoretical and…
Probabilistic models for the distribution of primes in the natural numbers are constructed in the article. The author found and proved the probabilistic estimates of the deviation $R(x)=|\pi(x)- Li(x)|$. The author has analyzed the…
We make an application of ideas from partition theory to a problem in multiplicative number theory. We propose a deterministic model of prime number distribution, from first principles related to properties of integer partitions, that…
Let $\mathfrak{p}_{\mathbb{P}_r}(n)$ denote the number of partitions of $n$ into $r$-full primes. We use the Hardy-Littlewood circle method to find the asymptotic of $\mathfrak{p}_{\mathbb{P}_r}(n)$ as $n \to \infty$. This extends previous…
We suggest other models of sieve generated sequences like the Sieve of Eratosthenes to explain randomness properties of the prime numbers, like the twin prime conjecture, the lim sup conjecture, the Riemann conjecture, and the prime number…
Let NSymm be the Hopf algebra of noncommutative symmetric functions over the integers. In this paper a description is given of its Lie algebra of primitives over the integers, Prim(NSymm), in terms of recursion formulas. For each of the…