All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
The fibbons (Posted on 2021-03-16) Difficulty: 2 of 5
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.

No Solution Yet Submitted by Ady TZIDON    
Rating: 4.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionVirginia Dunn2021-03-18 01:48:40
Solutioncomputer solutionCharlie2021-03-16 10:58:20
Extended SolutionJer2021-03-16 10:08:40
SolutionSolutiontomarken2021-03-16 07:47:36
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2021 by Animus Pactum Consulting. All rights reserved. Privacy Information