I was messing around in class, and I found that there's a small set of rules one can use to draw a directed acylic graph (it looks like a tree, but isn't) such that the number of nodes at a distance d from a "start" node is equal to the (d+1)th Fibonacci number.(adsbygoogle = window.adsbygoogle || []).push({});

The graph is pretty neat looking. Like I said, the graph is infinite and recursively defined (sort of... at least I give an algorithm for producing as large a graph as you want) Maybe the neatest thing about it is its self-similarity and symmetry. I was even able to prove that the property held. I haven't looked into this at all, as in, seen if it's already been done (I'm sure it has) or if it means anything deep (I'm sure it doesn't).

Is this something worth pursuing, or is it just a neat observation that I should let be?

Math is awesome.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Cool observation concerning Fibonacci numbers

Loading...

Similar Threads - Cool observation concerning | Date |
---|---|

A Observing interactions with plots using est. coeff. | Apr 24, 2017 |

A Sum of random variables, given sum of observed variables | Jun 24, 2016 |

HMM with continuous observation - PDFs to probabilities | Apr 5, 2014 |

Is this a correct observation about Markov-chains and stoc.processes? | Jan 13, 2014 |

Question Concerning Probability Systems | Aug 22, 2013 |

**Physics Forums - The Fusion of Science and Community**