40
MATHEMATICS OF COMPUTATION VOLUME 47. NUMBER 175 JULY I4K6. PACIES .161-36« Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele 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 (220,284) = (225.11,2271). In order to check whether or not a given positive integer m is the smaller member of an amicable pair, it seems necessary, at first sight, to compute a(m) and n := a(m) — m, to check whether n > m (i.e., whether m is abundant), and, if so, to compute a(n) and compare a(m) with a(n). This involves one or two complete factorizations, in case m is deficient or abundant, respectively. However, a closer look reveals that it is often possible to find out whether a given number m is deficient (hence cannot be the smaller member of an AP) without the need to factorize it completely. Moreover, once o(m) and n (= a(m) - m) have been computed, it is often possible to discover that a(n) ¥=a(m) without the need to factorize n completely. These considerations have guided the design of an efficient exhaustive numerical AP search algorithm, the details of which are given in Section 2. With the aid of this algorithm we have extended Cohen's exhaustive list of all 236 APs with smaller member below 108 [4] to all 1427 APs with smaller member below 1010. Of these, 601 have been published earlier [6], [7]. The other 826 seem to be new, and are published here for the first time (9 of them have been communicated to the author already in 1983 and 1984 by Woods (2), Borho (2) and Lee (5)). Section 3 presents details of the computations together with several tables collected from this search. Moreover, a result of Borho and Hoffmann for constructing APs is extended, as was suggested by the numerical tables. Received March 27, 1985. 1980 Mathematics Subject Classification. Primary 10A40; Secondary 10-04. Key words and phrases. Amicable pair. ©1986 American Mathematical Society 0025-5718/86 $1.00 + $.25 per page 361 License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

  • Upload
    others

  • View
    4

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

MATHEMATICS OF COMPUTATIONVOLUME 47. NUMBER 175JULY I4K6. PACIES .161-36«

Computation of All the Amicable Pairs Below 1010

By H. J. J. te Riele

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

(220,284) = (225.11,2271).In order to check whether or not a given positive integer m is the smaller member

of an amicable pair, it seems necessary, at first sight, to compute a(m) and

n := a(m) — m, to check whether n > m (i.e., whether m is abundant), and, if so, to

compute a(n) and compare a(m) with a(n). This involves one or two complete

factorizations, in case m is deficient or abundant, respectively. However, a closer

look reveals that it is often possible to find out whether a given number m is

deficient (hence cannot be the smaller member of an AP) without the need to

factorize it completely. Moreover, once o(m) and n (= a(m) - m) have been

computed, it is often possible to discover that a(n) ¥= a(m) without the need to

factorize n completely.

These considerations have guided the design of an efficient exhaustive numerical

AP search algorithm, the details of which are given in Section 2. With the aid of this

algorithm we have extended Cohen's exhaustive list of all 236 APs with smaller

member below 108 [4] to all 1427 APs with smaller member below 1010. Of these,

601 have been published earlier [6], [7]. The other 826 seem to be new, and are

published here for the first time (9 of them have been communicated to the author

already in 1983 and 1984 by Woods (2), Borho (2) and Lee (5)). Section 3 presents

details of the computations together with several tables collected from this search.

Moreover, a result of Borho and Hoffmann for constructing APs is extended, as was

suggested by the numerical tables.

Received March 27, 1985.

1980 Mathematics Subject Classification. Primary 10A40; Secondary 10-04.

Key words and phrases. Amicable pair.

©1986 American Mathematical Society

0025-5718/86 $1.00 + $.25 per page

361

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 2: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

362 H. J. J TE RIELE

Three appendices to this paper appear in the supplements section of this issue.

These may also be obtained by writing to the author.

In Appendix I, we present the complete list of all 1427 APs with smaller member

below 1010 ordered according to the size of the smaller members of the pairs.

Appendix II displays the same list with a different ordering, viz., according to the

various occurring types (defined in Section 3). Finally, Appendix III tabulates all the

greatest common divisors of the 1427 APs, in increasing order, together with their

frequencies of occurrence, and, for each gcd g, the rank numbers of all the APs

(m, n) for which gcd(w, n) = g.

2. Check Whether a Given m is the Smaller Member of an AP. Let p, be the ;th

prime, P,/= Wk%T1 pk, Qu-= UfJ/1 pk/(pk - 1). We start with the following

lemma which gives an upper bound for a(m)/m.

Lemma 2.1. // m only has prime divisors > p¡ (i > 1) and if m < P¡¡+i (j > 1)

