Reputation
697
Next privilege 1,000 Rep.
Create new tags
Badges
4 15
Impact
~11k people reached

5h
asked How limiting/ heavy is the “triangle inequality” assumption?
Feb
1
awarded  Popular Question
Jan
22
comment Bound for $\log { \binom{n}{i}}$?
Following your idea, why can't/don't we say $\log \binom{n}{k} \sim k \log n/k $? (or under what conditions $\binom{n}{k} \sim n^k / k! $ is a sensible approximation? )
Jan
22
comment Bound for $\log { \binom{n}{i}}$?
hmm well both $k$ and $n$ are important for me, asymptotically.
Jan
22
comment Bound for $\log { \binom{n}{i}}$?
shouldn't it be $k \log n - k \log k $? (instead of $\log n$)?
Jan
22
revised Bound for $\log { \binom{n}{i}}$?
added 6 characters in body
Jan
22
revised Bound for $\log { \binom{n}{i}}$?
added 456 characters in body
Jan
22
revised Bound for $\log { \binom{n}{i}}$?
added 91 characters in body
Jan
22
asked Bound for $\log { \binom{n}{i}}$?
Dec
16
awarded  Inquisitive
Dec
6
asked Is it true that $\sum_{i=1}^n \log (n/i) = o(n)$?
Nov
28
accepted Why $ \sum_{t=2}^T \frac{1}{t^{\alpha-1}} \leq \frac{1}{\alpha-2} $?
Nov
28
asked Why $ \sum_{t=2}^T \frac{1}{t^{\alpha-1}} \leq \frac{1}{\alpha-2} $?
Nov
26
comment Expected number of vertex-pairs without any simple path in between
For two fixed vertices, the probability that there is a path between them of length at most $k$ is: $\sum_{l=1}^k { n-2 \choose l-1 } (l-1)! p^{l} $. Am I correct?
Nov
26
comment Expected number of vertex-pairs without any simple path in between
Right. Any other suggestions for me?
Nov
26
asked Expected number of vertex-pairs without any simple path in between
Nov
25
asked Probability having a path of length less than a fixed number
Nov
22
accepted How big the maximal decrease in consecutive elements of a sequence?
Nov
21
comment How big the maximal decrease in consecutive elements of a sequence?
@A.S.didn't get your point.
Nov
21
comment How big the maximal decrease in consecutive elements of a sequence?
@MartinR corrected.