356 reputation
212
bio website pavel.kabir.ru
location Moscow, Russia
age 22
visits member for 3 years, 3 months
seen Oct 21 '13 at 16:53

Student at the Software Department of the Higher School of Economics.

Prefer C#, Java and Objective-C, ordered descending.

Know a little bit about C++.

Trying to keep up with the community.


Jul
2
awarded  Curious
Oct
21
comment Interpolation of a logarithmic function
The task is just "find". And I may obviously interpolate and I may obviously min-square. But in the case of interpolation I only need two points, don't I?
Oct
21
asked Interpolation of a logarithmic function
Sep
9
revised Probability of a sorted sequence
added 230 characters in body
Sep
9
comment Probability of a sorted sequence
Actually, Marc, you get a credit for inspiring me to write a blog post about that: pkabir.ru/2013/09/09/can-a-random-array-happen-to-be-sorted-ii
Sep
8
comment Probability of a sorted sequence
Great explanation, thanks!
Sep
8
accepted Probability of a sorted sequence
Sep
8
asked Probability of a sorted sequence
Sep
8
comment Fraction of ordered sequences among all sequences
Michael, brilliant result, thanks, though (sorry for bad problem formulation) not what I expected :) I have to think about that one - because I really presumed that $n$ is not a variable but a fixed number (and $k$ as well). Different elements means that the elements inside the sequence are different.
Sep
8
accepted Fraction of ordered sequences among all sequences
Sep
7
comment Array sort input
Yup, distinct. Assume $k > n$.
Sep
7
comment Fraction of ordered sequences among all sequences
And $k \choose n$ ways to choose numbers from $A$? So $|O| = {k \choose n}$ ?
Sep
7
asked Fraction of ordered sequences among all sequences
Sep
7
asked Array sort input
Sep
7
comment Unique inputs of size n
Thanks for giving some aid! Why does it miss $n!$ ? If every number is unique $(r = 0)$, there is exactly $k!$ permutations of them, so my formula seems correct.
Sep
6
asked Unique inputs of size n
Apr
1
awarded  Notable Question
Jun
8
awarded  Caucus
May
19
awarded  Tumbleweed
May
7
accepted Why are generators of $Z^{*}_p, p=c \cdot 2^k + 1$ so small?