Related papers: Partition-theoretic model of prime distribution
The study of the well-known partition function $p(n)$ counting the number of solutions to $n = a_{1} + \dots + a_{\ell}$ with integers $1 \leq a_{1} \leq \dots \leq a_{\ell}$ has a long history in combinatorics. In this paper, we study a…
The Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…
The partitions of the integers can be expressed exactly in an iterative and closed-form expression. This equation is derived from distributing the partitions of a number in a network that locates each partition in a unique and orderly…
A hypothesis is put forward regarding the function $\pi_2(x)$ which describes the distribution of twin primes in the set of natural numbers. The function $\pi_2(x)$ is tested by evaluation and an empirical $\pi_2^{\ast}(x)$ is arrived at,…
We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…
Research has shown that deep networks tend to be overly optimistic about their predictions, leading to an underestimation of prediction errors. Due to the limited nature of data, existing studies have proposed various methods based on model…
A probability distribution is n-divisible if its nth convolution root exists. While modeling the dependence structure between several (re)insurance losses by an additive risk factor model, the infinite divisibility, that is the…
In this paper we obtained an original integer sequence based on the properties of the multinomial coefficient. We investigated a property of the sequence that shows connection with a primality testing. For any prime n the n-th term in the…
Recently we have introduced a novel characterisation of the distribution of twin primes that consists of three essential elements. These are: that the twins are most naturally viewed as a subsequence of the primes themselves, that the…
In 1882 J.J. Sylvester already proved, that the number of different ways to partition a positive integer into consecutive positive integers exactly equals the number of odd divisors of that integer (see [1]). We will now develop an…
The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…
We bring to bear an empirical model of the distribution of twin primes and produce two distinct results. The first is that we can make a quantitative probabilistic prediction of the occurrence of gaps in the sequence of twins within the…
We calculate the triple correlations for the truncated divisor sum $\lambda_{R}(n)$. The $\lambda_{R}(n)$'s behave over certain averages just as the prime counting von Mangoldt function $\Lambda(n)$ does or is conjectured to do. We also…
In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).
We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…
A primorial prime is a prime number of the form $p_n\# \pm 1$ where $p_n\#$ denotes the product of all primes less than or equal to $p_{n}$, the $n$-th prime. We show that the probability along the lines of Mertens' Theorem that either…
A central problem in computational statistics is to convert a procedure for sampling combinatorial from an objects into a procedure for counting those objects, and vice versa. Weconsider sampling problems coming from *Gibbs distributions*,…
Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…