title: about number of bits required for Fibonacci number
body: <p>I am reading a algorithms book by S.DasGupta. Following is text snippet from the text regarding number of bits required for nth Fibonacci number.</p>
  
  <blockquote>
    <p>It is reasonable to treat addition as
    a single computer step if small
    numbers are being added, 32-bit
    numbers say. But the nth Fibonacci
    number is about
    0.694n bits long, and this can far exceed 32 as n grows. Arithmetic
    operations on arbitrarily large
    numbers cannot possibly be performed
    in a single, constant-time step.</p>
  </blockquote>
  
  <p>My question is for eg, for Fibonacci number F1 = 1, F2 =1, F3=2, and so on. then substituting "n" in above formula i.e., 0.694n for F1 is approximately 1, F2 is approximately 2 bits, but for F3 and so on above formula fails. I think i didn't understand propely what author mean here, can any one please help me in understanding this?</p>
  
  <p>Thanks</p>