Basic questions?

[franktaw at netscape.net]

What you need, in general, is to compare as many members as the sum of the degree of the numerator and the denominator, plus 1.  The numerator provides an initial condition, and the denominator provides a recurrence.
 
Franklin T. Adams-Watters
16 W. Michigan Ave.
Palatine, IL 60067
847-776-7645
 
 
-----Original Message-----
From: Mitch Harris <Harris.Mitchell at mgh.harvard.edu>

>- if we can be sure both sequences have a rational g.f., it suffices 
> to compare about twice as much members as the degree of the g.f. 
denominator. 
> I think one can prove that. (It also applies to your example) 
 
how about exactly as many members as the degree? the degree of the 
denominator is the degree of the corresponding recurrence, which only 
requires degree # of base cases. 
 
___________________________________________________
Try the New Netscape Mail Today!
Virtually Spam-Free | More Storage | Import Your Contact List
http://mail.netscape.com
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20060117/1a629197/attachment-0001.htm>