recurrenceSep 25, 2026

A general closed form for a family of nonlinear radical recurrences

I
idriss-bado
Member · Research discussion
Votes
3
Answers
2
Views
8
3

Consider the recurrence

xn+1=c+(xn−c)r+λr,x_{n+1}=c+\sqrt[r]{(x_n-c)^r+\lambda},

where r≥1r\geq 1 is an odd integer, c,λ∈Rc,\lambda\in\mathbb{R}, and x1∈Rx_1\in\mathbb{R}.

Then, for every n≥1n\geq 1,

xn=c+(x1−c)r+(n−1)λr.x_n=c+\sqrt[r]{(x_1-c)^r+(n-1)\lambda}.

In particular, assume that λ>0\lambda>0 and x1≤Mx_1\leq M. Then the largest positive integer nn satisfying

xn≤Mx_n\leq M

is

nmax⁡=1+⌊(M−c)r−(x1−c)rλ⌋.n_{\max} = 1+ \left\lfloor \frac{(M-c)^r-(x_1-c)^r}{\lambda} \right\rfloor.

More generally, let Φ:I→J\Phi:I\to J be a bijection and suppose that

xn+1=Φ−1(Φ(xn)+λ),x_{n+1} = \Phi^{-1}\left(\Phi(x_n)+\lambda\right),

whenever the right-hand side is defined.

Then

xn=Φ−1(Φ(x1)+(n−1)λ).x_n = \Phi^{-1}\left(\Phi(x_1)+(n-1)\lambda\right).

Indeed, the recurrence is transformed by Φ\Phi into the arithmetic progression

Φ(xn+1)=Φ(xn)+λ.\Phi(x_{n+1})=\Phi(x_n)+\lambda.

Therefore the nonlinear recurrence is conjugate to the translation

t↦t+λ.t\mapsto t+\lambda.

Replies

2 answers
2
I
idriss-bado
Research member
Sep 25, 2026

Set

yn=xn−c.y_n=x_n-c.

Then

yn+1=ynr+λr.y_{n+1}=\sqrt[r]{y_n^r+\lambda}.

Since rr is odd,

yn+1r=ynr+λ.y_{n+1}^r=y_n^r+\lambda.

Let

un=ynr.u_n=y_n^r.

Then

un+1=un+λ.u_{n+1}=u_n+\lambda.

Thus (un)(u_n) is an arithmetic progression, and therefore

un=u1+(n−1)λ.u_n=u_1+(n-1)\lambda.

Since

u1=(x1−c)r,u_1=(x_1-c)^r,

we get

(xn−c)r=(x1−c)r+(n−1)λ.(x_n-c)^r=(x_1-c)^r+(n-1)\lambda.

Hence

xn=c+(x1−c)r+(n−1)λr.x_n=c+\sqrt[r]{(x_1-c)^r+(n-1)\lambda}.

Now suppose that λ>0\lambda>0. Then

xn≤Mx_n\leq M

is equivalent to

(x1−c)r+(n−1)λ≤(M−c)r.(x_1-c)^r+(n-1)\lambda\leq(M-c)^r.

Therefore

n−1≤(M−c)r−(x1−c)rλ.n-1\leq\frac{(M-c)^r-(x_1-c)^r}{\lambda}.

Hence the largest possible value of nn is

nmax⁡=1+⌊((M−c)r−(x1−c)r)/λ⌋.n_{\max} = 1+ \lfloor ((M-c)^r-(x_1-c)^r)/\lambda \rfloor.

For the general form, suppose

xn+1=Φ−1(Φ(xn)+λ).x_{n+1}=\Phi^{-1}(\Phi(x_n)+\lambda).

Applying Φ\Phi gives

Φ(xn+1)=Φ(xn)+λ.\Phi(x_{n+1})=\Phi(x_n)+\lambda.

Thus

Φ(xn)=Φ(x1)+(n−1)λ.\Phi(x_n)=\Phi(x_1)+(n-1)\lambda.

Therefore

xn=Φ−1(Φ(x1)+(n−1)λ).x_n=\Phi^{-1}(\Phi(x_1)+(n-1)\lambda).
2
I
idriss-bado
Research member
Sep 25, 2026

Consider the sequence defined by

a1=1a_1=1

and

an+1=an3−3an2+3an+33+1.a_{n+1} = \sqrt[3]{a_n^3-3a_n^2+3a_n+3}+1.

We want to determine the largest positive integer nn such that

an≤11.a_n\leq 11.

First observe that

an3−3an2+3an+3=(an−1)3+4.a_n^3-3a_n^2+3a_n+3 = (a_n-1)^3+4.

Hence the recurrence becomes

an+1=1+(an−1)3+43.a_{n+1} = 1+\sqrt[3]{(a_n-1)^3+4}.

This is exactly the general recurrence

xn+1=c+(xn−c)r+λrx_{n+1} = c+\sqrt[r]{(x_n-c)^r+\lambda}

with

c=1,r=3,λ=4,x1=1.c=1,\qquad r=3,\qquad \lambda=4,\qquad x_1=1.

Therefore

an=1+4(n−1)3.a_n = 1+\sqrt[3]{4(n-1)}.

Now impose the condition

an≤11.a_n\leq 11.

Then

1+4(n−1)3≤11,1+\sqrt[3]{4(n-1)}\leq 11,

so

4(n−1)3≤10.\sqrt[3]{4(n-1)}\leq 10.

Cubing both sides,

4(n−1)≤1000.4(n-1)\leq 1000.

Thus

n−1≤250,n-1\leq 250,

and hence

n≤251.n\leq 251.

Therefore the largest possible value is

251.\boxed{251}.

Indeed,

a251=1+10003=11.a_{251} = 1+\sqrt[3]{1000} = 11.

Your answer

You need a verified account to contribute. Create an account or log in to join the discussion.