9,237 reputation
31641
bio website
location
age 23
visits member for 3 years, 5 months
seen yesterday

Apr
9
comment For which values of $k$, we have $A = A^{-1}$?
@ellya it is not bad etiquette but if you fully answer very simple questions it is likely that you do more harm than good to the asker.
Apr
7
comment Given n ranging from 1 to 100, find sum of digits equal to half of arithmetic sum of 1 to 100
rec[100][2525] is not a valid statement. If you define "int x[123]" the maximal element you can access is "x[122]".
Mar
18
comment connected but not path connected?
You probably mean $0\leq x\leq1$ and $\frac{1}{2}\leq x \leq 1$?
Mar
17
answered Is there a limit for how “good” a numerical method can be?
Feb
28
awarded  Nice Answer
Feb
22
comment is it possible to generate a unique number given a set of N integers regardless of their permutation?
Integers can be sorted in linear time and you can't really expect a sublinear algorithm anyways.
Feb
21
comment Given a max flow on a graph, how do you determine the actual edges that belong to the minimal cut?
@VascoMota I updated the answer to be more clear: The edges leaving the connected component (which will be only saturated edges you removed from $G$ initially) will form a min cut.
Feb
21
revised Given a max flow on a graph, how do you determine the actual edges that belong to the minimal cut?
added 18 characters in body
Feb
21
answered Given a max flow on a graph, how do you determine the actual edges that belong to the minimal cut?
Feb
21
answered Is it easy to color 3-colorable triangle-free graphs?
Feb
20
comment Is it easy to color 3-colorable triangle-free graphs?
If it helps, deciding if a triangle-free graph of max-degree 4 is 3-colorable is np-complete ( dl.acm.org/citation.cfm?id=246916 ). If there was some polynomial algorithm to find an actual 3-coloring in triangle-free 3-colorable graphs, it could probably also be used to decide if a triangle-free graph is 3-colorable.
Feb
20
comment Discrete Mathematics Proof odd degree
What is eular's criticism?
Feb
20
comment Is it easy to color 3-colorable triangle-free graphs?
It would probably be better to ask this on cstheory.stackexchange.com as this seems to be a research-level question.
Feb
13
answered Function to change inputs from 0.5 to 1, to 0 to 1
Feb
13
comment Prove no real number satisfies $x^{2} = -1$
Show that $x^2 \geq 0$ for all real $x$. Look at 2 different cases.
Feb
13
comment Validity of my weird proof that $AB$ and $BA$ have the same eigenvalues?
Normally when the examiner rejects a proof, he should give an argument why he thinks the proof is insufficient or false.
Feb
6
awarded  Pundit
Feb
3
comment Prove: if $A$ is infinite set and $B$ is finite set then $\left| {A - B} \right| = \left| A \right|$
Thank you for the clarification, I thought you wanted to say the claim is actually false.
Feb
2
comment calculate how many Ring can cut from a sheet
What do you mean with "ring", an annulus?
Jan
31
comment Computationally proving a linear programming solution is unique?
@ThomasJRivera The solution is unique if and only if both $\min x_i$ and $\max x_i$ return the same solution for all $i$.