10h
revised Keys inside closed boxes, a question on probability
inner sum
10h
answered Keys inside closed boxes, a question on probability
13h
revised How many $n\times m$ binary matrices are there, up to row and column permutations?
classic approach
16h
revised How many $n\times m$ binary matrices are there, up to row and column permutations?
bound
16h
revised How many $n\times m$ binary matrices are there, up to row and column permutations?
faster multiset implementation
16h
revised How many $n\times m$ binary matrices are there, up to row and column permutations?
add the function w
17h
revised How many $n\times m$ binary matrices are there, up to row and column permutations?
spell me
17h
revised How many $n\times m$ binary matrices are there, up to row and column permutations?
linkage
17h
answered How many $n\times m$ binary matrices are there, up to row and column permutations?
1d
answered How many arrangements of $\{a,2b,3c,4d, 5e\}$ have no identical consecutive letters?
1d
revised find $O$ and $\Omega$ bounds as tight as possible for $T(n)=n+T(\frac n 2)+T(\frac n 4)+T(\frac n 8)+…+T(\frac n {2^k})$
geometric series
2d
comment find $O$ and $\Omega$ bounds as tight as possible for $T(n)=n+T(\frac n 2)+T(\frac n 4)+T(\frac n 8)+…+T(\frac n {2^k})$
This conjecture holds for the upper bound that I calculated above because for a string of one digits $\lfloor\log_2 n\rfloor+1$ is asymptotically $\log_2 n$. This also agrees with the accepted definitive answer.
2d
comment find $O$ and $\Omega$ bounds as tight as possible for $T(n)=n+T(\frac n 2)+T(\frac n 4)+T(\frac n 8)+…+T(\frac n {2^k})$
(+1) Another useful Akra-Bazzi computation.
2d
revised find $O$ and $\Omega$ bounds as tight as possible for $T(n)=n+T(\frac n 2)+T(\frac n 4)+T(\frac n 8)+…+T(\frac n {2^k})$
wrong link
2d
revised How many elements of order $k$ are in $S_n$?
moebius inversion
2d
answered find $O$ and $\Omega$ bounds as tight as possible for $T(n)=n+T(\frac n 2)+T(\frac n 4)+T(\frac n 8)+…+T(\frac n {2^k})$
2d
revised Finding the asymptotic behavior of the recurrence $T(n)=4T(\frac{n}{2})+n^2$ by using substitution method
correct typo
Jul
27
answered Finding the asymptotic behavior of the recurrence $T(n)=4T(\frac{n}{2})+n^2$ by using substitution method
Jul
26
awarded  Revival
Jul
26
revised Finding recurrence and an algorithm to represent it
fix bug