Another Topological Proof of the Infinitude of Prime Numbers
Jhixon Macías
本文通过引入一种新拓扑，为素数无限性提供了新的拓扑学证明，并刻画了素数任意非空子集的无限性。
我们利用一种新拓扑给出了素数无限性的全新拓扑学证明。此外，在该拓扑中，我们刻画了素数的任意非空子集的无限性。
We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
Comments about the paper by Elsholz, Fermat's last theorem implies Euclid's infinitude of primes, (2021), and simplification.
Starting with Zhang's theorem on the infinitude of prime doubles, we give an inductive argument that there exists an infinite number of prime $k$-tuples for at least one admissible set $\mathcal{H}_k=\{h_1,\ldots,h_k\}$ for each $k$.
We investigate progressions in the set of pairs of integers $\mathbb{Z}^2$ and define a generalisation of the Jacobsthal function. For this function, we conjecture a specific upper bound and prove that this bound would be a sufficient condition for the truth of the Goldbach conjecture, the infinitude of prime twins, and more general of prime pairs with a fixed even difference.
Infinitude of palindromic almost-prime numbers
本文证明了在任意基数下，存在无穷多个至多含六个较大素因子的回文数，通过等分布估计和矩上界实现。
Alpoge and Granville (separately) gave novel proofs that the primes are infinite that use Ramsey Theory. In particular, they use Van der Waerden's Theorem and some number theory. We prove the primes are infinite using an easier theorem from Ramsey Theory, namely Schur's Theorem, and some number theory (Elsholtz independently obtained the same proof that the primes were infinite). In particular, we use the n=3 case of Fermat's last theorem. We also apply our method to show other domains have an infinite number of irreducibles.
The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings, and we consider new arithmetics that enable us to extend Furstenberg's theorem of the infinitude of primes. We also review the classic conjectures in the new arithmetics. Finally, we make important extensions of the main idea. We see that given any integer sequence, the approach generates an arithmetic on integers and a similar formula to $\mathbb{Z} \setmi…
This short paper gives another proof of the infinitude of primes by using upper box dimension, which is one of fractal dimensions.
The density of primes $p$ such that the class number $h$ of $\mathbb{Q}(\sqrt{-p})$ is divisible by $2^k$ is conjectured to be $2^{-k}$ for all positive integers $k$. The conjecture is true for $1\leq k\leq 3$ but still open for $k\geq 4$. For primes $p$ of the form $p = a^2 + c^4$ with $c$ even, we describe the 8-Hilbert class field of $\mathbb{Q}(\sqrt{-p})$ in terms of $a$ and $c$. We then adapt a theorem of Friedlander and Iwaniec to show that there are infinitely many primes $p$ for which $h$ is divisible by $16$, and also infinitely many primes $p$ for which $h$ is divisible by $8$ but n…
Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results. The properties of these languages are then employed to prove that there are infinitely many prime numbers.
Let $R$ be an infinite Dedekind domain with at most finitely many units, and let $K$ denote its field of fractions. We prove the following statement. If $L/K$ is a finite Galois extension of fields and $\mathcal{O}$ is the integral closure of $R$ in $L$, then $\mathcal{O}$ contains infinitely many prime ideals. In particular, if $\mathcal{O}$ is further a unique factorization domain, then $\mathcal{O}$ contains infinitely many non-associate prime elements.
Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 B.C.--2022) and another new proof
本文是欧几里得素数无穷多定理证明的历史综述，梳理了公元前300年至2022年的200种证明，分类呈现不同时期、不同方法的证明，还给出了一个新的简洁欧几里得式证明。
Fermat's Last Theorem Implies Euclid's Infinitude of Primes
该研究借助费马大定理与舒尔组合定理给出小指数情形下欧几里得素数无穷性定理的新证明，还探讨了多个组合数论结果对该定理的蕴含，揭示其为诸多数学结果的必要条件。
In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.
On the infinitude of elliptic curves over a number field with prescribed small rank
该研究证明了在数域上存在无限多个具有指定小秩的椭圆曲线，通过专门化非平凡椭圆曲线并利用Kai的结果实现对坏素数的控制和秩的计算。
Folkman's theorem and the primes
本文通过Folkman定理（或Hindman定理）给出了素数无限性的两个新证明，扩展了利用Ramsey型定理推导素数无限性的文献。
We consider a generalization of Euclid's proof of the infinitude of primes and show that it leads to variants of the Euclid-Mullin sequence that provably contain every prime number.
We show that for each prime p > 7, every residue mod p can be represented by a squarefree number with largest prime factor at most p. We give two applications to recursive prime generators akin to the one Euclid used to prove the infinitude of primes.
On Telhcirid's theorem on arithmetic progressions
本文研究反素数（素数的数字逆序）的分布，证明基数足够大时满足简单必要条件的等差数列中反素数有无穷多，还得到反素数的有效Siegel–Walfisz型结果，其容许模水平高于经典情形。
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.
Superspecial primes for QM abelian surfaces over real number fields
本文将Baba和Granath关于特定四元数乘法阿贝尔曲面超特殊素数的结果，扩展到模域为任意实嵌入数域且弱化局部条件的情形，证明依赖志村曲线Heegner除子相交理论。
We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael numbers. Our main technical result is a new mean value theorem for primes in arithmetic progressions to large moduli. Namely, we estimate primes of size $x$ with quadrilinear forms of moduli up to $x^{17/32}$. This extends moduli beyond $x^{11/21}$, recently obtained by Maynard, improving $x^{29/56}$ from well-known 1986 work of Bombieri, Friedlander, and Iwaniec.
A folklore proof of Euclid's theorem on the infinitude of primes uses the Euler product and the irrationality of $ζ(2) = π^2/6$. A quantified form of Euclid's Theorem is Bertrand's postulate $p_{n+1} < 2p_n$. By quantifying the folklore proof using an irrationality measure for $6/π^2$, we give a proof (communicated to Paulo Ribenboim in 2005) of a much weaker upper bound on $p_{n+1}$.
Almost Prime Orders of Elliptic Curves Over Prime Power Fields
本文研究素数 p 使得 |E(F_{p^l})| / |E(F_p)| 具有有界素因子的无穷性，对 CM 曲线无条件应用大筛法，对非 CM 曲线在 GRH 下应用 Chebotarev 密度定理，并利用向量筛法给出相关殆素数个数的下界。
T-Fermat integers
引入T-费马整数概念，推广素数定义；证明合数T-费马整数必为卡迈克尔数，并猜想存在无穷多个合数T-费马整数，为证明ω(p-1)≤2的素数无穷提供可能路径。
Port Fillings for Primary Pseudoperfect Numbers
本文研究了无限多个primary pseudoperfect numbers的存在性问题，通过引入port和filling的概念，利用局部语言处理残差方程，探讨了端点填充的条件和方法。
Given an integer $k$, define $C_k$ as the set of integers $n > \max(k,0)$ such that $a^{n-k+1} \equiv a \pmod{n}$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient condition for the infinitude of $C_k$. Moreover, we prove that there are finitely many elements in $C_k$ with one and two prime factors if and only if $k>0$ and $k$ is prime. In addition, if all but two prime factors of $n \in C_k$ are fixed, then there are finitely many elements in $C_k$, excluding certain infinite families of $n$. We also give conjectures abou…
The distribution of $αp$ modulo one, where $p$ runs over the rational primes and $α$ is a fixed irrational real, has received a lot of attention. It is natural to ask for which exponents $ν>0$ one can establish the infinitude of primes $p$ satisfying $||αp||\le p^{-ν}$. The latest record in this regard is Kaisa Matomäki's landmark result $ν=1/3-\varepsilon$ which presents the limit of currently known technology. Recently, Glyn Harman, and, jointly, Marc Technau and the first-named author, investigated the same problem in the context of imaginary quadratic fields. Glyn Harman obtained an analog…
Let $f(n)$ be the sum of the prime divisors of $n$, counted with multiplicity; thus $f(2020)$ $= f(2^2 \cdot 5 \cdot 101) = 110$. Ruth-Aaron numbers, or integers $n$ with $f(n)=f(n+1)$, have been an interest of many number theorists since the famous 1974 baseball game gave them the elegant name after two baseball stars. Many of their properties were first discussed by Erdös and Pomerance in 1978. In this paper, we generalize their results in two directions: by raising prime factors to a power and allowing a small difference between $f(n)$ and $f(n+1)$. We prove that the number of integers up t…
Wieferich primes in number fields and the conjectures of Ankeny--Artin--Chowla and Mordell
本文研究数字段中Wieferich素数的性质，证明在特定条件下存在无限多个非Wieferich素数，并给出相关计数的下界。
The infinitude is established of the set ${\bf U_1}$ of positive integers $N>5$ such that $G(N)\le \min(G(N/q), G(Np))$ where $q, p$ are primes, $q\ | N$ and $G(N):=\frac{σ(N)}{N\log \log N}$ stands for Gronwall number, $σ(N)$ being the sum of all divisors of $N$. The constructive algorithm is proposed which successively calculates the elements of ${\bf U_1}$, the least of them $N_1^*=2^5\cdot 3^3 \cdot 5^2 \cdot 7 \cdot 11 \cdot 13 \cdot 17 \cdot 19 \cdot 23 =160\ 626\ 866\ 400, \ G(N_1^*)=1.7374\dots$ Some interesting properties of these numbers are studied which may occur useful for the pro…
The theorem below gives another way of computing the distribution prime counting function without using recursion and the values of Prime numbers
Using evaluations of the difference between consecutive primes we develop another way of estimating of the number of primes in the interval $(n, 2n)$. We also discuss the ultra Cramer conjecture, $p_{n+1} - p_n = O(log^{1+ε}p_n)$ where $ε> 0$, in the context of the results we have obtained in our paper.
A classical problem in analytic number theory is to study the distribution of $αp$ modulo 1, where $α$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is an almost-prime (the existence of infinitely many such $p$ is another topical result in prime number theory) and prove that its distribution has a similar property.
We prove an analogue of a result by Goldston, Pintz and Yildirim for small gaps between primes that split completely in an abelian number field. We prove both a conditional result assuming the Elliott-Halberstam conjecture, and an unconditional result. We also give another proof of the same result in the special case of a quadratic extension of class number 1, which relies on a generalization of the Bombieri-Vinogradov theorem for quadratic number fields.
In this paper, we introduce a certain method to construct polynomials producing many absolute pseudoprimes. By this method, we give new polynomials producing absolute pseudoprimes with any fixed number of prime factors which can be viewed as a generalization of Chernick's result. By the similar method, we give another type of polynomials producing many absolute pseudoprimes. As concrete examples, we tabulate the counts of such numbers of our forms.
Myriad articles are devoted to Mertens's theorem. In yet another, we merely wish to draw attention to a proof by Hardy, which uses a Tauberian theorem of Landau that "leads to the conclusion in a direct and elegant manner". Hardy's proof is also quite adaptable, and it is readily combined with well-known results from prime number theory. We demonstrate this by proving a version of the theorem for primes in arithmetic progressions with uniformity in the modulus, as well as a non-abelian analogue of this.
On the distribution of $αp^2+β$ modulo one for primes $p$ such that $p+2$ has no more two prime divisors
本文针对 α 无理时 αp²+β 模 1 的分布问题，考察 p+2 为殆素数的素数子序列，证明该子序列保持与经典素数序列相似的分布性质。
We study the Ramanujan-prime-counting function along the lines of Ramanujan's original work on Bertrand's Postulate. We show that the number of Ramanujan primes between x and 2x tends to infinity with x. This analysis leads us to define a new sequence of prime numbers, which we call derived Ramanujan primes. For n greater than or equal to 1 we define the nth derived Ramanujan prime as the smallest positive integer with the property that if x is greater than or equal to the nth derived Ramanujan prime, then the number of Ramanujan primes in the interval from x to x/2 is greater than or equal to…
Let $p$ be an odd prime number, and let $E$ be an elliptic curve defined over a number field which has good reduction at every prime above $p$. Under suitable assumptions, we prove that the $η$-eigenspace and the $\barη$-eigenspace of mixed signed Selmer group of the elliptic curve are pseudo-isomorphic. As a corollary, we show that the $η$-eigenspace is trivial if and only if the $\barη$-eigenspace is trivial. Our results can be thought as a reflection principle which relate an Iwasawa module in a given eigenspace with another Iwasawa module in a "reflected" eigenspace.
Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab + cd with min(a, b) > max(c, d) of two ordered products. This gives a new proof Fermat's Theorem expressing primes of the form 1 + 4N as sums of two squares 1 .
On the Weakly Prime-Additive Numbers with Length 4
本文在广义黎曼假设下证明了对任意正整数m，存在无穷多个能被m整除的长度为4的弱素数可加数，并给出了一个与长度为3情形类似的相关结果。
We study whether sufficiently large integers can be written in the form cp+T_x, where p is either zero or a prime congruent to r mod d, and T_x=x(x+1)/2 is a triangular number. We also investigate whether there are infinitely many positive integers not of the form (2^ap-r)/m+T_x with p a prime and x an integer. Besides two theorems, the paper also contains several conjectures together with related analysis and numerical data. One of our conjectures states that each natural number not equal to 216 can be written in the form p+T_x with x an integer and p a prime or zero; another conjecture asser…
We define the $k$-dimensional generalized Euler function $φ_k(n)$ as the number of ordered $k$-tuples $(a_1,\ldots,a_k)\in {\Bbb N}^k$ such that $1\le a_1,\ldots,a_k\le n$ and both the product $a_1\cdots a_k$ and the sum $a_1+\cdots +a_k$ are prime to $n$. We investigate some of properties of the function $φ_k(n)$, and obtain a corresponding Menon-type identity.
Some Bounds on the Lehmer Index
本文研究莱默数的莱默指数与其素因子倒数和的关系，提出莱默指数的上界、下界，以及莱默数以3为素因子时的指数约束。
We study the rational torsion subgroup of the modular Jacobian $J_0(N)$ for $N$ a square-free integer. We give a new proof of a result of Ohta on a generalization of Ogg's conjecture: for a prime number $p \nmid 6N$, the $p$-primary part of the rational torsion subgroup equals that of the cuspidal subgroup. Whereas previous proofs of this result used explicit computations of the cardinalities of these groups, we instead use their structure as modules for the Hecke algebra.
We present new algorithms for computing zeta functions of algebraic varieties over finite fields. In particular, let X be an arithmetic scheme (scheme of finite type over Z), and for a prime p let zeta_{X_p}(s) be the local factor of its zeta function. We present an algorithm that computes zeta_{X_p}(s) for a single prime p in time p^(1/2+o(1)), and another algorithm that computes zeta_{X_p}(s) for all primes p < N in time N (log N)^(3+o(1)). These generalise previous results of the author from hyperelliptic curves to completely arbitrary varieties.
Let $f=a_0+ a_{1}x+\cdots+a_m x^m\in \Bbb{Z}[x]$ be a primitive polynomial. Suppose that there exists a positive real number $α$ such that $|a_m| α^m>|a_0|+|a_1|α+\cdots+|a_{m-1}|α^{m-1}$. We prove that if there exist natural numbers $n$ and $d$ satisfying $n\geq α+ d$ for which either $|f(n)|/d$ is a prime, or $|f(n)|/d$ is a prime-power coprime to $|f'(n)|$, then $f$ is irreducible in $\mathbb{Z}[x]$.
For a positive integer $n$ let $H_n=\sum_{k=1}^{n}1/k$ be the $n$th harmonic number. Z. W. Sun conjectured that for any prime $p\ge 5$, $$ \sum_{k=1}^{p-1}\frac{H_k}{k\cdot 2^k} \equiv7/24pB_{p-3}\pmod{p^2}. $$ This conjecture is recently confirmed by Z. W. Sun and L. L. Zhao. In this note we give another proof of the above congruence by establishing congruences for all the sums of the form $\sum_{k=1}^{p-1}2^{\pm k}H_k^r/k^s \,(\bmod{\, p^{4-r-s}})$ with $(r,s)\in\{(1,1),(1,2),(2,1) \}$.
The appearance of primes in a family of linear recurrence sequences labelled by a positive integer $n$ is considered. The terms of each sequence correspond to a particular class of Lehmer numbers, or (viewing them as polynomials in $n$) dilated versions of the so-called Chebyshev polynomials of the fourth kind, also known as airfoil polynomials. It is proved that when the value of $n$ is given by a dilated Chebyshev polynomial of the first kind evaluated at a suitable integer, either the sequence contains a single prime, or no term is prime. For all other values of $n$, it is conjectured that …
Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the reduction $E_p$ of $E$ modulo $p$. Under the Generalized Riemann Hypothesis (GRH), we study the primes $p$ for which the integer $|a_p(E)|$ is a prime. In particular, we prove the following results: (i) the number of primes $p < x$ for which $|a_p(E)|$ is a prime is bounded from above by $C_1(E) \frac{x}{(\log x)^2}$ for some constant $C_1(E)$; (ii) the number…
One aspect of Chebyshev's bias is the phenomenon that a prime number, $ q $, modulo another prime number, $ p$, experimentally seems to be slightly more likely to be a nonquadratic residue than a quadratic residue. We thought it would be interesting to model this residue bias as a "random" walk using Legendre symbol values as steps. Such a model would allow us to easily visualize the bias. In addition, we would be able to extend our model to other number fields. In this report, we first outline underlying theory and some motivations for our research. In the second section, we present our findi…
Another factor of integer polynomials with minimal integrals
本文研究了整数多项式集合S_N的性质，证明了存在无限多项式P∈S_N，使得(x³(1-x)²)^{⌊N/6⌋}整除P(x)。
The previous version of this paper relied on a paper by another author whose proof appears to be invalid in a fundamental way. In arXiv:1707.00649 the author, together with Jeff Yelton, came up with a new proof of almost identical results. (See Remark 1.4 of arXiv:1707.00649.)
In this work we present a natural generalization of strong pseudoprime to base $b$, which we have called $q$-pseudoprime to base $b$. It allows us to present another way to define a Midy's number to base $b$ (overpseudoprime to base $b$). Besides, we count the bases $b$ such that $N$ is a $q$-probable prime base $b$ and those ones such that $N$ is a Midy's number to base $b$. Furthemore, we prove that there is not a concept analogous to Carmichael numbers to $q$-probable prime to base $b$ as with the concept of strong pseudoprimes to base $b$.
A subset of the integers larger than 1 is $primitive$ if no member divides another. Erdos proved in 1935 that the sum of $1/(a\log a)$ for $a$ running over a primitive set $A$ is universally bounded over all choices for $A$. In 1988 he asked if this universal bound is attained for the set of prime numbers. In this paper we make some progress on several fronts, and show a connection to certain prime number "races" such as the race between $π(x)$ and li$(x)$.
Fix an integer $r\geq 3$. Let $q$ be a large positive integer and $a_1,...,a_r$ be distinct residue classes modulo $q$ that are relatively prime to $q$. In this paper, we establish an asymptotic formula for the logarithmic density $δ_{q;a_1,...,a_r}$ of the set of real numbers $x$ such that $π(x;q,a_1)>π(x;q,a_2)>...>π(x;q,a_r),$ as $q\to\infty$; conditionally on the assumption of the Generalized Riemann Hypothesis GRH and the Grand Simplicity Hypothesis GSH. Several applications concerning these prime number races are then deduced. Indeed, comparing with a recent work of D. Fiorilli and G. Ma…
We give 50 digits values of the simple continued fractions whose denominators are formed from a) prime numbers, b) twin primes, c) generalized $d$-twins, d) primes of the form $m^2+n^4$, e)primes of the form $m^2+1$, f) Mersenne primes and g) primorial primes. All these continued fractions belong to the set of measure zero of exceptions to the theorems of Khinchin and Levy. We claim that all these continued fractions are transcendental numbers. Next we propose the conjecture which indicates the way to deduce the transcendence of some continued fractions from transcendence of another ones.
We proved recently (see \cite{lhgarasu}) the result on the title for odd prime divisors of such an $n.$ The result implies for many $n's$, more precisely, for an infinity of $n$'s with an arbitrary fixed number of prime divisors, the inexistence of circulant Hadamard matrices, and the inexistence of Barker sequences of length $n >13$. The proof used a result of Arasu. It turns out that there is another, shorter proof, of the more general result that includes the prime $p=2.$ This new proof is based on a result of Brock (see \cite[Theorem 3.1]{brock}), and besides that, requires just the defini…
We propose a quantum circuit that creates a pure state corresponding to the quantum superposition of all prime numbers less than 2^n, where n is the number of qubits of the register. This Prime state can be built using Grover's algorithm, whose oracle is a quantum implementation of the classical Miller-Rabin primality test. The Prime state is highly entangled, and its entanglement measures encode number theoretical functions such as the distribution of twin primes or the Chebyshev bias. This algorithm can be further combined with the quantum Fourier transform to yield an estimate of the prime …
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。