Zrjydtj

NMaximize is not converging to a solution

dbcc cleantable batch size explanation

Is it possible to do 50 km distance without any previous training?

What are these boxed doors outside store fronts in New York?

Can I ask the recruiters in my resume to put the reason why I am rejected?

High voltage LED indicator 40-1000 VDC without additional power supply

What would happen to a modern skyscraper if it rains micro blackholes?

How does quantile regression compare to logistic regression with the variable split at the quantile?

Intersection point of 2 lines defined by 2 points each

Why is consensus so controversial in Britain?

What is the word for reserving something for yourself before others do?

What does it mean to describe someone as a butt steak?

Malcev's paper "On a class of homogeneous spaces" in English

LaTeX: Why are digits allowed in environments, but forbidden in commands?

"You are your self first supporter", a more proper way to say it

Today is the Center

Are astronomers waiting to see something in an image from a gravitational lens that they've already seen in an adjacent image?

strTok function (thread safe, supports empty tokens, doesn't change string)

How does one intimidate enemies without having the capacity for violence?

Modeling an IP Address

When a company launches a new product do they "come out" with a new product or do they "come up" with a new product?

Why doesn't Newton's third law mean a person bounces back to where they started when they hit the ground?

What does the "remote control" for a QF-4 look like?

How can I make my BBEG immortal short of making them a Lich or Vampire?

Can $a(n) = fracnn+1$ be written recursively?

Formula for a sequenceUse of Recursively Defined FunctionsRecursive Sequence from Finite SequencesFinding the lowest common value in repeating sequencesUnexplanied pattern from increasing rational sequencesWhat would describe the following basic sequence?Understanding sub-sequencesCan the Fibonacci sequence be written as an explicit rule?Turning a recursively defined sequence into an explicit formulaWhat's the formula for producing these series?

1

$begingroup$

Take the sequence $$frac12, frac23, frac34, frac45, frac56, frac67, dots$$

Algebraically it can be written as $$a(n) = fracnn + 1$$

Can you write this as a recursive function as well?

A pattern I have noticed:

• Take $A_n-1$ and then inverse it. All you have to do is add two to the denominator. However, it is the denominator increase that causes a problem here.

I am currently in Algebra II Honors and learning sequences

sequences-and-series number-theory recursion

share|cite|improve this question

edited 5 mins ago

user1952500

829712

asked 1 hour ago

Levi KLevi K

262

New contributor

Levi K is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

1

$begingroup$

Take the sequence $$frac12, frac23, frac34, frac45, frac56, frac67, dots$$

Algebraically it can be written as $$a(n) = fracnn + 1$$

Can you write this as a recursive function as well?

A pattern I have noticed:

• Take $A_n-1$ and then inverse it. All you have to do is add two to the denominator. However, it is the denominator increase that causes a problem here.

I am currently in Algebra II Honors and learning sequences

sequences-and-series number-theory recursion

share|cite|improve this question

edited 5 mins ago

user1952500

829712

asked 1 hour ago

Levi KLevi K

262

New contributor

Levi K is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

$begingroup$

Take the sequence $$frac12, frac23, frac34, frac45, frac56, frac67, dots$$

Algebraically it can be written as $$a(n) = fracnn + 1$$

Can you write this as a recursive function as well?

A pattern I have noticed:

• Take $A_n-1$ and then inverse it. All you have to do is add two to the denominator. However, it is the denominator increase that causes a problem here.

I am currently in Algebra II Honors and learning sequences

sequences-and-series number-theory recursion

share|cite|improve this question

edited 5 mins ago

user1952500

829712

asked 1 hour ago

Levi KLevi K

262

New contributor

Levi K is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

share|cite|improve this question

edited 5 mins ago

user1952500

829712

asked 1 hour ago

Levi KLevi K

262

New contributor

Levi K is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share|cite|improve this question

edited 5 mins ago

user1952500

829712

asked 1 hour ago

Levi KLevi K

262

New contributor

Levi K is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

edited 5 mins ago

user1952500

829712

edited 5 mins ago

user1952500

829712

asked 1 hour ago

Levi KLevi K

262

New contributor

Levi K is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 1 hour ago

Levi KLevi K

262

3 Answers
3

active

oldest

votes

2

$begingroup$

After some further solving, I was able to come up with an answer

It can be written $$A_n + 1 = (2 - A_n)^-1$$ where $$A_1 = 1/2$$

share|cite

answered 58 mins ago

Levi KLevi K

262

New contributor

Levi K is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

2

$begingroup$

beginalign*
a_n+1 &= fracn+1n+2 \
&= fracn+2-1n+2 \
&= 1 - frac1n+2 text, so \
1 - a_n+1 &= frac1n+2 text, \
frac11 - a_n+1 &= n+2 &[textand so frac11 - a_n = n+1]\
&= n+1+1 \
&= frac11- a_n +1 \
&= frac11- a_n + frac1-a_n1-a_n \
&= frac2-a_n1- a_n text, then \
1 - a_n+1 &= frac1-a_n2- a_n text, and finally \
a_n+1 &= 1 - frac1-a_n2- a_n \
&= frac2-a_n2- a_n - frac1-a_n2- a_n \
&= frac12- a_n text.
endalign*

share|cite|improve this answer

answered 39 mins ago

Eric TowersEric Towers

33.5k22370

$endgroup$

add a comment | 

0

$begingroup$

Just by playing around with some numbers, I determined a recursive relation to be

$$a_n = fracna_n-1 + 1n+1$$

with $a_1 = 1/2$. I mostly derived this by noticing developing this would be easier if I negated the denominator of the previous term (thus multiplying by $n$), adding $1$ to the result (giving the increase in $1$ in the denominator), and then dividing again by the desired denominator ($n+1$).

share|cite|improve this answer

answered 1 hour ago

Eevee TrainerEevee Trainer

9,91631740

$endgroup$

add a comment | 

Your Answer

StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);

