| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 1 month |
| seen | May 5 at 16:03 | |
| stats | profile views | 41 |
Noob extraordinaire
|
May 24 |
comment |
How can I resolve a matrix of 13 rows and 40 columns? Try online matrix calculators. There most certainly should be some. |
|
May 21 |
comment |
Derivative of a weird Integral and Derivative of a Function Hi Teckizt. You have to notice a pattern for the derivative part. First derivative is $1/(x-1)^2$. The third is $((3-2x)x^2)/(x-1)^2$. The four is $((4-3x)x^3)/(x-1)^2$. Notice the pattern? |
|
May 19 |
comment |
How to prove inequality So is $d=3$? or $a,b,c,d$ are any elements of $\mathbb{N}$? |
|
May 17 |
comment |
Find all positive integers $L$, $M$, $N$ such that $L^2 + M^2 = \sqrt{ N^2 +21}$ Dammit Marvis, you beat me to it haha. |
|
May 13 |
comment |
Eigenvalues of a matrix $A$ such that $ A^2=0$. @froggie Yes you are correct. The only is unnecessary there. |
|
May 13 |
comment |
Eigenvalues of a matrix $A$ such that $ A^2=0$. @froggie I think it is. mathresource.iitb.ac.in/linear%20algebra/proof10.3.2.html |
|
May 13 |
comment |
Eigenvalues of a matrix $A$ such that $ A^2=0$. @preeti It will be diagonalizable with entries from $R$ only if the $nxn$ matrix is symmetric with $n$ distinct eigenvalues. |
|
May 11 |
comment |
Linear Algebra Text Hi Nunoxic. I added Strang. I think that one complements well with engineering applications. EDIT: I also see that you chose it too! |
|
May 7 |
comment |
Series Solution Near Ordinary Points for Second Order Differential Equations Haha, nice few people recognize the reference. |
|
May 7 |
comment |
Series Solution Near Ordinary Points for Second Order Differential Equations Thanks Jon. The only reason why I got stuck was because the simplification threw me off. It was late and I didn't even think to simplify (in fact I thought it was already simplified). Anyway, thanks again. |
|
May 6 |
comment |
Please help with derivative question Deniz, once you get the answer that you were looking for, please accept the answer with the "check" sign to the left of the question. This not only gives you a higher acceptance rate, but it also gives credit to the people giving the best answer. |
|
May 6 |
comment |
Prove that you can form at most $n$ same sized intersections of $m$ subsets of an $n$ element set. Ah I see. Thank you. Also, can you define semi-definite and definite. |
|
May 6 |
comment |
Prove that you can form at most $n$ same sized intersections of $m$ subsets of an $n$ element set. Hi Austin. I'm a little confused on your terminology. Could you please elaborate from "Letting M...". |
|
May 6 |
comment |
Prove that you can form at most $n$ same sized intersections of $m$ subsets of an $n$ element set. Thanks! Just one question, what does the ∪iCi at the end mean? I'm not sure I understand that notation. |
|
May 5 |
comment |
A game: Fibonacci sequences and probability. That's one way to say it. |
|
Apr 22 |
comment |
Using linear algebra, how is the Binet formula (for finding the nth Fibonacci number) derived? I'm truly, really sorry, but I'm not sure if I'm able to follow you. |
|
Apr 22 |
comment |
Using linear algebra, how is the Binet formula (for finding the nth Fibonacci number) derived? I haven't done eigenvectors yet (I do that in about a week in my L.A. course). Is there a way to derive all that without using those concepts? |
|
Apr 15 |
comment |
The rank of a linear transformation/matrix Oh duh. Oh my I feel very dumb now. |
|
Apr 15 |
comment |
The rank of a linear transformation/matrix Ah I see. Is there a proof to that? |
|
Apr 15 |
comment |
The rank of a linear transformation/matrix Again, thanks so much. For some reason the mn thing was throwing me off a great deal (I had read it somewhere online and for the life of me couldn't find what it meant). But apparently it has nothing to do with the rank-nullity theorem, so I believe it's all good now. |