A novel representation of a quasi-periodic modified von Mangoldt function L(n) on prime numbers and its decomposition into Fourier series has been investigated. We focus on some particular quantities characterizing the modified von Mangoldt function. The results indicate that prime number progression can be decomposed into periodic sequences. The main approach is to decompose it into sin or cosine function. Basically, it is applied to extract hidden periodicities in seemingly quasi periodic prime function. Numerical evidences were provided to confirm the periodic distribution of primes
The non-trivial zeros of the Riemann zeta function and the prime numbers can be plotted by a modifi...
In this document, prime numbers are related as functions over time, mimicking the Sieve of Eratosthe...
A function f(x) is called periodic if there exists a constant T \u3e o for which f(x+T)=f(x) for any...
International audienceFor a large class of digital functions f, we estimate the sums Sigma(n <= x) L...
International audienceFor a large class of digital functions f, we estimate the sums Sigma(n <= x) L...
We study those functions that can be written as a finite sum of periodic integer valued functions. O...
AbstractIf s(t) is a periodic sequence from GF(q) = F, and if N is the number of times a non-zero el...
AbstractArithmetic functions related to number representation systems exhibit various periodicity ph...
Abstract The purpose of this paper is to introduce a new pattern in Primes numbers, to eliminate the...
As an introduction, let us describe exactly the relation between the Fourier series and the Fourier ...
In a recent study of the PrimaIity oj the Smarandache Symmetric Sequences Sabin and Tatiana Tabirca ...
AbstractIf p(n, k) is the number of partitions of n into parts ≤k, then the sequence {p(k, k), p(k +...
Abstract. A large number of results in analysis of algorithms con-tain fluctuations. A typical resul...
In this thesis, we will study a class of divisor functions: the prime symmetric functions. These are...
Fourier analysis has been used for over one hundred years as a tool to study certain additive patter...
The non-trivial zeros of the Riemann zeta function and the prime numbers can be plotted by a modifi...
In this document, prime numbers are related as functions over time, mimicking the Sieve of Eratosthe...
A function f(x) is called periodic if there exists a constant T \u3e o for which f(x+T)=f(x) for any...
International audienceFor a large class of digital functions f, we estimate the sums Sigma(n <= x) L...
International audienceFor a large class of digital functions f, we estimate the sums Sigma(n <= x) L...
We study those functions that can be written as a finite sum of periodic integer valued functions. O...
AbstractIf s(t) is a periodic sequence from GF(q) = F, and if N is the number of times a non-zero el...
AbstractArithmetic functions related to number representation systems exhibit various periodicity ph...
Abstract The purpose of this paper is to introduce a new pattern in Primes numbers, to eliminate the...
As an introduction, let us describe exactly the relation between the Fourier series and the Fourier ...
In a recent study of the PrimaIity oj the Smarandache Symmetric Sequences Sabin and Tatiana Tabirca ...
AbstractIf p(n, k) is the number of partitions of n into parts ≤k, then the sequence {p(k, k), p(k +...
Abstract. A large number of results in analysis of algorithms con-tain fluctuations. A typical resul...
In this thesis, we will study a class of divisor functions: the prime symmetric functions. These are...
Fourier analysis has been used for over one hundred years as a tool to study certain additive patter...
The non-trivial zeros of the Riemann zeta function and the prime numbers can be plotted by a modifi...
In this document, prime numbers are related as functions over time, mimicking the Sieve of Eratosthe...
A function f(x) is called periodic if there exists a constant T \u3e o for which f(x+T)=f(x) for any...