English
Related papers

Related papers: On a conjecture of Pomerance

200 papers

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…

Number Theory · Mathematics 2016-02-26 Zhi-Wei Sun

Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…

Number Theory · Mathematics 2015-03-17 Benoit Cloitre

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…

Number Theory · Mathematics 2013-06-06 Shanta Laishram , Ram Murty

We discuss the relationship between Penner's $\lambda$-length and the norms of Eisenstein integers. This leads to a geometric proof of the fact, attributed to Fermat, that every prime $p$ of the form $3k + 1$ is the norm of an Eisenstein…

Geometric Topology · Mathematics 2024-03-22 Greg McShane

A positive integer $n$ is said to be $k$-layered if its divisors can be partitioned into $k$ sets with equal sum. In this paper, we start the systematic study of these class of numbers. In particular, we state some algorithms to find some…

Number Theory · Mathematics 2022-07-20 Farid Jokar

Let $E(X)$ denote the number of even integers below $X$ which are not a sum of two primes. We prove the bound $E(X)=O(X^{\frac{7}{10}})$, where the implicit constant is ineffective. The method applied here also leads to $P(q)=O(q^5)$, where…

Number Theory · Mathematics 2026-01-26 Genheng Zhao

Let $p_n$ denote the $n$-th prime number, $\{q_n\}$ be a sequence of positive numbers and $x\in\mathbb{R}$. In this note we prove that the inequality $$q_n p_{n+1}^{x}-q_{n+1}p_{n}^{x}<p_{n}^{x}p_{n+1}^{x-1}, $$ holds for infinitely many…

Number Theory · Mathematics 2017-12-11 Douglas Azevedo , Tiago Reis

In paper on a classification of Lehmer triples, Juricevic conjectured that there are infinitely many primes of special form. We disprove one of his conjectures and consider the other one.

Number Theory · Mathematics 2010-04-09 Yu Tsumura

For a positive integer r we prove that if G is a profinite group in which the centralizer of every nontrivial element has rank at most r, then G is either a pro-p group or a group of finite rank. Further, if G is not virtually a pro-p…

Group Theory · Mathematics 2022-07-19 Pavel Shumyatsky

Let $f(n)=\min_{p} |n-p|$, where $p$ is a prime. We show that there is a positive constant $\delta$ such that for any large integer $N$ there exist two positive integers $n_1$ and $n_2$ such that $N=n_1 + n_2$ and $f(n_i)\gg \ln N (\ln\ln…

Number Theory · Mathematics 2024-09-24 Artyom Radomskii

Let $k\ge 2$ and $\Pi(n)=\prod_{i=1}^k(a_in+b_i)$ for some integers $a_i, b_i$ ($1\le i\le k$). Suppose that $\Pi(n)$ has no fixed prime divisors. Weighted sieves have shown for infinitely many integers $n$ that $\Omega(\Pi(n))\le r_k$…

Number Theory · Mathematics 2012-05-22 James Maynard

Let $k\ge 2$ be a positive integer and $P^+(n)$ the greatest prime factor of a positive integer $n$ with convention $P^+(1)=1$. For any $\theta\in \left[\frac 1{2k},\frac{17}{32k}\right)$, set…

Number Theory · Mathematics 2023-06-06 Yuchen Ding , Lilu Zhao

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…

Number Theory · Mathematics 2017-01-11 Zhi-Wei Sun

Let $\mathcal{P}$ be a subset of primes and for each prime $p\in \mathcal{P}$, consider a subset $\mathcal{L}_p$ of $\mathbb{Z}/p\mathbb{Z}$. We provide restriction estimates with integers $\leq N$ sifted by…

Number Theory · Mathematics 2026-05-14 Tanmoy Bera , G. K. Viswanadham

Let $R$ be a local, Gorenstein ring with algebraically closed residue field $k$ of characteristic 0 and let $P_R(z):=\sum_{p=0}^{\infty}\dim_k(\tor_p^R(k,k))z^p$ be its Poincar\'e series. We compute $P_R$ when $R$ belongs to a particular…

Commutative Algebra · Mathematics 2008-05-27 Gianfranco Casnati , Roberto Notari

In this paper, as a main theorem, we prove that the decision version of the Frobenius problem is Sigma_2^P-complete under Karp reductions.Given a finite set A of coprime positive integers, we call the greatest integer that cannot be…

Computational Complexity · Computer Science 2016-11-16 Shunichi Matsubara

In 1958 E. Lehmer found an explicit description of those primes p for which a given prime q is a cubic residue. In this paper we demonstrate that a similar result may be obtained for cubic nonresidues, yielding a cubic character for fixed p…

Number Theory · Mathematics 2007-06-11 Sam Vandervelde

A classic question in analytic number theory is to find asymptotics for $\sigma_{k}(x)$ and $\pi_{k}(x)$, the number of integers $n\leq x$ with exactly $k$ prime factors, where $\pi_{k}(x)$ has the added constraint that all the factors are…

Number Theory · Mathematics 2023-03-13 Eric Naslund

This paper investigates the existence of integers that exclude two specific residence values modulo primes up to $p_k$ within the interval $[p_k^2, p_{k+1}^2]$. Using asymptotic results from analytic number theory, we establish bounds on…

Number Theory · Mathematics 2025-01-28 Liang Zhao

Kurepa's conjecture states that there is no odd prime $p$ that divides $!p=0!+1!+\cdots+(p-1)!$. We search for a counterexample to this conjecture for all $p<2^{34}$. We introduce new optimization techniques and perform the computation…

Number Theory · Mathematics 2016-07-21 Vladica Andrejić , Milos Tatarevic