Zbl.No: 147.30201
Assume that for every \eta > 0, there is a g(\eta) so that for l > g(\eta) and n > 0, l-1 sumk =
This generalizes (a strengthened form of) a result of R.Bellman and H.N.Shapiro (Zbl 057.28602).
Theorem 2. To every c1, there is a c2 (c1), so that if a1 < a2 < ··· < ak \leq n are integers, k > c1n, A =
Also the following result (not stated as a formal theorem) is proved: Let a1 < a2 < ··· < ak \leq x be k integers such that no two of them are relatively prime, but every three are. If, for given x, one sets max k =
Reviewer: E.Grosswald
Classif.: * 11N64 Characterization of arithmetic functions
Index Words: number theory
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag