Advanced Search

Let $\tau \left(n\right)$ be the number of divisors of $n$ ; let us define $$S_{\lambda }\left(x\right)=\left\{\begin{array}{cc}Card\left\{n\le x;\tau \left(n\right)\ge {(logx)}^{\lambda log2}\right\}\hfill & \mathrm{if}\lambda \ge 1\hfill \\ Card\left\{n\le x;\tau \left(n\right)\<{(logx)}^{\lambda log2}\right\}\hfill & \mathrm{if}\lambda \<1\hfill \end{array}\right.$$ It has been shown that, if we set $$f(\lambda ,x)=\frac{x}{{(logx)}^{\lambda log\lambda -\lambda +1}\sqrt{loglogx}}$$ the quotient $S\lambda \left(x\right)/f(\lambda ,x)$ is bounded for $\lambda$ fixed.$$ The aim of this paper is to give an explicit value for the inferior and superior limits of this quotient when $\lambda \ge 2$. For instance, when $\lambda =1/log2$, we prove $$liminf\frac{S_{\lambda }\left(x\right)}{f(\lambda ,x)}=0.938278681143\cdots$$ and $$liminf\frac{S_{\lambda }\left(x\right)}{f(\lambda ,x)}=1.148126773469\cdots$$

Let ${𝔖}_n$ denote the symmetric group with $n$ letters, and $g\left(n\right)$ the maximal order of an element of ${𝔖}_n$. If the standard factorization of $M$ into primes is $M=q_1^{{\alpha }_1}{q}_2^{{\alpha }_2}...q_k^{{\alpha }_k}$, we define $\ell \left(M\right)$ to be $q_1^{{\alpha }_1}+q_2^{{\alpha }_2}+...+q_k^{{\alpha }_k}$; one century ago, E. Landau proved that $g\left(n\right)={max}_{\ell \left(M\right)\le n}M$ and that, when $n$ goes to infinity, $logg\left(n\right)\sim \sqrt{nlog\left(n\right)}$. There exists a basic algorithm to compute $g\left(n\right)$ for $1\le n\le N$; its running time is $𝒪\left(N^{3/2}/\sqrt{logN}\right)$ and the needed memory is $𝒪\left(N\right)$; it allows computing $g\left(n\right)$ up to, say, one million. We describe an algorithm to calculate $g\left(n\right)$ for $n$ up to ${10}^{15}$. The main idea is to use the so-called ...