314 reputation
113
bio website
location
age
visits member for 1 year, 4 months
seen 21 mins ago

16h
accepted Using log of function to determine orders of growth
Apr
13
comment Using log of function to determine orders of growth
Let $f(n) = n^4, g(n) = n^2$. The following properties hold: $\log(f) \in \Theta(\log(g))$, $f \in O(g)$. But if we let $f(n) = n^2, g(n) = n^4$, then $\log(f) \in \Theta(log(g))$, and $f \in \Omega(g)$. So just given info about $\log(f), \log(g)$, I don't think I can infer anything about the complexity of $f$ w.r.t. $g$?
Apr
10
awarded  Popular Question
Apr
5
revised A proportionality puzzle
more descriptive title
Apr
5
suggested suggested edit on A proportionality puzzle
Mar
15
awarded  Critic
Mar
11
awarded  Popular Question
Feb
24
accepted Solving the recurrence $T (n) = \sqrt{n} T(\sqrt{n}) + O (n)$
Feb
24
comment Solving the recurrence $T (n) = \sqrt{n} T(\sqrt{n}) + O (n)$
@Did To be honest, your answer was a little above my comprehension level. I realized my mistake was that there aren't $n^{1/2^k}$ problems at level $i$. For example, there are $n^{3/4}$ problems at the second level. But your answer is correct, and complete so I will accept it.
Feb
23
comment Computing digits of number in another base
yes I completely understand that. But my question is why does is the algorithm mathematically correct (intuitively, perhaps)?
Feb
23
asked Computing digits of number in another base
Feb
20
accepted How to show $i^{-1} = -i$?
Feb
19
asked How to show $i^{-1} = -i$?
Feb
19
asked Solving the recurrence $T (n) = \sqrt{n} T(\sqrt{n}) + O (n)$
Feb
6
awarded  Popular Question
Jan
31
asked Using log of function to determine orders of growth
Dec
15
asked Understanding formula for max number of data sortable in two passes with merge sort
Dec
13
awarded  Yearling
Nov
22
revised Linear algebra: Matrix multiplication problem
typeset the problem
Nov
22
suggested suggested edit on Linear algebra: Matrix multiplication problem