Rational chebyshev approximations of elementary functions

Explicit formulæ which should be useful in practical computations, are given for the functions e^–x, log x, (1 + x), arctg x/x, sin x/x, cos x and (2/x) arcsin (x/2) in the interval 0x1 except for log x, where the interval is 1/2x1 instead.     

On the prime zeta function

The basic properties of the prime zeta function are discussed in some detail. A certain Dirichlet series closely connected with the function is introduced and investigated. Its dependence on the structure of the natural numbers with respect to their factorization is particularly stressed.     

Partitions in squares

In this paper we study primarily partitions in different squares. A complete characterization of the least number of terms needed in different cases is given. The asymptotic number of partitions in squares and in different squares is deduced by use of numerical results obtained from extensive computer runs. Some other related problems are also discussed.     

Numerical studies of the Möbius power series

We define the Möbius power series throughf(z)= _n-1 z ⁿ ,g(z)= _n=1 (n)z ⁿ /n where (n) is the usual Möbius function. This paper presents some heuristic estimates describing the behavior off(z) andg(z) when |z| is close to 1 together with representations in terms of elementary functions for real values ofz. Function tables are also given together with zeros and a few other special values.     

Investigation of the Wilson remainders in the interval 3≦p<50,000

The Wilson remainders for all primes less than 50,000 have been computed and tabulated. The distribution of the remainders divided by the corresponding primes has also been examined.     

On a combinatorial problem related to permanents

Some numerical results will be presented concerning the largest and smallest values of square permanents containing the integers 1, 2, 3, ...,n ² n=1(1)8.Dedicated to Peter Naur on the occasion of his 60th birthday     

Numerical results on the Goldbach conjecture

The number of Goldbach partitions has been computed for all even numbers 350,000 and compared to well-known theoretical estimates. The random fluctuations are slowly decreasing and less than ± 5 per cent at the upper end of the interval. The number of partitions is given explicitly for 2 ⁿ ,n=3(1)22. Further, if for a givenN the smallest prime in all partitions of 2N isa=a(2N) we have also determineda ₁(2N ₁)<a ₂(2N ₂)<... withN ₁<N ₂<... such thatn<N _k impliesa(2n)<a _k (2N _k ) up to 2n=40,000,000.