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

Home > Numbers
An interesting recurrence (Posted on 2017-01-17) Difficulty: 3 of 5
A sequence with the recurrence f(n)=3*f(n-1)+f(n-2) starts with two 1-digit numbers. The sequence contains the 8-digit number ABCDAECD. A≠0, and A, B, C, D, and E are not necessarily distinct. Find all possible values of ABCDAECD.

No Solution Yet Submitted by Math Man    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Why there are many solutions Comment 5 of 5 |
(In reply to Why there are many solutions by Math Man)

I can't believe I missed this.   I have f(14), f(15), f(16) right here and I didn't notice they had the form. 
  Posted by Jer on 2017-01-18 17:35:42

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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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