相关论文: The fractal nature of an approximate prime countin…
Recent work by Craig, van Ittersum, and Ono constructs explicit expressions in the partition functions of MacMahon that detect the prime numbers. Furthermore, they define generalizations, the MacMahonesque functions, and prove there are…
Differentiable real function reproducing primes up to a given number and having a differentiable inverse function is constructed. This inverse function is compared with the Riemann-Von Mangoldt exact expression for the number of primes not…
We introduce the notion of fractal index associated with the universal class $h$ of particles or quasiparticles, termed fractons, which obey specific fractal statistics. A connection between fractons and conformal field…
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…
This work proposes elementary proofs of several related primes counting problems, based on an elementary weighted sieve. The subsets of primes considered here are the followings: the subset of twin primes PT = {p and p + 2 are primes}, the…
In this study the general formula for differential and integral operations of fractional calculus via fractal operators by the method of cumulative diminution and cumulative growth is obtained. The under lying mechanism in the success of…
Atmospheric flows exhibit cantorian fractal space-time fluctuations signifying long-range spatiotemporal correlations. A recently developed cell dynamical system model shows that such non-local connections are intrinsic to quantum-like…
Two constructed prime number subsets (called prime brother & sisters and prime cousins) lead to a third one (called isolated primes) so that all three disjoint subsets together generate the prime number set. It should be suggested how the…
The convex hull of the subgraph of the prime counting function $x\rightarrow \pi(x)$ is a convex set, bounded from above by a graph of some piecewise affine function $x\rightarrow \epsilon(x)$. The vertices of this function form an infinite…
A new calculus based on fractal subsets of the real line is formulated. In this calculus, an integral of order $\alpha, 0 < \alpha \leq 1$, called $F^\alpha$-integral, is defined, which is suitable to integrate functions with fractal…
We observe two kinds of fractal approximating graphs, the background structures of the generalized Sierpinski Arrowhead Curve independently of the recursive curves. Both graphs related to the generalized Sierpinski Gasket and based on a…
This short paper gives another proof of the infinitude of primes by using upper box dimension, which is one of fractal dimensions.
Formerly the geometry was based on shapes, but since the last centuries this founding mathematical science deals with transformations, projections and mappings. Projective geometry identifies a line with a single point, like the perspective…
This work proposes a novel technique for the numerical calculus of the fractal dimension of fractal objects which can be represented as a closed contour. The proposed method maps the fractal contour onto a complex signal and calculates its…
A mathematical method for constructing fractal curves and surfaces, termed the $p\lambda n$ fractal decomposition, is presented. It allows any function to be split into a finite set of fractal discontinuous functions whose sum is equal…
We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.
Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…
The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…
We develop a theory of multiplicative functions (with values inside or on the unit circle) in arithmetic progressions analogous to the well-known theory of primes in arithmetic progressions.
The theorem below gives another way of computing the distribution prime counting function without using recursion and the values of Prime numbers