5,925 reputation
62584
bio website
location
age
visits member for 2 years, 11 months
seen 3 hours ago

Jan
24
revised Confusion about Hajós construction?
added 63 characters in body
Jan
6
revised Differentiating $1/(1-x)$ using the fact that $[x^n]'=nx^{n-1}$?
added 2 characters in body
Jan
5
revised Why the generating function of $\frac{2^K}{k!}$ is $e^{2x}$ instead of $e^{2^{x}}$?
added 168 characters in body
Jan
2
revised Is there only one continuous-everywhere non-differentiable funtion?
added 207 characters in body
Dec
26
revised What is the generating function to calculate the number of functions $f:\{1,2,3,4,5,6,7,8,9,10\}\to\{1,2,3,4,5,6,7\}$ with $|Im(f)|=4$?
added 14 characters in body
Dec
19
revised How to solve this kind of problem?
added 174 characters in body; edited tags
Dec
17
revised Does $\frac{0}{0}$ really equal $1$?
added 128 characters in body
Dec
17
revised is there a discipline of mathematics that studies graphical versions of various operations?
added 511 characters in body
Dec
17
revised Easy to read books on Graph Theory
added 581 characters in body
Dec
17
revised Easy to read books on Graph Theory
added 938 characters in body
Dec
17
revised Easy to read books on Graph Theory
added 938 characters in body
Dec
13
revised Evidence against Goldbach's Conjecture?
edited title
Dec
8
revised Easy to read books on Graph Theory
added 155 characters in body
Dec
3
revised How many ways can 25 red balls be put into 3 distinguishble boxes if no box is to contain more than 15 balls?
added 10 characters in body
Nov
28
revised How $a_{13}=0$ in $\begin{bmatrix} {2}&{1}&{0}\\ {1}&{3}&{5} \end{bmatrix}$?
added 4 characters in body
Nov
28
revised Why $f^{+}(v)-f^-(v) =val(f)$ if $v$ is the source?
added 213 characters in body
Nov
27
revised How many words can be written with $aabbbccdd$ such that no two equal letters are adjacent?
deleted 1 character in body
Nov
23
revised A small confusion in network flows (conservation constraints).
deleted 2 characters in body
Nov
15
revised A small doubt about slopes.
edited tags; edited title
Nov
13
revised Let $G$ be a simple graph. Show that $m\leq {n \choose 2}$, and determine when equality holds.
deleted 87 characters in body