Search arXivSearch

arXiv · 1705.04303

On a product of certain primes

Abstract

We study the properties of the product, which runs over the primes, $$\mathfrak{p}_n = \prod_{s_p(n) \, \geq \, p} p \quad (n \geq 1),$$ where $s_p(n)$ denotes the sum of the base-$p$ digits of $n$. One important property is the fact that $\mathfrak{p}_n$ equals the denominator of the Bernoulli polynomial $B_n(x) - B_n$, where we provide a short $p$-adic proof. Moreover, we consider the decomposition $\mathfrak{p}_n = \mathfrak{p}_n^- \cdot \mathfrak{p}_n^+$, where $\mathfrak{p}_n^+$ contains only those primes $p > \sqrt{n}$. Let $ω( \cdot )$ denote the number of prime divisors. We show that $ω( \mathfrak{p}_n^+ ) < \sqrt{n}$, while we raise the explicit conjecture that $$ω( \mathfrak{p}_n^+ ) \, \sim \, κ\, \frac{\sqrt{n}}{\log n} \quad \text{as $n \to \infty$}$$ with a certain constant $κ> 1$, supported by several computations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bernd C. Kellner. 2017-05-11. On a product of certain primes. https://doi.org/10.1016/j.jnt.2017.03.020

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT