Related papers: Primes Appearing in Prime Tower Factorization
The unique prime factorization theorem is used to show the existence of a function on a countable set $\mathcal{X}$ so that the sum aggregator function is injective on all multisets of $\mathcal{X}$ of finite size.
The problem to express a natural number N as a product of natural numbers without regard to order corresponds to a thermally isolated non-interacting Bose gas in a one-dimensional potential with logarithmic energy eigenvalues. This…
It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…
This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…
In this paper, we will extend the falling and rising factorial transforms \cite{ref. 1} which in this case every arbitrary function can be applied. Then, the properties of these transforms will be investigated and some corollaries will be…
The paper introduces the butterfly factorization as a data-sparse approximation for the matrices that satisfy a complementary low-rank property. The factorization can be constructed efficiently if either fast algorithms for applying the…
Let $a,b\in \mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\pm b^n$, $n\in\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime…
We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…
A matrix approach to continuous iteration is proposed for general formal series. It leads, in particular, to an order{to{order iteration of the exponential function, and consequently to an algorithmic approach to tetration. Lower{order…
Emergence is a pregnant property in various fields. It is the fact for a phenomenon to appear surprisingly and to be such that it seems at first sight that it is not possible to predict its apparition. That is the reason why it has often…
We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. This is a consequence of a structure theorem making clear the inter-relation between 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…
For a proper submodule $N$ of a finitely generated module $M$ over a Noetherian ring, the product of prime ideals which occur in a regular prime extension filtration of $M$ over $N$ is defined as its generalized prime ideal factorization in…
We obtain results concerning the so-called factorization for the convergence of random variables almost everywhere (almost surely or with probability one), belonging to the classical Lebesgue-Riesz spaces and we extend these results to the…
Although the prime numbers are deterministic, they can be viewed, by some measures, as pseudo-random numbers. In this article, we numerically study the pair statistics of the primes using statistical-mechanical methods, especially the…
In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found,…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
The main objective of this article is to study the exponential sums associated to Fourier coefficients of modular forms supported at numbers having a fixed set of prime factors. This is achieved by establishing an improvement on…
The purpose of this text is to provide an accessible introduction to a set of recently developed algorithms for factorizing matrices. These new algorithms attain high practical speed by reducing the dimensionality of intermediate…
We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial,…