then a(m)/m < Q(j.

Proof. Since m < P¡¡+i = PiP¡+\ ' • • pi+j, and since any prime divisor of m is

> p¡, it follows that m has at most j different prime divisors > p¡ (otherwise we

would have m > p¡p¡+\ ••• pi+j = Pij+i)- This implies that

a(m) n pe+l ~~ i n P ~ P e o P ' rr ^k - n

~™~ = /i p'(p - i) ~ p'I ^P31" < M P7^ * k=\ Jk~^=Q,J' DIn the algorithm below, this lemma is invoked very frequently. Therefore, we require

a precomputed table of P- and g-values, large enough so that the values needed can

be found quickly by simple table look-ups.

Now we describe an efficient algorithm to check whether a given positive integer

m belongs to an AP (m, n) with m < n. This algorithm is based on the observation

that when, for given y and N, we want to verify one of the relations a(N)/N > y,

= y, < y, and when the primes 2,3,...,p have been tried as divisors of N, it may

be possible

(i) to detect, with Lemma 2.1, whether a(N)/N < y by using the information that

the unfactored portion of N only has prime divisors > p, and

(ii) to detect whether a(N)/N > y by using the factored portion of N.

In this way, much unnecessary factorization time may be avoided. The price to pay

for this gain lies in the time needed to consult the P- and Q-tables used in Lemma

2.1. In the algorithm, the index z'max is the maximum value of i for which Lemma 2.1

is invoked. In order to restrict this table look-up time, t'max should not be chosen too

large. The optimal value of z'max also depends on the actual implementation of the

algorithm (cf. Section 3).

Algorithm to Check Whether m is the Smaller Member of an AP.

Step 1. (Find out whether m is abundant; in this step, keep m = mxm2 where

gcd(m1,wi2)= 1, mx is the factored and m2 is the unfactored portion of m,

a := a(mx)/mx; start with mx := 1, m2:= m, a.= 1.)

Start factoring m by trial dividing m2 by the primes px, p2,... < m1/2. In case a

prime power divisor p'_x (e > 1) of m2 has been found, update mx, m2 and a

(mx:= mxpf_x,m2:= m/mx,a:= a • o(pf_x)/pf_x). After the trial division with

p _, (whether or not p¡_x divides m2): if a < 2 and 4 < / < ;'max, check whether m

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 3: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

AMICABLE PAIRS BELOW 1010 363

is possibly deficient as follows: by inspecting the P-table find the smallest value of j

(='j*) such that m2 < Pjt+i', if «ô,,7» < 2, then STOP (because, in that case, m is

deficient: by Lemma 2.1 we have a(m2)/m2 < Qijt so that

o(m) °(mx) a(m2) a(m2)-=-•-= a-< aQH» < 2).

m mx m2 m2 J

If a > 2, or / < 4 or i > i'max, the deficiency check on m is left out. After the

complete factorization of m (and simultaneous computation of o(m))\ if m < a (m)

— m =.n (i.e., m is abundant), go to Step 2, otherwise STOP.

End of Step 1

Step 2. (Given m, a(m) and n = a(m) - m, check whether a(n) = a(m); during

the factorization of n try to exclude those m for which a(n)¥= a(m) as early as

possible by testing whether a(n)/n *= ß where ß = a(m)/n; in this step, keep

n — nxn2, where gcd(«l5 n2) = 1, nx is the factored and n2 the unfactored portion

of n, a.= a(nx)/nx; start with nx:= 1, n2:= n, a.= 1.)

Start factoring n by trial dividing n2 by the primes px, p2,... < n1/2. In case a

prime power divisor pf_x (e > 1) of n2 has been found, update nx, n2 and a: if the

updated a satisfies a > ß, then STOP (because, in that case, we have

o(n) o(nx) a(n2) a(nx) a(m)-=-^-= a > ß =-,

n nx n2 nx n

so that a(n) =£ a(m)). After the trial division with /?,_, (whether or not p¡_x divides

n2): if 4 < i < ¿max check whether a(n)/n < ß as follows: by inspecting the P-table

find the smallest value of ; (=:/*) such that n2 < Pij+1. If aQijt < ß, then STOP

(because, in that case, a(n)/n < ß: by Lemma 2.1 we have a(n2)/n2 < Q¡ ,, so

that

o(n) o(nx) a(n2) a(n2)——- =-= a-< aQ, ,» < ß ).

n nx n2 n2 *'•' HJ

If / < 4 or i > ;max, the check on a(n)/n < ß is omitted. After the complete

factorization of n (and simultaneous computation of o(n))\ check whether a(n) =

a(m). If so, (m, n) is an AP.

End of Step 2

3. Computing All the APs Below 1010. In order to compute all the APs (m, n) with

m < n and 108 < m < 1010 (thus extending H. Cohen's computations reported in

[4]), we distinguish between m = 0 (mod 6) (the easy case), and m # 0 (mod 6) (the

hard case).

If m = 0 (mod6) and n = a(m) - m is even, then (m, n) cannot be an AP [5].

Therefore, n should be odd. In that case, we have [6] m = 2)íM2, n = N2, with

H e N, M and N being odd. For all the numbers m = 2'"Ai2 with 3|M and

108 < m < 1010, we computed n := a(m) - m and checked whether n was a perfect

square. Not a single such case was found. Computer time was about 6 CPU seconds.

For all m # 0 (mod 6) with 108 < m < 1010 we used the algorithm of Section 2 to

find all APs in this range. The optimal choice of jmax for our FORTRAN-implemen-

tation on a CYBER 750 was about 75. This value was chosen to be fixed for the

whole range. The speed-up factor of our program was about 15, compared with a

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 4: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

364 H. J. J. TE RIELE

straightforward program which, given m, computes a(m) and, if n:= a(m) - m >

m, computes a(n). A slight increase of the speed was obtained as follows. In Step 1,

in case a prime (power) factor of m2 was found and mx and a(mx) (among others)

were updated, it was checked whether both mx and o(mx) were divisible by one of

the primitive abundant numbers 20 = 225, 28 = 227, 70 = 2.5.7 and 88 = 2311. If

so, the algorithm was stopped since this implied that also m and o(m), hence also

n = a(m) — m were divisible by this abundant number, so that both m and n were

abundant. This is impossible for an AP (m, n).

The total time to cover the range 108 < m < 1010 was about 1000 (low priority)

CPU hours, spent in the last seven months of 1984.

The total number of APs (m,n) found with m < n and 108 < m < 1010 was

1191. In Appendix I (of the supplements section) all the APs with smaller member

< 1010 are given (including the 236 APs with smaller member < 108). For each

pair we list the decimal representation and the prime factorization of the members, a

rank number, a code (letter plus digit) referring to the discoverer, and the type of the

pair (defined below). For example, pair #1427 reads as follows:

1427 9967523980 2E2.257.5.17.37.3083

R942 12890541236 2E2.257.107.117191.

Table 1 gives the meaning of the codes, and their frequencies of occurrence.

Extensive information about the sources of the pairs with code LI is given in the

survey paper [6].

There are 1015 pairs with even members and 412 with odd members. The minimal

and maximal values of m/n are 0.6979 and 0.999858 for the APs #567 and #1010,

respectively.

Let A(x) be the number of APs (m, n) with m < n and m < x. From the list of

APs with m < 108, Bratley et al. [3] concluded that for x < 108, A(x) is approxi-

mately proportional to x1/2/ln(x). In Table 2 we give, for x = k. 109 (1 < k < 10):

A(x), A(x)ln(x)/xl/2, A(x)(\n(x))2/x1/2 and A(x)(\n(x))3/xl/2. From these fig-

ures we may draw the conclusion that for x < 1010, A(x) is approximately propor-

tional to x1/2/(\n(x))3.

Table 1

Status list of the first 1427 APs (m,n), m < n, with m < 1010

code #APs references and remarks

LI

R2Wl

R3

W2R6

W3

L2B4

R9

5081

73

19

11

1

52

816

[6]

[9] (#1056)sent to the author by D. Woods on June 29,1982 and published in

[7]found by the author with the methods described in [8], and

published in [7]

sent in by D. Woods on Feb. 16,1983 (#330)

found by the author in May, 1983 (#1375)

sent in by D. Woods on My 11,1983 (#1050)

sent in by E. J. Lee in July, 1984 (# #778,860,894,1241,1261)sent in by W. Borho on Nov. 2,1984 (# #809,1393)

found by the author during the systematic search described in this

paper

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 5: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

AMICABLE PAIRS BELOW 1010 365

Table 2

Comparison of A(x) with x1/2/(\n(x))', i = 1,2,3

A'/IO" A(x) A(x)\n(x)/x^ A(,x)(ln(x))2/x1/2 A(x)<\vt(x))i/x 1/2

1

2

34

56

7

S

9

10

586762

8981009

1100118512561317

13771427

0.38400.3649

0.35780.3527

0.34740.3444

0.34030.33580.33270.3286

7.9587.8157.8077.799

7.7597.7557.7157.6567.6257.566

164.9167.4

170.4172.4

173.3174.6

174.9174.6

174.8174.2

We define an AP (m, n), m < n, to be a regular amicable pair of type (i, j), if

(m, n) = (gM, gN), where g = gcd(w, n), gcd(g, M) = gcd(g, N) = 1, M and N

are squarefree, and the numbers of prime factors of M and TV are i and j,

respectively. Other pairs are called irregular or exotic. There are 1082 regular and

345 irregular APs with smaller member < 1010. It is easy to see that there are no

regular pairs of type (1, j), j > 1: let g be the gcd of such an AP, so that

(m,n) = (gp,gN) where p is a prime and gcd(g, p) = gcd(g,N) = 1. We have

m < n, hence p < N. By definition, a(gp) = o(gN), implying that p + 1 = a(N).

Since, for any N e M, a(N)> N, this implies that p + 1 > N, a contradiction. We

note that in this argument N need not be squarefree.

In Table 3 we give the frequency distribution of the various types among the first

1082 regular APs. We note that there are relatively few regular APs of type (j, 1),

/' > 2, and of type (/', j) with /' < j.

In [7] the total number of known APs with smaller member < 1010 was 601

(these are the APs belonging to the first four codes in Table 1). Among them were

104 irregular APs, i.e., 17.3%. Comparing this figure with the 345 irregular APs in

our complete list of APs with smaller member < 1010, i.e., 24.2%, we see that

relatively many irregular APs were found in our systematic search.

In Appendix II (of the supplements section) we present lists of all the 1082 regular

APs arranged according to their types, together with a list of the 345 exotic APs.

This appendix may be useful for searches of APs of a special type.

The regular pairs of type (;', 1), /' > 2, play an important role as "mother" pairs in

methods to generate new APs from given pairs. In [8] a substantial part of the new

APs found there was constructed from such mother pairs. In [1], Borho and

Hoffmann have partially generalized the methods from [8] by introducing the

concept of a breeder: a breeder is a pair of positive integers (ax, a2) such that the

equations

ax + a2x = a(ax) = a(a2)(x + 1)

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 6: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

366 H. J. J. TE RIELE

Table 3

Frequency distribution of the first 1082 regular APs

of type (i,j), i > 2, j> 1

column

totals

3

20

16

1

0

67

271

78

6

21

280201

IX

4

24

63

7

37 422 520 98

row totals

112

591

345

34

1082

have a positive integer solution x. If x is a prime, then (ax, a2x) is an amicable pair.

For certain breeders, called "special" breeders, Borho and Hoffmann formulate the

following

Theorem 1 [1]. Let (ax,a2) be a special breeder, i.e., ax = au, a2 = a, with

gcd(a, u) = 1. Take any factorization of C:= a(u)(u + o(u) - 1) into two different

factors Dx, D2 (C = DXD2). Then, if the numbers s¡ = D¡ + a(u) - 1, for i = 1, 2,

and also q = u + sx + s2 are primes not dividing a, then (auq, asxs2) is an amicable

pair. D

Regular APs of type (/, 1), i > 2, are of the form (au,ap), p prime, and the

numbers (au, a) are special breeders which generally produce many APs with the

above theorem.

In our list of 1427 APs we found a few APs, e.g., #647 and #955, which

suggested that the condition gcà(a, u) = 1 in Theorem 1 may be dropped. In fact,

we have

Theorem 2. Let (au, a) be a breeder, i.e., there exists a positive integer x such that

au + ax = o(au) = a(a)(x + 1). Take any factorization ofC:= (x + l)(x + u) into

two different factors Dx, D2(C = DXD2). Then, if the numbers 5, = D¡ + x, for i = 1,

2, and also q = u + sx + s2 are primes not dividing a, then (auq, asxs2) is an

amicable pair. D

The proof of this theorem is left to the reader.

If gcd(a, u) = 1, then a(au) = a(a)a(u), so that x = a(u) - 1 and Theorem 2

reduces to Theorem 1. As an example, AP #955 gives the breeder (au, a) with

a = 3.5.7.19 and u = 7.29.47.181. Theorem 2 yields 16 new APs with this breeder as

input.

It is known [5] that most even APs have a pair sum which is = 0 (mod 9). Our

search proves that indeed Poulet's pair #503: (24331.19.6619,24331.199.661) is the

smallest exceptional pair. All known exceptional pairs had members = 7 (mod 9)

and a pair sum = 5 (mod 9). In our search, we found two even APs with pair sum

= 3 (mod 9), viz., the (irregular) pairs:

ÄV77.94/l92103.1627 and #874.22i9/l3237.43.139*577' 2 \3847.16763 ^ #™' " 41.151.6709.

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 7: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

AMICABLE pairs BELOW 10 367

Table 4

The 17 APs among the first 1427', whose pair sum is ^ 0 (mod 9)

regular

irregular

even members odd members

#503, type (2,2)#1031, type (2,2)

#1081, type (2,2)

#899, type (3,2)#1057, type (2,2)

#1158, type (3,2)

##577,874 ##7,38,78,113,256,440,1083,1175,1380

Table 5

All (37) pairs from the first 1427 APs having the same pair sum

rank numbers pair sum

prime decomposition of the pair sum,

i.e., exponents belonging to the primes

2 3 5 7 11 13 17 19 23 29 31 37

32 35105 109

137 138172 173272 276

282 286350 351347 355373 375

368 377395 399411 415

427 433462 476486 491

574 582626 630

653 665695 697717 730751 753

798 807786 787

824 840940 941926 952

997 998

1012 1019

1069 10971124 1142

1147 1150

1143 11811232 12331254 1265

1249 12551272 1278

1410 1425

129600020528640

3773952075479040

321408000

348364800556839360579156480638668800

661893120761177088796340160

8838720001181174400

1282417920

20684160002395008000

2682408960

315502387235997696004049740800

4606156800

4716601344

509483520068245632006897623040

79252992008273664000

1002792960011195712000

114162048001209821184013473008640

14341017600

14478912000

1505806848019926466560

7

9

10

31

1 1

11 4 1 110 4

13 56 6

912

12

10

6

8

7

8

9

10

12

11

13

10

13

13

109

13

11

11

3

2 11 1

5 1 24 2 1

5 1 1

1

1 2

3

2 21 13 1

27

37

5

512 59 39

12

10

12

9

10

6 2 1

3 2 2

1 1

2 2

3 1232 1

11

2

3

1

14 5 1 1 1

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 8: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

368 H. J. J. TE RIELE

These are the first two examples of APs of the form described in [5, Theorem I, case

(b)] (also cf. the remarks immediately following Table I in [5]). Table 4 gives the

rank numbers of the 17 APs with smaller member < 1010 whose pair sum is # 0

(mod 9), divided into even and odd pairs, and regular and irregular pairs.

Another question, suggested by Professor C. Pomerance, is whether pairs, triples,

quadruples, etc. of APs exist having the same pair sum. Among the first 1427 APs,

we found 37 such pairs of APs, but no such triples, quadruples, etc. Table 5 gives the

rank numbers of these pairs of APs, and the prime factorization of their pair sums.

The pair sums only have prime divisors < 37. In 30 of the 37 cases at least one

member of the pair was found during the exhaustive search described in the present

paper.

In Appendix III (of the supplements section) we tabulate all the greatest common

divisors of the first 1427 APs, ordered according to their size, with frequencies, and

with the rank numbers of all the APs corresponding to a given gcd. This might be

useful in further searches for special APs, and in searches for so-called isotopic APs

(cf., [6, p. 83]). For example, new APs, isotopic with APs from the list of 1427 APs,

are obtained by replacing the common factor 335 in # #882 and 1087 by 327.13, by

replacing the common factor 3353 in #1205 by 325231, and by replacing the

common factor 335231 in ##717 and 1228 by 365.23.137.547.1093, and by

3105.23.107.3851.

In [8], we have presented methods to find new APs from known APs. By applying

these methods to the new APs among the first 1427 APs, we have found 117 new

APs (with smaller member > 1010). The new APs were found mainly from mother

pairs having a relatively simple structure, like those of type (/', 1), i > 1. They will be

published in a forthcoming report [2], together with many other new amicable pairs.

Centre for Mathematics and Computer Science

Kruislaan 413

1098 SJ Amsterdam

The Netherlands

1. W. Borho & H. Hoffmann, "Breeding amicable numbers in abundance," Math. Comp., v. 46, 1986,

pp. 281-293.2. W. Borho, H. Hoffmann & H. J. J. te Riele, Table of Amicable Pairs Between 1010 and 1052,

CWI-report. (In preparation.)

3. P. Bratley, F. Lunnon & John McKay, "Amicable numbers and their distribution," Math. Comp.,

v. 24,1970, pp. 431-432.4. H. Cohen, "On amicable and sociable numbers," Math. Comp., v. 24, 1970, pp. 423-429.

5. E. J. Lee, " On divisibility by nine of the sums of even amicable pairs," Math. Comp., v. 23,1969, pp.

545-548.6. E. J. Lee & J. S. Madachy, "The history and discovery of amicable numbers," J. Recreational

Math., v. 5, 1972; Part I: pp. 77-93, Part II: pp. 153-173, Part III: pp. 231-249.

7. H. J. J. TE RlELE, Table of 1869 New Amicable Pairs Generated from 1575 Mother Pairs, Report NN

27/82, Math. Centre, Amsterdam, Oct. 1982.

8. H. J. J. te Riele, "On generating new amicable pairs from given amicable pairs," Math. Comp., v.

42, 1984, pp. 219-223.9. H. J. J. TE RlELE, Further Results on Unitary Aliquot Sequences, Report NW 2/78, Math. Centre,

Amsterdam, 2nd ed., Jan. 1978.

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 9: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

MATHEMATICS OF COMPUTATIONVOLUME 47. NUMBER 175JULY \1Xb. I'A(iESS9-S40

Supplement to

Computation of All the Amicable Pairs Below 1010

By H. J. J. te Riele

Appendix I

The first 1427 APs

1 220 2E2.5.11 3DLI 21 284 2E2.71

2 1184 2E5.37LI X 1210 2.5.11E2

3 2620 2E2.5.131LI 22 2924 2E2.17.43

4 5020 2E2.5.251LI 22 5564 2E2.13.107

5 6232 2E3.19.41LI X 6368 2E5.199

6 10744 2E3.17.79LI 22 10856 2E3.23.59

7 12285 3E3.5.7.13LI X 14595 3.5.7.139

8 17296 2E4.23.47LI 21 18416 2E4.1151

9 63020 2E2.23.5.137LI 21 76084 2E2.23.827

10 66928 2E4.47.89LI 22 66992 2E4.53.79

11 67095 3E3.5.7.71LI 22 71145 3E3.5.17.31

12 69615 3E2.7.13.5.17LI 21 87633 3E2.7.13.107

13 79750 2.5E3.11.29LI X 88730 2.5.19.467

14 100485 3E2.5.7.11.29LI 32 124155 3E2.S.31.89

15 122265 3E2.5.13.11.19LI 21 139815 3E2.5.13.239

16 122368 2E9.239LI X 123152 2E4.43.179

17 141664 2E5.19.233LI X 153176 2E3.41.467

18 142310 2.5.7.19.107LI 32 168730 2.5.47.359

19 171856 2E4.23.467LI 22 176336 2E4.103.107

20 176272 2E4.23.479LI 22 180848 2E4.89.127

21 185368 2E3.17.29.47LL 32 203432 2E3.59.431

22 196724 2E2.11.17.263LI 22 202444 2E2.11.43.107

23 280540 2E2.5.13E2.83LI X 365084 2E2.187.853

24 308620 2E2.5.13.1187LI 32 389924 2E2.43.2267

.5E2.11.83

.71.4332E3.13.23.1492E3.199.251

25 319550LI X 430402

26 356408LI 32 399592

27 437456 2E4.19.1439LI 22 455344 2E4.149.191

28 469028 2E2.7E2.2393LI X 486178 2.7E2.11E2.41

29 503056 2E4.23.1367LI 22 514736 2E4.53.607

30 522405 3E2.5.13.19.47LI 22 525915 3E2.5.13.29.31

31 600392 2E3.13.23.251LI 32 669688 2E3.97.863

32 609928 2E3.11.29.239LI 32 686072 2E3.191.449

33 624184 2E3.11.41.173LI 32 691256 2E3.71.1217

34 635624 2E3.11.31.233LI 32 712216 2E3.127.701

35 643336 2E3.29.47.59LI 32 652664 2E3.17.4799

36 667964 2E2.11.17.19.47LI 43 783556 2E2.31.71.89

37 726104 2E3.17.19.281LI 32 796696 2E3.53.1879

38 802725 3.5E2.7.11.139LI X 863835 3.5.7.19.433

39 879712 2E5.37.743LI X 901424 2E4.53.1063

40 898216 2E3.11.59.173LI 32 980984 2E3.47.2609

41 947835 3E3.5.7.17.59LI 32 1125765 3E3.5.31.269

42 998104 2E3.17.41.179LI 32 1043096 2E3.23.5669

43 1077890 2.5.11.41.239LI 33 1099390

44 1154450LI 22 1189150

45 1156870LI 32 1292570

.5.17.29.223

.5E2.11.2099

.5E2.17.1399

.5.11.13.809.19.6803

46 1175265 3E2.7E2.13.5.41LI 21 1438983 3E2.7E2.13.251

47 1185376 2E5.17.2179LI X 1286744 2E3.41.3923

48 1280565 3E2.5.13.11.199LI 22 1340235 3E2.5.13.29.79

49 1328470 2.5.11.13.929LI X 1483850 2.5E2.59.503

50 1358595 3E2.5.19.7.227LI 22 1486845 3E2.5.19.37.47

51 1392368 2E4.17.5119LI 22 1464592 2E4.239.383

52 1466150 2.5E2.7.59.71LI X 1747930 2.5.47.3719

53 1468324 2E2.11.13.17.151LI 43 1749212 2E2.37.53.223

54 1511930 2.5.7.21599LI 23 1598470 2.5.19.47.179

55 1669910 2.5.11.17.19.47LI 42 2062570 2.5.239.863

56 1798875 3E3.5E3.13.41LI X 1870245 3E2.5.13.23.139

57 2082464 2E5.59.1193LI 22 2090656 2E5.79.827

58 2236570 2.5.7.89.359LI 33 2429030 2.5.23.59.179

59 2652728 2E3.13.23.1109LI 32 2941672 2E3.71.5179

60 2723792 2E4.37.43.107LI 32 2874064 2E4.263.683

©1986 American Mathematical Society

0025-5718/86 $1.00 + $.25 per page

SM

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 10: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SIO SUPPLEMENT

• ■> c?v r^i-< ■ c^ d oo o* oa -^ oí • —« i-h ■-* f#<Ji<Tiii)triCTiií>mr-i\£¡ to >n hic s <T> • ■—i o> ■ o^ • p—: l/i *M3 rsi i£i iß . lT

"" -oh r»H wNtTii-tiiiriiifirivBisinrii-tisBriir« •* eri ■ r» cri r~-.—t ä m ñ ■ • ■■vt^i-i iiTiin ci^n t rinn ■ • inhis- • • « «ftiA -r- ■ • ■ m • • iH ^ . s • ín od . . on ^ r-- Ci .00 ■ r^ .h « • -Hi"'>>no»i-H».-<r-u".r-i.M'» incoinn^si . . .

H CTN ■ ON ON . . H INm B .r-r-n . • CO ON -O* ■ . ON rH .-H (S .fH »Ö ■ • ^H rH • .-H . ^ in -Jr-- i <N •-« rH ON ON •"-«innn^HMtNirt h-< <£> 10 a m r- ■ r*- i~- 1-1 n fi on ci • • • >nn • • n on r- (N • . en -- ■ i«9mh■ H BrtnHHui • • •"»i-ir-(r,,-i-<^,nn • n-i>MHr4nnHniHini'inNtD<r4>-iHr'i^nn • ■-( fi ín4 • • • • ■ • • on r- r- ■ « • * ■ «1-1 . rN rs ■ • • . — —1 —1 in ■ . —■ ,—1 • ■ > . -j -1 un . hh rri • . .

tlfl . U lO iBttHOIinr

-1 (N r

^—if3>^^r^cor^*iy(^iSfNr^fn*f-Jr^r^tswSu-iœLn*-HfNrst^ij^r^^r^NH«iñinNHN^<SCDnmw9rl1vin>£^vOr«0i)ininN^DVrlNNNcoinNmfti6r~ncoro<^fNœ(Xif^in^socTi[BODŒ>mœro^wear^*cc.coŒu^rNrNu^inco^

minrni/^nr^«9inif>i/>xO\6«c<caoœ^s<NSrHtHr4^9N^(NiON<vn\owij^

j j j JJJ,JJ,J,JiJiJ,j,j,j JJJJJJJJJ

(C H 0M71 i-H >-H r*N ON i-J PN. • f"* <^rH»*0*CT* ON f.-^sO'Tir^rHffiCTiiTi r- 03 on ffiOMir- -NhB MHi/iHNhr* œ> -

4H .NrtioHfnhHf i©rvr-4M ,S"

in » ■■» o ■ <n on ■-■) «-< • <"•< ■ f» u"i ,-t ■ on ■—< r*- i-i m • tni-ii• fN 1 ^) m ■ ^- f*^ i«-4 1 r* OD .fj o>^ 1 \£> i-* . m on r- »

o>nr<Htr]r> ■ ' r~- isr~- -o .^-wr-r-io^fNfN^vor--

■1 oiijih -inoî ma• r>rH(*i(»toor-'f>Joa >ä .-

1 ON tO rH V .-l f

1 ui 1— w on on • ■ on » r^ m ■ —. ti cjs

4 w tu On-1 ■» e

tNHrtHNifiNnr1 • • es —■ s e

.on • t >isnhh .Nts .r--4r( . r>■> ̂ r-t r» r- n • > >i>uunn ■ ■ >Jn ̂oiíH»^Hini/ir*F-n(lini-li/liílinHft

ISuiinN nyi/ifN»nm*mm<Nr^o5^ni--"nr^Lnmi^iaM>e^^(N(Ncow^MmooiBmLnie

r^Or^O-^r^mS^u^-jœor^r^fNTrt^rNvr^l^œœ^CS.-iu^.^Sr^cO^ONnwnr^i>^-^M»^^r»(eo^aDmi^.»niÄ^n»niiif^r'i»i/Njior^mn^r^Mweo»noNONnr^»oi»eoioco»n.rtmo^n,^,^.»n«.^c*>mr^CAœ«Nnr^^ntnn^nn^v^co^in^tfinu^i/NiAin^iotAi^^hO^hr^hvN^c^r^tDinCvtQN

•I (NJ f

i-íiNXiMnpiNc

J J J J

■>iûi*ir-fNoofN<j\r

j J J J J J j J J J J J J J J J J

0 o. _-. o-. r

- 1- o- r- e

N r~- , ff* pjm rfl 1^ o> r* »nr»

.■JíUJIMt^JjLtJtiJ . .INIMNNtNINUUta

S i£ rs S 3 Œ

: w r. u :

rSSCC

^r^-^p31tÛ,A(NfNCT*0^r,^\ûB«s(finH^'Tinff>fM^^cft"ff"N5fn(NHN^o3^irr*(flF4uiri/N^rNr^C^u^r^n^r^u^ONON',,ricoONrKr*-'--4»J"i'SON(>i^-r^'Oi*C®''

r- r- 00 00 o

><*><crr"ï.^rna-<T.^rnrj>»aNarscs><cs^sr\i-s^raXtsXis^A

■> o* r- ^h c ,-H^ori-j n nr~-rii-Hroc'*rM'*iiaj .-« i-"f"ir^ on on r*- m on on. • .-t iN r- on -h *r n co in iî cft o"1 01 on imit n.r-iû ■ neon n Oimn r» ^ f- (N • ■ • h » 01 ifi r- in •<-< ■ -j .—1 <n ob on • ■ • r4 W"- Bin »rt inn o>« ■OMCiiiiûUnr'i'ir-Hirwcviisto.

r m m ne

i«Oi.-j .KinSicjiSOI.-iOiONONr'iiO'N t o Ifi P. O , _i _ ._ _ _ . te r-l -I .

n n -j • a\ r- iO pf*ï if t .—I r- O» t • • ^ «f*- • ON■ u"ii-cflNHnr-nnr» . ni on i-n r-

n s r*N .-h .-^MlûtflVl^^Ä'^lûW0)HmH^l^^û^rt^^^c^Hf^VH^N^H^^^O^f4H^S^c^lHCO^NHlûHHMS(l|ö^Hnr>-'irNin'-'aiiricoi0(Ti>-< Nr~anCr-icrie-Bf»iñr>iT|r-r-o-iisBBi/Niû«^^-iN«9>ioiTiio'n'»nHB)t,i«ioriininiiiinH^■T«CONr>miuiO'^ií)N'ABiñiO'iifiOQDC^'ñP^BN^^Nfnvr^i^Mv>r^^tí3riIiTiU^^0^- n ry ^ ■» s —•t>NBi',nBBSn^4'<DinviI)<Mn',iBiOiNS^

iß-»\0'*iier>jio^'\C'*Nu

j kl j j J

os u"i t* r- 0rlvUnCO^Tr-'*lf-S«*flm"llí31"í'Ji-iNH'rNÍMTl£l

in^i/ii/iuiu>inifli/iiotnp"ioíOiíiiD'í»r-ier-r"r>'r*'»Sri-

)(M»y »-»ffin

j j J J■j j j j J -: -3 JJJ.J.J.J.J.J

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 11: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT Sil

- .Mto .on.fficN . . . on on .n . fi fM Ln m on . r-■*-w . . . » omt. r-<n h ■» . . . on n «w . . co (N .onhh . n . . . r-

'►«►«M .»,n.r.«n»«.,.B»,

rM _i Í m in .'ftnHNBftNpníH^ínJJnn^iNnH^HHS^nMH^

,<*r-mr-m„,.í

uuuuuu.

lui SÍL o, --"ss^ss^s^.ss:

! »S» «

atS»«B(N..flB^UlJl^.CÍ,

bís;dsSs¡s¿s^I^^"Ss^-aM¡ „J.^JsSsH^I^I^^"«s^v^-sa-:«:«

, c^ 01 (T.r- «s >o™ m r. m o, ro . .«ot.nHffls

:««»?'!WV¡wr¿f!iñmMf<»ñn!»ññiñ«i<íil

SssssässsasRSs^^

ssss3><s;£SäS£>«s><sss><s^^

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 12: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

S12 SUPPLEMENT

íciss sL:

.»r.<N»

■SssSsssSs.^NLOON-« - m -r . .cii-on . .(Nr.

.on-h-i^in .■*.-* . . ..-"lein-

1 >»■»««-

:S£SSS55?!SS£S3SSÏÏ2SS;S3SÏSÏÏ5Ï

iSSSgBi3SsÍSSISSSSSE»53S2SS¡fir-»-!«?»';»»'-««:

;sss3sssss?:3;ss5ssss

„¡„„i,.«.«.-,...«;.;».»;«; ^^x-.«-ix-

t- » . » r-

SS S51S Sr. 3-33. S„ 133 .: 3Î ,. 8 !

§Scs?S S:3^??¿«S»»«^5»?^4,, .*»

1 5 - J»"" -1 » ?

Issssss^sssB'i'ifHsK^»«""»: ?»'-"?■»»»

5sciSsssss5s.-S:,Sas3s;s;ss£^í:s3SS2SS:s;ssís3S£sssss

.j .j j o j a j

»»«"'-"»'»

,*»«-,»»,.

»»■>■«»-.

¡o,^»,^ .r-t-i ;»».3

ss^sssssasssH^sa^asss^sssaassaa!ir-Nn^H»«^.

?S5SS-?«S«-"ÍS5SI53SS¡S¡!I55¡¡¡Í«ÍS|S.»«»_«

"¡St-.': ^¿2 *-S2»-. .„OM^oinM^HOi . on r- ci , r» oí ,-i r- ■ r- \o

?--=^^¿^^£l^ib¿^Ír="í^5^^í,^;

. . ...-.-. «» . .0-1-» . ;S ■.••'«««'"''üt?'

•?J»»«'

!(.:•»« .• _• H H 8 H H 1 JUUUUUUUBUB

ro,-. n^o =Ss3SaS ^llsll|gisig|s|g|llll§§lllllisllllil, I- «•.»«> »m» U> .

S"»S~S»SÜSÜS"SÜSÜS-S*;!";:!»;:

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 13: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT SI 3

• <N ON (S -HNlfl^í

ts no • • r-

oo 10 --10NONON si m m « r- on o\ r* r- on ^ io Nfflmtnui t»- r- no —i r*himm^m^h »jii-i*i7ioiOi«roin .-(r'ir-iÄin.cNr-.ON.H.fipN h ir >n h p-

iif4 »i»h h ii-i 01 01 vo i-h r» —i 01 >nn • c> n bnh œ ■ s> ■ ko r» 10 * • <-< 01 -Nn ^- oo .-< . u"i 01 ■ b b hnos ■ • n n -oi ^ivOfHvocii,H^^r*i\D-H<N^JLriio ■ . ^ ^ in ph 1-1 • . n r^ .-i r- 'inONB « .r- • on 01 in in in

îiii uNi/inn « «

a«Nmi'iviiniO'«li/iin\OfviiiixiNiriininini(iaiiniiiiiNninkriss«ti1lOONNf-BH-l(»Vr1(niilBI',Nr~rNC0l/ia*tlN|JlNr(01WC0fflMHICiconniNi^niNf-vMr-'rHMHBai(NOiioo,iOi!»Oi<jiB"UNriMO'

OMOgiSOiiDSr« (M-. ai r-<e (O Oí o

inininininininLninwin-0NON#-H^p—ÍONi—lOl.—«OlOl.—Ir-íiHi-íi-HOlOlr-IOlOlOlGl«-*

jjjo-cíOíJ.JJccjoíjaíOíj^jjjDíCÉjoíaLtQíí

- r~ m r~ on in oi o> io i"1-! œ ci vo • oi.-i!soi^'.-"'-<r-in n i© oi r*i • •

■j ■ ■ . ,-i . ,-i .BHO^r-Nifiioio ■ vr--1 on on ■ M<n h ai s U «

i —i r- on oi

•lilUiiiHMMUllUli] ■ cd ta • ■ w w : w w w • .wwwwiauMwwwiauî

las^mcor

QioioioiOioiou

M^r^isSNOHiísnonfiísBOihjiiii^íHHH^^^^lsnl»Bln((lff^B««HalnnM^lo)BH»SB(^rlnffl^u&mnu^®irisœ»a3Br^œinf-'*r^r---^ifl®io^r-r«.nmr^r.«'*j'\ooi»iDC1n^u-l^^m^fico<^(JlNa^nBn^t^lftl4>(O^CNl^'^íl-lB-l-lnBlnNeeul•^o<|lOl/llOl/lŒuN»líll/lln'»^DlflUJ^^D^«)9l^•f,•r-lfl(aBo5^lN(Olf)l»OlO)^>lD^10\0^>kO's-iOiOiO'NiO'v10r^iOiOVOr,'iD10*OiO\Or-iOr>iocO\or^lûiOvOO

nfii^nM^iNiA^kû^r-'iNco ai n b

j a: s j as es

ON Hlfir

■. i—i p . .on >io n con h ai oí i . tflicinHiOniûn • r»* in »in ■ oir-^,r,-iprK,'íNíN4,*HtK-m iIsh pion . ■ r- . . <—i no oi on. •aNC-r*i("i^.-*r- .r- .r-p-Hr-4r«ioiBi--r-i . . ^ r\i «> oi r-j . o* . r- r- on » ko r- ■ • .œainNH ■ ar-criciSr-iOno.-tf.pi,-

- w

.ÍÚ U3.uu.

riONnaKOioviNixiirieu

Fiooir>iBr'riiainHio<iiiosansioior-Bsi:HnHinrnnr>in(ii«»f'it,iiN«iNionvnr>ii«

3rJoÍp-(iu^[^t«Bai^ií)iíir-^ntOHBHr-í*i(i5\o5nco"rc0r-00'-<3^r-^^0Dr^COr^'*lPNHH'OC0r'lNC0COfl,lAlOCOC0(Sirll/lUNlOUNHtMNiooiionfliHrJitOiMiniN^ojMiMOffiHisvoF^oiMnooioioifiwiojr^nf^r^soOf-toj^oiBinvor^f^oNOooNONLnrj^^iur^i/iNOvonsf"-^r^incoinr~irir^ini43inLnr^r-r--cor--rNir^œœneooNa>eoONOioiSBa)Nioiíiuiuii/Ni/Ni^miíuiP-iríuNiíiinuiiOinuiuiioininuiuNiíiifiinioior-

noimb^hmin r»i ^■roir>nvo-*r-foeo(NO\^'Sf*iimmniiiXioniû^iiXiûi'iu

-3SQÍJOÍUÍ30!,JO£OÍOSJee

co on on *—< r-- m *—< oi n iû io on r- on r*- *—i .on

BOitofsœr'iNi®oi f*j n oi r* n . oi <n »oiiTioi^oioir-oiOioiOi . oí ^ <■■"> *—i r*- r- coH Ci (O MN Oi • —iaiOiiN^BiNIHOii/i^'mr-1 lOiHmr-fflíiOiffiOiH-HHwnHiíin ■(Or-BiOn^HiciOi

o\ lo m » oí oí ^ i un n oi Oi"1 r- Oi ir-N-IOl!

. ^ Ol Cl ON f.M i -noir-oi

J M r 4 0>niS^BD

• •••CilCil.u u.te.u-.-

• ■ u u • ■ w td Lu bj ■ ■ ■ .uuuu^uuuuuciauuuciiuuu • • u u u u u ■ ■ 'UiduuiimmiiuuuiLi ■ ■ • ■ u ta

B^io(Jii/iinnONfiir~H03ini/ioiNoiB^ooiíroo)iJNr*Nr-^oo«ti/>^rJWio»ffiNr^aiíiij»^œnHBl^ll^7Bnln(Onlíl/lO'lnl>JBïlHOOl^Olín^ona3-^HœIJ|^^^Jln^NfllHlOuN.lí*Olnw-lcoW'-^^^|Bnolll)nln

innsŒMnr-^Aio»jœœK^inr^œr--\oONOT'-^ri*'r~r>(0!M^sONi^cDrjr'-i/i<soir-»rt^in^i»gjœ^HinNfl*^intDBg3UNiDHuiHnffl(Oi^iO'HNHB^coifiBHoivr"iiinf'iio^isHr-Nfo\r^

■*ininwr-oi.-..-ifnfi.9"**t,»\oinoir',i

IXiNndinfJXr r Ti« t Xu

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 14: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

S14 SUPPLEMENT

oí oí p-

01 r- ^ lO UN H 01 CO ^ 'tSi-iONr'-eíON.^in .ci^r-t--rnecoi"Pr-'inp-i--r--s • <n ^4

. io . . a> cn r- vo ■

» mi"- r-co h o> ̂ in s b n • on • r- "O1 <n r- p-i| m «O CO «r Oí B ir r^ Oí iO ul ■ p* Oí Cl On • ^ »—i 00i B n n • • vo oí ^ Oí oo vo • • r- h n h CO • p> r-i *^ in •

h o« i-i oí ■-< ■ ̂ * fHHfNrHn>«Hrj*oirvoioi(Ní*icovc'ifNrN'«'«oii-*c'i • p* io • p» p- onco .oicdon • • m

ci r~- ■ r- oí oí o

n oí ci v »oí . . \o p- r^ *-. . --i —i .r---!'-'íNciO!Oi.-«inciCieor- . in on ^ ci .-i

_ . . p» r~ tfl • ci ci ci • .nnHH • .in i(iih ■ p» • • • r-hOi • •kO*'-i^j,fN^,ONNO iHr-h «ci • ■ p- O* iHr-ifijinmnoifn r« ri h m • . • p» • in CN r- .lOcicNONficir-irsir-vo • <n cn i h to r- r

JídUCÚüilLúLúbu

W(Jri3aÉÉ.ii...É...i.....ii..£L!tJ''[iJ

Lninp~p-ciciioiocici'W*voiocin-o,,«a'nncNfN<rtcip-r'-ininp-p-inu• • • .auuuauuuiauaiiíuiiiuaaKiiHi]. 3 M • ■ W til

«iosiO'NCOeofii3)Bioiotfii/N*riiriio30i^coNKNiíi^meocii/)*kOciininrNieocsciioLnr-ioo(N(-'*cN{vjr^

í S S3 X ^ tf ^

oocB^j,ONCO(Nt~-ino>ciNOcsciio^^r^inoioiinin^Ñoi03iñ-HiAr^r^sinoiior--cOfN)r^ineor^'^co^»rrN^r-)

ciœcoeB^inrNLOc>ci*^cir^oo^»toiincpcocsioininiooouica,*r^c»cifNinr^eBcBoor^Nœ»o^cN^ciciwoiNO^inp-oi^pJinwr^siocoMcBCBNon^sœ.sioooLncir^iSMinoir-c'4,NOr^r^fNcNNONO^iö'^ci^-»criin'^p-cNö^i^oip-^e»FH-»oi®^»vciLnr^oinoi«B>oa^eri^^r^ci^inMCi^eBf-ic>inLnni^ncB*tn^oi^inLOCiinciinciiß—■ •-^NH^NWNNNNMnN*«N(NMrN^INNN«Nn<NfS(Slílfil(NNfl,NMIN"lN

J — kl

-cNp-tsr-fNr-r^o

r« tNCicici^ciintNiûfMr-- coiNOinBHHNN'*iMiN^WKiMvoirp- co-HOicirs —. r-Jcicici^-cimeJio p- cocioi ta cin>!n*nwnnnnnnn><nnn«rifN^rj*nvnvnfl>t*«»j<flnir'fiiiXinXin')'Ui"fin*innui><iri)CiíiniAXiínl£>^0\0\D10NO'0>Ol010'OlO»010NO>UVßl010IOieNONO'ON010VOlßlO*0

-HOioioi'-ONOioiONpH^oir^^oiONoioiONOi'-iaioioi--oioi^JOiena&KK3c¿&t£txj^aJ^cüccoaa:aia:¿icc'3Ccií^aLtx.tiQí,tz

01 OlCI00CBr-I "ON ON p

V r-* »0(fN^^p-l010J-JBr>ícií01C•t On ci —i iß n Oii-

-i<-ir-ci(Ninr--f--i-ii-ij . . . .

• H M • •

7iiPr^x^Tinjr^(N^(u'jiLn^^is®fl'OiE^sininir^i^iAj-iTriiJSSiriui3fiisBiAi/ii/iioi5iS,£^o,T^OQöiJi^^^roicoNifiHB»inncncoinHNnWHinni^*H^hnioi^NioncoHi^ijiiom^nni^r^iOr"ioinr»c^j^WIÖ^Kf^ntNtooiOiCOOJMOirtBr^Oif^njliii^iOB^HVniDniOirirJirir-HVrilOiC^^HOiN|N^io«Bnv0'^rHr«C0*Nr"HOllrlHWinr*IO',lfflvOWB^iO^WSr^tnNi^C0^1fl^u^^p-P-p-n^,^rsr-fNOon*p-io<^toicBeBcB»"»»'^piir'.cir^inr^ioPi^ONi^coooMinI-HCip-œciSp-oifsoii>jeBnp-i>ieBinrNC*"iroicoinCBinr'j'OONroc^lnlonlOln^Be^N^Ol^||lnaOl^oœcoHBlO^JOonnBBHOlBHN^coolnH^coolaH^mnHNOJNr^rNOl»nlOp^n('^^lnlJ^^^ûíOl0^lOfl^Olcom(»^»B»-^c^BC^HOllnBHB^HH-^NH^orllNNr^NHMnn^»ln^Bl£ln^^colOOlNí

BnsXB^BifiISmBXBXIStBX-HfHrtHMHWH'rHnH^,

Äaaa:iKjafi:ii:Q:jjjct:a:a:ci:a:j^a3:_iSu:^a;3;_)j

lO iO NO iO NO lO NO VO

-lO IOB f

i . . «r r- u

NOlHf'll^^OIrt (N^i ■ p* Cl . 4N * ON OJ Oi ^ \Or-i101VOO40N p Cl .CI 'Hr^ONfNOlHr^OllOfflON "ON * w-» .ON

i ^ .^in^rci^cioi . • • • co ^ no s on . • r* ■* b Oi un ni IO Ol U1H .BWCOHOlCli-IOl'J' • <"> DON ON • >H<

• i-< C( P- ON • —"ON .ClON ■ • . 'HT

.LU ■ ■ W • ■ ■ ■ U Cil ■

3 a a u a * ■ • • a a a a * ■ w g

-I-I^OIBUNTO

ic-iioœioBMBOir»•»ciinrNinoNr-i-ir---OloSlOSlO^VOr^^)!1riOiBdHOlBOVBOif

■i iO un n (S soi u0Oi01*01r*Hi0l!

)uiui«ifiBC3uiir>«iO<iionMssBC"i(Nciiocicioii-iooiNON>sr*co'-tminr-''4NirlBOi^BCO(s'iONHnoiB<lUNnu

r>ooir--cBcioom-HtB-HtBininr-'Oi(Sco-

t in m m

ct«.jœ.jœttetï,jos.%oiajûiQajij œ os ce j ce ce s

VO 01 CI ON Cl H n H OiiOr1 •Ol ^i r-( \0 Oi CO i ^ ■ r-H B Cl rHHinir r-- oi oi oino^- ci inn

iv«. vo ^h fNCicifM^r- cbonoop-^p-oi.cioiavooioioip-vocJici 01 un« • .ci .-i n . co --4 oo in ci ■^■r^r- • p* • «* -.*1 ■hbiOiC'-'OIfJOI • -H iOClON • p- 01 *H Ol P- . tS 01 (S fN ,[\^^Mrl

) r- r- oí oí o<l PJ . -S« Cl Cl

• NÛ^clfNiNr-NOi • ci .-j ■ ffi -4 ci Cd 01 • • oi r-* t^ v *i i" -m oi b s -j . ■ eonoi • rj oi oi in m r- to . -uCi ifl H ■» t • t • in P* • ih-<N • P» 00 cl ON .» fM . -w .f*. irtifliflNn ._^_^^. .».ciiOr-iin . .nm-tr"-* i . • ciP-aicipjEsaiOi • ■ ■ ci ■ m^h i Mfimn h ■» . .on • m n ci . m N-« • . ihoi • «i-i p» •>

U ■ ■ «OiON^oicif^cip- • .ciciinmcici . ■ en p- ci no td m • -coHhr-HrioiOiu ■ . • ci ci • • oo

i/NuinnNr>iuNmT*nnNfVN^uu»«ifluinnnnnniiiincoconnaunn(ii(NuiuifviN . itfiinuuiiiu* *umuci] . •umuuuuucunnub] ■ . u cd td u u td ■ 'aaaaNrNaaaa . * cd cú » • r^cNCdCdrii'CNiNfNCdCOCNrNïNfN

in in >o« (NOO^NOesoorNcostNin*ninin.*iosB*>ori(ocinin3iiNrNr^ia.9'îB®io^œtNLnininin.»ir>j;ci»*nMnr^n>45üNr-fNicieBior*r^r-íuic»Ln^c)ioiociMr~rHi»^in^oor^C*H»BHBU1COfi|Mri|r»01J>ilflBirBrtUlV^BMBiriBiOinr*01^HiocCOlBBMVUNChiOr^^r^JN^^p^^^^^m^H^oj^^^^^^^^^^^^s^^(j,^^^^aj^^^^^œœ^^^(^Q]^jrjKi(nHsrï]iii"5iii~-^L^^Ul^l/lQSOl^^BH^CO^COu^unf^^OiC^^IHœ^r^COOirJmBfM^^rvliu^BiN^^ilNiriijJtNOiciineoeop-âioiop-Nonini^innp-oiiniû^inooci-wcBr-'cBinoPicip-eoriiL^iTih>9riiconwvulio>ouir^i^Hisio4i9in«u}r^BHn<irr^iirvNnniNs^T^Tifl"ÍIB"«,UlUÑP»lrtriUleíl/INlO!^C0Bh01hC0I^O101^Ol0i01|^BBBh0iBBPlH«HCQCOCOOOOOOlCOOQÇOCOCOCOOOOlCOOl ^COCOOOOICOCOCOOICOOiodOIOnOIOnOI ■—lOiONOlOlONOlOlOlOlON H oi 01 »—I *-» ON Ol --4

ît/iciievr-cioocioiliOnioMiomioviOXiOi/

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 15: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT S15

; „„„ „ s™ s„ „ ^ s^s sss-a,- ~mr- » -» ss ss s ".s:2sss „ssssí: ssss^s s^s««s««2-„-^^:;!»;?íssa.S2ss;;£r^ si »s si.s2«8«2sS*S8¿22222Ís:-8*i^

BSs5lB.S;S-asS.¡S.85¡Ss3a^uNv^N^^Prii^uiB^HHuî soi 01CNC.O- com inNnco*œiOHBr-^iiNionWHHniftBionB^,ifiWHioHP»NOiio»r-i0mi0r~iooiioincociruciœcir-iruciaiœ.-j.cs-Br^n^r-wr-snrncirnr-oioosiooi^œ^voiœci^iOLor-^œincicioiw

SassSaSaSlisSSlSSasSl«asaasai-aaMBasMasgagagsgsgsg"?8;?5»8^

SS2S2S^SS22SSSSSSjSSSSSSSSS32S

s-sJs. ¡S-ÎS B-sSsa?5^»-ág-.85S ¡sl.S.ss. é* .¿iHaX^s«SÍ-33SS ~^--:-.2i:s-t':5S^sssi:^";ss"-.-.,^So;S2S0;cssjSïï^---i-.s^ïS32S

:-*¡3:-á-aaa«3as3SsaaSá2s8*22:^ci _i ,p- .oioNPnmHH ..*,_,,•■ ni -h • .-4-* .oi--p-cd .ci«» . . . ru p. ci .h on .h • .poi-ihîib^hp«) .p-ciio . cd io ci

¿assas,™ 1*8,0*35.«.^

saá'SrjriassSíiisaHs^SSS;SBSSSÎSÏSSSSiS^SSSS2SSSSSî!»SsSSSPlS5S2S£f;S£SS2ïSKÎSS»ÏÏÏÏSSNOVNO>riin-wriir«p.^r--»'p-CBio^P--*p--oomior-cociPJcicir-Sinciœ^

SPSSïïSS3SSSSS£5ÎSÏÏSS23S«£SSSS£S2S£SSS;SSSSSSÎ!:2î:ïïSSSSSS2S3Î2;£SSSS33SS£SS3S3£;S"S2SSiSS;S3i=SSS£:iSS5SS;SSSIi!SS£3SSS;;«S£SÄÎ3SSÎ3F;SF:SSSSSSSSSSSSS3S3SSÎ3SSSS2SÏSS£S£^SSSSS£SÏÏSSSSSS;;S2

.su s sa, =.sSs La 3«s2- ss s5»„s. 3 ïsï ; S5. =s ~sss^-.^Sh r:"S£S£":-:«So;ssms2":iss':^"5ïï-:£S-r:r- ¡es-^s^.s^ssss s "¡s;2sâs^ss^5î'^aaîS"^pâ^^^5?s;as^« ;?s^s»: ¿¿»».te«:.

!l¡3¡l«5¡S¡a¡Sa¡5s5l¡5S¡Ss^îiïÊï-sssssâsssârîïPSsaii.â.iaâsiïï^

s;£3gss>.3aa32aa33>,aKaa3a-sa»53ÎSS23£SÎSîSSSÎÏS^3SSSÏ2ÏS^Î^ÏS

- „ » S S«» S r.«ON 2S CN -. Cl PHOIP S NO Ci S S ON 01 23 ON P» 01 S Ol £Mr- P-H Cl» .OiP-Cl^

ÎoiÏÏru-.c.cÎSSinÏÏ»'". £S2oio!2oi--4« in oi ci iNinn_HfJ,1!2in . . oi" p- 2 oo . *o en p- . -. ci p- pj t pn^n»sifi-Np

j2tí«;ss^^s-;2':R^r:ssí^ssS23SS".»^5;23r:s¿S3":^-;S":c^£^-a£íS»-i3-;s^o;3 5

S ,-< £ w . p- ci ci ¡2 » .r^cicico»ï2csp-^ .Spjci . -. m .p!f>)^i--i^cicicloi^ci^,-ip-Picioi . . ci ci h . u -t ■ • ■ . -h oo. . . . r- _, _, . . .p-ph^^ , , . .h« . ci . . - p- . . r--n « • • ..-.-..-.rj . . ci ci . . -h -< ru in ^ ^ . p- p- -i p- p- m m . .

aaaau;u;r¡aa3u;u;u;u;3asar:«3SR33aaau;^a3SSr;r:p;f;22~c,aSr:--sSr;r;ría^u;r;r;sa33

2Si;»ïSSSSSS-SÎPîSï!SSSSÏÏS;S"riS;SS2S?^SSÏÏS25SS»SÏS?:S-SS£SSSSSSÏ22£?:£SS£SS3;sSS£SSS3S2S;S£!;2ÍSS:SS;S2»£2-S;SS3SSSSS3£S52Sí:S£ss?ss2?aaíÍ5s.pR3a£s?533aiassaRa?aa^

£SÎSSS^S33jÏSS3^SSSSÏSSSÎÏ33

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 16: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

Sid SUPPLEMENT

CTl -

JWr. . On ■ .»On NOiO • Oí ■» T*a CÄ O! *—i csi ■ PiicioiiO'-«PKCi . on On <—t i-i i-* . « .

■—ir- tvn^nHiD^ajHHmHojcir* •Wi-iíNf,iiooiH*íPior4BOipN^ppf*i .ciaioi •vo>-ihbvOOihh^ -in t 01 p p n p• h 01 N co v • in r-< 10 in ci . .■»rtr-iHpi/KN^1 . • 01 co ■ • r-J .-Heats . —i vo .-i . oi r-i .oncipicicií-i .ci iH rinBPP > ■ ■ •

ci .f-J . . . r>i —i ■ ■ • n .-i r-1 . . . .ci-Hin . 01 p- ai ■«■ ci Oi «ci ip h m • ■ .rXNCOH v v . . • .oipjoi • •NfiwpPC'iPair- .r--HCiCil 'HPP .cicioioicip-r-ici .cir-i^ciior-iinp-cNoi-« . eo ci ci ,j in . . « n éPnpihp ■ r- fN cn n ■ • «cicir-i»

• oippBuauuMHisp^r-i -aoipc

■ Cd Cd • • Oi W •.Cd W • U

i . .[did ■ lauaaaaaaaaaaaauuaauuaaiituaaaauaaa • • ■ • • • • •

JWWVOBVBlíNUlINlCOBISNWiílUlaSN^

itNin^iociintsinio^CBp-oi^^ioci^INBfr'10l/llflBHHPCOBlOP'ffPBPntS"f01plílHiOI,110Ha)^in01Pini,lHHHlO»C0ioOlOlfflri|fflr^PBOlBC«lOiOvOU>O5HN»(n'-((Dr-IB<OIN'-IC0o5ISPP'l,BUl

oi«9,P-œp-iO'W«Oinwp~P-«^miniscicsineo(Sr-Hi-4 csp-oioicoeociin^r^tsru uipahpspoinpipp-icoOiio«ftDr-iBiOfNiOPPœriiBC^nio^BrjN^coioC^r-^wSHUiN»fi/i'--i"rppl'innpO^BnMUirj^vui"íi/i'TCO<f'ípppoipBosHoiiN»uio\irHnnpmulmioiriOi'iPu1o3ulcoujoapBcoiflco oi oo •-i co p oo ■-lœBco^coPœ^cofflœBœoiojBœ^cooiWNoichoiB^flioiu'OiHoioic'iHoiOioi'-ic'iBoit^oir'ioi

oo—i r** oí oí co p «"r^pJcocir^pjcB^'voOi^iOCNCDOip.CicsiC0r*

-Xr^XP-cir-r

-i r~ ci —i r- ciOir-iio ci.p-oi p-iop

n en oo ci » mp-rum ■ inp-i-ieo,*rcs,'J,cs ■ «c0 Ul <f "" .HNUlintHCOHwOl ■—I • i-l P-OIP

oi ci oi01 Ol Cl

llOM • •lOHHOlHUlHB''

-pBrJPaapp -cdoio

; pHio n oi . p-

aiosoioip-cioioi

. . ci ci ■ • . . o- . r

4PUiOivoinioiNO

>COCitlO"fO)UJ)BCOwNCBCaM<OBBirlUlCOPJBCiulw<N(PPPBOiOi'-IP«PP^irlCO«llù'OONr-ip-oimr-icTip^iomcoiûP-oi'WiniocQ'--ip-ininr-jtscBp-P^p-PJruciio,o'r--<«oiesioimr^cotB«»covlnl«^nBN^^e>BlOBBBO

iiococohcoidoii

iiOfiiOí*iiDmiocijn).fio,'u

ON P- —4 Cl 01 Ol OB

o —i lo oi w a

1 « lO Olr-1 B P C

JldtdtdtdtdCdCdCOCd

jfN^riococoininpiiooo

u\OOiOic)^'rsinior-,ooriio>pirHifr>)rjq.caccica(NBolOiconcoiocooioiU'BPCr^J,^rr-''í,uj'í,uiíi,uli/i^u

■iP-fOim-iOiPii—t PliO-ciin OlOi —I Ci H ■ N n 01 r

-lOPNNPBCOffi-llilOlfliPH —I B n H Oi Ifl of . rs - •vulroOiU'PPU'^iOP . r^ in .incNr-

■ HrH «P- i HfJ W • • .PJ^«*P--^C1 . ■ P4 N . .10-^ . -J P- .S" 01 fM -J . .OOCO . 01 r--n*» HHci • tn ■ r» r- r» m • . . m in n oi s h • en ci cn .r- ■ • es id ■ m^i n co pgivo

BOlr-l-HClOlCICIClOOONCirULfl

]UrHHOl»mHJI»IHH

• CdUCdCilCdCdCdCi]

m»OllOOiiripUll/liiB<N*U3PNPi,lBillNBl»NCDPNfnfllPC0^lP'*'«i»i.fBrcnin—i—ioi^oiin^-Hcnp^ciP^ooinvoPJiooiiHCioicoci^CFiiOinoics—■. » oi —iiniou

r liBBinuicor

«lOOcßCir-iOiioKacooicBCBiOiocopjincSP

»PCHCOlOPl010«rBi001UlBrrl'fflcBCiincNincicoincaP-^^rvi'O'cics^—lOi-^^Hpj^ojiOïrcB^p-miûinooii

- r- -i oo oi -■iiniooicop-(N—4P

ar^coioûOP-rJCi^jOicooic!

J ce j j a. ce ce j

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 17: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT SI 7

es • es oi m oi ■ enctcB P-r

Flp-P-OÍ . —( oi p cu »oicin » CO H CO «IJB p- in ■ p- ■"»■ cn . 01 ci en ■ vp ci co » i-i ru r

■nion • -td

en . en ci id &

ín 01 -oip- r—i oooioiio—* » » ^copjoi^'m no p m if n ^ *ci\j

IHP« • • e» —• r- m 01 ■ 01 p p _■ -<NS^9 1DIOlOSPC

p-œo!«»^oiooaicivociin»iBOir-rueNP-p-nriip»»ininioruinp-csr-wi^cicicsicniop-ioinoiciinoor--^,(s—iin^cNCiesoi—i^oo-iHuiio<oco^>-«iorricoBcooi-'imiornr^r-iinta—iciots—4CNOiesoip-r-i^p—i

B <0 S V -<BM10IOPlOPlD'*lB01H*r>JlflPP01'-IIS'-"10(SC0C1[--01ÍB—ll/lPneíIOUlBNnMlOMP'-llOlDWPi-IPífnifl^OnfHionnni£^noiBHBWHC^niHPjnrJuicoiOBu,iroi<,BP^^iooincouir4píTi^pnnpiOBinui'^fficocopHrncococooi

PlUi^P^lOlOPlOf^P^OirOBfNBPBChNCO^in^^lAUllûH^BPPtCOlOlDPBBCSlONlhr'Jf'JfllI/lnW

aceoccx-jjeececeeeaceja

4IDNr-IB',101PP

• OiCdCi .OiOiIS • r-i p--i^p-rucicBin—«ci .i-ii-

-p-rMioci—i—ici ■ • • Oi p 10 h ro . «r -j ^ iû e

MP • d ■« riH ifiinNinpnppiuii-ip • ■ . .cien .cii-t—ici—ip--ji «t a h nnn . . p) n* —i —t ■ lUioiWHHHmmoipr'i-iui* • p- ■* ci —i ci

■ . -J Ol ■ • —< —I f^- P- Cl rH > «OlOl ■ • Ol Cl . Cd CI P- Ol P- Ci CI .CI .C1CBCBCIOI.--I—<INirvlr*li-ir"-C),-lr-" • • . <HH P P . ti-iHi-IHuiin«puii/iHHvw«rPfiiNHrippiNuipPHHHHN^inHincoHHHp«rJNNHPi-iNHinininiNNHHnnwnHHrJH

.Cd (d.UCd....CdCd....

aauàaaUUaUUU • ■ ■ • • .HUUCdUUUCäCdCdCdCdCdCdCdCdCdCalCdCdCdäiltdCdCdCdCdCdCdCd ' ' ' ■ Cd Cd • ■ Cd Cd Cd Cd

co^oi\oooHpœBPHCOini/i^cs^^Bi/iNOiioropr>Jr^Nriico^cnoiBio^iOPCOOi^chnBO\io^<Hi/iuioinsHHBPnHtfi(iicoHBCni7i«nsn<rBiDuivi/iNionNinr-Nrnior^BioBPOiBPCh<-icNO)Buiiouiooo—leoppiftWBWB'i'^NPNPr^iOBONvPriiWninNNNOiNPiouiHOinmoipiyiwriiNnifiiaJ'TBS''OBCBP-inoiOl—IN01»WWBUln"fONIN(>i*iOPiOr,lBffllOiO'»B(N'-1 Ulli! lO T i-(■*»"—lN01*HBP"KN0101IOll

rup-ciio«*—<■»—i^-ior-iinr^iofNio^oo—i b p >■ip-ci^^oocicicooiiocBCOincicir-iea—(uiinifurp-i^PHvocB*^wuiBin'niuNP"fcfiOBPBMH"fT»^iOifi»in-iionpiocoBcooimr-iH»^iomuirf(NvHi/i4j^i/iioinpiri'Oincouiu5uiiOi^BioNio^ioiOiuSvO'«voioiooi\o^\üPví>-Hvoc&iOODpppoipcopcopOipo>r

g es iß io p- œ

u)MlO'^llOXlíX^o^vO'flûnlûXlOlnpnpxp^í^«p»p^^vIsn^xpnco'»eo•fcol*lcow»nconco"eolNlcoioioioioioi^oioicnoioioioioioioioioicnONOioioioicncnc

oicncnoioioioi oioi—'Oioioioi—<oi—loi^encn—tenen—<ai^c6(xa.cctea.txtjíC£¿ic&(x<xtzjicc^c£¿iaLK^a.aí^a.'í

cii-i.p-.esoi—icscicir-iPíoiincB.i-Hinci.. cn c> in ci c> • r- ci.-<"p- en e» oo in io in ■ONci—4 0ioiini-i .i~i"a*p»pj iiocDPHrJiíicncin'NoioipV'íBMPnnoii/inPw • oi in ci . —i es —i oi p p ca—< ci » .in . . i-t .p-voPJp-^'u^'-'p'Oi ■ .p-oooNOi—'iO'-íuiis.cop-csiBí .cico . p« in *■■ » p» —i .in—i co m» h oi

• Cl <N cn ■ cn t"N fs —i rN t « <tp rH . . » NO Ol P* ■ **vOi ■ ■ .CIOICÖNO—4—< —iPP- P» • NO Ol Cl ÙJ —I Cl «H • P- ■ iOIHP • Cl 10 —(OIINOIOIOI-I"-

iH ill • • iHPíOPPi-IVCOH^1 •<» ■ • • •—itr • on ci ci « —i N * . . • . ■ .citscicicici,-4 ipBi-l i-<P • • «r-IP-Cn—IP-Cl—4—1—I—I—<—I.

Oi «cicioi es —tpv .coen—(inp-oici-joip-in—ioii-icici ■ p- .«■ r-

• . cn es in .pjiooip-ci • i-t . pj co —• -v

Id [d td Cd td Cd • ■ Cd Cd Cd Cd Cd Cd JidCdCdCdCdCdCdldCdCdCdCi

tno^nO'J'Ci^i"'«

^MH\OÑcoinBPPio^nHPBpionNmpin"iiniDuiMCOPnPHo5inN^uiBiO"MioiouiBioHBB'íBI/l«Jr-<NUlUlinH«fin<»"rBCOCft«fB0110'-inBPf,tlOPCONOJH100lN'THn(^H"lCOPCOP(i|H01HNnr^l0W-'H*Ol^BUlnBH-HNr1lnU5lûPHMr-OIIDU1-l01«'r1ullOU103HB'Jl(,.P'^PnpOI"l(NnBUIinfll

ninncovioinnr-nr---leocioo^oitsoincscNtBNDCBCi—its-«oi—nOniiûrnon^wn^MiomifiipOj^HvNui

ICdCdCdCdCdCdCdCd

îuiiopoin-ioiioijin^ninB-iP)UIBPBpU1C0'*l

□ccecececejcca.JDe j cc cc ce j

*î ^ _ ^ _ ■* "W ci oo-c -t pHion m oi ci oo -i en . p- cn m ■-i m p-«,* ■* ̂ ■"• w •- •■"»■oir- m louioiiû .en -i . id • en en ci ci ^npphcoSoi

r £ * cn S œ^ oî -h (N Sn "? Ín en 5 ^£ r-p-pj r-cn no p- r-io ci ci oi r-ru en t» in -. h ci oi en p- . en 10 ■ cn . en en

-iooonci»_. r-p-in W p- p- r- ._. .cnp-oi .ci . .<*^tN0'i*ioci(C^£ct^^rl!¡™-4.Í¡N1^.H^

—i pi-ipjcioiio» » ■ —i OiHin • • . en m co .ci—ia

• Oi NO —»UlciciciP-OiOi

icioiineBfs&icd .etc

• esio^«ior--ci^HOir

-i <s no w . en - j cd • . en e

LlWCdWCdWCdCCUWCdCdCdCdWCdCdtijCdCd . .CdCdCdCdCdCdCdld . -CdCdtdCdUCdCdCdCdCdWCd^^Su

ä'»«co(Ni«BB«iO'firNOiHB'0'»iflioN^ioiow(NN»*No,ininvioT«io«uiu^»0!-t.Hciciin-*»cip.píioP;.3'in-4CtB^Ln.»p.m

110^P^"UlulBf,I^H47U'lD(,líNPUlP(aP01C0^,irlCtOini04rPUIU>BUlCOP4rHU<CO^COCDPr-INU?i-l

looip-caeBCBcocnin-

B(NBBB-IB10B"BHBBBUlB"B(NHnr-|H,JinHnHHHNHinHniHrirtirf.BrNNrJNNPNnrNie(NPNC"r.!!

iiO'ri*Hfri*riirniûCOiiioioifioi*BPc'iufCIP-p-eOOlPJCB—IPINOlOlOOlOO^IiCICBOOlO'fl'CirNCN—lü

i|eBCicsciB(^'cscicBcieBcicBX!cBc

íSJoeosjjoeo ce a j j

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 18: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SI 8 SUPPLEMENT

—t lO Ol Ol • P-co-IP- cip-ci in» 01 r-- en p- —i » 01 p-cn —' en 01 iNci ci—( —i es r- —i npiop en 01 p- pcopiûfiocfip ciioc

• Ol—tin»OiCOCSOi Oi iO IN • ClclP-ci » Oi • CN 10 *H Cl ft p-OinOiineNvn..pjtSOi«0''i.<n -^ —1 pi co en • es in p- 01 »m^cncici .-- ■ ts —1 n *>■■ en en . ^nrjoipoirioinp-JPBOimBP ■t -j pj .coin—ip-ci»pi . «cirHincioiioO!—< es es • —lOinoitNiOftin —1 • p- -* pj —i io r- n (n —inni. w v • u ■ . «i r—(ci .01 1 n ii p .(n»oip-ci—ii-iciinci «p- ■ * ci p- ■ <-i —1 in ts «¡n •—iciin—tin • n p- cn ■ ■ «ci • ■ • n p- n en

■ .OicioiPI • .r-i«-ii-ioi<stscNci • 01 —t p- .cneNincn—4 .—icocienioencicim • ci —< —1 • ■ 01.—1 —1 n ffi en p 10 • 10 -1 cci oi .-i —4P- .nninn—iinnin . .01 • ■ ts ci ci —i • ■ co cn . ■ .en »p- ■ pj .r- «oi . 01 h n m p ■ —' —i no in ci cn ..

i_1 co • —1 iujuih .oip-inoi-Hcioi «ciin . ■ • 01 —i cn ■ p n 10 v • p- .looiin .es ■ n 0110 ■ . ci ci ci ci —4 —1 .01».-

. ¡j td • . . ■CdCdCdCdCdCdCdCdCdCdCdCd

tsesescseO'3'in —ii^»\D»»io»io»ioœri)r^coio»caesininio»»iococN»ioiO»eoeNtscBCNeoininccip-p-oip-CNcNf^-m»p^fN»in\oOi»—icNP-iooiinvinoicNP-p-íNCD—icnp-co—icntsco —i ui m ui n p co rn»»csin»ioeBiop-p-»ci»pjoooo^p-'OP-in{»inp-eooicap-io^co—ics-hw^oicn^oicbpjoocip-ljmnppcriB^NioMp-Jvoco^NiniiicorJnoiHriuiiO'i'PoicoiNiPBffiO'VBnuiinneoiouiniofi00 ■» to *r es —< —i^noi—ifNeoenoi-i ■» r- P- r- —ieoioPPPp<^'»riipB(iiMuiui(NPCiiPB'),B(JiNuiio(oncoiiipisi'ii/i(iiB'oocoiOP-<"P-inp~eooNOi(SCB—<p-ionr-oiiotstsONts —t—iMcinrn»CDOieo»coiOiO'>i,P-»—icoco—iiOcs»»p-piP-p-inesinp-»

cif^inooinciiooiosp-encNts—itS'weNiHeNOiincNencioicscsoicseo—t»pjcneNcnp-ij,oo--ioop~esf«i»in»"*'i,oo»iom--(mcap-p^icn—1—1—ÍP-—i»—((N—i in cn CN cn CN in —^rll'>fNPNl^^lPWOSrolnnpnu^MMmlOrOBl,1Bv"í^u1lJla)^^o^|u^^f^o^flO■1■^•

CNC1C1 » mnionr-nconc

■ ciiooicNOicics cNoiP---.oioip-(N»io—W b ui cti h r-im ■ *—(cn»oo—i p- 01 m cn cx> v ■ n es » 01 p b p h »ci .locicioi .iop-oiq

es 01 —1 01 • n h ai «oicBcioiiHCioipip- • 01 m » » p-1 > ■ >o —1 cn 01 p- 10 • • • r- 00 .cncnci . ■ 10 «ci • ■ . en —1 01 —1 n p . • • —4 io»en ■ .cip-iomoicoiocNinp" •»» .cici •—icnlooioi • • • n —1 .r-cioiio »ci • ■ co p h »ci .cienencN «ci ■ • • p- p- —1 . .es-HCicicn • .clin • • • • .p-» ■ n -h eo n iHTpBOiMHrj .MHiiim^-iNpnuicsioNwHio^ppmifioiOioicoHHpp—1 .p-cocNOi—■ .cip-oicncir- ■ .clin . ■cop-i-h—(-»»cnooiocsonio • • —< • no cn —t 10 —< —1 • u p»i»im ■ .e» >oioihh . • 10 co

.ci ■ • .cir-ici .cicioi»»—1—'ciiooioi .io • ■ • • «no .loeoeo—<—1 -ci . . • œ • .cnci • —1 . . ^ n • 01 -a- —ici—«cici—h»P-P-CICIP-—I • H N .Olin . .C1C1CN •SBHNPOIOlr'l(N • p- . • • CI CI r-1—I ft p p . 01 Ol Cd ■—IP- • ci —I Cl i-H —1 10 • • —1 .—1—< • .IOCI—IV • .Cl «CdCIPJ ■ —I •—I • • iHr-lr4PNr-IN^nii¡H^'HrtC'l • • —I i-1 r-1 i—I • 01 —< U"l Cl .C1P-CNC1 ■ H P P H 01 .P" ■ • P- ÍN

n n —4 —I Cd ■ "Cd * tP-fN * « Cd Cd . i H r-l Ol Oi H H .01 • ■ p- V . ' a a Cl Ol r^ r

TTio^wuiuii/iuiinuiriicoifimifimBMNcoiû^'ii'OBainui^irBisiriinBBBBuiinNwi^^voininoifNP-—i cn —'cociiooitsp-eNoieûOitsinv'ij'Ci—toiio—ip-caminiNP-en —loiencN—iinv^-rp-eninnp-p-—i—loominninTrnc

cioioicicsim»rOiij3Ln—i ts —icNcsin—ip-cott—iinm—io)miooiBPioinift4iiBOieoioN,onBinpriin\ocMNiPin-itoHcopiD-4i'BiOviOPHOHcoBBlíP,o^N»,OBiípr<>oinnpvBvtSH',icovn«HnNcncoinBuipBr4C04jcocNHriioioi-(oi*rp b p r-i in no m en —»viop-p-inooeN—* —i es —'incocnntsBCNCNcin—leNinn^NO-ifijpf'iBChOii*iBN^p^,iYiiriOiBfiïfniriiscoriDinB»NPftPN^ft*noiinoi»BnoiBPnftH^HPP'fB'rispP'fBftoi'NrjpNHPrico"iBfflnPcopiDinnnoftinBfNBHrnp^BinH'impBPOSftuiBNBHHCftmw-riiO'ûiû'fliO'OPMftftWBi/iMft'iiTi^PCOCOHCOI^OJ'-ICO'NCOHCOOlXPiOwœNftBCrlBOl'NminolNOl'^ftBOlMOlBOlinBBBBBHBHBBBNB'NBinr^'^rvv^invinviyivinvi^v'Tvijivinvinvinvinvinvinvinvinvinvinvin^

01 ft .cn p- P- 01 —I (N(Ne! 01 01 oi —1 CN Ol —4 Olft ■voi p- P- —( Cl Cl IN

• oo cicip-oioi^.inio .inoi —< 01 ci en —i cn ^ —iioup «ci ci oienop.. * eo m b h ■ Pioco ci —i ci m moi cup -hn p p-ci. co -tf . co —i \a œ 01 oo pcici .io^hp-cn .cicncNj—io! en ai —i« pneooiNin i-100—lenoico —i ■ s n p ■ -ciio oicicooncicicion ci \a —i

• in —i • ■■*>■ • p~ (N —i • .oi r-nn-Tio ■ • ■P'»o)ninnpH»HioncMs,»oioi-n» m . ci p» 01 ■ oo in en en en p 010Oi ■ oienenenoiio ■ .p-enenentscoio—lencioicNcon . . —i . •—luipuiicHnuiPH.foi'iP • «r —i —ii/i po< •» n • r~ •■* en an m p pH p ui «in—lenoiiocicioip-—icNciincop-—i . —i en p« >cip~ -ooci • r- «ci ■ —t ■ ■ ft ru —■ —>—ip<i n>-101*01-100 «oi

• cdiooo .—h .01 • . —e —4 —■ (n —1 on • .10 ■ • « • «ci .r-Ptoiiovo—iin 1 r- h n .p- .p-cip- . «inin .tN ■ .—1pH npp .ciuifien • . • • .en—1 ^ —inoimnftcorH-tr —ip^i-< co .cici .inoinpoico^ciN-i .01 «oioioie-j^eovtS'HeNcicNcocirnoioicnp-inc:

p-p-eNcip-ciinincNiNp-P-eNCNCip-—• c

• • Cd Cd • • ¡1

p-n^OB'Sui'^iscscip^ininvwœPtcsœin'^esisvvO'S'Sco. n■vciciP-p-p-Oi^-inincNCip-eNcsenioincNcnoiesp-e-ipjp-—iP-tNr-Oiin-trcs —ir^CNP-nesBCieNr-'irft—iinincNtsiOiesftOiesr-eNP-CNts cn ft —4 es P- es —ii^cicncsiominvOicicN—ipj—ic&n vp>-i in^r-tniûBcooîBPCor'iCiiP'H^'HBPpciiB^'NCi'NCifiiPuivHiTC0l/IH10ni0P0lH01BNC0Bin^eOU5BftrHHITili||J5*NHPB01U1IOftftPUlfnHCnBIÍNr^NH'^

PiíPB,4i*Bn*wu3inoi,íc09eo<PB'N,íC«NirftHBU)iiiffloi4firn'íUiPB«NPN-JOiN,ooi,owpifBnn-iHpspftft'íBVHCOHCONniíiciicoNftPHNiNB'jiPPOiraPoDPOiWBPHHn'í'ooipwB'^BCOwuiincoan'tnnnol»u1*ll1fl^l^Vl^'^'»^*Qlnplnu)ll^^lnu)mlímHU1a,OB^í)'í,íOl,OPU¡p^*pOl^Ol^P^^J^•■ll^^^^-J

jnioxioi"b s es

jôs K' U tf J g « g « K K Pi S a ï ce ce ce ce 3. ce ce ce ce j a j

ci —icn—leocnncoes—1 loaren .cien es p- • 10 ci —1 pj ci locicsmaienoioi 01ccocí 1 * p m 01 n h * •fi'fniooiHcop pcopcoiroii-npoi —eoicnoi ■ *•* .11 ^ m ™ *n

es • ■ ■ n es '00 t ci —4 ci iuibcs^h^pcop ■ 01 —1 —4 co . . ih^cnpohoi/in . .m * —i —e «veNeneun—iin . es p- p- —< 00 —4 .ci—(cici—<—i n n r- •# no • cn —1 in . . . . .en • m p • . .010101 -p- «cacsin . ■encipicniooifi—<in—1 «es • • p- —1—1—4 . ■ .ci

• ci (N (O • «Cil «.-i • >p-w * •Oificieiei .Oi(N .—4—ipmoiiooippior-1 h n n ui ui • n Pw r-1 • • • in —4 ci ci •er . ■ .cicir-^rcicN ■ ■ r> 01 .—1 .rocicNcip-oioi—iinucd—im • ci —4 —1 10 > m 1/1 es p «i • ■ .—1—1 • .p-cn . . m en —i p- . •hh . ci ci ci —i —i . .UlHH'^^eOUlPHCMI/l'NCN'rCll^ . ■HiHUJCOlNlfNIN «CICN .—I • • ON Cl 01 • iHHOl , H P IT P n » n n • ilANrlri t .^i-l

_j^ . ,^ci_^^h .^r--4ftcicicicdcd ■ .nnnrjnn ■ .p-ciciin . . . «cdCd • -oi^h • es —• r- on on . •mUHH^iHua > >

.Cil.•.CdCd.Cdtd

Cd Cd.Id Cd • . id Cd • ■CdCdCdCdCdCdCdCdldCdCdCdCilCdCdCd • • Cd Cd • ■ Cd Cd • .CdídCdCdtdtdCdCd . . Cd Cd cd Cd • .NNnnNNciiNcii'NN'NNNNiNnnnniNe^N'NNNnMNNNNnnNNnnnnN

œœinintS'SES'^scsriicoesesiovinininijieNOOTiiocNrNjini^csio—ie»ci—in vuli-luiapnuifiiUlfflfi'iio^'Oir-ipBOitOHiNPBCiiulinrjpBinnujKniiiuitrnujifrtBCOiflitPiNiPpes

iO'^—iP-iniop-(Nio—icip-ininciioio—iNOeon—'—ineseN^ior-jcsr-ONciiNci—'BCOoiniosvuicopnoiscsnir'NcoiNC'icooiiDO'in^NPCACO^W'iiftncOi^ioinvpPBPoicoeow-ipnioffl'innpvifBco'OrjpiDBinœininMHftftHPinfts«BftBC|iNH*oiOí'*pccii'ipi>ic*HPinH*ní8co,»oi,»9»o}PHi»B*'^tfin'Sa

coNftoiBCOB'^B*Nn*Pifn'»ífflifiinHinfliou)eoinoo-4i-i,íH*fl-iiíBBWai'rw"fcocOr^'fHnNeseNcs^*—i—id—i—i n-4 m-1—i—i ui-4 m-icn—iin—in—in—iin—ivcNvcNeNeN^pjcNr^vr^'W'eNncN'vcicininntsciesci—*ninn—4

acsescsescscscseses4HHHH01HHH01H01i-01H01-^enHn

iJOCKbJceoecececco

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 19: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT SI 9

*2S„a aal*«. hL s„s sSÜs's Jas á«*: Bhm sgSS'.-^S3;S'.^í£S£S-;S23SSSSSí^Sr- ssis-'.^s^ss^s-iss"''^^'-:« ss2S3SS3.;3-.S^a3»E2S-.3SSS3«SSS»R«3»S»33SS^8»«SS£3»^»3'i;»a-,3»»^¿^.¿s^asgas^^»;^^s^aaa'asa^a's^aH^2a22¿¿a^s^aB2áa322áaaRc3sss3^s8^gaSSaSS^SfóS!^S5.53.sâ-iSaâîâssââ3âsâ«esftftftftftp-P-p-PJnftoo-in.np-^nnn^œft™^

S^œ^fttsSSèsoo^ÏÏnftn^p.eNrNtsMtSNOvooeNCNn-inMoocNtsvcoeo^-.oor-Nco^ftvvesintspJ'*

«ss-ËsâsSSâssESSass.âssss^i-t . cn r^m pi * in in fio Nr» *?* pj es ci h n cn

in -4 oi v nu, n -i 01 r-i n -i cn -i -. en p-n P-en n P- . n ft

is r„;»- ¿seíír;. „ ^3 sa s„s,":»»»S£3 s s sssss^ s»£ss„Oir-o> m» .«»»» .« . u> . .H »»»iM-noin»«N«a>in»«»inriiN . -< • r- r- o> -. -. -i -. -i -, 3 u, « « » -. 3 5 -i a*

s;-paaS5pa^a¡;»a»„2.a„»::2¡^^n no cn in . . .en-* . . . en . oo . . en in ft -o- .-i . ta ■* n . io • r-m m-its p- . .-< n . . es • <h . . , m m n-< ^ .h m n ^-4 . .pj . ■■»poioin .ftoi-4 ,01 v-.cn , n-. .ft . p-eo-. . en v -. no . pj m-. cn n n p- . ft en -» r-i . ft ft en . .-4.-.-< n en

^S35i-":--s-3':»--3^ç:2S23So;0;3£o;;^ir:3^s--^3-.sj2ss-:":32o;S3i33^-;-s

aaS3222"3agH22222:JäR^^^

ïsïslllslslllllllllllsllsllslllssllllllllgllllSa.aSâaâsâ-ss.SsaâsâSSaSàS^SssSasîsssSES-Sss-.aSsSssSsiBS^SxSSS"s;£SS"£S;g5Sx2ïï3S2S2;3S2S2Sn32S23aïïS«S;SSSSSSSSSKS3S»,SS

-1 en -t on -

¿^Ep".ssHp3.slL2¡i«s£Ís^^Í5p|^s^Í »â^i^iP.sassâ^3^3£PS^5SS; :3^5-3¿£^S3^¿S^SS¿SJS£VSS3SS

»■i*s^:ia.222:î::sî!;"s::':s.i*s.i?pâ2222-1 «Cd .PPP*NPP-i-in . n cn -1 .n.p. rH cn cn . r- ru en p- n -1 cn pj pj . ft -- -1 .hn<v<S(Spp • • -i -1 -1 ,-1

^2í3^^^^s^^uí^s"ss^r:s33Sí:ss3;^^sss2ssuíuí^^'Síss;^^s2sses^^s;uí^^^

¿•¡^""Sga'aSSM^^sssssî:ïsssssssssss2s??ss2ss;s»sîsïssssssîsss!3£saîï:sssî:s2ï;sss»»a£S»¡eRSS3S»S2S3S3aS£3SSSSESSRS¡:SS2S3SS.2f:»S:;S»»S.35..2S2a»aaSSSaSSSasaa.SSSaSSSaSSSïïaaSSaSSSSSaSaaaSSSaSSSRSïïaSSSSSaSS

sssisSspssâisssSSs-ssSssss^^ ;s;s;s3Sïïss5;sxSx£Ss;ssigs

,a»a»3»3»3£3»3rf3»3»3»3»3»3»3»arfa«a»a»3»3»3-i3»3.H2»

£S£;s^s£ssrtss r. ss sis» ;s-.3«"a s s« » s3.«-;-:-^-,:21ssse333;So,-:sp,^^ss2S2k;s"*s~siss25S^ssk-ssn^-n—ioip-—in • .—1 • .in—ifteoioeNCNnnp-—i-* • C

!222:î2âsî.Sa1«sS!î-Sg22S22«ss!•aSasSsaas^»»^:^5.«.^!

IH*H«N^lftUlNtNHNNtNPNIftMHHpVSSÎSNN

,.JÍH^2¿H^^^^^iHsÉsS^^£Jj^3SSSIssas.SssssSaSs-saaâsâ-isIss^,ftp-,p^,-inNOfP-ftcNCN,ftioooftLn,,n,cNes-iftœ*-.ftio-icn,-iioineo^in-4eotsftfnines*ooft

SSS5;2SïSSSSS£SS£3S2ÎS£S;?î;2S2SS2SS"2S£Sî:p:SS;ïï5SÏ23SSΫ3S2SSS5ïSSS2SïSSSS2?:5SSÏS£SSS£SS22S;?!ÏPSS£S23SSÏÏS;3S»ÎÏ£S£ÎSS2SÏî;SÎSSSSÏSSSSS£SSSSSSSSSSS£S3SSSSSSSSSS£3£2£;SS£S£3£"£SS£SSSSSS

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 20: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

S20 SUPPLEMENT

•NO • . P- r-

-teoiOft • • ■ —i Oi ft n .n iop

Oi p* ft m n ft 01, -4 ^ en -es -* c

oi es ts ft • • io ^ c

. in p- . *r —( . no rO^ffiH^B^BnB"

p-p-nni-icN .p-ciin....—i—i. • • ^ u •—i—i—t—i....i-i. .\©..r-r>««-i w ...... in .. . •• ••■ • • ta •• ■ cd cd . ip-^incNnnnn . •—4—i—icsoin . • . . 01 ci —in ■ ft 01 ■«■ n —> • «p- iinuiiniiir-ipinr-iinuipppppoippintii

minmininin-in ■ .-im—Miiiui-i^p^ntfinuiininuiin-wiNrjDinHrinn-tn . • . .-4-4 . . . . ,-t n ^ -h -4 -< . . , <a.(NCN.Cd.[dtd.[dCNCNnn..cNfNpjcN.m in ■•* in

Cd Id Cd « • CdCdCdCdCdCdCdCdCdtdCdCd • • Cd Cd Cd Cd • ■ • .nnnn . «eiJeNnncdCdCdtiJCdWnnnn

icnNPm«uic

inioNomtscNftcNp-NOfcop-tscitsioin—icncNin—i-BPBWVOtJlHNPBflilBUlOinlPeOrllBUHOUie4BH<NconioBpmcouinnBa8innBionoiiconpin-iwBininuiBcopiniOr1 es co p uj iop rB^^nr*(i(ninuinp«(N|Bwcoinwui*p«)Htmioinp-incimiocoesintsiocoio—1 10 p 10 co 10 bp •ooooooooooftcoft —looftcocooofteoftcoeocooieoc

4P(SPWP01*Br

VBlSlOtOlDBBOlr-IC-101—iftCNNOftONinoitsoiiooieocB^jieBints-íootsoo—icntsco—icoesoi—iftP--tseNcnesoio

n p- ■«■ r~ "* 00 x

KcccejeeuccKacecececccecccece ce ce ce ce ce ce

oo •» 01 n 01 01 c

m—4in—ift—ioip-01—in . 01 r- . en —i —1 00 p- -

oinoin • e^ ^-i r^ . . r— n ■ .(scop-nenenr

• Cd W Cd Cd • .p-r

a cd cd cd • ■ cd cd cd cd t

Bin^inftcop-NOtsOii-

JldCdldCdtdldtdCdCdCdtd . 'Cdb] ■ ■ Cd Cj

coNOinoi—ifteses^iotsesoor BoarNOiio^eoesiNCNOOininmincovocscico—1Tifui»incouinioniOB-iBOiNHneOr4Ui

U3 0IPP01IÍIU1NP r-ICOft^c

4 (N ■» an sn-iPJr-tniotNftftinoitNvooocip-ioioeNLnp-fn—1—i 01 io cn es P- n eíNOOi—4P-—inininnoonnooooinesr^ —iincicNniooop-inooinmntNtsiOP-p-rles^ntsftPiinoooinneNnNOP-nineocoesp-p-p-oitNp-inesfttsp-ftcsco—1-410P-N0—teo'SP-P-p-^'ootNftfttS'O—les^tsiooinioincominincseoftft —1 oie

iionpnconoivBnr

ijjceoeeeeeosa

TwXfl-x-rXffl-'wXfXii

¡ ce ce ce ce ce ce

es m 01 m

n£n/ir4 ■ r- p- ^p-r^en^r-

jenco^enp-votN^-.-^ . 01 p- —i

Cd Cd.Cd Cd.r

• ■ Id W Cd Cd Cd Cd . .CdCdCdCdCdCdCdCdCdCdCdCdCdWCdCdC

^ pn "HO'í lOf

1 Cd Cd Cd Cd Cd 1 • Cd Cd • JCdCdCdCdtNiNcdcdCdCdCdCdCdCd

jioHnPncoiouii-looft^ooricoB«tHpnBisn«n8pr-flUOPUIOlCOlDfflMHCOlíl*«

N VOlBOlBPBO

Oi X ft n ft x c lOinsnB' resnes Xtsnes-«resn(sx^n-t x —in—tc

ip 10 ■ tr • >oo • no u

lOipPu UPP .co- i—i -w • -oiftftft—ir-ir-—1 •tijftftiO'- ilft • Cd • • ci i£> Cd •—I ft ft CN [d P- ft Ol . .

"fnHNfdPSninrinieincov'HHi!es <n r- ft —iNOPJtsmeMcioooioiiotS'vftocsoooop-esp^oooieNOiooooiocs^oiñnftr

p- , in ft p- —1—ieompo3co«oicocii«ioo

p-p-r- ppppppppcoppppppc

sescoeN^iorNOomuits

ppppvoffioiBMcopisniíciiu

s oin uiioio -1 10 .-

spppppcopr

ip-Xp-nr-^reon

-1 in io 01 cn —i eo

ft no -h es no m 10

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 21: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT S21

—i n rcf^nrnpoioiffPHCOp esinft es—fft esnp- 01 —e 01 m co -eNOiineoinr-Nooi—iin tscNeNnnen

n p- ts ineNioftp- ■ n p- -< ft cn .csoinoco*p->-4—i ts -h pj co ■—i\0 <s p- nooftp-ts—10110 • -ci . en ^ n cn es • • • »r ft —i -ncoppen en f .—i p- ts >CNCNnr~,ftOi—ieneN—4 • . cn p- n —i «n • r-< • «n—t

—inioftp-p- • »es .rues ■ •Hinoinn^nuicinoi^BflWinoiuip ■.BBUiuicopmnH • in ft ft . .P- • m ft -«r cn n • « .—itN—4 • —i io —i p»

ih p" »h . . <r v in > top . cn ^> 01 ft >p- .en • .pjenp-ft «m .r- ■ ■ «eses • ih p 10 «CNft^nft -B h rip b p • n —i • n —i —ip . r- m n n in —i

-toift . u en (-j -i -i • -mmiPJcNinineNm^Hctftcnrupj

cd cd cd ■ • n n u u

co p) estNooeNio^eotN c3tsinmcocNts><3inin*r!Ots<S> tsio

—tioftesp-—itsnnoo—iioioncNft-HiooiiOftnoONDininoo'Wp-ft—toon—icNftncsints^—linio—iftesftese»r-iP-NOioinioin^inooooin<nf~incN(N'*BOipppinoiuisioHBuiiocorJscofiriHinuiioion^oii/icOcoioinuiftcN^oop-p-ncNnesiotnconp-^iom-ii'tsiNNOin—icsin—i in n cn ft no p- tsfCo^oiioBBOOcs^iOr-4—mif,nio,HUicftpnconconc04rcOfU30iin—tco^i—iiop^cDp-eNp^fooftncoootsooftootscofNoooioomcoeSinftoioofttsinioioP^ft—'ftesftesfttsoocooi—toi—ifttsft—lenesftcsfteSftftoieu

—i m en en en —i —i —i -lOiOi —i —4 —t —i —i —i —i ft ft —t

—i oinncN^CNinnior-ip- o N* w s —i n <N n n ■^pJmnionr^cN

ts p- ncsr^isp- —4 n p- ■ « oim ionnn>-ift-HNO^H oo n —4 n >o • en en n n cn in ft —i in en cn .co

■ ̂ innnnHin . \o . en .en n^" ftnftftCNOoeotNCN n p- p- p- —i—i *n nin ■ oicoi i-i •HpinpNco .—i niocN • n en in —i p- <n p- n —i oi u> co en r-< co ic . • en co ui co s h « • —i • ui en oioi h * p-io >iO(N .^n—iftftP-(NCi]ftftnco .incoiocNncNp-mtscDaoïo • ■ .oi—iin—i ^ cn on n —4tN—in—i *» <n <n en >oi

• lOtN en . —t •—icn—tea . m r- • ■ p- co ts •* ■ p- —t ft ■«■ . es cn es n n p- —tio—inoiirconciniOioiNNU • oo "Htoidn —i—t■"-iviOP^BCOiii-JBBHCNKNH . . r-- co -h -4 —i co.^ n «ft • • . .ft n .

i • • • —4 r- cn . »P- • (N oi —t in ■ in ft r» ft en oo • ■ .nn—i—iin—itNines • lUiNinuinpoi «nw. r- n ft —i ̂ .p-r-noi -es • • —i • in ^ ^ p- —m-ioii-iin .^nnmko—inn • • .cn—i—i—4ineN—iirJH m . • —4 in • «e»—i—in—i m en in n « h . m ts in —t . —< • . . • • . —i —i ft p- —i —4 • • *¿> t . .

H .INtN—I—ICN^|ii~4—4CO(Nn . —1 • —1 .rH—I—l^n • -4 niN P N Ul « rlin Prl 1*1 • • • P» P- U"l * ft —t—I• ftcdbl • • • • • • • • cd p- • n • —4 r-< —i —t . cd p- —i in • . . • • • • ■ cd cd —4 n n to • • • p- • •ipminminnpniNnoipnn'JPB • ■ .p~in, • .mmmninpmpppri—i—'—loien—ism ui*^h • . . . in —i u) ca —' «~' • •oo^NO^p-r-n—i ■ •innhhhh . ■—iio.<-i <n io ** ■ .

pi (N . . . . p p w a.nnmtN . .inm . .min.eu ■ in cj « cd . . • ■ —< —i ■ .cNincNCNnn . . . . en cncd cd m m in m • .inminu-iininminididcdcdinci • . n ci . •uiuiininininuiuiaUuiininulinuiHHnnciiuuuuUnnincnuunncduucupiPJ.cdbinnnntdCdnnrdCiipjtNuuuu • • • • in <n.hiunniNtiicNCNCiiUbl&jnn

in ft esto inminuiinintscs tscN p- ci <o t -o- o mmi7ifl,'firriiair-isuii'iBisinini£ia'oiPcon.i.i£(Npiiir-icMccoiNioinuiisisB'^niBaBsiCSicstoflviiMMrinnNP^œcii^ioO'p-ftesNOinvo^>ni~-tN—tp-inesr-pJCNintstscN —iiN^in^eseniONoncN-HOOin—iinftininp-r^en—inftionooiniocieo—i—ico^inp-p-■^lOH^rH^H■l|NC^m^^^mf^H^vOlnlswB^»^H\OH^ac^l^«l-ll^lO"l^o-l^ílf-ltv^oc^Isa^w',la"DW^llosc^lSlneN^n^fttsoiœuiftesinioesfteNtNnooninftinmcNPJcstB—ioooopicncnoi,—iinnm—iinpints—iiniopjoi-H—4ftio,incNOiin-Hp^vn«wnnniBpinnptoriinnispio(iiC'iiOHPa>4|oiuicoPnu)n«n«,Nioinnui«ioHPriiVH-iiosin«N40iinencocoenoicnu-i-a'—i r- en —ir-fiio\in^pfriHM4nsisiS',>in*i)'iriuii-i^'ß(Ni/iHr-i<feoinr-iooitOHa)ppoi"rcominBH\C"iin(sNiJ*iOBnpHninioPPinB*ncoinMo\BioeonnBWincoricopn(iinpuii£ioi^i»neopp,r4inioPuiBOie'i(,iBBnoies—iincop-^ts'ooo—i oo es 01 n ts es —ipj—lBlnc^Hrl^ul(N[NM^lnn^nlIl^Il^(NTcol^<^plsHBUllI•c^)^o-^nBl^lnT^lsol|Sln^en—icstsisnft—ees—i b * b w r-icNftesoits-icNftts—inftescNPicNniNtNpjioOi—tcNftCNeoninn^nooftesftesftts^io^inoies

—i en oi ai ft —(oiftencnencnenen —4 —1 en en —4 ft ft —loiOiftftftftftft -HftftoiftftftftftOioi —1 —1 —t 01 01 01 en —1

h niN w nm ^ innionp-cNconoines —1 ccovaonconcoxconeo^ooneonco'O'ftXftxc!

HOlrtrlHOlrlOlHOlHOlHITIHCriHOlHCriHH.-

K-iMoïKasfxaiotaCh.

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 22: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

Appendix II

The first 1427 APs ordered according

to the various occurring types

AMICABLE PAIRS OF TYPE {2,1)

LI 218

LI 219

LI 2112

LI 2115

LI 2146

LI 21104

LI 21117

LI 21

162LI 21

291LI 21

297LI 21

303LI 21

460LI 21

629LI 21

640LI 21

792LI 21

888LI 21

1030LI 21

1191LI 21

1219LI 21

220 2E2.5.11284 2E2.7117296 2E4.23.4718416 2E4.115163020 2E2.23.5.13776084 2E2.23.82769615 3E2.7.13.5.1787633 3E2.7.13.107122265 3E2.5.13.11.19139815 3E2.5.13.2391175265 3E2.7E2.13.5.411438983 3E2.7E2.13.2519363584 2E7.191.3839437056 2E7.7372711498355 3E4.5.11.29.S912024045 3E4.5.11.269931536855 3E2.5.7.53.188932148585 3E2.5.7.102059175032884 2E2 . 13.17.389.509175826716 2E2.13.17.198899183408615 3E2.5.13.19.29.569190055385 3E2.5.13.19.17099196421715 3E2.5.19.37.7.887224703405 3E2.5.19.37.7103536637465 3E2.7E2.13.97.5.193646745463 3E2.7E2.13.97.11631191953763 3E2.7E2.11.13.41.4611223611389 3E2.7E2.11.13.194031225052829 3E4.7.11.29.13.5211321639011 3E4.7.11.29.73072172649216 2E8.257.330232181168896 2EB.85201912935281375 3E3 . 5E3.13.149.4492961518625 3E3.5E3.13.674994149106335 3E4.5.11E3.43.1794268776545 3E4.5.11E3.79196066248175 3E2 . 5E2 . 13 . 31 .149 . 4496120471825 3E2.5E2.13.31.674996370495978 2.7E2.19.23.11.135236950103062 2.7E2.19.23.162287

AMICABLE PAIRS OF TYPE (3,1):

86 6955216 2E4.19.137.167LI 31 7418864 2E4.463679

151 23358248 2E3.37.23.47.73LI 31 25233112 2E3.37.85247

164 32205616 2E4.17.167.709LI 31 34352624 2E4.2147039

196 52695376 2E4.17.151.1283LI 31 56208368 2E4.3513023

270 147366765 3E2.7E2.13.5.53.97LI 31 182028483 3E2.7E2.13.31751

312 205843365 3E2.7E2.13.5.43.167LI 31 254264283 3E2.7E2.13.44351

390 347263216 2E4.17.137.9319LI 31 370414064 2E4.23150879

446 492275992 2E3.131.13.23.1571R9 31 553544168 2E3.131.528191

648 1254255550 2.5E2.23.19.137.419R9 31 1333078850 2. 5E2.23.1159199

661 1309651310 2.5.11.29.571.719R9 31 1359071890 2.5.11.12355199

753 1957374968 2E3.31.17.107.4339LI 31 2092365832 2E3.31.8436959

782 2115211995 3E3.5.13.17.31.2287R9 31 2312891685 3E3.5.13.1317887

979 3693013664 2E5.41.131.21487LI 31 3812143072 2E5.119129471

1009 3986534090 2.5.929.7.11.5573LI 31 4971106870 2.5.929.535103

1228 6562770525 3E3.5E2.31.17.19.971R9 31 7322055075 3E3.5E2.31.349919

1300 7696871576 2E3.19.53.127.7523R9 31 7904894824 2E3.19.52005887

TOTAL NUMBER: 16

TOTAL NUMBER: 20

AMICABLE PAIRS OF TYPE (4,1):

779 2099442345 3.5.7.11.13.37.3779LI 41 2533809495 3.5.7.24131519

TOTAL NUMBER:

S22

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 23: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT S23

s ? s „ s s "s^i^s^s^ssssssssosasss^ss-:^s^srs^s^s«i«3^32ós«a^2.;g^.;^s-s"--:s

¿3sa8s¿aa¿s88t53a;:s^a^■ • .p-r-cn ■rnner.nPHcnHHHCN^pPfiHPiriinH(NHHHPnfiiHniHiOH*c>iHHniHPtii(N.BU

á¡:í:jii¡ái¡iÍ¡B¡¡i¡iÍii¡¡i8"<ra

Ilîitiiiiitlillllillilîi

5« .„sâSS S3S2»5S-3S1?¿.3 as„¿

2»^3saaâsï3a522

is»»?'

aBSaa38838RS22KI

»3S„„ P ^ gg«S| S§SS5ÜSS„ S2S5»glla^^fe^âii^l^^fAú.2^.2ÍÍÍÍ222ÍéUUÍ^^'M^iiiÛiilïïîWm m cv N tu n n n cOMmuiHHinm^iSuiuimu

iOP-ftftftftftft^-1-.^-i-ieNeNeNCNnnininiOiOiOvOP-p-p-P-p-ftftft-i-i-i-i.H-i^

sasaaasagasasaRSsasasagasasaaaasaaäasasaaaaaaasag^

35 ««2,aL.a s8ltll3«^l^pP^a¡aa¿s|

^£sss£^-u« —^,^22- — -^So^sss.uss — ̂ a^sssass^s«

iiiiiiiiiiiillliiiililiiliiililiilliiliiiliiiüllifilllil»ri<l»««»n-B«ns«iJ'<r.(<««sri«i<»n>n-rir:5n«cti!:B™nsnH5»riH!inri?(!»t.»tii-»

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 24: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

S24 SUPPLEMENT

c*»r-

¿SSçr » ■»,»

...t.í!aí.

I»!--. -OO,,,.-'mmm ^¿"ssSSSÏ '»"-C-!»»"

.«««r-o

> -, -, r- r- •e»»««5>>»<'

«S»"»C• uuuu- •.»»«»SH8SSS.

: irf-«?»11!'-'?'- 5 » ».

^assssasssr!5;"!»?»?5?«'«5"«

r >?»»*•».■ ?">í »"•»

SS32î">p>?«m̂mi»--i">Cf"ï

íí-ÍSCÍt !ï!-t!!SSSISSií■-!!■!"

.ar-»a>,.

asssassr!>-►<«' i««-»-«-

r»»«<o>s»r ISSSSSSSÍSSS?ÏSÏÏSSS

-«-•e«a<»s<,«9!-*»

.,a>a>co«><»»»o.,<T,c»o<j.» ;

sagas;ï ï :

'«««««r

;?srsissíeueueää«« « « a «

J I «

8,3,:9 _ » 9 _• ■«• «

*»9 » » .

»»r- .»„» .»r

■ » „ « . r- r- s

iiisilii■.ftfteNeDr-

ISa^Sï

■»»»»»?•!»»»»»•

SSSSí3¡:?¡?;

sisa:üiii 111

i»»»»«»«nr

üaí

SsiwässsSsft,,

^ ̂> ^ pi « ̂ p

11! Siss^l

Se»,

II, O n lo n no n « n e» n to n ft ,

m m m

S ót J S

m m u

3 3 J « « J

»alïss^ie^iSiJii^sSiïsisggii"

■ ■»tí-«i«.--ih»t

as-aas-s^ .sr-sas«S22°¿*s^2*«g.,-:,»~-.^ss».HJ^5«.:.Ul»S1M!"ii1H'<'!1î5j.:»«

?5i^2S^¿¿§Ja. ¡aMsIs

H"Sa;4tf| - -,»œu

teÜ38S338?!?.!a . .uuuu

SliiiiiiililiiSiliïiifiiliisilfllïiiiiiiiillËiïSiililIiSiaiis»r^r«^i09mSri-i,2^-,»ScjO^i-in¡í3r3>0>0,SinS^«^>D'-»»,-.,»,t-a¡!DaiaiS-.í:r-2r.SS3r<!í'-i?IS

SSSSSaaSsasKsssasSSSasSsaasasaaaaaaaaaaasasaa;,,

3Ï33Ï33333333ÏS3SSSÏS3ÏÏ33

¡•SisUs âs?RS S-3«

. .-,cMOMT,-ir-««-i« • • r- fi . • ■ • .

WMmissSâsSs

;S522S22:222222r;p;':r:-:":-:r:":":2arraa222S":^22'ir:":»":-;°R"Sr;r^^u;u;u;«;SSs;22aa23^u;3Sr;r;^u;«r;Sïïu;u;S2ïï5':r:S222':-.<.i;SS

:î93'=5'»29S5ï9»9.

222222aaSSSRSSS?S?--t-tîS«fS?«i: ífí»"««;!»!;»-1 !-3«ï***33 ft ft ftüiüiS

í^^^<: ■JvOCN CÛC

-s-a"?3 3 3 3 3 3:j j j j j j j j j j

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 25: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT S25

•9-,.» T-• 91-9« Ü3-S5

inft-,.-.-.

p^p-nnIPPCOfflUlU

si2K-. ss a- l35-s«s^^ssss^^rs^So-s,»^:Í23 = ̂ --sl2"^S2^1is^=:i:

S2si22^SSS»SSS--S3^-^2SSïïSSS3S:

.-* .^>c»r

.»,9-nnn«i-t-uici

saassasäsr

<?»t>!!!

HS!m■>9-f <vf

o ?«.?», 9

-a; ssslaisl.Riss.; aislad-"«¡Sa»2SSSSSS!Sc3a"9SSS333SSSiSS£^sasaRaassssaaasssgsasgsssjsss

S " _ i- r- S <rj r- 00 r- 9 9 9

asasasaaaaaaasaaa;.«;.;

111HÜ

!•"•!iaaaaa;X X X X 0!

»"*•!-•«.

:8^ »»?""» j er.

• ft ft P- -H ft ft P

;ss -h -r-»o

a.ssE»?.O-, 049,o

--•S-»»"

»•■"""«»--»».■.■"»tf-.'

!»«"!■"

•MH»(M-9--<.

»»"_». 9 -

.■»■«■r.-.-»"',,040-9,.-:-;

- -, -,r-o- U 00o

.■"««»

B"»s»»»ss»S5. ihhhhhhhh.

"0?"""î"ÎS«! 4 « 9 » i i- s 9 » s r- ri e « e « <.

iaa>>>s«<«.

»sssassasssasa.fti 3?2SSS23f

¡äS.iHiis: • ««?' ^§i.aÍÍ.ÍSÍPÍ19 0

-, ,00. r-

•«»«»»•(»••»»•'.■•^•■m

»S«»-"'h-f ui.» » ,, .

-SSSSS,9^ionnio>in>£ilß,£,"ri,o"ri,ovß>öv£,*i>\riu>

40401,0104,0i«»«,'

'"•'••■!•<"• 5,^»^,^o>^o>-

!„s§i3S*55^3i»a«aâ"àâ^3i:a^":.-^"««sss£™2°~23ssl

HHininnnppinN--i---HHH(ii(NP'i|ioiûHnHHininNr.cOHrJintii(SppN

9 9 O

s s»s»»»»»»»»

SS3S333ÏS3

„aaa. a!"?5*«s^a^aâs^sââsss".]??

'»»--»■!»»>

■■tfftp-p- -tOinftr

,¿3»»33a.4,

fejpsaiyiiayíh ft io no ft ft m -i -. p. np- •* es ■ ■ ~* -> ft co -

SSSSSSSsS:isssssssssssssssao

.r-r-9.mm,r..^^sS22SS22u;«;sS99U;„

SsSâasSSâsâSâsasaâasssISs

RSS5sâa8sillfe-**;i9i-99«sr-9«i-r-.49<M<io-s9«-<«o<ni>i990<lin94rr«r-

iar^aaassssassasassssasassa^assaa;*'»■»S-S^-SS! 4 04 O

■>9«9O9«0j

=•922 ir!,,,,-,»> œ oj oo oo o

3 S S S S.

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 26: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

S26 SUPPLEMENT

i es» ft m ft ^ p

-ip-eaft-^NOftNO^

ft ft »O V ftn ea —i cn ■ ft s p- s»1 ft <t ft Oi«flC»-i8Pr-e- in tSiDH* •* •ItBPOi'fuiHpHOincOi'l

i cd —ip- .inft ■ ft —i .h s m

■ . p» ft iß p- ts *f —i p- ft ■ —i

m p« no ft • p- —i —ti n p p * nut ■

j ^ in in r^ p-

l m w ¡a ta Cd u ca

a ts ft ^r clHffUO U■i on co in -

i u ta ta w ta i. w cd üJ ta u

}Or

upHjiSHPriftftta^-ftcMu

i vo •*J P- CNh oi ta

i »O en * ft n p-s ta u

r no ft ft (a ta ■-

iUlHNMB-iininrltSft'i-—i CO P- iß in CscoftcicN—enftftp-^sf'n^^fNßcOißcS^'cNP-r-1—imcN—iftftCOkßeßNO^CO

3intíp.n\í)y3ft-HtaeNCDíí-itanNOp-eNn-'pifttainio¡■"»^■t^ißiuPPOSoioicn

îœniNneanP-nftnCNn

- œ ft . ft ta

\ -I -H fti in es ta -- e» p- -< m c

■i en en p- • -i

i io ta ■ es o

-• Iß ft ft p- * r Cd W Ed [d P- P-

r ft n r■e ̂ -. -

neîpr

1 Cd cd Cd Cd Cd Ei

cn p" ta oil» on in pta ta p- p

"îininTtiotaescor-p-cNtDftinmX'-i-hcD<*>00^,i/1'*'-

- ■ Cd Cd Cd Cd

jtaviDi;

J Cd Cd

? ta »o

r p- p- n œ ft rp- es —w M) ui p u) ocNtanntsco-imo

rn-*cDin,ïfn'iïitTNp)iot3PjftNOcOftniONOON\oinri^iuitcn^^eiipóiniíiHiíitíiíNippiscñuisiriPo-iiíip(NtSPni'íiíeooiaNco*ci*^a)ta'^'*iui»í»to3-HNp^'eap-inp-cDP-coifitsojftNoninftii'eD'TcjNp-o3CNta-d"cNeNninncOinNOftnoN'í--HCDn«í,ftineNcoaIPiOiÔeCPiOPiS'CiDPiflPiÛPPPPCOPelNûiOi

- n* P- t ft f ^

CC X EX

J Cd Cd Cd Id td Cd

i p cûeîP P'

i n ta n cd•Hiflpro

> * œ n io ■» a. co u; es ft ta pi ta p m es eo cipinnirni;

t iß CN —i PJ ft Pi p in im m iû u

urniipu

1 -H CD -h P- ■;

T P- ft CO ft -

• ft P- P> ■ pH pH4 -I ft 10 -I -H -I

■ ft ̂ ft ft U

■i ft n lO Cd Cd - -i ft Cd Cd ft e■ O» • ft -I □

»innwifiii

JUCdUWWCdW

riíf lOinininuiu

i ta m u nc if u3 "

- ta co «

> Iß lO U

a ta ■* io es es f-. ft cn -i in m v- 03 CO Nf -h es r

■I ft 1Û CN lO NO P

ft p- p

jCdCdCdCdCdCdCdCdiJ

t iO CD CN CD r

icOiOiOncOf r

i co ft p- es CN P-

Cd Cd ■ ■ Cd td ■

iß es es in ft ea C

S ft i

iT-H^t-er^eDC. 1 co r

C io ea -i ȧ co -:

runíiuf œ^f riot p^ajvesf nm m CN CO CNr if *r no »er

ts <s

m .h —i

■in-nf PHIMNI .iD -CNIdiCliS -H (N P

•mffiH Hr. » nO ON iß ■ ON n

■1 CN ft CD • CN P- -

■* oi n iH1 on —e oi ■ ̂■i -p. «oi • ft n ■lftU-lft.-HoH-4-loHOeNftPJp-eOe-- -ft

. p- m -i n

•CdEdCdCdtdCdCdCi ] Cd Cd Cd Cd Cd e1 Cd Cd Cd Cd Cd

">innnnn*fT*ci

i .cd . ^> ft p- --

iininininnnti

• ft ft

-COiû—iiOiOeNP--3 ft \ß n ft CD S ipniBPo

i ft n co -i u•COfSHti CD CO CO CO 0

JCOCNCOCOeNlSrSCNCDCOtNlßi:

i es p- r* ft r

fiOCSISCScBiO^CïCCanftr^p-nnioftp-

f ta ft »ß —ift^fftCBcSOestStseNincNi-ineaac-p'N'fteNn'ifti^i

f m ■* on <er ts t

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 27: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT S27

*ftCONonpjiß^,inincDco»nncD—i(S»ß■i P- ft ft ft o

ip-p-nftft -Ht ,h ^ p. tf r- m tt ne»rcscocNftftftft •»ftncNn^'ftrH . ao no ft p- ^-h iß CO —i—iftnin.-tftifcO —* ■ oo r- ■ p- n • m nú • p

»IfttSP-lN-H .f-p-iHnoip-r.

ip Oi u) h u) "p-r•*BIHHH-

-ir~p-P-P"P-p»-ftc

-CdUCdUCdCdCdtdP JtdCdbJIdCdtdtdCdCdCdCdCd■* CN CN •;

ulUUb

Mninmino

ief jjif ujiaf c

)(OPf.<«t

i in in in

>iB<Nin-H»i»*isr*,ftp-ftcNninftTf-sr-HtrnftÑ"ts<Nftnp-p-np-ft(S(a

tSPJrsinißp^cOeacoftftlONOißißißißißP

co ta oco -i P

œ ta n

CdldEdCdCdCdCdEdUb

HO^iSiiiOU

rPCIHPrtrf,

iß Nß lO P- P"

inißnvßnp-r

iß es a

n >> r

S^UIPió^tsuinunDcO'acOeSp-'ftftftinr^iO'-imrnoocDnp-m—t m m \0 p» in rDftco-Hes^cNnmf^incNNi-P-P-CDCOCOaOCDCOCOeDftO

■i * * m in i» iC co r• m ts (N PlC P INWiCO-HinSftioftp3 m h in h h œ B o3P-N0—icOcijmißp-lO^ftBintseNP-PSB m <f -i iß ft CO -I P CHiJ C* -I ft if UiCOCOCDftftftftö

i co ̂ ci n ft n

- on iß ta p» n ■-OHHHJIUlt

h u- ft ft n pj r- in p- m ■ . e

> n iß n u- ft M S r ■ -h -h œ n r

■i 19 p* . .•p^flinr

i ft ft ft ft n p-1 ft ft ft P* IS ifi ta ^ in ft in cn iß ft CN

j vß in p- p» in o- ininiflP'

i • 9 ft ft •- r» h ■■» & **>

fuiuippc■ Cd Cd Cd Ed Cd Ed Ei

r in m cn -

f rf if *f ■

. . ft (N .ft ft p- • r^ r

t t f m m pi cd cd ¡a w bJ cn PJ PJ <N r

9 tS iß f CN Qi n «t n ft B

IrtSUMP^rHCDiCHPUi^PO HÍCNifPi

■i ft ft rIPPOjt1 p- pj in e* cd ta ft i

j ta co s rh ft ta if rlOisnr

F p- if in in -3 iß pj ea in i/h m vo cd n ai œ n ^ m ti■i -i n ft œ r

i^ißNONOP-tScocooNfttBr

f PJ CD f iß f•J ft (B CN P- PJn m a) u) n uj- CO P- PJ ft PJr f m m —- mr co iß if if pjo ta m ao in fti n if n if n

n co -h -i iß -in s ft iß pj r<*i co p en *r

HOIPPCMPPPOIP'

» n ft ft »* ft ftft»im—ip Hpef n iji ftft—4 m -h n*■ » ■ ■ —i ru '^cûncttôiionPPOi —i■ Hjinmmp •lOCO^n^ . s ta ft ft p-

ft v ft ft nftn pHvßftcom p* ft r- p-ft co ta ft c

ftifconnpHpHp334-iioftißp.isiftißinftpcoinp-c

• ftftftn—icNntSftn—inftr

ilUUUEdUUEdCdUCdUCdEdCdtdli

*inin-ic»j--c-H-iin^jinr»j<Nifi<N(Nr»-

jnnnniNPjnnnnmmiNCNifif bICdCdUEdEdEdEdCdEdCd ■ -UEdEdtdr

-f H<

■ ft n » p

inp*n ■ » » ■ ft ft -noiftoîcNcNtNftftnft^nr-'Hcaft

• iß cö œ n œ «

• ft p- ft p» ft p

IMf g in r

j cd cd cd cd cd cd cd • ■ cd cd u u cd cdi (N r

..cDiß^'eNCOCDeNeaiS^'ißiOif^Nßmin^'^p-io^cNC0iß*^»Oininr»iCDNßifininifißiß^r»iQ0eDesisiSiSC0ißif^int^N" fflftis>n^co^csftnioftioeNr*vßp-in(SP»CNCO^ininpjiD'Hfflir»ncsinroNß^,»fM

naninr^B-HsininipœincO'HioineNP-cD'Hp-ififftifincNr^ifnp.in^ftnin^incDifpji-ftC0ncNftißininnC0C0ißftC0NO«fvßin-H-HmcNftftftnP»eNinc0ifcDfttB'

-NfOipHOnOMHCOlDBiOPl'

nißp-nBJ-HftifGDftntBfcîmjipœnicii'CnPHHjiPpacoNfinnp-cDu^n—iioniN—inioftnißis<Nninnn»ocNiDinp-ftioiOP-vo—ifttN—iinesißftftp-intap-^'oip-ea^'ri<r^.ißeotsco-iifN-inißißncocNia-inini>fteN'f-

CN CO Nß *CMfHOin -et cn -

f ntf ■** «

OißftCOißifVßiiimcOftincoeSfteNiß'-j^-iftCNfinifinißaiißftr-incais-HCN-Hr

r ft p- -

"lißißiß»ßf*-P*P-P-P-CO(DCDCOftftftp-

gnp-nnnißn-

J J J J J J J

i n n if n if r

JJJJJpJJO

i iß n r-- n r* p Dncönftnftp

3 es es -i —

ipnton

ftn ft ft p-n m ft r»» n pHcn en in -h <* •

* ft -h -NfVP. • . o

n ft r- p

IftftN" ■ SS r~ IN ft CO C

■iNßnftftOiftißp-KUHnpinniCtn

i ■ «ft P- *-h ft ft r»i ■JftftlßftftlßpHlß «ft.-Hineum-iifcOtNOip'» . . . m • • oo ■ co ■C P H fll »ftft »P* "ft

■< n ft p- p- <■

ininininnnininininr

tsiscais^'iotatacspsmft Ci r^ n co —ift-H—in—iconmisftNßts>Hn-H\ßp-ftNOftcON-ntfineNtsPdnmnHNiScOHntOQPJifcNn-iinncoP"

m iß t rS3 - CD -ft if n -CD ft M C

■» m in n n

C0lßflElf»f1^'lß'Hn^EP-UCOnißiß-HQnftp-iOeN'-tSp-icor^ftP-ftCOftCN-HPifrnftftr-ftiNr-ifmca-p^iovß—icNcift^eacN—io

. uuuuuuuu

3—inißinißeNei)-jr-cop-SNßißNße■icocip-cocop-ta'-

itftf^iniûuipiOiOP

4 CN CN CN CN fiQIilUUUUUUUTCNtNr»icNrNir»inn

jftcD-HCO»Bftnftft^cNp-nio<Np-inifr»ii>" in^esn^infteNCOm

jescocDcoconooeB-Hiûlftn-JiNtDtSr-iißisn4 <S —ir-i—ivßpoCOCDu"1—'lNflißcoeocOft-Hifniß

D CD -* iß C9 »ß u-tDNoio^r^coer1 pin u) h in ^ f

ininnißnißn

J J J J

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 28: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

S2S SUPPLEMENT

3 CD ȧ P

i ft ft a ■ ft H • —I P» ft ft ^ 00-inftft-Hvß^ftio -a

Ed Ed Cd Ed Ed Ed ■ Ed Ed Ed Ed Cd Ed

)p- ft —i nc5 h ftftftftftftpip.p-oiftp-iß-H -ftts—i—iin^ißp-fNCNftftißiß -n—i h p-iißin—icoo'HPtSip'NHClllíP'-inHCii'-lcJ-

4—1—1 "ft »ft ■ • » p* »OI »ft ' C

in *t ¿n n co f|p-iif^ioinftts—i in o- . .m ■ -h -i • -if.iß-m » r-

i cn co ft ea ft n ■ ■niop-ioftp-p-u4.e»jeNin-ip-coeNCMifpj-ipj—i—i—ip

iißiOininininininininifii-irrrfi■ Id Cd Cd Cd Cd cd • • EdEdEdCdCdEdEdCi

1 iO ft iß if r

h PJ n iß ta ft ißi ft in S m p- oo\ «er if P- ft CO ñ*p »* co -a- ea in if4 CO 00 PJ (JN P* ft

ft -i ta -

ta iß p- -

c p-1 ta ni co ta

4P-COtB-HlßP"CÖu

^■oifHSiO'fHBSS^'fœrj.œcijininfNCOP.coifioœr^peiiininpNrjiPi,iPCO^cOH(i*'npNOiiD'-iiXei|Piûtmp-iOfteap-tscNinißftftp"pjp- -nansninims^uini<NftconcDfN^ftinifif-HfttsoiificoiDftp-jn'*ftp"^'r»irP'fM'S'iiDPCäOiinpcoiniNPifMPiiaiP'i-Jnnprtann^r-iiNP-ifp-cDCNíS—iincNcDfteap-*n»Oinftftp"ivßcinr-i—iftifp-ftp-cocNtstDinißtSP-in^oo^cOioeSiinftinr

ißp-ißtsftr»iP-fNiNnniOp-iftS"ißißp-cop-cocDeNftcaftr»ir»jinniinminminminNßLnißLnißioißNON

jsifftntacocop-ifȧo

iß n

x. K -J

• -HpHnftftcONß—iftrft -fteßifP^pSicOinft-*e^ h a cn ui co *f ■ r» p-ifp-eaio^eij -fteN^1' ■i -np-p-ftPiftp-HpH

- ft p» iß iß ts n in • .

Ed Ed Ed Ed Ed Cd ■

f iß if 10 CD N 8 5ißp-^ntsftnr

Oi co p h q Bin rPHtonQMicft"fp-tarjißn-COftft—ita>-jeBr

conftntsntsr

ft PJ -i CDÍ J J t

• Cd Ed Ed Ed Ed Ei • CdCdEdCdEdCdCdCdEdCdtijCdCdCdCdEi

- iß if f iß e

i iß *r co iß -

1-IHNNINlfiP

n if in IS IN C3 n p- s ft r1 CD CO ft -i r

rcNfttNiDiOiniDi4PBNO)inoiP'

J Ed Ed Ed U

iiseaifißcaco»i-tmineampjcorJSftnifcNineHiNP-iSftCNftrJSiftíN'ÍNfQ.-ifiNfteNftp-cnp-iO-jeancOij1 ft CD —i *i ionrf in s i» id iO h rinifnnnirr

SifiOifvßCOeNCOeNiftcNif-iPJp-if-i

aninp-c0ftftta»O

jp-^p-p-nœn3ncaests»Oifio

innniff^if

j ft ft ft ^ c

»> ft p- Ci . .-t ch n ■ e• iO ft ■■ft ft ft P- m

P- *f

ft iO ■f, -| -I —I

ift • m

■O CN ft 0

4 ft ft n ^ ft

IN ft Iß ■ ■ -Ii in if n p- •

• n ft • • s

n . p- if tco p- pj n u

i Cd Ed W Cd Cd

. ft ft m r» • C

i co • • n noi . n ft ■* n r■ ft —i p- wo • »- OO ■ • • r-

-CdUbJEdCdCdEdU

ifp-ißiDtap-p-nifeNcNinm-Hißp-p-mniß-imifcSin-HpjiOP-taftp-ftftcOfNcNrj^p—i-•ftCNißconftP-incOCOCOtDCOCOftCOftftft

eut n-i ts a

ft ft a

- ft ft CNI ft oo -Ia c~ no ftif-in (N ^ p-

n ta ta -iß IN iß u

- ft iß P- t1 NO Nß »O Pa vo co n a

3 -< Nß PJ cJ ■* if PJ ç i iß P- CO IS U

-i n Nß ft if ur- «f if ir m u

H ft iß CO p* Cî p-

Mnm*COHiJa es s ft in pj r- -o s es ts co -

luiOf-i

a ft n ta ft

i iß «r es p œ io ti tsoi œ bnî h u• -i r- ft co co co -

iconconftnesni¿np53 co co

ft ft ca at c

) co œ o

4 B (Ti P UN KIN ft ft IP» ».r »o oi es -

-j œ f a ■* p■ ■ ■ if ft •;

ft ft ft CO if 0CO h (On n c

■ ts iß n n in p-1 ft -i 00 P- r

f *t r- ftft4 • -t ft cn n cn np p *i m cop fli nICJlUllOHP • «f

• P-ftCiftftP*- -I -i -ef ft 10 0T • ■ m (N •;

n Ed Cd ft P- -

• m cm . n in » p- ■.. . . » n • en ■ r- u•Jnp-iOÑ-ftQftes

1UUU ■ •Ed Cd Cd Ed Ed 0

COft-HCOCOpHftOnircop-ftea—eico rn auf in \S oi c

comißiaftiocooh m q mv s oi u

fttaeatstatatac

] Ed td Ed Ed Ed Ed

3 ft ft S

3 n ft ta

•IdbJEdCdEdCdCdCi

» n -i \0 s m ui in iß in co in 0i ft IS IS —I IS P

lUNUUUIi

- oo ea e1 ft ft u

iißfQSCoißrJ-iftifnr-sinnp in h « en s t COiniocOHUi-in

j * iß n ft P>

^pJiOidiOulHlSP1P-ftP--HiOCD<Nft

eSftinftftcNeN^esn

■íNHiO-írCD cn 00 —i m rifl^nrrPr

3 CO nD PJ Cù n rrwta-jcNvonobißftp-^'p

i n ir n f n u3 \D iß y

ft ft -i

i—inconoinißnp

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 29: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT S24

ft ft ft ft

■c ft ft cn ft -^ n

-i n n \0 ■ if p-i CDnp-jr

■ n • e

in h —i p- -* p« p-ip oi »—in —i p- inftio ftftp- ftißp- ft ifcNnm t-i in n pj ■ n in ft r- »oo cnp-00 ■ n tihchp • q iß ft cn n -i p-

»tstNP-Nßn •unfoiHSiDinnrtinpint-NiuPPHMn .tfnco^^ißinftin »n- • poinuiHHrir-HH »CO »CN»ftp-iniOn »00 • h h œ »moOißir -p-nifftts • es ir •—ip-i ■ —« n ft• p- .h io »p- »p- • m rrt .p-ftftCDES • ■ p- ■ ■pHnp-pHnißfttNCNCO • r-t • ■ in -h ft in • —i ■ s h >t œ pipSjta-^ftftp-pj^n »ftft-HCN .HPMiHuiiiiH- ■ • m ui h • in ft ts n ft ■ »CO • nuioi SB • ■ ■

.p-p-jcn» • n p- ft -i »n» ■ -ftr-pJcN-i -ppin • » » "îphiîi.r- m in4noiPHPOiOio4iO * • n p- e»* » —i p en B h p 01 B • • p co n B • cn n —ihm -n • n p- ft n n ^h » •HCOfNiDiflNfiNCD^HPHPfli »ft -ftifin—ihiuhpJOihnnpHcicii-i p p-i m f on • m —i if m cm in -nft

EdEdEdEdCdCdUC

Hftftftnnftftftp

t p- p- n c

■ ft ft —i ft n io

j rs r j im r •i pj r i n

1 CO PJ lO if lO ifr «» m p- pj ft tar s n ft is »ß ft

ft Iß r- HUJ nnPP COffliÛBHOiPIPBU1C>I*C0BP

BsusnuinimPPONQpH

nt-iin>íniíini'ipit

ft o» -i ft -i -pOS OS J OC J J

ifißcoiNirißiNooiNCOinin-vp-ifeaoiNßnftia-i^niOT»]cocNCD--»cD-Hp- pi in if es n io

ininifioiß^if'OininiacocNeDesenoocNiO'eresiaininTriDiseacofNininnißfflHi^C0tinpNmHpyQHfflNPNHulinf1iD(Nnlpni£j(»lHO3snftœinior^iNirftftp-ftiofteNjlSin^^ifincoftHtsinconesioin

HHnHPHiN^(flQiÛWPOiP^PISOifl,iOPncOHB'^COOIC»lPOitN|,î»iOP^'OiinB^nï)BB^SCOBHpn\OHpuiHCTiHnpn»4iniOH'N^criprnQin^Hiûincoc^cûiOcii<NPCnœ,t^*^ai'inran^HPPuit0l',1ulBiOiiiI(rJHBœBH^ChPBiCiÎBHiOCi|tNftnp-ininftœinuiniDiDifinftr^œr«jftSinr»jSP-neNnp^cocONO-ioon-*if-Hn'*

r if if •* u

f-í-í'rit'í-í'J'fr oi f ts f ts

ft n

•* UJHNP

»ifttSncNnp-in cn in if »co •

iß •* ft r- ft

ftftp-i —i p- n p»ftNß if p- «p pp-im ifn-ftin^H-ftin cn n i-ioi—i cOifnr-in cop-toft^n^ft piji^priioiHûiCOHPHpp-iftn—ihm »n • p- ft p-

-ft ■—i^p-h—MiflfflMP • »s* ■siHHiô'i^'pin • .p-mft^^1 -n mPH anon j -ft)>hm)i • »in »iß «S »eNftp-cft^-nr- • ^ . n .h ft r- in . .-h . -mm • » ■ tOHOi^pnHj ■coinr-'p-—ifli^ nniji h m ■ ̂ —i ■ »p-pjft • • t*\ *t • p- »nftco • ft ft n • p-j »p-i ■ ̂ •jnin ■ s» iß -m -lOi-itD • ■ h —i »ft^Hio ■ co ft —i pj »nftncjcD . n cn in p- ft »p- -on »n»co phhhp »ftpj ■ • ft p- p- •—icNp- »on -P-4-H • n oo »ft ■ »noo ■ - ■ n -4 ft ft v ft oo- . ,_, —i , . ea —" n ■ p- ft in p-i »ftft • > gi m "i h »p-CNnnpjftftinnni-iftp-p-p-inifpjn

, —i ,[«.ffi,_i ■ . .cn ■ ■ .p-p-i • ■ —i —i -p- »n • • ft ft »n ■ ■ HP • • >p-Hnr-»Hftnp-. h h p ■ ■ p~ —i • •p^pcmnui'-icouicOriiiNrnHpppi'iHnHPNfn

■ »PJCNP-P-^-l-IÙJÙJCN PH Ed Cd ■ • • • tN PJCdEdr-jr-ir-ieNiNcNINIM IB VD

•"fiNiOiftacOiDin•J1 u3 ni h ni m n-j O nißinn<N»nfttnißcoftineDftcOP-COpHionp-niß^cNp-cOfNißißißCOiTP-P-tseNPICOtBU)P HHINnPCO -I

iinu

■ Cd Cd U Cd ' ■CdEdEdCdEdEdCilCd

i in in in r

3 Ed • • Ed Cd P

icamL.-iSißcacoinmcaiß'fNßesvßSS■ fteanißr-n—j^coeDp-taftißftnrivßinftiftapjcOP-^p-itNftcor»iincO(iinnp-incNNßP-'fpSfNinißininco—ir

f>>fti>-HiNa3ft*p-ftft^-^in^

■ Cd Ed Ed Cd Ed Ed•j pj in pj r

tseaeaesmin^'ißcacocîinQtammp-oHftftncocO'Hpjœiiaftp—ifteSft^iSft^cONßn^eaftiiiifeaftifftCOCOfteN,*pjinft(D(Duaifp-ta-Htsftintaeit^io-HeacocD-

~ Tiftftneanp-incT"

leominpSOfifi^NflcOeNlesfttaftp-oomoftrjp"-oon^iOißfttaftea-ieNTCNPJpjißTfißeNionr-mT^ifcNioestOftinißCNin» mpiiinpNfin ph tän

(DiSP"p-p-ic~j*cs—leN^ncsp-'S^iNesnn^ftinini^iNftißpaiotBin^ißnco^ißincNcsp-ftn^'Oft^'ooisft-Hp-in^'cocOrJ^eaniß—iin—ico^p-cois^ftfflisninifpoirinifeDinioißißißcOPft'DesiaiNeBiN

_l F|HHH-4H(»llN'>14'N|'P8IPPPCOPCOCOCO HHH-IHHrtHp4Hp4Hp4-lp4Hrf«IN(N(l|tl|'l|

J J J

rfttts^,-^^,pjfif,<fin>i'coif(sif- aifißifißiriß^rp-ircoifcoira

oí j Oä

o» ft—i ft ftftftftp-tsmftinn np-eomp-iotSPJCNnm p .h p- n p-'COinftißoo^'tSi-HPJCO

'HißcNftftinooncNr-.in-H^'npiia • -h -naoftm pHinpHOiBNBnciin »cnp- »»hnp-ift ■cDêstscocssî—iin . . n —i ■ ̂ .h r» r- ftiN-^ni^^Hp-.^H^np-j^1 -nftninnnftinftin

if ft . . -i^ft ■ •—i . pj —in - ■ <n ft ■ p- • ■• ftftftnpjco—i h m (ji ni » ■ n —i - n p- cn n n

(MnH(NHiNieanniNPHOiciifiiiflPc»i^'HBH

- • M td.ininininminnnininminuEdEd • -CdCdCdCdCdEdUCd

n ts -i p- ft m e

(D pj ts ta ta is co3(NCOeseSifinp-4ftnncocN cn

íBc^niNOinajiop ftp-iCDScorjpNnmiiiinHtOPinin ..itOPmiiiHUiinvOuitooOie oíiNO*vßftpjißin^n(Nftio taS'HeoneDmftp-ncoifcoif ffl

j co ta in ft e

lonconconftr

1 -| ON -J ft -í Q£ a.

33 iT fr>-i ft O

ft e

nft » » ■ 'Nßp-cOCOnincD • miHp-ieNftiü>J>eN p in p p hloesftpHnftp-ipftpHP-n «ftiop- ■ - ^ iß -ft ■ - cn —i *t n b inlO^ftpJCNCNftißNßioftnftnintsftftifconnnnr^ ■ -ft—irjp-n

• ft • ■p-r-n—(ft • • n —i -ftíNP-cNCNp—i h h • ■ • if CO ■ p n m nft m p- ft —i p-i ■ n co ft ^ no ■ r— » • » • »co • » h —i ft is - h h m ■ ■ft n —i —i • •r*^Eianinmnißftnnnftrjftftnn^,.-i—im . • m r^

—in ■ ■ • • ft in ft p- 1-4 —i—ii-i—inr-ip-inftp-p-tdtdP-—iftft - -ftft

h m p ^ inn nft ftftnin^caft —i -ftft

. ON I-

»OOOcbcDftn ftp-i opHCOnta—iißoip-innp-u-^ ■ ■.-lißp-IP-if^'iOvDftp- »ftnin-Hnnta

SCNftP-coeNCN -en BPH • -hph-íhií

.^.(D---.ftC0--ft-H--o\ cy\ c^ t*^ t^t pftnp-nftftp-inftp-cOP-'ftnnft-HcNn-Hp- "ính-4 . .-h-* • -n^f(Nin • ■ in ui p-i p co in -p-n • »ftft^^

4P P Ol ONUlin -4H -

rKNCjnnfxfiNPj^• UEdUtdCdtdtdCdCdCdCi

J H CO -I ft

-j rs r

CO^p-iNpSjnnaißneSt^ftftint-H^ftcD^ftp-eNpHCOH-HiD-HnnppJnißinta^cNinineaftlOP-cNmtSißftinftcOfNtsnißr^cSißftifn—i(N^oi^BPBCfiu^Bu^cD'^cO'«Hefj'XCOnif'jiBn\OiOHP^pHCOinpn;COin^HOcoftn—i^oit^info^coc^inBinnijiBBrNPOiHipDBi^iûQBPe^ininCNCDi^r^~ np-ftinir^^ftSftpftin\ßCNiocoiSOTcOp>»api^ifißcoiaiß-HP-iaesißesrN*cnnO—iftcop-JnftmcNCOPj—iisp-ißißiOftncD'feNCOftcOineap-ncOP-'SCDp-—ipBinuio-iBiDiOiñoi'-iS(NiiO(NiNiS(NC0C0NOHC0inis—iinioftp-^,inftp-p-iiniOiß'--in^,ntstaintap-r»in--ina3inp-ftcspiflMB*œ^*inu5BPintfinMHpjpNB*cJBNP(nincnHi/iB»iOiincD

■-HnHpNnpnSnpnp-íiOif--

iinnißnißnvßr

t (N (N Ha pj »o i

- co o _ .lCOinp-ißlpCOCDftlSft!!

~ *0 P Ojqj u

h ta m co -i ni iß if if m p-3 CO CO CO CO CO

et CC Lt. ce

^ftnftnoinc

^_Hft■HftHft-í ce ce œ a. U

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 30: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

S30 SUPPLEMENT

^í«■*,»»,, gg36: >»■!»•»•<» #Mïm\

4»œirno œ

--P-,UMn-,mÖ4-•>o-,»m-p,,o

S»»»»»»»»»»»'

s;s;9-r.f.oo

ssaas-ÇOMNfl

- m m _: a

Í333?HtNCNNNf

jpjmvp-p.pjpjminl-.ft'

jinc

't»!»«»'î •!!!!! »»-i ¥

i?<!""»»«!

sc?sss;i iiilii-«9«»«

sis:;2s;

—¡Ill«^>«^«0

S3SSSSS

;Í3SSS2

;;s;s5s

5S2SSS5SS2S r m pJnC-SC

S|ïï2SS3ISg

ißNßißißioijSißNOißioi^NO[^»ßiOißp«.r».p-p.eo

585S?S383a5: r«»o

9 9 9 9 9 9

4 9 « f 04 -.«»n*».

. -, . ,040-90'-»"»-

4 .c « .r r- -

,ar

mli^uioio

y¡3^ii¡¡iási

:S^S5^5S2S°'.t"".

j 0-00,5*0

;«;aH3««i¿¿¿aaa3aa33gg;

iiii^üiiHaB8iÍM*!!:¡assssasaassssf>»95

»'»•»..- •» - 9 T 2 » ? 04 o- ,

ÏSS

iSHi Í33 i3iS»i¡ieii3S3g!3iii§i3i!£i33».S I3SIiiiiiiiSiiiisiiiiyüü

r,*,«,*-.1"»"«""'

;5S3S53535£355«|5|:9 is 9 is is is as

"!!;».

52=555. . -40- -0

2S3¿S:aSR^à;

-.-.-."as■?5885"

•j <o o n ft r

,««0

i3o;f> 0- in -. . « ;

r-*i/i . ,*• 0- * , , , 0

0 . .»_^,i-

¿î%sa%=

-0-04-,tf>-

■ 9 9 " 9 " 9 9 9 9 U 9 US

■issasasssîaa issssssa

'"»« _■ o-«o-

¡lip«!s s a ¡s s s s»-

mm- p- in m m »n n r

iüí;

¡gap.,^9-, il!

!«»«04«U

'|3S»»«"». passas

•sO«««

.»»-.»«o

:s^aaT!;. ui » »i _. -p « -

"ÎRSRR

4li1«Ä,4tO

, , 9 , , r-0- -

îhsa; !ii

-im-,in-i-i». -iinr-p-p-p-N-a

NjpjiNíNíNnnnr

mirîsssssssî

ÍSRÜSKM"um«?■?»•<

14»--«?

fililís-»*-«-!;*!;'

r«9«9«9«o 1 ON « « « 4o,»B»o.»o4.ro

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 31: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT S31

i^tMmáúaise^■ « 9 f. p 9 p. '

,9 .r-o

4,Ï2-49-4»-.9

. « ^ * r- 9 ^ o

i«,, ,,»*«_,

;sas» nnnmin-

;saa: .»o 5 -,/

: P t » :

!ÄSSSga5äS2S;ä£S5ä£3

33SSSSSÏSS

3 S""•«SS

9999*0

:¡!¡°

'P295?o

ilSiisi5sai

s5IS5=

¡lili!f?3?î23S: ■«»«»T 'S'a3

Í33ES53Ü

S S S o

is'ss'ia

:333s««B -

r mu

îaslsaa

S Ç5 *

CD lO -03 ■ -■* r- an io

pi -j a(N if u

■J in iß -I f P

:¡53,?3Íía2a2a.í8"""a¿S353 -j n m m

■ »WWW .

:«"""«"- -I cn r ,ss¡dsss?

\m ■ »»«»»»'r

sidSîl!4O4«PÜ<s^»ul9iO>O9'-'-0

ílllülsülllüüüpülüii(DCOifirininœinin^cnr».nifNO-Hn^irp.ifinsin-HPrPPnmp*BONinií(Nla-iMnHPai(N(»iBco«íViBiiip-r-in(MC0iO-ir».r».-Hirtnp-ifftiamp-lSP.p»ne0P-iSC

'9«p«po

04«»»

« ««»««O-t- moi . PHW-P ■ . ■ -

ass ■..¡oIS'hSS

•«90-« -04

. U1 0 .«_

3S«2iïSU.8«

•p«9

1 « 04 o

9^4)9,

;p«P"9«««9«P«^«9««9-"»0,9»

¡35111¡3 á

9 9 9

■HsJ:«:L : s.s =5: Immmmmm^-¡Sa^^S^o^SaS^-V:3a«222S3««ï322o;ao;o;2aia

i m

m-4 . p- r»- n

"lassa::222S2;

xm\

\s%xsss**sxsíxss***¿¿***i

- - in m

\i¿J¡

i n in in m m cn (N

ssssss

En!««e «,«-pp-

fiail.Í3S3?

illHi

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 32: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

S3 2 SUPPLEMENT

Hlfft—ICNCOftp-

lQftftEdftn—inco

Jp-Hftr-in .^ftiNC

SftftiDNO • -C100-

Oi-ICOHP

3 iß iß fJ ea ft cn

■j • r- ■• ft . -Hin rr r- nin*f

■CdCdCdCdCdHEdEdCdCd • ■ Cd Cd Cd Cd• CdCdbJCdEdCdCdCd

lO -M CO »D

Nß ft "* ■*ft ft n COin -i iß ta

ft (N ts e-PJ iß in r a P- Nß p- P

3 if CO ȧ f

■jcotsißifißißifse

leoooißtstaeNiniJ (N CN Ui N" en m œ ii u) if m lO œ »a io i

CNCOCOCNcaCNlu'iU^tStaeSISißCSsS^eNCOCO■HCOionntaifp-inftftp-ißp-p-i^HftajcoineUftCNiP-ftP-ncNinoo^pHtnißta^itcO■SJCOP-rNp-ft—iininta-H^HinftcNiDireNp-tanta—inp-ip-pjinooftp-—i^fp-iißeNißft^■ftoOfte-Jnpj—iincDftifcNnincDftinifcotDootaNßp—iioftißinißcoftinißinio^ft

Mtinp3 n cn œ3 ft Tf if

ta s oin n ft iiß no f r

J X ^ X if X u

ft CO ft PH1ÍH1

i—iißftnp-cOeO^H^'cOft—i in uiXNßXißXP-XCOXCOXCOXftXftXftXftXftXtBXiSX.- J XM X r

COiOrn^cn ft p- p- C■O in tn if u

X if X if X if X

1 ft ft . r1 if p- PJf m iß (d c

H If ft . . . --i ■ n n ft -n• ft <N »* -I If U

3 . ft f in n r

CDCNifpOtS^StNOSißinißr-ifcOintari n p-t lO r-

i co »o P

- r- ft p

HißiO—I^P-COp-

SinftiaftißCNnftr-icoaSiOp-iniOOOtSiDP-tS'-ir

jniOPCJ CO T * Ci if if p- r

SQininiOifS(NinftioiiniOftp-ifrH^-pjp-p--BPinPPBUliOnOp-inuiinumjinirnincNtsifeN.Nftp-^ftinini-iisioisr»jT^eDcNpNSißnftincoinftp-p-tap—iinin•i^'nfi-iiOp-iciJr-nioVifeNifcOftCOOfiTrfinifinininininininr-p-i-p-p-cO

ifftp-^COftP-NßvßOuiißtnifio^-HiSitsiO'SCNtsftftinvj

J p- f ft ui ta ft ts c

»XnxnXtX-iXu iXNOXP-Xr-XP-XP -XcoXcoXftXftXtsXtSXtSX-

■ co tsft (N ftf lO iß cn cn iß n

ft ft ft ft

t o r- u

i p- ft c

-i -o ts es ft p

ifcoeD'Hcor-tap-

ft ft ft ft

r co if e1 CO if uN ft ft C

—i—incoesftftr»I ft .-I ft ft P

D ■ cn »O P

-I CO ft ■

n ft co -n e

EdEdEdEdCdCdCdCdEdEdCd Ed ■

»IP-ftCOP-iDtSci

n •* CO iß 1/ipuinui n s oo c-i ft tS ft p-

f B^purc

CO ft uCO m uta ft r

h CO ft

ft n n -n -

iß -4 ft m e■ if ft n ft p

3 CO ■* ft CO t

) ft ft -I IS

- ■ CO if. ft n CO •

n (n s ft -

■ ft*—i(HCOftr-iftftnftpiscSft'"

ift » ■ ft n n r^- —i pNinp-fteNCOinftiH-ir indiHpnpjcOr •PP(NCJOIi>r

- ft io p- p- n

■ • rH r- ft ft

■ EdEdCdCdCdEdCdEd JCdCdEdCdCdEdCdCdCi

i* ft ft iß ta ft p"iintatscseaesca^

leooinmií rlißtSft'HOOfttSißP-ifii

iftiOinftiniOftr"iSfttrp-^sftP-P-inr^ftCD^

0 n co S ft -r »o s œ ta »o -

□ iT"iifinp-ftp«lDftlSft(NftC□ vO IS CO CO C - ft -I ft •* 0

0 n iD ID in ruf CO HifftiDCOCO-tfiNCOhftp-Nom4*(Di/)coSP-iNCOP-tSintSifSrtpmHitpifB

i'fn'ícO'í-J'ícO'ín^eS'r^";sifcDifftirtsfSfrN^ififißr

iißinNßißißiONßißißiOP-Nßp-r

rr-fcoifftfts

ta p- on ft ioiß io in is tsm a iß iß co■* io ft -i noo ft S ft ts

T# ID * P f ON *

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 33: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT Sí 3

assisso

iî:~

.-.¡es:Î3«3: 4,,-,, O-

\ih-I -I - ft -I ft -t vO NO (N P- O

• ■ u ta.At":

■jcN - n r- r

;s|¿3¿-s¿!

ssSâaâï

■UU9U

S 9 S ? S ? S 2 5 S 5 5 P :

BBîl

Î0404SS0

\mmw¡àaaî Ï3?Sm

nimm-inifnr-nnp-ao

mmmfx

s s 3!Xí*o-Xp

s s s s s s s: * s * a * ?

221'o^o^s*?:*!!12 2 2 2

19.99. Il3i*s;|Ss5 ■4 -* ft S) • ft if

• ID ft* • n p- ft ft a

2^3So

^ p- 10 -i m «n r- n

sllssís:ftirco^-ivop-r

sssssis;SsissisS

3 3 s s

1904,99» Kl;Jâs!

:sssî mm mmîcsssss^:

¡XiX^Kt-Xf <Sxo3xSxSx£xSxaxÉ'x£xSxo5x3>

01 .9990-0-«19»

33S?9Sas: '«lis:; 19-, 0-«

• 9P-.90-1

:^|^:S¿SS53SS

- n ft-, cd -i-i.- ••-'_■ p

u^asasss^aasssu^aa™.^;:.:^!!hhÏÏ3^^Sh333S9ÏÏÏÏsÏÏ9S?" •MU • .»««««B

iiii

slisssçsil0,09,049,

'"SasaässsssKS^.»..9.

33SSSSÎSÎSSSSS33SS3SSSSSSSSSSS

?«2ó,S~22,2*2

^^""^aa^á^s^aás!4 ^ -, h p- n pj n n n p- p- p- H c* h h cn . . in 1

3i¿múñininintnmÑ£ñu.ininÑg33Nr

¡SaSSSSSSSSSSSSSSSagSSa!4,o9«JP,POPPi>|i«04»«904meo«>«'-,«i,

¡ísssssssoísoísssasasaiss;ssassssssssssasRsssss

.. «1, 9.

4-p, ,9-"OT-

!2«l1-, 04 411,

■ uu 01991.

4 41,- • .

>»«»» ■■>«'

:aa.

Issl! WMîlT-0^,9- igiliii

;;óíss?3.mm

iXNOXNpxNoXP.x.-xœX9pxftXeaX5Xtsxts>

j j j, , , -, -, -, 9

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 34: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

S34 SUPPLEMENT

mhf-, 04, O«

Í33T■«!»•«

!S!?! •""»«;

p«»-«-»"!

. ,»o

si-::0,9

puÎNuiior-p-Hr¡S.««»!!

49,, • -o«

;3ra?«

iááissi.riàSei"

lift!.SKo30,-

illISM

flagsslsS

iîls;oPr.oicii.4fo.«

.9999990-0,9900905 fHi

'ssass;

íssí

íiii 1¡!P=»XiflXiOXiiX-CXiCXPXPX

s3»3»-»-»-»

ùiyjûiioùiuiuiiûyj'-^«

ICxSxSx3x»xS>

Do-* isîsissSss lier il lili.«»»«

J ÖS « B

4352a:».üsi^i!;

.O-«O-9«l,0O.

ï|ll||l|3?llllll§ls.ilS4P- 01 «5 04,- :22S933oi3¿23^¿:

«49-, »-,,

m¿h40-P 0-04P-0

1 «1OO0-0

4 P- O - f «1 «1 »1 0

""««ir.«1"?

l«l«lS

liai4 0-,--,«-

,«,0-, -,900-9.4,00499900-.

%m*\!«î»îp:î<io«,,»*«:*!

»99

.-.,9» 9S?S3S55?I«S??-??3S

•?!•»«-'0««ÏOO-o

àâcBSS11 o , 9 - 9 , 9 0 i„]¡{¡¡ ÜÜHJHlifii!

,X«lX«lX9X«5X'-Xl-Xo-Xt-X00XœXC0X9X,X,X5>X«

2S2S2S2S2S-S-S-S232S-3-S-S-HS-JS3S:x s x 9 x a

4«l»«10-904 0-,0-O.

saav;»«a¡

4*9-90-0

8V9ÎS

!»•»»- '»»-«!-.

• or- .90. .«,.,,*

fp-fo- -9.

4,04, «,

,«10---

4 040000

<t'0»S«M

49,59p.

■»»!"•">1«>,«10,0

m'""SSSSSasSS

.»,p,p< S5ÎHHÏ113ip9,po

,,,0499995

Siä«£5Ia!

(SiHSSSS:,X,X«lX«lX«lX«lXvOX« 1X9X9X9X9

»-s-PX-X-Xo

ÖS Ôi iS 9

4SI-2ÏÎ'« »?f

:-o5o;- »-.is?3;^3?3S3o

is.«.*i,2-3S¡assaó

ai^

•8^ .-i_tn • fj ?j ?« -* *>

jr-r-n-inr im^miñu

ÍNPJINCNCNPJÍNP

in s ni « no ço co ts ç «

1U1UIU

jplñn

IHIlttii 1040090 \m\ftnnjnr--

J PJ PJ PJ CN n r.

Í 0.-9,000.

49.-990.99p- „¡mm!a3»!is:'!!»■>"! RêliÎ

îpx>2"ÎP2o1990-0

íüi§i§gig£i

9XO;X9X9X-X-X3X3XO PX«X«XO> ïxSxr-X9x3x9X9X9Xax-X-X->

,s','sa>sa'3'I'sa's°'s°'s°'s''s''s°'s

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 35: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT S35

¡aÍ3i^yi§§te 3 939IP

u:ao;-í':So;2aaaT-53o;aa23aa3S3r:^So;sa2

9S~s a*aaaa33329asa-:Sf:saaaóasaR":':aSf:*.rP.aa-R23„sca3S-;ssóa3s»S^SoSS^SaSSS^^oiSRaoiSS-saoJSaaasSo^ssa^asssaass^is^o^^aR^^asasso:3r-ss2^':ar:a2RSS'í^tóa;923o:aói^,2aaS2»a2Saoao:-£^aóSRao:S2o:aS":3aa252S;a22':3aa~^a222';a^a90*2assao^':o:-:'iao»S';':gïïtïïoa„as'Î9a-:a„saS'ír;o9':2^o4a^':asa2o;o:o42o:oSaaa3r;2":2S':as':s2":asR3S^2aa<ís-3óa^aa2a-:3aa«;sss«iSS«io!R22¿ri«i¿s«io4 04ojas2oSo:^

fij (n n n r* cn n n n n 01 r* in in in in n n n n ni n pi ri ni pj n n n* ru <N (N n n m cn <n pj cn pj pj m n n ni pj pj «n n n cnhn m pj

xÏÏxSxïïx?xnxnx3x3x5x-5x5xSxSx»ox3x|x5><

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 36: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

Appendix III

The gcd's of the first 1427 APs

GCD PREQ RANK NUMBER(S) OF AP'S WITH THIS GCD

1 3 4 23 24 36 53 64 83 97115 153 154 165 209 226 238 255 267 274294 313 323 345 347 348 502 505 570 586632 645 721 738 748 750 763 776 800 807811 822 842 846 852 867 877 909 920 937975 976 1060 1119 1132 1160 1251 1307 1316 1322

1350 1355 1365 1368 1374 1399 1406

37 40 42 47 59 62 65 67 69 7476 80 81 84 90 93 94 95 103 110

112 116 120 122 126 131 140 143 144 148150 159 161 163 174 180 182 184 186 192199 201 206 208 212 217 218 239 240 244258 266 279 280 293 296 298 300 305 311314 315 317 318 330 333 339 353 357 361363 374 375 376 382 387 400 405 417 432438 447 452 455 458 459 463 467 475 498513 523 525 546 552 553 558 571 574 579580 587 591 599 606 631 633 639 644 646652 658 665 668 690 702 713 716 720 722727 737 762 771 788 806 808 814 836 845848 854 855 858 863 869 871 876 881 912913 919 925 942 946 953 972 973 974 978981 982 992 999 1011 1026 1028 1043 1063 1077

1078 1079 1113 1117 1120 1126 1130 1141 1152 11531164 1170 1182 1184 1213 1218 1222 1235 1243 12501252 1253 1279 1302 1320 1329 1345 1354 1356 13611376 1378 1391 1393 1404 1407 1408 1417

13 18 43 45 49 52 54 55 58 7075 79 98 99 105 107 128 146 190 210

219 227 228 264 275 283 286 289 299 328332 343 378 420 437 441 448 476 479 507519 534 544 589 598 609 617 620 627 664670 674 676 723 759 769 826 834 835 843859 897 904 1001 1007 1023 1027 1042 1053 1062

1064 1066 1074 1093 1103 1104 1105 1108 1111 11231148 1159 1167 1209 1221 1240 1257 1266 1285 12871373 1394 1398 1419

25 61 73 77 119 127 135 177 187 198249 377 395 399 412 470 480 651 701 756790 809 825 857 873 1070 1110 1342 1344 1384

S?6

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 37: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT S37

ft nr- «nCO iß

s ?2iʣ

si assis sa sa

Il assss s Is sa

la 2RÍS? s sa 2s

«1 O 04,0 904

¡SS sa i 2 aa «SiSS s s U sis sa S

SS • S ~S3 §S S i 2 s

■* no n

m ea -icn n nCM CN (N

2âss;sssi!£ai lïSSRâl sa!CD P- 00 ftm ft s con r- a c*

sâss;ssî!,i: ¡«ssas SR¡

SaS335RSSS3a2S; 99 »»•«

»rPpp»o

ïs»a

S2SSS;Rïîisâ2So il sss: ■f» «ï!

saaas;33R»sa2H aSIsssRS i3„: 55*5ir «ft r-m ta

"saSSKS«.«: iSsSSS'S S3SR 33S 511:

"SâasssSSss'âS asssisss

'SsâSssssSSHaS a 5S55I1SS■sis «53 -Ssls 2â 5 -S;

"sâsssasIlRRâàs 5 £ -assisâo "sss

-I (N (N

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 38: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

S3« SUPPLEMENT

ais? s

asas i n

ißS-4-Nß ir ft oí oo -iS ft pj es moo n »in-hnoOn inn ín u> s

IS -iin ru M

as

0459000« -»3 2

S as 2 S I a s î 3 3 s s 2I S S S s a 3

ssi: 3 i s S s s s r î s 2

asr- n

ss

5 i s 3 1 s 2 S a a «S aa s s s s ? ? 3 s 5 5 s s sa

h-H-»-*eo-HrM-H<M«-4 n -i*4-Ji>nruin*HMCl*.-i.-it»

a a 2 S S s 2 r s a S a 2 S S S r S 5 3 3 ? s s S S a

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 39: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

SUPPLEMENT S39

-i -I ft

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

Page 40: Computation of All the Amicable Pairs Below 1010 · Computation of All the Amicable Pairs Below 1010 By H. J. J. te Riele Abstract. An efficient exhaustive numerical search method

S40 SUPPLEMENT

iO <$ -J iO CD

iß r^ r^ p- a

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use