Here are some problems in calculus which i am not being able to solve:
1. Evaluate: n→∞lim2n1log(n2n)
2. Consider the following sequence of positive integers regarding ai
a1=1 and an=n(an−1+1) for all n≥2.
Calculate: n→∞lim(1+a11)(1+a21)…(1+an1)
3.Let f:R→R be function that is differentiable n+1 times for some positive integer n. The ith derivative is denoted by fi. Suppose:
f(1)=f(0)=f1(0)=f2(0)=⋯=fn(0)=0
Prove that: fn+1(x)=0
4.Let f be a real valued differentiable function on the real line R such that x→0limx2f(x) exists, and is finite. prove that: f′(0)=0
#Calculus
#Limits
#Differentiation
#Tough
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
2) limn→∞(a1a1+1a2a2+1...anan+1
an−1−1=nan
Thus,
limn→∞(2a23a3....n+1an+1.a1a2...an1
=limn→∞(n+1)!an+1=limn→∞n!1+an
=limn→∞n!1+n!an=limn→∞n!1+(n−1)!1(n−1)!an−1
limn→∞n!1+(n−1)!1+(n−2)!1+....(1)!1+(1)!a1
=e as a1=1
Log in to reply
SUPERB! :D
Great :D
In 1st use limit as a sum
We will first cancel one n!
Now it becomes
limn→∞n1log(1.2.3...n(n+1)(n+2)....(n+n))
limn→∞2n1r=1∑nlog(rn+r)
Changing summation into integration
21∫01log(x1+x)dx
Now this can be solved easily
4th is easy if limit exist then it is 00 form Applying L-hospital 2xf′(x) so this should also be 00 because limit exist hence
f′(0)=0
2nd looks interesting I'll try it
Log in to reply
for the 4th one.. that is exactly what i thought.. but i was confused that it might be incorrect.. are you sure that method is right?
Log in to reply
Yes :), what's the answer to 2nd?
Log in to reply
e
the answer given is@megh choksi @Krishna Sharma @Sandeep Bhardwaj ..any idea as to how to approach the 3rd one?
Log in to reply
I posted a solution just now, and I think it works. It seems too easy though, which is troubling :<
3: I don't know if this is a valid proof:
f(n+1)(x)=0 iff f(n)(x)=Cn where Ci are some arbitrary constants. However, f(n)(0)=0; because f(n)(x)=f(n)(0)=0 for all x∈R, therefore, f(n)(x)=Cn=0.
Repeating the same argument for n−1, n−2, and so on, we see that it must be true that f(x)=0 and hence f(n+1)(x)=0.
Logically it seems sound:
∀n∈Z,x∈R(f(n+1)(x)=0∧f(n)(0)=0⟷f(n)(x)=Cn∧f(n)(0)=0⟷f(n)(x)=0)
Log in to reply
Using PMI
Log in to reply
What's PMI?
Log in to reply
Log in to reply
n+1.
Yeah, it's pretty much induction but in reverse with base case