English
Related papers

Related papers: On the generalization of Golomb's conjecture

200 papers

Question 10208b (1992) of the American Mathematical Monthly asked: does there exist an increasing sequence $\{a_k\}$ of positive integers and a constant $B > 0$ having the property that $\{ a_k + n\}$ contains no more than $B$ primes for…

Number Theory · Mathematics 2016-04-26 Christian Elsholtz

Suppose that $n$ is $0$ or $4$ modulo $6$. We show that there are infinitely many primes of the form $p^2 + nq^2$ with both $p$ and $q$ prime, and obtain an asymptotic for their number. In particular, when $n = 4$ we verify the `Gaussian…

Number Theory · Mathematics 2024-10-15 Ben Green , Mehtaab Sawhney

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

Number Theory · Mathematics 2015-07-10 Ernie Croot , Neil Lyall , Alex Rice

Let $[\, \cdot\,]$ be the floor function and $\|x\|$ denote the distance from $x$ to the nearest integer. In this paper we show that whenever $\alpha$ is irrational and $\beta$ is real then for any fixed $\frac{13}{14}<\gamma<1$, there…

Number Theory · Mathematics 2025-05-29 S. I. Dimitrov , M. D. Lazarova

Given a prime $p\geq 5$, we reduce modulo p a convolution of order p-1 of powers of two weighted Bernoulli numbers with Bernoulli numbers in terms of harmonic numbers and generalized harmonic numbers. Our proof is based on studying the…

Number Theory · Mathematics 2021-11-08 Claire I. Levaillant

Let $P_{r}$ denote an integer with at most $r$ prime factors counted with multiplicity. In this paper we prove that for some $\lambda < \frac{1}{12}$, the inequality $\{\sqrt{p}\}<p^{-\lambda}$ has infinitely many solutions in primes $p$…

Number Theory · Mathematics 2025-10-14 Runbo Li

In this paper we examine Grosswald's conjecture on $g(p)$, the least primitive root modulo $p$. Assuming the Generalized Riemann Hypothesis (GRH), and building on previous work by Cohen, Oliveira e Silva and Trudgian, we resolve Grosswald's…

Number Theory · Mathematics 2016-08-08 Kevin McGown , Enrique Treviño , Tim Trudgian

Let $p_{1}<p_2<... <p_{\nu}<...$ be the sequence of prime numbers and let $m$ be a positive integer. We give a strong asymptotic formula for the distribution of the set of integers having prime factorizations of the form…

Number Theory · Mathematics 2013-11-28 Hans Vernaeve , Jasson Vindas , Andreas Weiermann

We give a reformulation of the Lehmer conjecture about algebraic integers in terms of a simple counting problem modulo p.

Number Theory · Mathematics 2019-05-21 Emmanuel Breuillard , Péter P. Varjú

Let p be an odd prime. Let K_p = Q(zeta) be the p-cyclotomic field. Let pi be the prime ideal of K_p lying over p. Let G be the Galois group of K_p. Let v be a primitive root mod p. Let sigma be a Q-isomorphism of K_p. Let P(sigma) =…

Number Theory · Mathematics 2007-05-23 Roland Queme

Let $p$ be a prime and let $g(p)$ be the least primitive root modulo $p$. We prove that for any $\epsilon>0$ and $p$ large enough the bound \begin{align} g(p)\ll p^{\frac{1}{4\sqrt{e}}+\epsilon} \nonumber \end{align} holds for most prime…

Number Theory · Mathematics 2018-01-23 Andrea Sartori

Although squaring integers is deterministic, squares modulo a prime, $p$, appear to be random. First, because they are all generated by the multiplicative linear congruential equation, $x_{i+1} = g^2 x_i \mod p$, where $x_0 = 1$ and $g$ is…

Applications · Statistics 2016-12-20 Roger Bilisoly

We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.

Number Theory · Mathematics 2024-06-24 Rodrigo Angelo , Max Wenqiang Xu

We give an asymptotic formula for correlations \[ \sum_{n\le x}f_1(P_1(n))f_2(P_2(n))\cdot \dots \cdot f_m(P_m(n))\] where $f\dots,f_m$ are bounded "pretentious" multiplicative functions, under certain natural hypotheses. We then deduce…

Number Theory · Mathematics 2019-02-20 Oleksiy Klurman

Let $r\ge k\ge 2$ be fixed positive integers. Let $\varrho_{r,k}$ denote the characteristic function of the set of $r$-tuples of positive integers with $k$-wise relatively prime components, that is any $k$ of them are relatively prime. We…

Number Theory · Mathematics 2016-04-11 László Tóth

We study the number of primes with a given primitive root and in an arithmetic progression under the assumption of a suitable form of the generalized Riemann Hypothesis. Previous work of Lenstra, Moree and Stevenhagen has given asymptotics…

Number Theory · Mathematics 2018-10-16 Michel Zoeteman

For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with…

Number Theory · Mathematics 2018-04-25 Olivier Bordellès , Florian Luca , Pieter Moree , Igor E. Shparlinski

Let $B_n$ ($n = 0, 1, 2, ...$) denote the usual $n$-th Bernoulli number. Let $l$ be a positive even integer where $l=12$ or $l \geq 16$. It is well known that the numerator of the reduced quotient $|B_l/l|$ is a product of powers of…

Number Theory · Mathematics 2009-08-08 Bernd C. Kellner

Given a finitely generated multiplicative subgroup of rational numbers $\Gamma$, assuming the Generalized Riemann Hypothesis, we determine an asymptotic formula for average over prime numbers, powers of the order of the reduction group…

Number Theory · Mathematics 2016-02-04 Cihan Pehlivan

Let $\pi(x;\gamma_1,\gamma_2)$ denote the number of primes $p$ with $p\leqslant x$ and $p=\lfloor n^{1/\gamma_1}_1\rfloor=\lfloor n^{1/\gamma_2}_2\rfloor$, where $\lfloor t\rfloor$ denotes the integer part of $t\in\mathbb{R}$ and…

Number Theory · Mathematics 2023-10-02 Xiaotian Li , Wenguang Zhai , Jinjiang Li
‹ Prev 1 4 5 6 7 8 10 Next ›