|
%I #6 Apr 28 2019 11:03:07
%S 2,4,24,120,840,1680,5040,720720,720720,24504480,465585120,465585120,
%T 465585120,53542288800,160626866400,4658179125600,288807105787200,
%U 288807105787200,288807105787200,10685862914126400,10685862914126400
%N LCM of all differences of odd primes up to prime(n).
%C That is, we compute the LCM of all differences prime(i)-prime(j) for 1 < j < i <= n.
%H P. Erdős, <a href="https://users.renyi.hu/~p_erdos/1986-15.pdf">Some problems on number theory, Analytic and elementary number theory</a>, (Marseille, 1983), Publ. Math. Orsay, 86-1, pp. 53-67, Univ. Paris XI, Orsay, 1986.
%H P. Erdős, <a href="https://users.renyi.hu/~p_erdos/1986-16.pdf">Some problems on number theory</a>, Proceedings of the seventeenth Southeastern international conference on combinatorics, graph theory, and computing (Boca Raton, Fla., 1986 Congr. Numer. 54 (1986), 225-244.
%t Table[p=Prime[Range[2,n]]; d=Rest[Union[Abs[Flatten[Outer[Plus,p,-p]]]]]; LCM@@d, {n,3,30}]
%K nonn
%O 3,1
%A _T. D. Noe_, Aug 12 2009
|
