Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1804.07607

A study of divergence from randomness in the distribution of prime numbers within the arithmetic progressions 1+6n and 5+6n

Andrea Berdondini
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this article I present results from a statistical study of prime numbers that shows a behaviour that is not compatible with the thesis that they are distributed randomly. The analysis is based on studying two arithmetical progressions defined by the following polynomials: ($1+6n$, $5+6n$, $n\in{N}$) whose respective numerical sequences have the characteristic of containing all the prime numbers except $3$ and $2$. If prime numbers were distributed randomly, we would expect the two polynomials to generate the same number of primes. Instead, as the reported findings show, we note that the polynomial $5+6n$ tends to generate many more primes, and that this divergence grows progressively as more prime numbers are considered. A possible explanation for this phenomenon can be found by calculating the number of products that generate composite numbers which are expressible by the two polynomials. This analysis reveals that the number of products that generate composite numbers expressible by the polynomial $1+6n$ is $(n+1)^{ 2}$, while the number of products that generate composites expressible by the polynomial $5+6n$ is $(n+1)n$, con $n\in{N}$. As a composite number is a non-prime number, this difference incited me to analyse the distribution of prime numbers generated by the two polynomials. The results, based on studying the first (approx.) 500 million prime numbers, confirm the fact that the number of primes that can be written using the polynomial $1+6n$ is lower than the number of primes that can written using the polynomial $5+6n$, and that this divergence grows progressively with the number of primes considered.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Andrea Berdondini. 2018-04-19. A study of divergence from randomness in the distribution of prime numbers within the arithmetic progressions 1+6n and 5+6n. https://arxiv.org/abs/1804.07607

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