Is there a closed form solution to the function $f_n=2^{f_{n-1}}$ where $f_0=2$ ?
For instance, the first few values of the function are 2, 4, 16, 65536.
2026-04-04 04:33:25.1775277205
Closed Form Solution to Exponential Recursion
396 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in RECURRENCE-RELATIONS
- Recurrence Relation for Towers of Hanoi
- Solve recurrence equation: $a_{n}=(n-1)(a_{n-1}+a_{n-2})$
- General way to solve linear recursive questions
- Approximate x+1 without addition and logarithms
- Recurrence relation of the series
- first order inhomogeneous linear difference equation general solution
- Guess formula for sequence in FriCAS
- Solve the following recurrence relation: $a_{n}=10a_{n-2}$
- Find closed form for $a_n=2\frac{n-1}{n}a_{n-1}-2\frac{n-2}{n}a_{n-2}$ for all $n \ge 3$
- Young Tableaux generating function
Related Questions in GENERATING-FUNCTIONS
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- How to multiply generating functions with $x^n$ and $x^{5n}$ and $x^{2n}$
- Relationship between the generating functions of sequences $(a_n),(b_n)$ given $b_n=\sum^n_{i=1}a_i$.
- Double-exponential sum (maybe it telescopes?)
- Solve recurrence equation: $a_{n}=(n-1)(a_{n-1}+a_{n-2})$
- Want to use Herbert Wilf's snake oil method to show $\sum_k \binom{2n+1}{2k}\binom{m+k}{2n} = \binom{2m+1}{2n}$
- Young Tableaux generating function
- Generating function of the sequence $\binom{2n}{n}^3H_n$
- Expansion of fibonacci generating function
- Partial fraction of $A(x)=\frac{x^2+x+1}{(1-x)^3}$
Related Questions in CLOSED-FORM
- How can I sum the series $e^{-2}\frac{(3)^n}{n!}\sum_{k=0}^{\infty}\left ( \frac{1}{2}\right )^k\frac{1}{(k-n)!}$
- Computing $\int_0^\pi \frac{dx}{1+a^2\cos^2(x)}$
- Can one solve $ \int_{0}^\infty\frac{\sin(xb)}{x^2+a^2}dx $ using contour integration?
- Finding a closed form for a simple product
- For what value(s) of $a$ does the inequality $\prod_{i=0}^{a}(n-i) \geq a^{a+1}$ hold?
- Convergence of $\ln\frac{x}{\ln\frac{x}{\ln x...}}$
- How can one show that $\int_{0}^{1}{x\ln{x}\ln(1-x^2)\over \sqrt{1-x^2}}\mathrm dx=4-{\pi^2\over 4}-\ln{4}?$
- Exercises about closed form formula of recursive sequence.
- Simplify and determine a closed form for a nested summation
- Direction in closed form of recurrence relation
Related Questions in RECURSION
- Solving discrete recursion equations with min in the equation
- Recognizing recursion relation of series that is solutions of $y'' + y' + x^2 y = 0$ around $x_0 = 0$.
- Ackermann Function for $(2,n)$
- Primitive recursive functions of bounded sum
- Ackermann Function for $f(2,n)$ as compared to $f(5,1)$
- Determinant of Block Tridiagonal Matrix
- In how many ways can the basketball be passed between four people so that the ball comes back to $A$ after seven passes? (Use recursion)
- Finding a recursive relation from a differential equation.
- A recursive divisor function
- Are these numbers different from each other?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Depends what you mean by closed form.
If you mean to ask, does this have an expression in terms of elementary functions such as exponentiation, trigonometry, and polynomials, then the answer is NO.
How do I know that?
Because this function you've given is a famous NON elementary function, known as tetration. Read about it here!
https://en.wikipedia.org/wiki/Tetration
But an actual proof, arises from the fact that elementary functions have individual constitutents (that can be composed and added and multiplied) that grow at most as fast as $a^x$ for some base $a$.
So a finite elementary expression will have at most finitely many
$$ a^{a^{a^{... ^{x}}}}$$ But this function you've given grows at a rate that is UNBOUNDED in the number of nested exponentials. So any finite elementary function will be eclipsed by it.