Related papers: Prime divisors of the Lagarias sequence
Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…
Let $s$ be a fixed positive integer constant, $\varepsilon$ be a fixed small positive number. Then, provided that a prime $p$ is large enough, we prove that for any set $\{{\mathcal M}\subseteq \mathbb F_p^*$ of size $|{\mathcal M}|=…
Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…
We study the existence of various sign and value patterns in sequences defined by multiplicative functions or related objects. For any set $A$ whose indicator function is 'approximately multiplicative' and uniformly distributed on short…
For any constant $C_0>0$, we construct a set $A \subset {\mathbb N}$ such that one has $$ \sum_{n \in A: n \leq x} \frac{1}{n} = \exp\left(\left(\frac{C_0}{2}+o(1)\right) (\log\log x)^{1/2} \log\log\log x \right)$$ and $$ \sum_{n,m \in A:…
Chebotarev's density theorem asserts that the prime ideals are equidistributed among the conjugacy classes of the Galois group of any normal extension of number fields. An effective version of this theorem was first established by Lagarias…
Let $a_0=b_0=0$ and $0<a_1\leq b_1<a_2\leq b_2<\ldots\leq b_{n}$ be integers. Let $Q\left(x;\bigcup_{j=1}^{n}[a_j,b_j]\right)$ be the number of integers between $1$ and $x$ such that all exponents in their prime factorization are in…
The prime numbers look like a randomly chosen sequence of natural numbers, but there is still no strict theory to determine 'Randomness'. In these years, cryptography has developed a battery of statistical tests for randomness. In this…
The appearance of primes in a family of linear recurrence sequences labelled by a positive integer $n$ is considered. The terms of each sequence correspond to a particular class of Lehmer numbers, or (viewing them as polynomials in $n$)…
Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. In a continuation of a previous paper we prove that, if $D=1$ or $D$ is a prime number, the…
The density of primes $p$ such that the class number $h$ of $\mathbb{Q}(\sqrt{-p})$ is divisible by $2^k$ is conjectured to be $2^{-k}$ for all positive integers $k$. The conjecture is true for $1\leq k\leq 3$ but still open for $k\geq 4$.…
Let $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$--generalized Lucas numbers for some fixed integer $k\ge 2$ whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. For an integer $m$,…
We give asymptotic estimates for the mean number of divisors of integers without small prime factors, integers with bounded ratios of consecutive divisors, and for practical numbers. In the last case, this confirms a conjecture of…
In 2013, Strauch asked how various sequences of real numbers defined from trigonometric functions such as $x_n=(\cos n)^n$ distributed themselves$\pmod 1$. Strauch's inquiry is motivated by several such distribution results. For instance,…
We compute the density of the set of ordinary primes of an abelian surface over a number field in terms of the l-adic monodromy group. Using the classification of l-adic monodromy groups of abelian surfaces by Fite, Kedlaya, Rotger, and…
Let a be a positive integer which is not a perfect h-th power with h greater than 1, and Q_a(x;4,j) be the set of primes p less than x such that the residual order of a(mod p) is congruent to j modulo 4. When j=0, 2, it is known that…
Many famous integer sequences including the Catalan numbers and the Motzkin numbers can be expressed in the form $ConstantTermOf\left[P(x)^nQ(x)\right]$ for Laurent polynomials $Q$, and symmetric Laurent trinomials $P$. In this paper we…
Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…
A modified Lagrange Polynomial is introduced for polynomial extrapolation, which can be used to estimate the equally spaced values of a polynomial function. As an example of its application, this article presents a prime-generating…
Let $Q$ be a set of primes with relative density $\delta$. We count integers in $[1,x]$ with prime factors all in $Q$ that also have a divisor in $(y,2y]$. We establish the order of magnitude for all $\delta \in (0,1]$. This generalizes the…