# On a product of certain primes

## TL;DR

This paper investigates the properties of a prime product defined via base-$p$ digit sums, linking it to Bernoulli polynomials and exploring its prime divisor structure with conjectures on its asymptotic behavior.

## Contribution

It establishes a connection between the prime product and Bernoulli polynomial denominators, and formulates a conjecture on the asymptotic number of large prime divisors.

## Key findings

- (n) equals the denominator of Bernoulli polynomial difference
- _n^+ has fewer than (n) prime divisors
- Conjecture: _n^+ ext{ has about } rac{ ext{(n)}}{ ext{log } n} \text{prime divisors asymptotically}

## 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 $\omega( \cdot )$ denote the number of prime divisors. We show that $\omega( \mathfrak{p}_n^+ ) < \sqrt{n}$, while we raise the explicit conjecture that $$\omega( \mathfrak{p}_n^+ ) \, \sim \, \kappa \, \frac{\sqrt{n}}{\log n} \quad \text{as $n \to \infty$}$$ with a certain constant $\kappa > 1$, supported by several computations.