Xref: utzoo sci.math:15824 comp.theory:1660 sci.crypt:4335
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!magnus.acs.ohio-state.edu!csn!ccncsu!longs.LANCE.ColoState.EDU!ld231782
From: ld231782@longs.LANCE.ColoState.EDU (Lawrence Detweiler)
Newsgroups: sci.math,comp.theory,sci.crypt
Subject: Re: Lankinen's recursive factoring algorithm
Message-ID: <13577@ccncsu.ColoState.EDU>
Date: 18 Mar 91 07:44:28 GMT
References: <13559@ccncsu.ColoState.EDU>
Sender: news@ccncsu.ColoState.EDU
Reply-To: ld231782@longs.LANCE.ColoState.EDU (Lawrence Detweiler)
Organization: Colorado State U. Center for Computer Assisted Engineering.
Lines: 15

- - -

Curse the phantom USENET lineater! <13559@ccncsu.ColoState.EDU> should read:

]                   |  undefined if n<0,
]                   |  (u,v) if n=0,
] Let f(u,v,b,n) := | [otherwise]
]                   |  f(u+b,v,2b,(n-v)/2) or f(u,v+b,2b,(n-u)/2) if n odd
]                   |  f(u,v,2b,n/2) or f(u+b,v+b,2b,(n-u-v-b)/2) if n even
]
] Thm: f(1,1,2,(m-1)/2) = (p,q) iff pq=m for odd m.
] ---


ld231782@longs.LANCE.ColoState.EDU