Recent content by flufypancakes

* means "times" as in 2*2=4

x is a vector - (x1,x2, ..., xn)_transpose (i.e. a column vector). so when we have x_transpose*x we have x1^2+ x2^2+...+xn^2 = norm(x)^2. right... now what's x*x_transpose, i.e. column times the row? is it an n-by-n matrix? actually now that I'm finished typing it I'm pretty sure it is...

the asymptotic lower bound for sorting n elements is n*log(n). what about sorting a set of n elements when you know that they only take on k distinct values? does n*log(k) sound right?

never mind, got it!

anyone knows what's sinh(x)*sin(x)? or sinh(x)*cos(x)? i get sinh(x)sin(x) = 1/2[cos(x[i-1]) + cos(x[i+1])], but that doesn't help me much. any suggestions?

already got it, never mind. you guys suck...

i thought i understand it but i guess i don't... you can expand a function in cosine f.s., sine f.s. and complete f.s. on some [0..L]. i thought that the coefficients a_n and b_n for complete expansion would come from sines and cosines respectively, but i guess that wouldn't make sense...

i'm not sure what mistake you fellas are talking about... is it that zpconn assumed the constants to be positive? that actually WAS an assumption i forgot to mention, so I'm fine with that. and what's all that "hints only" policy? this problem came up as a possible shortcut in designing a more...

thanks! god bless the scots for inventing logarithms

what is the limit: lim (1 - c_1 * epsilon) ^ (c_2/epsilon) as epsilon-->0, c_1 and c_2 are const.

take home exam urgent latex help! hi! i don't know anything about latex, but i need pictures a matrix: it is a tridiagonal matrix with (1-2lambda) on the main diagonal (except for the last row where it's 1-lambda) and lambdas above and below: [(1-2*lambda) lambda 0 0 ........ 0]...