if only co(n) -> with n . Hence log O(P) is for almost all P's much less than its maximum, which is as LANDAU 2 proved, 1/n log n . Though several questions in the first paper were left to later… (More)

A universal algorithm is given for computing a root of an arbitrary polynomial with complex coefficients in a number of operations dependent only on the order n and relative error e. This paper is a… (More)

1 . In the first and second parts of this sequence we dealt with applications of graph theory to distance distribution in certain sets in euclidean spaces, to potential theory, to estimations of the… (More)

1. In a sequence of papers l) the last two named authors are developing a statistical theory of the symmetric group S, of n letters. Some of the results can be immediately extended to A,, to the… (More)

The problems of the theory of diophantine approximation concern in general the solvability and non-solvability of systems of inequalities in rational integers (or integers of an algebraic extension… (More)

Our frienctslup and collaboration spread over most of our active and scientific life. We first met at the University of Budapest in September 1930 and innnediately discovered our common interest in… (More)

where for n 1, 2 . . . . we have (1 .2) 1 fix,,,>xz„> . . .>x,,,, Then, as it is well known, for given values y,,,, there is exactly one polynomial g(x) of degree ~ aI such that g(x, •„)(r'1, 2, . .… (More)

BACKGROUND
Diabetes is a condition known even in its early stages to impair the normal course of wound healing, thus leading to chronic wounds. The role of insulin in the regulation of energy… (More)

1. We start by explaining two groups of theorems and we shall derive both from a common source. P. Bloch and G. P6lya' investigated first the question of giving an upper estimation of the number R of… (More)