Related papers: A short note on the computation of the generalised…
In this paper, the estimation formula of the number of primes in a given interval is obtained by using the prime distribution property. For any prime pairs $p>5$ and $ q>5 $, construct a disjoint infinite set sequence $A_1, A_2, \ldots,…
Using the concepts of Hyperbolic Classification of Natural Numbers, Essential Regions and Goldbach Conjecture Function we prove that the existence of a proof of the Goldbach Conjecture in First-Order Arithmetic would imply the existence of…
The ternary Goldbach conjecture states that every odd number $m \geqslant 7$ can be written as the sum of three primes. We construct a set of primes $\mathbb{P}$ defined by an expanding system of admissible congruences such that almost all…
Recent work by Craig, van Ittersum, and Ono constructs explicit expressions in the partition functions of MacMahon that detect the prime numbers. Furthermore, they define generalizations, the MacMahonesque functions, and prove there are…
This paper introduces a new generalized superfactorial function (referable to as $n^{th}$- degree superfactorial: $sf^{(n)}(x)$) and a generalized hyperfactorial function (referable to as $n^{th}$- degree hyperfactorial: $H^{(n)}(x)$), and…
Extending Sellers' result, Das et al. recently proved some congruence results for generalized overcubic partitions using theta functions and posed some related conjectures. In this paper, we provide a combinatorial proof of a result in…
We consider weighted averages of the number of representations of an even integer as a sum of two prime numbers, where each summand lies in a given arithmetic progression modulo a common integer $q$. Our result is uniform in a suitable…
Simple asymptotic expansions for the Jacobi functions $P_\nu^{(\alpha, \beta)}(z)$ and $Q_\nu^{(\alpha, \beta)}(z)$ for large degree $\nu$, with fixed parameters $\alpha$ and $\beta$, are surprisingly rare in the literature, with only a few…
The Schinzel hypothesis is a famous conjectural statement about primes in value sets of polynomials, which generalizes the Dirichlet theorem about primes in an arithmetic progression. We consider the situation that the ring of integers is…
A recast of the standard residue-class analysis of the 3x+1 (Collatz) map in terms of two elementary operators on arithmetic progressions. The resulting calculus (i) splits any progression into its even and odd subsequences in a single…
We generalize some results on semicomputability by Jockusch \cite{jockusch1968semirecursive} to the setting of $\alpha$-Computability Theory. We define an $\alpha$-Kalimullin pair and show that it is definable in the $\alpha$-enumeration…
The counting function on binary values is extended to the signed case in order to count the number of transitions between contiguous locations. A generalized subdifferential for the sign change counting function is given where classical…
We give the converse to Dirichlet's theorem on primes in arithmetic progressions by generalizing an old result of Guinand.
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 prove three sharp estimates for the generalized Zalcman coefficient functional: one for the Hurwitz class, another for the Noshiro-Warschawski class, and yet another for the functions in the closed convex hull of convex univalent…
We present here a more general version of the balanced pair algorithm. This version works in the reducible case and terminates more often than the standard algorithm. We present examples to illustrate this point. Lastly, we discuss the…
In this article, we define a very important sequence of functions, all the functions of this sequence present behaviors very close to that of the Collatz function. The study of such functions allows us to obtain very interesting results…
Doubly intractable problems occur when both the likelihood and the posterior are available only in unnormalised form, with computationally intractable normalisation constants. Bayesian inference then typically requires direct approximation…
By creating a new method, the author proved the well-known world's baffling problems Goldbach conjecture, twin primes conjecture, the Proposition (C) and the Proposition $n^2+1$.
Associated to each random variable $Y$ having a finite moment generating function, we introduce a different generalization of the Stirling numbers of the second kind. Some characterizations and specific examples of such generalized numbers…