Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

The number sequence \[a _{0},a _{1},a2...\] is defined by the recursion formula: \[a _{1}=1\] \[a _{n+1}=a _{n}−\frac{ 1 }{ n(n+1) },n≥1\] Find the closed formula for the sequence and prove it by induction.

Mathematics
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this and thousands of other questions

we will get a0 as 0 if we put n =1
ok this is what we do when we have just \(a_{n+1}\) and \(a_n\) in recursion formula \[a _{n+1}-a _{n}=\frac{ 1 }{ n(n+1) }\]\[a _{n}-a _{n-1}=\frac{ 1 }{ n(n-1) }\]\[...\]\[a_2-a_1=\frac{1}{2}\]and add them all
sorry cant find a0

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

what mukushala has done is correct then you will get a(n+1) = 1 - sum of terms of rhs
for finding the sum of terms on rhs write each term like this\[\frac{ 1 }{(n)(n-1) } = \frac{ n - (n-1) }{(n)(n-1) } = \frac{ 1 }{ n-1 } - \frac{ 1 }{ n }\]
now when you add consecutive terms will get cancelled and you will be left with \[1 - \frac{ 1 }{ n+1 }\]
did you understand frx?
Well, not really yet but thank you, will have to sit down and think about what you guys just wrote:)
I can't see what the closed formula is? Is it \[1-\frac{ 1 }{ n+1}\]?
another way to seeing this is writing it in the form\[a _{n+1}-a _{n}=-\frac{1}{n(n+1)}=\frac{ 1 }{ n+1 }-\frac{1}{n}\]and guessing closed form like \[a_n=\frac{1}{n}\]then prove it by induction because it says find the closed formula(even by guessing) then prove by induction
yeah what mukushla is saying is better i think
I really don't get it :/ I get the first part when subtractin a_n from both sides but is 1/(n+1)-1/n equal to the first ecpression, I can't see it
\[\frac{ 1 }{ n+1 }-\frac{ 1 }{ n }\] Looking at this expression, why should i guess the closed form is ?\[a _{n}=\frac{ 1 }{ n }\]

Not the answer you are looking for?

Search for more explanations.

Ask your own question