中文
相关论文

相关论文: Consecutive primes which are widely digitally deli…

200 篇论文

We prove that there is a small but fixed positive integer e such that for every prime larger than a fixed integer, every subset S of the integers modulo p which satisfies |2S|<(2+e)|S| and 2(|2S|)-2|S|+2 < p is contained in an arithmetic…

数论 · 数学 2009-10-03 Oriol Serra , Gilles Zémor

In this paper, using the well known fact that the series of reciprocals of primes diverges, we obtain a general inequality for gaps of consecutive primes that holds for infinitely many primes. As it is shown the key ingredient for this…

数论 · 数学 2017-12-14 Douglas Azevedo

We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…

综合数学 · 数学 2025-08-05 Julius Stricker

A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A [ fng) = 1. The number of nonempty subsets of A which are relatively prime to n is \Phi(A, n) and the number of such…

数论 · 数学 2009-10-27 Mohamed El Bachraoui

For any measure preserving system $(X,\mathcal{X},\mu,T)$ and $A\in\mathcal{X}$ with $\mu(A)>0$, we show that there exist infinitely many primes $p$ such that $\mu\bigl(A\cap T^{-(p-1)}A\cap T^{-2(p-1)}A\bigr) > 0$ (the same holds with…

动力系统 · 数学 2007-05-23 Nikos Frantzikinakis , Bernard Host , Bryna Kra

We show that for integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the normal order of the number of prime factors is $C \log \log n$, where $C=(1-e^{-\gamma})^{-1} = 2.280...$ and $\gamma$ is…

数论 · 数学 2021-11-15 Andreas Weingartner

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

This paper proposes an elementary solution to a special case of finding all perfect squares that can be written as sum of consecutive integer cubes. It is shown that there are no non-trivial solutions if the perfect square is a prime power,…

综合数学 · 数学 2024-01-10 Atilla Akkuş

Let $ \lfloor {x} \rfloor $ denote the greatest integer less than or equal to a real number $x$. Given real numbers $0<\alpha_1 < \alpha_2 < \cdots< \alpha_k < 1$ satisfying a certain condition, we show that there are infinitely many…

数论 · 数学 2025-12-23 Anup B. Dixit , Nikhil S Kumar

Let $p$ be a prime number, and $h$ a positive integer such that $\gcd(p,h)=1$. We prove, without invoking Dirichlet's theorem, that the arithmetic progression $p\left(\mathbf{N}\cup \{0\}\right)+h$ contains infinitely many prime numbers.…

综合数学 · 数学 2023-11-21 Jhixon Macías

We show the existence of a constant $c > 0$ such that, for all positive integers $n$, there exist integers $1 \leq a_1 < \ldots < a_k \leq n$ such that there are at least $cn^2$ distinct integers of the form $\sum_{i=u}^{v}a_i$ with $1 \leq…

组合数学 · 数学 2023-11-17 Adrian Beker

We consider the problem of counting $k$-tuples of positive integers satisfying any arbitrary set of gcd conditions, where every integer is not larger than $x$. We first establish the conditions to guarantee the existence of such tuples, and…

数论 · 数学 2025-05-12 Chan Ieong Kuan

Legendre's conjecture states that there is a prime number between n^2 and (n+1)^2 for every positive integer n. We consider the following question : for all integer n>1 and a fixed integer k<=n does there exist a prime number such that kn <…

数论 · 数学 2009-01-11 Shiva Kintali

Given integers $k_1, k_2$ with $0\le k_1<k_2$, the determinations of all positive integers $q$ for which there exists a perfect Splitter $B[-k_1, k_2](q)$ set is a wide open question in general. In this paper, we obtain new necessary and…

信息论 · 计算机科学 2019-03-04 Pingzhi Yuan , Kevin Zhao

In this paper we show that a certain subset of the Carmichael numbers contains good Euler pseudoprimes, composite numbers that for many bases survive the Solovay-Strassen primality test. We present a classification of Carmichael numbers,…

We show that the Gaussian primes $P[i] \subseteq \Z[i]$ contain infinitely constellations of any prescribed shape and orientation. More precisely, given any distinct Gaussian integers $v_0,...,v_{k-1}$, we show that there are infinitely…

组合数学 · 数学 2012-01-04 Terence Tao

In 2013, Zhi-Wei Sun proposed a Romanov-type conjecture stating that every integer $n > 1$ can be written as $n = k + m$ with $k, m \ge 1$ such that $2^k + m$ is a prime. In this paper, we unconditionally prove that the natural numbers…

数论 · 数学 2026-05-18 Songlin Han , Jinbo Yu

I give some claims on primorial prime numbers for interested readers in number theory.

综合数学 · 数学 2007-05-23 Turker Ozsari

Recently, there has been a sharp rise of interest in properties of digits primes. Here we study yet another question of this kind. Namely, we fix an integer base $g \ge 2$ and then for every infinite sequence $${\mathcal D} =…

数论 · 数学 2016-09-21 Domingo Gómez-Pérez , Igor E. Shparlinski

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