Levi K is a new contributor. Be nice, and check out our Code of Conduct.

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

Required, but never shown

StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3176633%2fcan-an-fracnn1-be-written-recursively%23new-answer', 'question_page');

);

Post as a guest

Name

Email

Required, but never shown

2

$begingroup$

After some further solving, I was able to come up with an answer

It can be written $$A_n + 1 = (2 - A_n)^-1$$ where $$A_1 = 1/2$$

share|cite

answered 58 mins ago

Levi KLevi K

262

New contributor

Levi K is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

2

$begingroup$

After some further solving, I was able to come up with an answer

It can be written $$A_n + 1 = (2 - A_n)^-1$$ where $$A_1 = 1/2$$

share|cite

answered 58 mins ago

Levi KLevi K

262

New contributor

Levi K is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

$begingroup$

After some further solving, I was able to come up with an answer

It can be written $$A_n + 1 = (2 - A_n)^-1$$ where $$A_1 = 1/2$$

share|cite

answered 58 mins ago

Levi KLevi K

262

New contributor

Levi K is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

share|cite

answered 58 mins ago

Levi KLevi K

262

New contributor

Levi K is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

answered 58 mins ago

Levi KLevi K

262

New contributor

Levi K is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

answered 58 mins ago

Levi KLevi K

262

2

$begingroup$

beginalign*
a_n+1 &= fracn+1n+2 \
&= fracn+2-1n+2 \
&= 1 - frac1n+2 text, so \
1 - a_n+1 &= frac1n+2 text, \
frac11 - a_n+1 &= n+2 &[textand so frac11 - a_n = n+1]\
&= n+1+1 \
&= frac11- a_n +1 \
&= frac11- a_n + frac1-a_n1-a_n \
&= frac2-a_n1- a_n text, then \
1 - a_n+1 &= frac1-a_n2- a_n text, and finally \
a_n+1 &= 1 - frac1-a_n2- a_n \
&= frac2-a_n2- a_n - frac1-a_n2- a_n \
&= frac12- a_n text.
endalign*

