相关论文: On algebraic structure of the set of prime numbers
In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…
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…
Natural numbers can be divided in two non-overlapping infinite sets, primes and composites, with composites factorizing into primes. Despite their apparent simplicity, the elucidation of the architecture of natural numbers with primes as…
In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…
In the paper "An Abelian Loop for Non-Composites" (arXiv:110.14716), we introduced a group-like structure consisting of odd prime numbers and 1, with properties that allowed us to prove analogous results to well known theorems in Number…
We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…
In a prime number decomposition of integers in a given set, the occurrence frequencies of prime numbers are shown to satisfy a general forms of Zipf's law.
A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.
We study the basic properties of a prime sum graph, which is a simple graph defined on $\mathbb N$ where two vertices are adjacent if and only if their sum is a prime number. Further, we investigate some specific structures that appear…
A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…
A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…
This work is meant to demonstrate new class of prime numbers -- cyclic prime numbers, that can be derived from any prime number at certain numeric systems. Cyclic prime numbers are also related to the cyclic numbers and full reptend prime…
We found a regularity of the behavior of primes that allows to represent both prime and natural numbers as infinite matrices with a common formation rule of their rows. This regularity determines a new class of infinite cyclic groups that…
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
In the course of studies of the measure of chaos for the distribution of the prime numbers among the positive integers N arched structures have been found. It is given a brief description of the fine structure of the positive integers…
Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…
The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…
We study odd numbers through a straightforward indexing. We focus in particular on odd prime and composite numbers and their distribution. With a counting argument, we calculate the limit of two sums and compare their convergence rate.
While the prime numbers have been subject to mathematical inquiry since the ancient Greeks, the accumulated effort of understanding these numbers has - as Marcus du Sautoy recently phrased it - 'not revealed the origins of what makes the…
We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…