Florian K. Richter
Let $Ω(n)$ denote the number of prime factors of $n$. We show that for any bounded $f\colon\mathbb{N}\to\mathbb{C}$ one has \[ \frac{1}{N}\sum_{n=1}^N\, f(Ω(n)+1)=\frac{1}{N}\sum_{n=1}^N\, f(Ω(n))+\mathrm{o}_{N\to\infty}(1). \] This yields a new elementary proof of the Prime Number Theorem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We present a very elementary proof of the uniqueness of Markoff numbers which are prime powers or twice prime powers, in the sense that it uses neither algebraic number theory nor hyperbolic geometry.
A New Elementary Proof of Landau's Prime Ideal Theorem, and Associated Results
本文给出Landau素数理想定理的新初等证明，推广了Richter的素数定理证明，并包含素数理想计数函数等分布的相关结果。
We give an outline of a generalization of the Gelfond-Schnirelmann method in elementary number theory. It is related to an integral of Selberg (1944) generalizing the Euler beta integral. The result we explain was obtained by Nair and Chudnovsky independently in the early eighties.
Prime Plus a Non-Square-Free Integer: An Elementary Approach
本文用初等同余和有限计算，无条件证明了 Lee-O'Clarey 猜想对不被 997# 整除的 n>24 成立，反例必被所有≤997 的素数整除且大于 10^415。
Let $p$ be an odd prime. Using I. M. Vinogradov's bilinear estimate, we present an elementary approach to estimate nontrivially the character sum $$ \sum_{x\in H}χ(x+a),\qquad a\in\Bbb F_p^*, $$ where $H<\Bbb F_p^*$ is a multiplicative subgroup in finite prime field $\Bbb F_p$. Some interesting mean-value estimates are also provided.
We introduce extremely symmetric primes and provide some elementary properties of these.
We present an elementary proof for Ljunggren equation
We present many novel results in number theory, including a double series formula for the natural logarithm and a proof concerning the Hölder mean based on the functional equation for the Riemann zeta function. We find a harmonic mean analogue of Chebyshev's inequality for the prime counting function involving the Euler-Mascheroni constant. Furthermore, we define a function taking the Hölder mean of all positive integers up to a given number and investigate its asymptotic behavior, finding two different patterns which are separated by the harmonic mean. Additionally, we discuss the behavior of…
An elementary gap in the proof of corollary 2.2 was found, the claim in the first version of the paper is thus retracted.
We derive the mean square of the divisor function using only elementary techniques.
An elementary proof of the Selberg identity for Kloosterman sums
本文利用加性特征的正交性，给出了Kloosterman和的Selberg恒等式的初等证明。
In 1930, A.A.K. Ayyangar allegedly produced the missing proof that the ancient Indian Chakravala algorithm, designed to solve Pell's equation, always halts. Refining his own elementary arguments, we give a correct and shorter proof.
Two number fields are called arithmetically equivalent if they have the same Dedekind zeta function. In the 1970's Perlis showed that this is equivalent to the condition that for almost every rational prime $\ell$ the arithmetic type of $\ell$ is the same in each field. In the 1990's Perlis and Stuart gave an unexpected characterization for arithmetic equivalence; they showed that to be arithmetically equivalent it is enough for almost every prime $\ell$ to have the same number of prime factors in each field. Here, using an $\ell-p$ switch trick, we provide an elementary proof of that fact bas…
We give an elementary proof of the Mazur-Tate-Teitelbaum conjecture for elliptic curves by using Kato's element.
Existence of primes in the interval $ [15x,16x] $ -- An entirely elementary proof --
本文基于Erdös等人的素数区间证明思路，给出了k≤15时区间[kx,(k+1)x]内对充分大x至少含N个素数这一命题的完全初等证明，其中k≥5的情形采用了新思路。
This is an exposition, in 12 pages including all prerequisites and a generalization, of Karamata's little known elementary proof of the Landau-Ingham Tauberian theorem, a result in real analysis from which the Prime Number Theorem follows in a few lines. We believe this to be the most transparent of the elementary proofs of the PNT.
An Elementary Analysis of the Prime Partition Function
本文通过初等方法证明了素数划分函数pp(n)的对数渐近于2π√(n/(3 log n))，并展示了该方法可推广到相关问题的渐近估计。
The main goal of this article is to present an elementary proof of Ramanujan's identity for odd zeta values. Our proof solely relies on a Mittag-Leffler type expansion for hyperbolic cotangent function and Euler's identity for even zeta values.
We announce a number of conjectures associated with and arising from a study of primes and irrationals in $\mathbb{R}$. All are supported by numerical verification to the extent possible.
In this paper we study elementary extensions of differential fields in prime characteristic. In particular, we show that, in contrast to Liouville's result in characteristic zero, all elements of an elementary extension admit an antiderivative in some logarithmic extension.
By an elementary observation about the computation of the difference of squares for large in- tegers, deterministic quadratic Frobenius probable prime tests are given with running times of approximately 2 selfridges.
We describe an algorithm for arbitrary-precision computation of the elementary functions (exp, log, sin, atan, etc.) which, after a cheap precomputation, gives roughly a factor-two speedup over previous state-of-the-art algorithms at precision from a few thousand bits up to millions of bits. Following an idea of Sch{ö}nhage, we perform argument reduction using Diophantine combinations of logarithms of primes; our contribution is to use a large set of primes instead of a single pair, aided by a fast algorithm to solve the associated integer relation problem. We also list new, optimized Machin-l…
We provide an elementary proof of an asymptotic formula for prime counting functions. As a minor application we give a new reduction of the proof of Chebotarëv's density theorem to the cyclic case.
We give a short proof of the following known congruence: for every odd prime $p$ $$\sum_{k=0}^{p-1}{2k\choose k}^2 16^{-k}\equiv (-1)^{p-1\over 2}\pmod{p^2}.$$ Moreover, we provide some new results connected with the above congruence.
Mordell in 1958 gave a new proof of the three squares theorem. Those techniques were generalized by Blackwell, et al., in 2016 to characterize the integers represented by the remaining six "Ramanujan-Dickson ternaries". We continue the generalization of these techniques to four additional forms.
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In addition, our proof highlights an interesting use of generating functions.
For the old question whether there is always a prime in the interval [kn, (k+1)n] or not, the famous Bertrand's postulate gave an affirmative answer for k=1. It was first proved by P.L. Chebyshev in 1850, and an elegant elementary proof was given by P. Erdos in 1932. M. El Bachraoui used elementary techniques to prove the case k=2 in 2006. This paper gives a proof of the case k=3, again without using the prime number theorem or any deep analytic result. In addition we give a lower bound for the number of primes in the interval [3n, 4n], which shows that as n tends to infinity, the number of pr…
An elementary proof of some Ramanujan-type identities
本文通过初等方法证明了将黎曼ζ函数在整数点的平方表示为涉及双曲函数、digamma函数和伯努利数等级数的恒等式，并修正了文本中的不准确之处和参考文献。
An elementary Tauberian proof of the Prime Number Theorem
本文用初等实分析给出素数定理的 Tauber 证明，避免 zeta 函数解析延拓，通过推广 Wiener-Ikehara 定理至 Laplace 变换实现。
An elementary formulation of Kubota's proof of Satz 4 about biquadratic number fields
本文旨在提供Kubota关于双二次数域Satz 4证明的初等表述，因为该命题是计算Polya群阶的基石。
Let $ψ$ be a generic Drinfeld module of rank $r \geq 2$. We study the first elementary divisor $d_{1, \wp}(ψ)$ of the reduction of $ψ$ modulo a prime $\wp$, as $\wp$ varies. In particular, we prove the existence of the density of the primes $\wp$ for which $d_{1, \wp} (ψ)$ is fixed. For $r = 2$, we also study the second elementary divisor (the exponent) of the reduction of $ψ$ modulo $\wp$ and prove that, on average, it has a large norm. Our work is motivated by the study of J.-P. Serre of an elliptic curve analogue of Artin's Primitive Root Conjecture, and, moreover, by refinements to Serre's…
An elementary proof of the local Kronecker-Weber theorem
本文给出了局部Kronecker-Weber定理的一个新的初等、自包含且显式的证明，仅使用离散赋值理论和本科代数课程中的工具。
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
This paper examines with elementary proofs some interesting properties of numbers in the binary quadratic form $a^2+ab+b^2$, where $a$ and $b$ are non-negative integers. Key findings of this paper are (i) a prime number $p$ can be represented as $a^2+ab+b^2$ if and only if $p$ is of the form $6k+1$, with the only exception of 3, (ii) any positive integer can be represented as $a^2+ab+b^2$ if and only if its all prime factors that are not in the same form have even exponents in the standard factorization, and (iii) all the factors of an integer in the form $a^2+ab+b^2$, where $a$ and $b$ are po…
For n>1, let G(n)=σ(n)/(n log log n), where σ(n) is the sum of the divisors of n. We prove that the Riemann Hypothesis is true if and only if 4 is the only composite number N satisfying G(N) \ge \max(G(N/p),G(aN)), for all prime factors p of N and all multiples aN of N. The proof uses Robin's and Gronwall's theorems on G(n). An alternate proof of one step depends on two properties of superabundant numbers proved using Alaoglu and Erdős's results.
We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.
For a two parameter family of Bernoulli numbers $B_{n, p}$ the exponential generating function is derived by elementary methods.
We present a new, elementary, dynamical proof of the prime number theorem.
We present a new `elementary' proof of the irrationality of $ζ(3)$ based on some recent `hypergeometric' ideas of Yu.Nesterenko, T.Rivoal, and K.Ball, and on Zeilberger's algorithm of creative telescoping.
An Elementary Proof of the Generalization of the Binet Formula for $k$-bonacci Numbers
本研究提出了$k$-bonacci数Binet公式推广形式的初等证明，该公式通过$k$-bonacci递推的特征多项式根实现数的闭式计算，为相关数论问题提供了基础证明方法。
An elementary heuristic for Hardy-Littlewood extended Goldbach's conjecture
本文提出一个基于超几何分布和Hoeffding型界的初等组合启发式，用于预测Hardy-Littlewood扩展哥德巴赫猜想。
An elementary proof of the Artin--Springer theorem for generalized quadratic forms over quaternion algebras
本文为四元数除代数上各向异性广义二次型在奇数次域扩张下保持各向异性提供了初等证明。
We present a new proof of the irrationality of values of the series $T_q(z)=\sum_{n=0}^\infty z^nq^{-n(n-1)/2}$ in both qualitative and quantitative forms. The proof is based on a hypergeometric construction of rational approximations to $T_q(z)$.
We illustrate how elementary information-theoretic ideas may be employed to provide proofs for well-known, nontrivial results in number theory. Specifically, we give an elementary and fairly short proof of the following asymptotic result: The sum of (log p)/p, taken over all primes p not exceeding n, is asymptotic to log n as n tends to infinity. We also give finite-n bounds refining the above limit. This result, originally proved by Chebyshev in 1852, is closely related to the celebrated prime number theorem.
An elementary algebraic proof of the fundamental theorem of algebra
本文给出代数基本定理的一个新的初等代数证明，并推广了Joseph Shipman近期得到的一个更一般的版本，关键思想是理解多项式获得给定次数因子的扩域。
An elementary proof of Cohen-Gabber theorem in the equal characteristic $p>0$ case
本文提供了一个新的初等证明，用于Cohen-Gabber定理在等特征$p>0$情况下的应用。
This short paper gives another proof of the infinitude of primes by using upper box dimension, which is one of fractal dimensions.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。