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: ( You must be logged in to post comments.)
  Subject Author Date
re: Why there are many solutionsJer2017-01-18 17:35:42
Why there are many solutionsMath Man2017-01-18 16:25:20
A number worth looking for?Brian Smith2017-01-17 23:22:51
computer solutionCharlie2017-01-17 11:20:42
UnreasonableJer2017-01-17 10:48:55
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information