# Randolf R-F

less info
reputation
313
bio website location Bogota, Colombia age 28 member for 3 years, 3 months seen 2 days ago profile views 100

"When you're doing something you're passionate about, stress becomes a feature not a bug."

# 91 Actions

 Sep19 revised Pretty simple question about running time deleted 94 characters in body Sep19 revised If $A^2 = I$ (Identity Matrix) then $A = \pm I$ deleted 273 characters in body Sep9 accepted Triples algorithm complexity Sep9 comment Triples algorithm complexity Now I see, thanks! +1 Sep9 revised Triples algorithm complexity added 2 characters in body Sep9 revised Triples algorithm complexity added 1 characters in body Sep9 awarded Critic Sep9 accepted Why this subset of $\mathbb{R}^3$ is not a subspace? Sep9 asked Triples algorithm complexity Aug24 awarded Yearling Apr26 accepted Area of a geometric configuration Apr25 revised Area of a geometric configuration added 117 characters in body Apr25 asked Area of a geometric configuration Feb27 accepted Is this recurrence $O(n^2)$? 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 revised Is this recurrence $O(n^2)$? added 3 characters in body 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). Feb27 asked Is this recurrence $O(n^2)$? Feb24 accepted Pretty simple question about running time