Cover Image

A Smooth Analytical Approximation of the Prime Characteristic Function

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Semenov, Stanislav
Format:	Preprint
Published:	2025
Subjects:	General Mathematics 11A41, 11Y16, 26E40, 03F60 F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Wave Arithmetic: A Smooth Integral Representation of Number Theory
by: Semenov, Stanislav
Published: (2025)

Smooth Approximations of the Rounding Function
by: Semenov, Stanislav
Published: (2025)

Fractal Origin of the Continuum: A Hypothesis on Process-Relative Definability
by: Semenov, Stanislav
Published: (2025)

On the Nature of Fractal Numbers and the Classical Continuum Hypothesis (CH)
by: Semenov, Stanislav
Published: (2025)

Axiomatic Foundations of Fractal Analysis and Fractal Number Theory
by: Semenov, Stanislav
Published: (2025)

Invariant Bridges Between Four Successive Points: A New Tool for Data Coding
by: Semenov, Stanislav
Published: (2025)

Fractal Analysis on the Real Interval: A Constructive Approach via Fractal Countability
by: Semenov, Stanislav
Published: (2025)

Smooth Integer Encoding via Integral Balance
by: Semenov, Stanislav
Published: (2025)

Invariant-Based Cryptography
by: Semenov, Stanislav
Published: (2025)

Invariant-Based Cryptography: Toward a General Framework
by: Semenov, Stanislav
Published: (2025)

Fractal Boundaries of Constructivity: A Meta-Theoretical Critique of Countability and Continuum
by: Semenov, Stanislav
Published: (2025)

Fractal Countability as a Constructive Alternative to the Power Set of N: A Meta-Formal Approach to Stratified Definability
by: Semenov, Stanislav
Published: (2025)

Constructive Limits of Cantor's Diagonal Method: Countability, Enumerability, and the Impossibility of Exhausting the Continuum
by: Semenov, Stanislav
Published: (2025)

Verified Program Extraction in Number Theory: The Fundamental Theorem of Arithmetic and Relatives
by: Wiesnet, Franziskus
Published: (2025)

On the Realizability of Prime Conjectures in Heyting Arithmetic
by: Rosko, Milan
Published: (2025)

Exploring the abyss in Kleene's computability theory
by: Sanders, Sam
Published: (2023)

The Evolution of Cryptography through Number Theory
by: Castro, Fernando Peralta
Published: (2024)

On the computational properties of ambivalent sets and functions
by: Normann, Dag, et al.
Published: (2026)

Baker's dozen digits of two sums involving reciprocal products of an integer and its greatest prime factor
by: Gogoberidze, Tengiz O.
Published: (2024)

Unimodular lattices of rank 29 and related even genera of small determinant
by: Chenevier, Gaëtan, et al.
Published: (2026)

Unimodular Hunting II
by: Allombert, Bill, et al.
Published: (2024)

Unimodular Hunting
by: Chenevier, Gaëtan
Published: (2024)

Evaluating lattice sums via telescoping on $SL_+(2,\mathbb Z)$: a short proof of $\sum \frac{1}{|x|^2|y|^2|x+y|^2}=\fracπ{4}$ and Zagier's identity
by: Kalinin, Nikita
Published: (2024)

High-Precision Computation and PSLQ Identification of Stokes Multipliers for Anharmonic Oscillators
by: Zhou, Jian
Published: (2026)

Non-Existence of Quintic Factorization for the Second Cuboid Polynomial $Q_{p,q}(t)$
by: Asiryan, Valery
Published: (2026)

Homotopical Observables and the Langlands Program via $\infty$-Topoi
by: Galikhanov, Anatoly
Published: (2025)

Consistent ultrafinitist logic
by: Gajda, Michał J.
Published: (2021)

Pure Data Spaces
by: Youssef, Saul
Published: (2025)

A formalization of Borel determinacy in Lean
by: Manthe, Sven
Published: (2025)

Quantum modularity of signatures in TQFT and generalized Dedekind sums
by: Murakami, Yuya
Published: (2026)

On $|{\rm Li}(x)-π(x)|$ and primes in short intervals
by: Tan, Shan-Guang
Published: (2011)

Walking through the Gaussian Primes
by: Das, Madhuparna
Published: (2019)

Undecidability in Relevant Logic
by: Knudstorp, Søren Brinck
Published: (2026)

The Exponential Congruence Symbol
by: En-naoui, Es-said
Published: (2025)

A Guide to Krivine Realizability for Set Theory
by: Matthews, Richard
Published: (2023)

Computational Evidence Against Quadratic-Cubic Factorization for the Second Cuboid Quintic
by: Asiryan, Valery, et al.
Published: (2026)

Non-Existence of Linear-Quartic Factorization for the Second Cuboid Quintic
by: Asiryan, Valery
Published: (2026)

Forcing as a Local Method of Accessing Small Extensions
by: Lau, Desmond
Published: (2024)

On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)

Relative Constructibility via Generalised Sequential Algorithms
by: Lau, Desmond
Published: (2024)