Reputation
327
Top tag
Next privilege 500 Rep.
Access review queues
 Aug21 comment Basic probability counting @Omnomnomnom Thanks, I'll watch it right know! Aug21 comment Basic probability counting @RossMillikan It will be 16C5 * (1/8)^5 * (7/8)^11 ? Aug21 comment Basic probability counting Thanks Ross for your answer. I have one question. Can you recommend me a book to learn how to count this things. The one I'm using is not good for counting. Thank you very much. Apr17 comment Smallest and largest values of $\|\vec{v}-\vec{w}\|$ @Berci Thanks :) Great to hear that. I have one question. Should I delete the question or can I let it in case any one found it valuable? Apr17 comment Shortest Vector for which Dot Product = x + 2y = 5. (Strang P21 1.2.26) Although I can see your point and thank you for that (+1) these seem like a long workaround. But thanks. Apr17 comment Shortest Vector for which Dot Product = x + 2y = 5. (Strang P21 1.2.26) Thanks. Although I didn't derive since college this is a great and simple way to solve the problem (more than the calculus-free approach that @user12477 proposed). +1 Apr17 comment Shortest Vector for which Dot Product = x + 2y = 5. (Strang P21 1.2.26) (1,3) will result in a greater magnitude vector than (1,2). So it can't be. Apr16 comment Geometry of perpendicular vectors Thanks for your vey comprehensive answer. I do the exercise as you suggest, it seems from the results that the orthogonal vectors to both will be the span of precisely {1, 0, -1} and such they'll be a line. Also your definition helps me a lot. Thanks! Apr10 comment Find area of triangle (given its equations) Thank you. A very clear explanation. I solve the problem, the area is 16 Sep9 comment Triples algorithm complexity Now I see, thanks! +1 Feb27 comment Is this recurrence $O(n^2)$? @BrianM.Scott Thanks. I edit my question. I'm sorry but I'm not a native english speaker so I thought that was the correct translation. One more thing, given that there is not an annihilator for the logarithm is there anything else I can do to prove it without induction? Feb27 comment Is this recurrence $O(n^2)$? @anon can you provide details about your probe by induction (I'm not so agile with that method for probing recurrences). Feb27 comment Is this recurrence $O(n^2)$? @anon 4. Comes from a nullator table. $$gets null with (E-1);$$ with $(E-1)^2$; $<2n+digit>$ with $(E-1)^2$ and so on. (Excuse my mathematical informality but I'm an engineering student not a mathematician). Feb24 comment Pretty simple question about running time Thanks @ArturoMagidin didn't know about Lambert's W function. Actually that's the solution. Feb18 comment Why this subset of $\mathbb{R}^3$ is not a subspace? So, It was kinda simple :( I'm sorry but didn't knew how to test it. Feb16 comment Orthogonal vectors with given magnitude Ummm now I see, the free parameters are the parameters of the general solution. Thanks again. Feb16 comment Orthogonal vectors with given magnitude Thank you very much David. Just one more thing. Why do you say the system has two free parameters? I mean, doesn't has three including also v3? Feb5 comment If $A^2 = I$ (Identity Matrix) then $A = \pm I$ Thank you @Martin Wanvik, pretty clear explanation. Aug26 comment Power a Matrix (Without calculating) Well indeed I have the "feeling" that given that 1 only changes on its sig then its the same the power of 3 that the power of 2001 but I'm not sure. I'm correct? Aug24 comment Cartesian equation with just one vector Thanks joriki. Do you know any book maybe more soft than fraleigh's linear algebra (with I'm currently using 'cause was the used where I get my bachelors degree). I'm a lawyer that (for weird reasons) build software and likes maths and want to self-study them as much as I can. I don't know if the book election was fine but maybe you could provide me a more useful reference.