Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

So I was exploring some math the other day... and I came across the following neat identity:

Given $y$ is a function of $x$ ($y(x)$) and $$ y = 1 + \frac{\mathrm{d}}{\mathrm{d}x} \left(1 + \frac{\mathrm{d}}{\mathrm{d}x} \left(1 + \frac{\mathrm{d}}{\mathrm{d}x} \left(1 + \frac{\mathrm{d}}{\mathrm{d}x} \left(1 + \frac{\mathrm{d}}{\mathrm{d}x} \left( \cdots \right) \right) \right) \right) \right) \text{ (repeated differential)} $$

then we can solve this equation as follows: $$ y - 1 = \frac{\mathrm{d}}{\mathrm{d}x} \left(1 + \frac{\mathrm{d}}{\mathrm{d}x} \left( \cdots \right) \right) \iff \int y - 1 \, \mathrm{d} x = 1 + \frac{\mathrm{d}}{\mathrm{d}x} \left( 1 + \frac{\mathrm{d}}{\mathrm{d}x} \left( \cdots \right) \right) $$ $$ \implies \int y - 1 \, \mathrm{d} x = y \iff y - 1 = \frac{\mathrm{d} y }{ \mathrm{d} x} $$


$$ \ln \left( y - 1 \right) = x + C \iff y = Ce^x + 1 $$

This problem reminded me a lot of nested radical expressions such as: $$ x = 1 + \sqrt{1 + \sqrt{ 1 + \sqrt{ \cdots }}} \iff x - 1 = \sqrt{1 + \sqrt{ 1 + \sqrt{ \cdots }}} $$ $$ \implies (x - 1)^2 = x \iff x^2 - 3x + 1 = 0 $$

and so

$$ x = \frac{3}{2} + \frac{\sqrt{5}}{2} $$

This reminded of the Ramanujan nested radical which is:

$$ x = 0 + \sqrt{ 1 + 2 \sqrt{ 1 + 3 \sqrt{1 + 4 \sqrt{ \cdots }}}} $$

whose solution cannot be done by simple series manipulations but requires knowledge of general formula found by algebraically manipulating the binomial theorem...

This made me curious...

say $y$ is a function of $x$ ($y(x)$) and

$$ y = 0 + \frac{\mathrm{d}}{\mathrm{d}x} \left(1 + 2\frac{\mathrm{d}}{\mathrm{d}x} \left(1 + 3\frac{\mathrm{d}}{\mathrm{d}x} \left(1 + 4\frac{\mathrm{d}}{\mathrm{d}x} \left(1 + 5\frac{\mathrm{d}}{\mathrm{d}x} \left( \cdots \right) \right) \right) \right) \right) $$

What would the solution come out to be?

share|cite|improve this question
fyi the ramanujan radical evaluates to 3... and its solution can be found here: (go to attention from mathematicians) – frogeyedpeas May 2 '13 at 21:40
It really helps readability to format questions using MathJax (see FAQ). Regards – Amzoti May 2 '13 at 21:44
@Amzoti I tried to reformat it – DanZimm May 2 '13 at 22:09
@DanZimm thank you! – frogeyedpeas May 2 '13 at 22:11
How do you exactly define that repeated differential equation? If we cut-off at $n$, don't we get $y_n = n! \frac{d^n y_n}{dx^n}$? – Aryabhata May 3 '13 at 0:53
up vote 3 down vote accepted

If the operator is meant to derive what follows, then we have $$y(x) = \lim_{n \to \infty} n! \cdot y^{(n)}(x) \qquad,\qquad \forall\ x \in X$$

since the derivative of a constant is always $0$ , and the derivative of a sum is the sum of derivatives. However, if multiplication is meant, with the “last” term of the nested product presumably being none other than y(x), then we have $$y(x) = \sum_{n=1}^\infty n! \cdot y^{(n)}(x) \qquad,\qquad \forall\ x \in X$$

where $y : X \to Y$ ; either way, since $$\lim_{n \to \infty}n! = \infty$$ then, in order for the function to converge $\forall\ x \in X$ , we must have $$\lim_{n \to \infty} y^{(n)}(x) = 0 \quad,\quad \forall\ x \in X \quad=>\quad y(x)\ =\ P_m(x)\ =\ \sum_{k=0}^m a_k \cdot x^k \quad,\quad m \in \mathbb{N}$$

since the Nth nested integral of $0$ is nothing else than a polynomial function of degree N-$1$ .

share|cite|improve this answer

Having been quite a bit of time I thought about this some more!

If we cut our original radical at a finite time we have (as pointed out by Aryabhata) we have

$$y = n!\frac{d^n}{dx^n} $$

Solutions to this include $$ y= C_1 e^{x\sqrt[n]{n!}_1} +C_2 e^{x\sqrt[n]{n!}_2}... C_n e^{x\sqrt[n]{n!}_n} $$

For all possible nth roots of unity.

Now consider stirlings approximation of n! which states

$$n! \le e n^{n + \frac{1}{2}} e^{-n} $$

(Note that for $n \ge 0$ these functions are both greater than or equal to 1) hence

$$ |\sqrt[n]{n!}| \le |\sqrt[n]{e n^{n + \frac{1}{2}} e^{-n}} | $$

Which yields

$$ |\sqrt[n]{n!}| \le |\sqrt[n]{e n^{n + \frac{1}{2}} e^{-n}} | $$

Which yields:

$$ |\sqrt[n]{n!}| \le |{e^{\frac{1}{n}} n^{1 + \frac{1}{2n}} e^{-1}} | $$

Which yields:

$$ |\sqrt[n]{n!}| = O(n) $$

As n tends to infinity, so does this.

But before I throw out any hope for this, I would like to point out that as n gets larger, we essentially obtain a basis for functions in terms of complex exponentials, I'm curious if there is a way to pick the constants $C_i$ such that for a given n, you can model the function as closely as possible, and determine then in the limit what the $C_i$ need to be (probably very degenerate piecewise constant functions)

If there is such a scheme, it may very well be that ANY function satisfies this differential equation, assuming the set of exponentials gets closer and closer to forming a basis for all functions (which in the limit as n goes to infinity means it does indeed form a basis). The tricky part is defining, "how well" a basis is. IE if it doesn't cover every case, how do we say that it covers more cases, or relatively more cases than its predecessor.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.