MHB Can you find $f^{(n)}(1)$ with the given conditions?

  • Thread starter Thread starter lfdahl
  • Start date Start date
  • Tags Tags
    Derivative
lfdahl
Gold Member
MHB
Messages
747
Reaction score
0
Let $f(x)$ be a function satisfying
\[xf(x)=\ln x \ \ \ \ \ \ \ \ \text{for} \ \ x>0\]
Show that $f^{(n)}(1)=(-1)^{n+1}n!\left(1+\frac{1}{2}+\cdots+\frac{1}{n}\right)$ where $f^{(n)}(x)$ denotes the $n$-th derivative evaluated at $x$.
 
Mathematics news on Phys.org
My solution:

We have:

$$f(x)=\frac{\ln(x)}{x}$$

Now, let's look at a few base cases to see if a pattern emerges:

$$f^{(1)}(x)=\frac{1-\ln(x)}{x^2}$$

$$f^{(2)}(x)=\frac{2\ln(x)-3}{x^3}$$

$$f^{(3)}(x)=\frac{11-6\ln(x)}{x^4}$$

$$f^{(4)}(x)=\frac{24\ln(x)-50}{x^5}$$

I'm ready to posit the inductive statement $P_n$:

$$f^{(n)}(x)=\frac{(-1)^nn!\left(\ln(x)-H_n\right)}{x^{n+1}}$$

Note: $H_n$ is the $n$th harmonic number, defined as:

$$H_n\equiv\sum_{k=1}^{n}\left(\frac{1}{k}\right)$$

We already know the base case is true, so as our inductive step, let's differentiate both sides w.r.t $x$:

$$f^{(n+1)}(x)=\frac{x^{n+1}\left((-1)^nn!\frac{1}{x}\right)-(-1)^nn!\left(\ln(x)-H_n\right)(n+1)x^n}{\left(x^{n+1}\right)^2}=\frac{(-1)^nn!\left(1-(n+1)(\ln(x)-H_n\right)}{x^{n+2}}=\frac{(-1)^{n+1}(n+1)!\left(\ln(x)-H_{n+1}\right)}{x^{(n+1)+1}}$$

We have derived $P_{n+1}$ from $P_n$, thereby completing the proof by induction. Hence:

$$f^{(n)}(1)=\frac{(-1)^nn!\left(\ln(1)-H_n\right)}{1^{n+1}}=(-1)^{n+1}n!H_n$$

Shown as desired. :D
 
MarkFL said:
My solution:

We have:

$$f(x)=\frac{\ln(x)}{x}$$

Now, let's look at a few base cases to see if a pattern emerges:

$$f^{(1)}(x)=\frac{1-\ln(x)}{x^2}$$

$$f^{(2)}(x)=\frac{2\ln(x)-3}{x^3}$$

$$f^{(3)}(x)=\frac{11-6\ln(x)}{x^4}$$

$$f^{(4)}(x)=\frac{24\ln(x)-50}{x^5}$$

I'm ready to posit the inductive statement $P_n$:

$$f^{(n)}(x)=\frac{(-1)^nn!\left(\ln(x)-H_n\right)}{x^{n+1}}$$

Note: $H_n$ is the $n$th harmonic number, defined as:

$$H_n\equiv\sum_{k=1}^{n}\left(\frac{1}{k}\right)$$

We already know the base case is true, so as our inductive step, let's differentiate both sides w.r.t $x$:

$$f^{(n+1)}(x)=\frac{x^{n+1}\left((-1)^nn!\frac{1}{x}\right)-(-1)^nn!\left(\ln(x)-H_n\right)(n+1)x^n}{\left(x^{n+1}\right)^2}=\frac{(-1)^nn!\left(1-(n+1)(\ln(x)-H_n\right)}{x^{n+2}}=\frac{(-1)^{n+1}(n+1)!\left(\ln(x)-H_{n+1}\right)}{x^{(n+1)+1}}$$

We have derived $P_{n+1}$ from $P_n$, thereby completing the proof by induction. Hence:

$$f^{(n)}(1)=\frac{(-1)^nn!\left(\ln(1)-H_n\right)}{1^{n+1}}=(-1)^{n+1}n!H_n$$

Shown as desired. :D

What a nice solution, MarkFL, thankyou for your participation! :cool:
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top