Limie's blog

By Limie, history, 22 months ago, In English

How to quickly find the value of each item in the following sequence.

$$$a_n=\lfloor (1+\sqrt{3})^n \rfloor$$$

Calculated in the sense of taking a mode.

  • Vote: I like it
  • +1
  • Vote: I do not like it

»
22 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Limie (previous revision, new revision, compare).

»
22 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Do you want to calculate all the values from 1 to n? or just for specific large n values?
It looks like you got this from the formula a_n = 2*(a_(n-1)+a_(n-2)).
If you want all values from 1 to n that'l take at least O(n) anyway so then use the recurrence

»
22 months ago, hide # |
Rev. 2  
Vote: I like it 0 Vote: I do not like it

But it's fast enough, since it's exponiental, it will only be calculted in log(n). Or is the problem of float relative error, if yes can you provide the equation that have this number as solution?

»
22 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Limie (previous revision, new revision, compare).