[Tutor] Recursive Least Common Multiple

[Sean 'Shaleh' Perry]

On 18-Jul-2001 Sean 'Shaleh' Perry wrote:
> def adder(n):
>     val = [] 
>     count = 1
>     dummy = n
>     while((count < dummy) and ((2 * count) <= n)):
>         dummy = dummy - 1
>         val.append([count, dummy])
>         count = count + 1
>     return val
> 

of course the (count < dummy) is now superfluous (-: