Proceedings of the Glasgow Mathematical Association

Research Article

Upon A Second Confluent Form of the xs0190-Algorithm

P. Wynna1

a1 Mathematisch Centrum Amsterdam

In two previous papers [1], [2] the confluent form

S2040618500034535_eqn1

of the δ-algorithm [3]

S2040618500034535_eqn2

was established, and various properties which the confluent form of the algorithm possesses were discussed. It was shown, among other things, that if in (1)

S2040618500034535_eqn3

and the notation

S2040618500034535_eqn4

is used, then (1) is satisfied by

S2040618500034535_eqn5

and further that under certain conditions, and for a certain n,

S2040618500034535_eqn6

identically. It is the purpose of this note to derive another confluent form of the xs0190-algorithm and to discuss its properties.

(Received July 21 1961)

Footnotes

† Communication MR45 of the Computation Department of the Mathematical Centre, Amsterdam.