中文
相关论文

相关论文: Uniform Bounds for the Least Almost-Prime Primitiv…

200 篇论文

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…

数论 · 数学 2016-02-04 Cihan Pehlivan

Let $1<g_1<\ldots<g_{\varphi(p-1)}<p-1$ be the ordered primitive roots modulo~$p$. We study the pseudorandomness of the binary sequence $(s_n)$ defined by $s_n\equiv g_{n+1}+g_{n+2}\bmod 2$, $n=0,1,\ldots$. In particular, we study the…

数论 · 数学 2021-05-18 Arne Winterhof , Zibi Xiao

ABSTRACT. In this article we present a point of view that highlights the importance of finding the upper bounds for prime gaps, in order to solve the twin primes conjecture and the Goldbach conjecture. For this purpose, we present a…

综合数学 · 数学 2020-02-19 Andrea Berdondini

Let $\mathbb{F}_p$ be the field of residue classes modulo a prime number $p$ and let $A$ be a nonempty subset of $\mathbb{F}_p$. In this paper we show that if $|A|\preceq p^{0.5}$, then \[ \max\{|A\pm A|,|AA|\}\succeq|A|^{13/12};\] if…

数论 · 数学 2009-07-14 Liangpan Li

We fix a non-zero integer $a$ and consider arithmetic progressions $a \bmod q$, with $q$ varying over a given range. We show that for certain specific values of $a$, the arithmetic progressions $a \bmod q$ contain, on average, significantly…

数论 · 数学 2019-12-19 Daniel Fiorilli

For an elliptic curve E/Q without complex multiplication we study the distribution of Atkin and Elkies primes l, on average, over all good reductions of E modulo primes p. We show that, under the Generalised Riemann Hypothesis, for almost…

数论 · 数学 2019-02-20 Igor E. Shparlinski , Andrew V. Sutherland

This article examines lower bounds for the representation growth of finitely generated (particularly profinite and pro-p) groups. It also considers the related question of understanding the maximal multiplicities of character degrees in…

群论 · 数学 2009-10-06 David A Craven

We provide an elementary proof of the lower bound for the variance of continuous unimodal distributions and obtain analogous bounds for the higher order central moments. A lower bound for the rth central moment of discrete distribution is…

统计理论 · 数学 2016-02-16 R. Sharma , R. Bhandari , R. Saini

It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…

数论 · 数学 2024-07-24 Aleksandr Tuxanidy , Daniel Panario

In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such…

计算复杂性 · 计算机科学 2015-07-09 Ignacio Garcia-Marco , Pascal Koiran

Let $p>3$ be a prime. Euler numbers $E_{p-3}$ first appeared in H. S. Vandiver's work (1940) in connection with the first case of Fermat Last Theorem. Vandiver proved that $x^p+y^p=z^p$ has no solution for integers $x,y,z$ with…

数论 · 数学 2018-04-10 Romeo Mestrovic

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

Let $k \geq 3$ and let $L_i(n) = A_in + B_i$ be some linear forms such that $A_i$ and $B_i$ are integers. Define ${\mathcal{P}(n) = \prod_{i=1}^k L_i(n)}$. For each $k$ it is known that $\Omega (\mathcal{P} (n) ) \leq \rho_k$ infinitely…

数论 · 数学 2020-06-16 Paweł Lewulis

This work proposes elementary proofs of several related primes counting problems, based on an elementary weighted sieve. The subsets of primes considered here are the followings: the subset of twin primes PT = {p and p + 2 are primes}, the…

综合数学 · 数学 2012-08-29 N. A. Carella

This note investigates the average density of prime numbers $p\in[x,2x]$ with respect to a random simultaneous primitive root $g\leq p^{1/2+\varepsilon}$ over the finite rings $\mathbb{Z}/p\mathbb{Z}$ and $\mathbb{Z}/p^2\mathbb{Z}$ as $x…

综合数学 · 数学 2025-01-22 N. A. Carella

Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…

We show that for every positive p, the L_p-norm of linear combinations (with scalar or vector coefficients) of products of i.i.d. random variables, whose moduli have a nondegenerate distribution with the p-norm one, is comparable to the…

概率论 · 数学 2016-04-05 Ewa Damek , Rafał Latała , Piotr Nayar , Tomasz Tkocz

The classical Brun--Titchmarsh theorem gives an upper bound, which is of correct order of magnitude in the full range, for the number of primes $p\leqslant x$ satisfying $p\equiv a\bmod q$. We strengthen this inequality for different ranges…

数论 · 数学 2025-12-30 Ping Xi , Junren Zheng

Let $H$ be a Hardy field (a field consisting of germs of real-valued functions at infinity that is closed under differentiation) and let $f \in H$ be a subpolynomial function. Let $\mathcal{P} = \{2, 3, 5, 7, \dots \}$ be the (naturally…

数论 · 数学 2015-04-30 Vitaly Bergelson , Grigori Kolesnik , Younghwan Son

There has been considerable interest in recent decades in questions of random generation of finite and profinite groups, and finite simple groups in particular. In this paper we study similar notions for finite and profinite associative…

环与代数 · 数学 2024-02-21 Damian Sercombe , Aner Shalev