| http://www.w3.org/ns/prov#value | - But that is easy: for in S(N) we added s(N-1) 0's.So, now we know that s(N+1) = s(N) + s(N-1), i.e. the Fibonacci sequence, albeit with slightly altered starting conditions, i.e. to determine the counts we define:s(1) = 2;s(2) = 3;s(N) = s(N-1) + s(N-2);We can determine the order of magnitude by the information we have about the Fibonacci sequence, which means that s(N) ??? (1.6)^N. (actually clos
|
