中文
相关论文

相关论文: On differences between consecutive numbers coprime…

200 篇论文

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

This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared…

计算机科学中的逻辑 · 计算机科学 2016-12-09 Arno Pauly , Florian Steinberg

The Franel numbers given by $f_n=\sum_{k=0}^n\binom{n}{k}^3$ ($n=0,1,2,\ldots$) play important roles in both combinatorics and number theory. In this paper we initiate the systematic investigation of fundamental congruences for the Franel…

数论 · 数学 2015-03-19 Zhi-Wei Sun

Let $m$ be a Carmichael number and let $L$ be the least common multiple of $p-1$, where $p$ runs over the prime factors of $m$. We determine all the Carmichael numbers $m$ with a Fermat prime factor such that $L=2^{\alpha}P^2$, where $k\in…

数论 · 数学 2017-10-05 Yu Tsumura

Consider the operation of adding the same number of identical digits to the left and to the right of a number n. In OEIS sequence A090287, it was conjectured that this operation will not produce a prime if and only if n is a palindrome with…

数论 · 数学 2015-10-22 Chai Wah Wu

It has been known since Vinogradov that, for irrational $\alpha$, the sequence of fractional parts $\{\alpha p\}$ is equidistributed in $\mathbb{R}/\mathbb{Z}$ as $p$ ranges over primes. There is a natural second-order equidistribution…

数论 · 数学 2018-02-21 Aled Walker

Let pi(x) denote the number of primes smaller or equal to x. We compare sqrt{pi}(x) with sqrt{R}(x) and sqrt{li}(x), where R(x) and li(x) are the Riemann function and the logarithmic integral, respectively. We show a regularity in the…

数论 · 数学 2007-05-23 Erika Alvarez , Jean Pestieau

We prove that there exist infinitely many (-1,1)-Carmichael numbers, that is, square-free, composite integers n such that p+1 divides n-1 for each prime p dividing n.

数论 · 数学 2022-07-26 Qi-Yang Zheng

Let $k\geq1$ be a fixed integer, and $\mathcal P_N$ be the set of primes no more than $N$. We prove that if a set $\mathcal A\subset\mathcal P_N$ contains no patterns $p_1,p_1+(p_2-1)^k$, where $p_1,p_2$ are prime numbers, then \[…

数论 · 数学 2024-10-15 Mengdi Wang

Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…

数论 · 数学 2022-12-01 Hrishabh Mishra , Anwesh Ray

In this note, we study the problem of existence of sequences of consecutive 1's in the periodic part of the continued fractions expansions of square roots of primes. We prove unconditionally that, for a given $N\gg 1$, there are at least…

数论 · 数学 2019-04-09 Piotr Miska , Maciej Ulas

We explicitly construct a diffeomorphic pair (p(x),p^{-1}(x)) in terms of an appropriate quadric spline interpolating the prime series. These continuously differentiable functions are the smooth analogs of the prime series and the prime…

数学物理 · 物理学 2007-05-23 Lubomir Alexandrov , Lachezar Georgiev

We consider several problems about pseudoprimes. First, we look at the issue of their distribution in residue classes. There is a literature on this topic in the case that the residue class is coprime to the modulus. Here we provide some…

数论 · 数学 2021-03-02 Carl Pomerance , Samuel S. Wagstaff

``Behind every limit theorem, there is an inequality'' said Kolmogorov. We say ``for every inequality, there is an approximate inequality under approximate regularity conditions.'' Suppose $X, X'$ are independent and identically distributed…

统计理论 · 数学 2026-04-17 Manit Paul , Arun Kumar Kuchibhotla

Within the scope of elementary number theory, we prove that, as the main result, if $1 \leq x < y < z$ are integers such that at least one of $y, z, x+y$ is prime then $x^{n}+y^{n} \neq z^{n}$ for every odd integer $n \geq 3$. This result…

综合数学 · 数学 2020-03-23 Yu-Lin Chou

The repetition threshold is the smallest real number $\alpha$ such that there exists an infinite word over a $k$-letter alphabet that avoids repetition of exponent strictly greater than $\alpha$. This notion can be generalized to graph…

离散数学 · 计算机科学 2018-06-29 Borut Lužar , Pascal Ochem , Alexandre Pinlou

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

数论 · 数学 2016-02-26 Zhi-Wei Sun

The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that for all $x \geq R_n$ the interval $(x/2, x]$ contains at least $n$ primes. In this paper we undertake a study of the sequence $(\pi(R_n))_{n \in \mathbb{N}}$, which…

数论 · 数学 2017-11-15 Christian Axler

Every function over the natural numbers has an infinite subdomain on which the function is non-decreasing. Motivated by a question of Dzhafarov and Schweber, we study the reverse mathematics of variants of this statement. It turns out that…

逻辑 · 数学 2016-03-30 Ludovic Patey

The objective of this paper is to introduce an approach to the study of the nonasymptotic distribution of prime numbers. The natural numbers are represented by theorem 1 in the matrix form ^2N. The first column of the infinite matrix ^2N…

数论 · 数学 2007-05-23 Lubomir Alexandrov