Is this acceptable in recursive formulas?

  • Thread starter Cloudless
  • Start date
  • Tags
    Formulas
In summary, recursive formulas are mathematical and computer science tools used to describe sequences and functions that involve repetition or self-referencing. They are considered acceptable if they correctly model the sequence or function and follow the rules of recursive definitions. An efficient recursive formula produces the desired result in a reasonable amount of time and with minimal computational resources. They are useful for solving problems in various fields, but may be difficult to understand and implement for some people and can lead to infinite loops if not constructed carefully.
  • #1
Cloudless
15
0
Say for the recursive formula 2, 5, 9, 19 , 37...Instead of writing it as an = an-1 + * 2 an-2

can you write it as:

an = 2an + (-1)nJust double checking. I encountered this earlier helping someone and I haven't done recursive formulas in a while..
 
Last edited:
Mathematics news on Phys.org
  • #2
I think you meant an = 2an-1 + (-1)n

Sure. Your formula is the same as

an = an-1 + (-1)n + an-1
= an-1 + (-1)n + 2an-2 + (-1)n-1
= an-1 + 2an-2
 

FAQ: Is this acceptable in recursive formulas?

What are recursive formulas used for?

Recursive formulas are used in mathematics and computer science to describe a sequence or function where each term is defined in terms of previous terms. They are particularly useful for modeling and solving problems that involve repetition or self-referencing.

How do I know if a recursive formula is acceptable?

A recursive formula is acceptable if it correctly describes the sequence or function it is intended to model and if it follows the rules of recursive definitions. These rules include specifying the initial term(s) and the recursive rule that defines each subsequent term in terms of the previous one(s).

What makes a recursive formula efficient?

A recursive formula is considered efficient if it produces the desired result in a reasonable amount of time and with minimal computational resources. This can be achieved by carefully choosing the initial term(s) and recursive rule to avoid unnecessary repetition and to optimize for the desired outcome.

Can recursive formulas be used in all types of problems?

Recursive formulas can be used in a wide range of problems, but they are particularly well-suited for problems that involve repeated or iterative processes. They can be used to solve problems in mathematics, computer science, and other fields such as economics and biology.

What are the potential drawbacks of using recursive formulas?

Recursive formulas can be difficult to understand and implement for some people, as they often involve complex calculations and require a deep understanding of the underlying problem. Additionally, if not carefully constructed, recursive formulas can lead to infinite loops and inaccurate results.

Similar threads

I Finding a general formula for a recursive sequence
Replies
1
Views
1K
Insights Reduction of Order For Recursions
Replies
4
Views
3K
I Calculating Collection Rate Error in Labs
Replies
31
Views
2K
How do you calculate recursive efficiency?
Replies
5
Views
2K
A Higher approximations of Ramanujan formula for ##\pi##
Replies
14
Views
1K
I Formula involving polynomial sequences + recursive reps
Replies
15
Views
2K
MHB CuRio$ty's question at Yahoo Answers regarding a linear homogeneous recursion
Replies
1
Views
2K
B Can Higher Degree Nested Radicals Be Simplified?
2
Replies
41
Views
1K
MHB Understanding Cubic Equation Formula for Polynomials of Degree Three
Replies
9
Views
2K
I Recursion theorem: application in proof
Replies
2
Views
2K

Hot Threads

Recent Insights

Back
Top