Abstract. An efficient exhaustive numerical search method for amicable pairs is.described. With the aid of this method all 1427 amicable pairs with smaller member below 1010 have been computed, more than 800 pairs being new. This extends previous exhaustive work below 108 by H. Cohen. In three appendices (contained in the supplements section of this issue), various statistics are given, including an ordered list of all the gcd's of the 1427 amicable pairs below 1010 (which may be useful in further amicable pair research). Suggested by the numerical results, a theorem of Borho and Hoffmann for constructing APs has been extended.1. Introduction. Let a(m) denote the sum of all the divisors of m, including 1 and m. An amicable pair (AP) is a pair of positive integers (m,n), m < n, such that a(m) = a(n) = m + n. We note that m is abundant (since a(m) > 2m) and that n is deficient (since a(n) < 2n). The smallest AP is