a1 Mathematisch Centrum Amsterdam
In two previous papers ,  the confluent form
of the δ-algorithm 
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)
and the notation
is used, then (1) is satisfied by
and further that under certain conditions, and for a certain n,
identically. It is the purpose of this note to derive another confluent form of the -algorithm and to discuss its properties.
(Received July 21 1961)
† Communication MR45 of the Computation Department of the Mathematical Centre, Amsterdam.