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.)
A number worth looking for? | Comment 3 of 5 |
In Charlie's list I saw this entry:
2 5   28572857

This has B=E. It is a unique solution if we had been asked for a number of the form ABCDABCD.  Looking for a number of this form may be a reasonable problem, as we could take advantage of searching for multiples of 10001.

  Posted by Brian Smith on 2017-01-17 23:22:51
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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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