English
Related papers

Related papers: The density of primes dividing a particular non-li…

200 papers

We study the notion of Beurling-Malliavin density from the point of view of Number Theory. We prove a general relation between the Beurling-Malliavin density and the upper asymptotic density; we identify a class of sequences for which the…

Number Theory · Mathematics 2023-11-09 Rita Giuliano , Georges Grekos

We prove that if A is a subset of the primes, and the lower density of A in the primes is larger than 5/8, then all sufficiently large odd positive integers can be written as the sum of three primes in A. The constant 5/8 in this statement…

Number Theory · Mathematics 2015-01-14 Xuancheng Shao

We establish mean convergence for multiple ergodic averages with iterates given by distinct fractional powers of primes and related multiple recurrence results. A consequence of our main result is that every set of integers with positive…

Dynamical Systems · Mathematics 2022-05-19 Nikos Frantzikinakis

The aim of the inverse Galois problem is to find extensions of a given field whose Galois group is isomorphic to a given group. In this article, we are interested in subgroups of GL(2,Z/nZ) where n is an integer. We know that, in general,…

Number Theory · Mathematics 2023-10-11 Zoé Yvon

Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…

Number Theory · Mathematics 2016-01-21 Vladimir Shevelev

Infinite exponential sequences of distinct prime numbers of the form $\lfloor a c^{n^d}+b\rfloor$, $n\geq 0$, are proved to exist for well chosen real constants $a>0$, $b$, $c>1$, $d>1$, assuming Cramer's conjecture on prime gaps. There is…

Number Theory · Mathematics 2020-12-08 Bernard Montaron

Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this paper, the structure of n-periodic binary…

Information Theory · Computer Science 2026-02-03 Qin Yuan , Chunlei Li , Xiangyong Zeng

Let $\mathcal{P}$ denote the set of all primes. $P_{1},P_{2},P_{3}$ are three subsets of $\mathcal{P}$. Let $\underline{\delta}(P_{i})$ $(i=1,2,3)$ denote the lower density of $P_{i}$ in $\mathcal{P}$, respectively. It is proved that if…

Number Theory · Mathematics 2016-03-02 Quanli Shen

For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…

Number Theory · Mathematics 2007-05-23 Pieter Moree

The order and disorder of binary representations of the natural numbers < 2^8 is measured using the BiEntropy function. Significant differences are detected between the primes and the non primes. The BiEntropic prime density is shown to be…

Other Computer Science · Computer Science 2020-04-06 Grenville J. Croll

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…

Number Theory · Mathematics 2021-11-15 Andreas Weingartner

All the known approximations of the number of primes pi(n) not exceeding any given integer n are derived from real-valued functions that are asymptotic to pi(x), such as x/log x, Li(x) and Riemann's function R(x). The degree of…

General Mathematics · Mathematics 2015-12-31 Bhupinder Singh Anand

It follows from the work of Artin and Hooley that, under assumption of the generalized Riemann hypothesis, the density of the set of primes $q$ for which a given non-zero rational number $r$ is a primitive root modulo $q$ can be written as…

Number Theory · Mathematics 2019-02-20 H. W. Lenstra , P. Moree , P. Stevenhagen

In this article new cases of the Inverse Galois Problem are established. The main result is that for a fixed integer n, there is a positive density set of primes p such that PSL_2(F_{p^n}) occurs as the Galois group of some finite extension…

Number Theory · Mathematics 2009-05-11 Luis Dieulefait , Gabor Wiese

If b^2 + 1 is prime then b must be even, hence we examine the form 4u^2 + 1. Rather than study primes of this form we study composites where the main theorem of this paper establishes that if 4u^2 + 1 is composite, then u belongs to a set…

General Mathematics · Mathematics 2010-07-28 Kent Slinker

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

Number Theory · Mathematics 2012-09-20 Zhi-Wei Sun

The following is proven using arguments that do not revolve around the Riemann Hypothesis or Sieve Theory. If $p_n$ is the $n^{\rm th}$ prime and $g_n=p_{n+1}-p_n$, then $g_n=O({p_n}^{2/3})$.

Number Theory · Mathematics 2020-06-09 Madieyna Diouf

For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…

Combinatorics · Mathematics 2007-05-23 H. A. Verrill

The van der Laan-Padovan sequence $P_n ~ (n=0, 1, \ldots)$ is defined by $P_0=1, P_1=P_2=0$, and $P_{n+3}=P_{n+1}+P_n$ for $n=0, 1, \ldots$. We determine all pairs $(P_m, P_n)$ satisfying $P_m^b=2^{g_1} 3^{g_2} 5^{g_3} 7^{g_4} P_n^a$ for…

Number Theory · Mathematics 2025-10-14 Tomohiro Yamada

Let $E$ be an elliptic curve defined over $\mathbb{Q}$, and let $\rho_E\colon {\rm Gal}(\overline{\mathbb{Q}}/\mathbb{Q})\to {\rm GL}(2,\widehat{ \mathbb{Z} })$ be the adelic representation associated to the natural action of Galois on the…

Number Theory · Mathematics 2021-06-24 Harris B. Daniels , Álvaro Lozano-Robledo
‹ Prev 1 8 9 10 Next ›