中文
相关论文

相关论文: Using Dynamical Systems to Construct Infinitely Ma…

200 篇论文

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

计算机科学中的逻辑 · 计算机科学 2024-04-26 Hashimoto Go , Daniel Găină , Ionuţ Ţuţu

A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…

组合数学 · 数学 2018-11-20 Xandru Mifsud

The undecidability of the additive theory of primes (with identity) as well as the theory Th(N,+, n -> p\_n), where p\_n denotes the (n+1)-th prime, are open questions. As a possible approach, we extend the latter theory by adding some…

逻辑 · 数学 2007-05-23 Patrick Cegielski , Denis Richard , Maxim Vsemirnov

Ova-angular rotations of a prime number are characterized, constructed using the Dirichlet theorem. The geometric properties arising from this theory are analyzed and some applications are presented, including Goldbach's conjecture, the…

综合数学 · 数学 2021-09-06 Yeisson Alexis Acevedo Agudelo

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

数论 · 数学 2007-05-23 D. A. Goldston , J. Pintz , C. Y. Yildirim

Let $r \ge 2$ be an integer and let $A$ be a finite, nonempty set of nonzero integers. We will obtain a lower bound for the number of squarefree integers $n$, up to $x$, for which the products $\prod_{p \mid n} (p+a)$ (over primes $p$) are…

数论 · 数学 2010-08-16 Tristan Freiberg

The usual nonnegative modulus function is based on addition. A natural different modulus function on the set of positive reals is introduced. Arguments for results for series through the usual modulus function are transformed to arguments…

综合数学 · 数学 2019-12-10 C. Ganesa Moorthy

In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…

历史与综述 · 数学 2007-05-23 Roberto Anglani , Margherita Barile

In this expository article we provide an elegant proof of the one-sided Ingham-Karamata Tauberian theorem. As an application, we present a short deduction of the prime number theorem.

数论 · 数学 2024-03-27 Gregory Debruyne

On the twisted Fermat cubic, an elliptic divisibility sequence arises as the sequence of denominators of the multiples of a single rational point. We prove that the number of prime terms in the sequence is uniformly bounded. When the…

数论 · 数学 2010-04-14 Graham Everest , Ouamporn Phuksuwan , Shaun Stevens

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.

数论 · 数学 2024-10-30 Jhixon Macías

When $k>1$ and $n$ is the product of the smallest $k$ primes, the $(k+1)$-st smallest prime is the least divisor exceeding $1$ of $n^{n^n}-1$. This variant of Euclid's prime generator is discussed with some of its cousins.

数论 · 数学 2024-08-14 Trevor D. Wooley

We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…

数论 · 数学 2017-07-20 Ivan Blanco-Chacon , Gary McGuire , Oisin Robinson

In this paper Euler shows how, if we have recursive functions f,g,h and an infinite sequence A,B,C,... which satisfies fA=gB+hC, f'B=g'C+h'D, f''C=g''D+h''E, f'''D=g'''E+h'''F, etc., where the primes denote an index not a derivative, then…

历史与综述 · 数学 2007-05-23 Leonhard Euler

In the present work the existence of some patterns of primes is shown which generalize the celebrated result of Green and Tao according to which there are arbitrarily long arithmetic progressions in the sequence of primes

数论 · 数学 2010-04-08 Janos Pintz

If p is a prime and n a positive integer, let v(n) denote the exponent of p in n, and u(n)=n/p^{v(n)} the unit part of n. If k is a positive integer not divisible by p, we show that the p-adic limit of (-1)^{pke} u((kp^e)!) as e goes to…

数论 · 数学 2013-01-29 Donald M. Davis

We review and possibly add some new variant to the existing derivations of the formula for the area of Jordan lattice polygons drawn on two-dimensional lattices. The formula is known as Pick's theorem and is related to the number theory…

历史与综述 · 数学 2017-07-18 Jacek M. Kowalski

The author proves that there are infinitely many primes $p$ such that $\| \alpha p - \beta \| < p^{-\frac{28}{87}}$, where $\alpha$ is an irrational number and $\beta$ is a real number. This sharpens a result of Jia (2000) and provides a…

数论 · 数学 2025-10-17 Runbo Li

We resurrect a standard construction of analytical mechanics dating from the last century. The technique allows one to pass from any dynamical system whose first order evolution equations are known, and whose bracket algebra is not…

广义相对论与量子宇宙学 · 物理学 2010-04-06 J. A. Rubio , R. P. Woodard

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

数论 · 数学 2007-09-23 Ben Green , Terence Tao