Related papers: On the distribution of composite odd numbers
The index of codivisibility of a set of integers is the size of its largest subset with a common prime divisor. For large random samples of integers, the index of codivisibility is approximately normal.
In this work I look at the distribution of primes by calculation of an infinite number of intersections. For this I use the set of all numbers which are not elements of a certain times table in each case. I am able to show that it exists a…
Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…
Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…
We consider the distribution of the major index on standard tableaux of arbitrary straight shape and certain skew shapes. We use cumulants to classify all possible limit laws for any sequence of such shapes in terms of a simple auxiliary…
Here we demonstrate a sieve for analysing primes and their composites, using equivalence classes based on the modulo 6 return value as applied to the Natural numbers. Five features of this 'Hexile' sieve are reviewed. The first aspect, is…
We present a function that tests for primality, factorizes composites and builds a closed form expression of $\pi(n^2)$ in terms of $\sum_{3 \leq p \leq n} \frac{1}{p}$ and a weaker version of $\omega(n)$.
The paper is a sketch of systematic presentation of distributional limit theorems and their refinements for compound sums. When analyzing, e.g., ergodic semi-Markov systems with discrete or continuous time, this allows us to separate those…
We study the properties of certain graphs involving the sums of primes. Their structure largely turns out to relate to the distribution of prime gaps and can be roughly seen in Cram\'er's model as well. We also discuss generalizations to…
We consider families of exponential sums indexed by a subgroup of invertible classes modulo some prime power $q$. For fixed $d$, we restrict to moduli $q$ so that there is a unique subgroup of invertible classes modulo $q$ of order $d$. We…
This paper discusses the distributions of missing sums and differences.
For $a \neq 1$ and $p$ prime, we define numbers of the form $pa^2$ to be Square-Prime (SP) Numbers. For example, 75 = 3 $\cdot$ 25; 108 = 3 $\cdot$ 36; 45 = 5 $\cdot$ 9. These numbers are listed in the OEIS as A228056. We study the…
We consider the following "partition and sum" operation on a natural number: Treating the number as a long string of digits insert several plus signs in between some of the digits and carry out the indicated sum. This results in a smaller…
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…
In this article we introduce associative Look-Up Tables. With their help, pseudo sums are correctly determined. The set of limit distributions in a pseudo-summation scheme of i.i.d. random variables is described. Also, two special cases…
Convolution sums are introduced and special instances of the cyclic convolution on finite sets is examined in more detail. The distributions that emerge are multidimensional generalizations of the Catalan and Narayana numbers. This work…
We investigate the distribution of modular inverses modulo positive integers $c$ in a large interval. We provide upper and lower bounds for their box, ball and isotropic discrepancy, thereby exhibiting some deviations from random point…
We present several types of ordinary generating functions involving central binomial coefficients, harmonic numbers, and odd harmonic numbers. Our results complement those of Boyadzhiev from 2012 and Chen from 2016. Based on these…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…