Landau's function for one million billions

Details Landau's function for one million billions Landau's function for one million billions

2008-03-14

arxiv.org/abs/0803.2160v1

Mathematics

Number Theory

Scientific paper

Let ${\mathfrak S}_n$ denote the symmetric group with $n$ letters, and $g(n)$ the maximal order of an element of ${\mathfrak S}_n$. If the standard factorization of $M$ into primes is $M=q_1^{\al_1}q_2^{\al_2}... q_k^{\al_k}$, we define $\ell(M)$ to be $q_1^{\al_1}+q_2^{\al_2}+... +q_k^{\al_k}$; one century ago, E. Landau proved that $g(n)=\max_{\ell(M)\le n} M$ and that, when $n$ goes to infinity, $\log g(n) \sim \sqrt{n\log(n)}$. There exists a basic algorithm to compute $g(n)$ for $1 \le n \le N$; its running time is $\co(N^{3/2}/\sqrt{\log N})$ and the needed memory is $\co(N)$; it allows computing $g(n)$ up to, say, one million. We describe an algorithm to calculate $g(n)$ for $n$ up to $10^{15}$. The main idea is to use the so-called {\it $\ell$-superchampion numbers}. Similar numbers, the {\it superior highly composite numbers}, were introduced by S. Ramanujan to study large values of the divisor function $\tau(n)=\sum_{d\dv n} 1$.

Affiliated with

Also associated with

No associations

Rating

Landau's function for one million billions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Landau's function for one million billions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Landau's function for one million billions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-246778