# Least Common Multiplier of First N Numbers

There is a famous result that is quite surprising if you see it the first time: The log of the least common multiplier of the first n integers is approximately n. The quotient converges to 1. Or to say it another way: It’s n-th root converges to e. You will find this result in the net. It is equivalent to the theorem about the distribution of prime numbers.

Let us check that with software.

>&load("functs");
>&lcm(makelist(n,n,1,500)), &log(float(%))/500

7323962231895284659386387451904229882976133825128925904634919\
003459630742080371339432775981989132698526831260664840887571331401331\
362333709431244066365980335206141556095539831625389222073894558545019\
7206138869521568000

1.003304233299495


Of course, this infinite integer arithmetic of Maxima is not an effective way to check the result. Instead, we can use the following code to get the quotient for much higher numbers.

>N=100000000;
>p=primes(N);
>f=floor(log(N)/log(p));
>longest sum(f*log(p))/N
0.9999824279662022


This is based on the following observation. To compute the least common multiplier of 1  to n, we have to compute

$$p_1^{k_1} \cdot \ldots \cdot p_m^{k_m}$$

for all primes p(i) less then n, where k(i) is the largest number so that

$$p_i^{k_i} \le n$$

The logarithm of this product is exactly what is computed in the code above. If we make this a function and compute it for N from 10 to 5000, we get the following graph. Diese Website verwendet Akismet, um Spam zu reduzieren. Erfahre mehr darüber, wie deine Kommentardaten verarbeitet werden.