Let me introduce you to a set of integers I’ve fiddled around recently.
I’ll call them fibbons.
A fibbon is a number such that each of its digits, starting from the 3rd from the left, is a sum of 2 preceding digits e.g. 123, 3257, ..... etc

To get more profound knowledge of fibbons please fulfill the following tasks:
1. Show that the maximal length of a fibbon is 8 digits.
2. List all existing fibbons.
3. Specify the least frequent digit in your list.
4. Specify the most frequent digit in your list.
5. Denoting by f(k) the number of fibbons containing k digits, list the values for f(1), f(2), ...f(8)
6. Explain briefly how the list of 2 was generated.

A really interesting challenge. Now I'm trying to solve it, but it doesn't work. In reality, it is much easier to play and win at https://777spinslot.com/gala-casino-online-review/ than to solve this problem. I wish you guys good luck. 

Posted by Virginia Dunn on 2021-03-18 01:48:40