1~n的最小公倍数小于3^n.pdfVIP

Canad. Math. Bull. Vol. 15 (1), 1972 ON THE PRODUCT OF THE PRIMES BY DENIS HANSON In memory of Leo M oser, a friend and teacher for many years 1. In recent years several attempts have been made to obtain estimates for the product of the primes less than or equal to a given integer n. Denote by , ^(«)=^p5:n/ the above-mentioned product and define as usual 0(H) = 2 1 °SP an d T(«) = 2 log/;. Analysis of binomial and multinomial coefficients has led to results such as n A(n) 4 , due to Erdôs and Kalmar (see [2]). A note by Moser [3] gave an inductive n proof of A(ri)(331) , and Selfridge (unpublished) proved A(n) (3.05)\ More accurate results are known, in particular those in a paper of Rosser and Schoenfeld [4] in which they prove ©(«) 1.01624/*; however their methods are considerably deeper and involve the theory of a complex variable as well as heavy computations. Using only elementary methods we will prove the following theorem, which im- proves the results of [2] and [3] considerably. THEOREM 1. Let B(n) denote the least common multiple of the integers 1, 2,... , n. Then B(n) 3n . a Note that for a given prime p, if a is such that p p is the highest power of p not p a exceeding w, then B(ri) is the product of the p p taken over all primes pn. That is a B(n) = riP or B(n) = T[P- 2. Before proving Theorem