中文
相关论文

相关论文: Arithmetic Properties of Integers in Chains and Re…

200 篇论文

Some basic properties of the ring of integers $\mathbb{Z}$ are extended to entire rings. In particular, arithmetic in entire principal rings is very similar than arithmetic in the ring of integers $\mathbb{Z}$. These arithmetic properties…

历史与综述 · 数学 2013-02-14 Alexandre Laugier

Using GCD sums, we show that the set of the primes has small common multiplicative energy with an arbitrary exponentially big integer set $S$ and, in particular, size of any arithmetic progression in $S$ having the beginning at zero, is at…

数论 · 数学 2020-10-27 Ilya D. Shkredov

Number systems with a rational number $a/b > 1$ as base have gained interest in recent years. In particular, relations to Mahler's 3/2-problem as well as the Josephus problem have been established. In the present paper we show that the…

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

综合数学 · 数学 2026-01-23 Edwige Tolla

Let $g(n)$ be the largest positive integer $k$ such that there are distinct primes $p_i$ for $1\leq i\leq k$ so that $p_i |n+i$. This function is related to a celebrated conjecture of C.A. Grimm. We establish upper and lower bounds for…

数论 · 数学 2013-06-06 Shanta Laishram , Ram Murty

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…

数论 · 数学 2022-01-06 Piotr Miska , János T. Tóth , Błażej Żmija

Graph theory provides powerful tools for modeling concepts in number theory, leading to the introduction of graphs derived from arithmetic properties. One such structure is the divisor prime graph, $G_{Dp(n)}$. For any positive integer $n$,…

组合数学 · 数学 2026-04-09 Purva J. Makadiya , Mahesh M. Jariya , Prashant J. Makadiya

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

数论 · 数学 2017-07-24 Acquaah Peter

For a base $b\geq 2$ and a set of digits $\mathcal{A}\subset \{0,...,b-1\}$, let $\mathcal{P}$ denote the set of prime numbers with digits restricted to $\mathcal{A}$, when written in base-$b$. We prove that if $A\subset \mathbb{N}$ has…

数论 · 数学 2025-10-16 Alex Burgin

By a sphere-packing argument, we show that there are infinitely many pairs of primes that are close to each other for some metrics on the integers. In particular, for any numeration basis $q$, we show that there are infinitely many pairs of…

数论 · 数学 2017-11-17 Minjia Shi , Florian Luca , Patrick Solé

The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…

综合数学 · 数学 2022-09-27 Tashreef Muhammad , G. M. Shahariar , Tahsin Aziz , Mohammad Shafiul Alam

Let $G$ be a multiplicative subgroup of the prime field $\mathbb F_p$ of size $|G|> p^{1-\kappa}$ and $r$ an arbitrarily fixed positive integer. Assuming $\kappa=\kappa(r)>0$ and $p$ large enough, it is shown that any proportional subset…

数论 · 数学 2016-11-21 Mei-Chu Chang

Let $G$ be a finite, connected graph. An arithmetical structure on $G$ is a pair of positive integer-valued vectors $(\mathbf{d},\mathbf{r})$ such that $(\text{diag}(\mathbf{d})-A_G)\cdot \mathbf{r}=\textbf{0},$ where the entries of…

组合数学 · 数学 2023-01-12 Alexander Diaz-Lopez , Kathryn Haymaker , Michael Tait

Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of…

数论 · 数学 2020-02-26 Lukas Spiegelhofer , Thomas Stoll

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

This note is devoted to establish some new arithmetic properties of the generalized Genocchi numbers $G_{n , a}$ ($n \in \mathbb{N}$, $a \geq 2$). The resulting properties for the usual Genocchi numbers $G_n = G_{n , 2}$ are then derived.…

数论 · 数学 2021-03-16 Bakir Farhi

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

Pillai showed that any sequence of consecutive integers with at most 16 terms possesses one term that is relatively prime to all the others. We give a new proof of a slight generalization of this result to arithmetic progressions of…

数论 · 数学 2013-05-31 Sudhir R. Ghorpade , Samrith Ram

Let $p_n$ denote the $n$th prime and $g_n:=p_{n+1}-p_n$ the $n$th prime gap. We demonstrate the existence of infinitely many values of $n$ for which $g_n>g_{n+1}>\cdots>g_{n+m}$ with $m\gg \log\log\log n$ and similarly for the reversed…

数论 · 数学 2016-04-12 D. K. L. Shiu

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

数论 · 数学 2017-01-11 Zhi-Wei Sun