Pedro was really interested in last algorithms class. So he started thinking and creating crazy networks. He proposed this:
- First, he restricted the BA model, so when adding a new node with
links, each link has to go to a different node (probabilities have to be calculated at each new link, excluding the nodes already linked to the new one). - Now he established that
should follow the t-Fibonacci sequence. Where for a given we have . ( is the standard Fibonacci sequence) - Finally, for each node he adds, he deletes
nodes.
Pedro started the network with 9876 nodes. Can you help him find the time
- None of the above.
Original idea by: Pedro Henrique Di Francia Rosso
Interesting idea, but some details are not clear. So, is m = Fib(t), or t*Fib(t)? Also, how does Fib start (in other words, what are the values of Fib(0) and Fib(1))?
ResponderExcluir