4
$\begingroup$

In this previous discussion, it was demonstrated that the standard Least Common Multiple sequence $\text{lcm}(1, 2, \dots, n)$ is not a subset of the highly abundant numbers. In analytic number theory, the Least Common Multiple of the first $n$ integers is fundamentally linked to the second Chebyshev function $\psi(n)$ and the distribution of prime powers through the identity:

$$\text{lcm}(1, 2, \dots, n) = e^{\psi(n)} = \prod_{p \leq n} p^{\lfloor \log_p n \rfloor}$$

I defined and I am investigating an extension of this structure, which I denote as $\Xi(n)$. This function is defined by a hierarchical $p$-adic valuation that accounts for the harmonic contribution of all $k$-th roots of $n$:

$$\Xi(n) = \prod_{p \leq n} p^{\sum_{k=1}^{\infty} \lfloor \frac{1}{k} \log_p n \rfloor}$$

To see how this relates to the standard LCM, we can expand the exponent $E_p(n) = \sum_{k=1}^{\infty} \lfloor \log_p (n^{1/k}) \rfloor$ and distribute the product over each $k$. By applying the property $\log_p(n^{1/k}) = \frac{1}{k}\log_p n$, the development of the product is as follows:

$$\Xi(n) = \prod_{p \leq n} p^{\lfloor \log_p n \rfloor + \lfloor \frac{1}{2} \log_p n \rfloor + \lfloor \frac{1}{3} \log_p n \rfloor + \lfloor \frac{1}{4} \log_p n \rfloor + \dots}$$

$$\Xi(n) = \left( \prod_{p \leq n} p^{\lfloor \log_p n \rfloor} \right) \cdot \left( \prod_{p \leq n^{1/2}} p^{\lfloor \log_p n^{1/2} \rfloor} \right) \cdot \left( \prod_{p \leq n^{1/3}} p^{\lfloor \log_p n^{1/3} \rfloor} \right) \cdot \left( \prod_{p \leq n^{1/4}} p^{\lfloor \log_p n^{1/4} \rfloor} \right) \cdots$$

By identifying each term as an LCM of decreasing order, we obtain the following explicit equivalence:

$$\Xi(n) = \text{lcm}(1, \dots, n) \cdot \text{lcm}(1, \dots, \lfloor n^{1/2} \rfloor) \cdot \text{lcm}(1, \dots, \lfloor n^{1/3} \rfloor) \cdot \text{lcm}(1, \dots, \lfloor n^{1/4} \rfloor) \cdots$$Which can be written compactly as:$$\Xi(n) = \prod_{k=1}^{\infty} \text{lcm}(1, 2, \dots, \lfloor n^{1/k} \rfloor)$$

I believe firmly, through my research, that this construction "injects" additional density into the exponents of smaller primes, effectively weighting the prime factors to improve the sequence $\text{lcm}(1, 2, \dots, n)$ and makes it "Highly Abundant" completely. Therefore, I have come to the following improved conjecture:

The Conjecture: For every $n \in \mathbb{N}$, $\Xi(n)$ is a Highly Abundant number ($\sigma(\Xi(n)) > \sigma(m)$ for all $m < \Xi(n)$).

$\endgroup$
1
  • 2
    $\begingroup$ One can also write $\Xi(n)$ as a finite product: $$\Xi(n) = \prod_{k=1}^{\lfloor\log_2 n\rfloor} \text{lcm}(1, 2, \dots, \lfloor n^{1/k} \rfloor).$$ $\endgroup$ Commented Mar 28 at 20:48

1 Answer 1

4
$\begingroup$

The conjecture fails for the first time at $n=27$ with $$\Xi(27) = 57825671904000 = 2^8 \cdot 3^5 \cdot 5^3 \cdot 7 \cdot 11 \cdot 13 \cdot 17 \cdot 19 \cdot 23,$$ which has $\sigma$ smaller than that of the following smaller number: $$57761421157440 = 2^6 \cdot 3^3 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \cdot 17 \cdot 19 \cdot 23 \cdot 29 \cdot 31.$$

$\endgroup$
10
  • 1
    $\begingroup$ I see that it is very difficult to construct at least in a multiplicative way a subset of highly abundant numbers, does one exist? $\endgroup$ Commented Mar 28 at 21:47
  • 2
    $\begingroup$ I'm not aware of the patterns, but you can search for those in the factorizations of first highly abundant numbers - OEIS provides $10^5$ of them in oeis.org/A002093/b002093.txt Also, in that range it's easy to test if a particular number is HA - if it lays strictly in between two consecutive terms, it's not HA. $\endgroup$ Commented Mar 28 at 22:38
  • 2
    $\begingroup$ Beyond that range, you can test for HAness with my SageMath code posted in mathoverflow.net/q/501164 $\endgroup$ Commented Mar 28 at 22:44
  • 3
    $\begingroup$ @JoséDamiánEspinosa see the Colossally Abundant Numbers en.wikipedia.org/wiki/Colossally_abundant_number $\endgroup$ Commented Mar 28 at 22:53
  • 2
    $\begingroup$ I wrote mathoverflow.net/questions/79927/… $\endgroup$ Commented Mar 28 at 22:57

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.