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

Home > Numbers > Sequences
Fibonacci but with Subtraction still stays Positive (Posted on 2023-02-15) Difficulty: 3 of 5
Let D[n] be a sequence whose values are recursively related by D[n] = D[n-2] - D[n-1].

D[1] is fixed to be equal to 1. Most choices of D[2] will result in a sequence which eventually has some n such that D[n] is negative.

What is the set of values for D[2] exist such that all terms of D[n] are positive?

See The Solution Submitted by Brian Smith    
Rating: 4.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsPuzzle ThoughtsK Sengupta2023-02-22 02:25:00
SolutionsolutionCharlie2023-02-15 17:13:49
SolutionSolutionLarry2023-02-15 13:43:48
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 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information