Implementation: IEnumerable<BigInteger> Fibs(){    BigInteger a = 0;    BigInteger b = 1;    while(true)    {        b = a + (a = b);        yield return a;    }}Usage:void Main(){    // take first 100 fib numbers    var fibs = Fibs().Take(100);}How can I improve this?
Calculating Fibonnaci sequence lazily
c#;fibonacci sequence;generator;lazy