8. Let I[sub:3qzcjcp0]n[/sub:3qzcjcp0] = [integral from 0 to 1] (lnx)[sup:3qzcjcp0]n[/sup:3qzcjcp0] * dx, where n is a positive integer. Establish a reduction formula for I[sub:3qzcjcp0]n[/sub:3qzcjcp0], then deduce a formula for I[sub:3qzcjcp0]n[/sub:3qzcjcp0] and prove it by induction.
I think I got it but if someone could check my work that'd be great
first rewrite the integral as [integral from s to 1] (lnx)[sup:3qzcjcp0]n[/sup:3qzcjcp0] * dx
when s is approaching 0[sup:3qzcjcp0]+[/sup:3qzcjcp0]
taking the integral by parts:
u = (lnx)[sup:3qzcjcp0]n[/sup:3qzcjcp0], du = n(lnx)[sup:3qzcjcp0]n-1[/sup:3qzcjcp0] * 1/x *dx
dv = dx, v = x
so it is equal to x(lnx)[sup:3qzcjcp0]n[/sup:3qzcjcp0] {value at 1 minus value at s} - n[integral from s to 1] (lnx)[sup:3qzcjcp0]n-1[/sup:3qzcjcp0] * dx
x(lnx)[sup:3qzcjcp0]n[/sup:3qzcjcp0] {value at 1 minus value at s} approaches 0-0 as s approaches 0[sup:3qzcjcp0]+[/sup:3qzcjcp0] (I did the work and know this to be correct)
so we are left with (-n) * I[sub:3qzcjcp0]n-1[/sub:3qzcjcp0] which is the reduction formula
so:
I[sub:3qzcjcp0]n[/sub:3qzcjcp0] = -(n) * I[sub:3qzcjcp0]n-1[/sub:3qzcjcp0]
I[sub:3qzcjcp0]n-1[/sub:3qzcjcp0] = -(n-1) * I[sub:3qzcjcp0]n-2[/sub:3qzcjcp0]
I[sub:3qzcjcp0]n-2[/sub:3qzcjcp0] = -(n-2) * I[sub:3qzcjcp0]n-3[/sub:3qzcjcp0]
so I[sub:3qzcjcp0]n[/sub:3qzcjcp0]= -(n) * -(n-1) * -(n-2)... * -(n-(n+1)) * I[sub:3qzcjcp0]0[/sub:3qzcjcp0]
= (-1)[sup:3qzcjcp0]n[/sup:3qzcjcp0] * n! (I[sub:3qzcjcp0]0[/sub:3qzcjcp0] = 1) this is the formula for I[sub:3qzcjcp0]n[/sub:3qzcjcp0]
by induction: for n = 1 I[sub:3qzcjcp0]n[/sub:3qzcjcp0] = [integral from s to 1] lnx * dx = -1 (after going through by parts) = (-1)[sup:3qzcjcp0]1[/sup:3qzcjcp0] * 1!
assume I[sub:3qzcjcp0]n[/sub:3qzcjcp0] = (-1)[sup:3qzcjcp0]n[/sup:3qzcjcp0] * n!
for n+1: I[sub:3qzcjcp0]n+1[/sub:3qzcjcp0] = -(n+1) * I[sub:3qzcjcp0]n[/sub:3qzcjcp0] (by the reduction formula)
so I[sub:3qzcjcp0]n+1[/sub:3qzcjcp0] = -(n+1) * (-1)[sup:3qzcjcp0]n[/sup:3qzcjcp0] * n!
= (-1)[sup:3qzcjcp0]n+1[/sup:3qzcjcp0] *(n+1)!
so the statement I[sub:3qzcjcp0]n[/sub:3qzcjcp0] = (-1)[sup:3qzcjcp0]n[/sup:3qzcjcp0] * n! is proven for all integers n >= 1
Sorry, I don't know how to type in a more easily readable format. Can someone double-check my work quickly?
I think I got it but if someone could check my work that'd be great
first rewrite the integral as [integral from s to 1] (lnx)[sup:3qzcjcp0]n[/sup:3qzcjcp0] * dx
when s is approaching 0[sup:3qzcjcp0]+[/sup:3qzcjcp0]
taking the integral by parts:
u = (lnx)[sup:3qzcjcp0]n[/sup:3qzcjcp0], du = n(lnx)[sup:3qzcjcp0]n-1[/sup:3qzcjcp0] * 1/x *dx
dv = dx, v = x
so it is equal to x(lnx)[sup:3qzcjcp0]n[/sup:3qzcjcp0] {value at 1 minus value at s} - n[integral from s to 1] (lnx)[sup:3qzcjcp0]n-1[/sup:3qzcjcp0] * dx
x(lnx)[sup:3qzcjcp0]n[/sup:3qzcjcp0] {value at 1 minus value at s} approaches 0-0 as s approaches 0[sup:3qzcjcp0]+[/sup:3qzcjcp0] (I did the work and know this to be correct)
so we are left with (-n) * I[sub:3qzcjcp0]n-1[/sub:3qzcjcp0] which is the reduction formula
so:
I[sub:3qzcjcp0]n[/sub:3qzcjcp0] = -(n) * I[sub:3qzcjcp0]n-1[/sub:3qzcjcp0]
I[sub:3qzcjcp0]n-1[/sub:3qzcjcp0] = -(n-1) * I[sub:3qzcjcp0]n-2[/sub:3qzcjcp0]
I[sub:3qzcjcp0]n-2[/sub:3qzcjcp0] = -(n-2) * I[sub:3qzcjcp0]n-3[/sub:3qzcjcp0]
so I[sub:3qzcjcp0]n[/sub:3qzcjcp0]= -(n) * -(n-1) * -(n-2)... * -(n-(n+1)) * I[sub:3qzcjcp0]0[/sub:3qzcjcp0]
= (-1)[sup:3qzcjcp0]n[/sup:3qzcjcp0] * n! (I[sub:3qzcjcp0]0[/sub:3qzcjcp0] = 1) this is the formula for I[sub:3qzcjcp0]n[/sub:3qzcjcp0]
by induction: for n = 1 I[sub:3qzcjcp0]n[/sub:3qzcjcp0] = [integral from s to 1] lnx * dx = -1 (after going through by parts) = (-1)[sup:3qzcjcp0]1[/sup:3qzcjcp0] * 1!
assume I[sub:3qzcjcp0]n[/sub:3qzcjcp0] = (-1)[sup:3qzcjcp0]n[/sup:3qzcjcp0] * n!
for n+1: I[sub:3qzcjcp0]n+1[/sub:3qzcjcp0] = -(n+1) * I[sub:3qzcjcp0]n[/sub:3qzcjcp0] (by the reduction formula)
so I[sub:3qzcjcp0]n+1[/sub:3qzcjcp0] = -(n+1) * (-1)[sup:3qzcjcp0]n[/sup:3qzcjcp0] * n!
= (-1)[sup:3qzcjcp0]n+1[/sup:3qzcjcp0] *(n+1)!
so the statement I[sub:3qzcjcp0]n[/sub:3qzcjcp0] = (-1)[sup:3qzcjcp0]n[/sup:3qzcjcp0] * n! is proven for all integers n >= 1
Sorry, I don't know how to type in a more easily readable format. Can someone double-check my work quickly?