If we have a sequence of numbers that follow a formula related to n (the position in the formula) eg for the sequence 1, 4, 9, 16, 25, 36... the numbers follow the formula n2. If we say the highest power of n in the formula is x (eg for n3+n+1 x=3) then how many numbers do we need in the sequence to be sure of being able to derive the formula?
Bare minimum terms to be able to do it, no extra ones to ensure the proof.
Question
Guest
If we have a sequence of numbers that follow a formula related to n (the position in the formula) eg for the sequence 1, 4, 9, 16, 25, 36... the numbers follow the formula n2. If we say the highest power of n in the formula is x (eg for n3+n+1 x=3) then how many numbers do we need in the sequence to be sure of being able to derive the formula?
Bare minimum terms to be able to do it, no extra ones to ensure the proof.
Link to comment
Share on other sites
11 answers to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.