share|cite|improve this answer

answered 39 mins ago

Eric TowersEric Towers

33.5k22370

$endgroup$

add a comment | 

2

$begingroup$

beginalign*
a_n+1 &= fracn+1n+2 \
&= fracn+2-1n+2 \
&= 1 - frac1n+2 text, so \
1 - a_n+1 &= frac1n+2 text, \
frac11 - a_n+1 &= n+2 &[textand so frac11 - a_n = n+1]\
&= n+1+1 \
&= frac11- a_n +1 \
&= frac11- a_n + frac1-a_n1-a_n \
&= frac2-a_n1- a_n text, then \
1 - a_n+1 &= frac1-a_n2- a_n text, and finally \
a_n+1 &= 1 - frac1-a_n2- a_n \
&= frac2-a_n2- a_n - frac1-a_n2- a_n \
&= frac12- a_n text.
endalign*

share|cite|improve this answer

answered 39 mins ago

Eric TowersEric Towers

33.5k22370

$endgroup$

add a comment | 

$begingroup$

beginalign*
a_n+1 &= fracn+1n+2 \
&= fracn+2-1n+2 \
&= 1 - frac1n+2 text, so \
1 - a_n+1 &= frac1n+2 text, \
frac11 - a_n+1 &= n+2 &[textand so frac11 - a_n = n+1]\
&= n+1+1 \
&= frac11- a_n +1 \
&= frac11- a_n + frac1-a_n1-a_n \
&= frac2-a_n1- a_n text, then \
1 - a_n+1 &= frac1-a_n2- a_n text, and finally \
a_n+1 &= 1 - frac1-a_n2- a_n \
&= frac2-a_n2- a_n - frac1-a_n2- a_n \
&= frac12- a_n text.
endalign*

share|cite|improve this answer

answered 39 mins ago

Eric TowersEric Towers

33.5k22370

$endgroup$

share|cite|improve this answer

answered 39 mins ago

Eric TowersEric Towers

33.5k22370

answered 39 mins ago

Eric TowersEric Towers

33.5k22370

answered 39 mins ago

Eric TowersEric Towers

33.5k22370

0

$begingroup$

Just by playing around with some numbers, I determined a recursive relation to be

$$a_n = fracna_n-1 + 1n+1$$

with $a_1 = 1/2$. I mostly derived this by noticing developing this would be easier if I negated the denominator of the previous term (thus multiplying by $n$), adding $1$ to the result (giving the increase in $1$ in the denominator), and then dividing again by the desired denominator ($n+1$).

share|cite|improve this answer

answered 1 hour ago

Eevee TrainerEevee Trainer

9,91631740

$endgroup$

add a comment | 

0

$begingroup$

Just by playing around with some numbers, I determined a recursive relation to be

$$a_n = fracna_n-1 + 1n+1$$

with $a_1 = 1/2$. I mostly derived this by noticing developing this would be easier if I negated the denominator of the previous term (thus multiplying by $n$), adding $1$ to the result (giving the increase in $1$ in the denominator), and then dividing again by the desired denominator ($n+1$).

share|cite|improve this answer

answered 1 hour ago

Eevee TrainerEevee Trainer

9,91631740

$endgroup$

add a comment | 

$begingroup$

Just by playing around with some numbers, I determined a recursive relation to be

$$a_n = fracna_n-1 + 1n+1$$

with $a_1 = 1/2$. I mostly derived this by noticing developing this would be easier if I negated the denominator of the previous term (thus multiplying by $n$), adding $1$ to the result (giving the increase in $1$ in the denominator), and then dividing again by the desired denominator ($n+1$).

share|cite|improve this answer

answered 1 hour ago

Eevee TrainerEevee Trainer

9,91631740

$endgroup$

share|cite|improve this answer

answered 1 hour ago

Eevee TrainerEevee Trainer

9,91631740

answered 1 hour ago

Eevee TrainerEevee Trainer

9,91631740

answered 1 hour ago

Eevee TrainerEevee Trainer

9,91631740