Related papers: Il Fattore di Sylvester
A celebrated conjecture of Hardy and Littlewood provides with an asymptotic formula for the counting function of the twin primes. We give an unconditional proof of such a formula by means of a finite Ramanujan expansion of the counting…
The article presents a generalization of the classical Hardy-Littlewood conjecture concerning the density of prime tuples to the case of tuples consisting of almost-prime numbers (numbers with a specified quantity of prime divisors). The…
The goal of this paper is to describe an elementary combinatorial heuristic that predicts Hardy and Littlewood's extended Goldbach's conjecture. We examine common features of other heuristics in additive prime number theory, such as…
In this paper we establish a function field analogue of a conjecture in number theory which is a combination of several famous conjectures, including the Hardy-Littlewood prime tuple conjecture, conjectures on the number of primes in…
Recent work of Borwein, Choi, and the second author examined a collection of polynomials closely related to the Goldbach conjecture: the polynomial $F_N$ is divisible by the $N$th cyclotomic polynomial if and only if there is no…
According to the similarity theorem on the distributions of the effective prime factors and by using two-part method, Goldbach theorem and, consequently, Goldbach conjecture was proved.
We show that the assumption of a weak form of the Hardy-Littlewood conjecture on the Goldbach problem suffices to disprove the possible existence of exceptional zeros of Dirichlet L-functions. This strengthens a result of the authors named…
In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester's formula was also recently proved by Lascoux and Pragacz by using multi-Schur…
This paper attempts to prove the Sylvester's conjecture using Egyptian Fractions with two key ingredients. First, creating a set of operators that completely generates all possible Egyptian fraction of 1. And second, to detect patterns in…
Stirling's formula is a powerful asymptotic approximation of the factorial function. Many well-known proofs of this formula are grounded in integral calculus. In this paper, we present an alternative proof of Stirling's formula using only…
Applying a theorem of Howard for a formula recently proved by Brassesco and M\'endez, we derive new simple explicit formulas for the coefficients of the asymptotic expansion to the sequence of factorials. To our knowledge no explicit…
Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…
We use an old elementary arithmetic argument to find new upper and lower bounds for Sylvester's denumerant function. These bounds are tight enough to get the asymptotic behavior of the denumerant.
An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…
This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger…
A Hilbert point in $H^p(\mathbb{T}^d)$, for $d\geq1$ and $1\leq p \leq \infty$, is a nontrivial function $\varphi$ in $H^p(\mathbb{T}^d)$ such that $\| \varphi \|_{H^p(\mathbb{T}^d)} \leq \|\varphi + f\|_{H^p(\mathbb{T}^d)}$ whenever $f$ is…
The generating function for restricted partitions is a finite product with a Laurent expansion at each root of unity. The question of the behavior of these Laurent coefficients as the size of the product increases goes back to Rademacher…
Let $\theta$ be an inner function on the unit disk, and let $K^p_\theta:=H^p\cap\theta\overline{H^p_0}$ be the associated star-invariant subspace of the Hardy space $H^p$, with $p\ge1$. While a nontrivial function $f\in K^p_\theta$ is never…
Defining a family of recurrences, we generalize Comtet's formula for the generating function of the enumeration of indecomposable permutations. Consequently, we generalize Panaitopol's asymptotic expansion for the prime counting function,…
We establish, via a formal/heuristic Fourier inversion calculation, that the Hardy-Littlewood twin prime conjecture is equivalent to an asymptotic formula for the two-point correlation function of Riemann zeros at a height $E$ on the…