Kumar
Reputation
682
Next privilege 1,000 Rep.
Create new tags
 Mar 24 awarded Inquisitive Mar 1 comment Finding the Basis of the Subspace U Note that last vector is sum of first three, i.e, given set of vector are linearly dependent. Feb 29 answered Petersen graph is tripartite Feb 29 revised Bases for $\mathbb{F}_2$ and for $M_{2\times2}(\mathbb{F})$ formatting Feb 29 suggested approved edit on Bases for $\mathbb{F}_2$ and for $M_{2\times2}(\mathbb{F})$ Feb 26 revised MLE for a uniform distribution Improved formatting Feb 26 suggested approved edit on MLE for a uniform distribution Feb 26 awarded Custodian Feb 26 reviewed No Action Needed Showing that an element generates the kernel Feb 24 answered Column Space vs Span and minimum size of a set of vectors to guarantee a vector is in span? Feb 22 asked Trapezoid graph representation Feb 15 accepted Is it true that sequence of non negative reals converging to one can not have initial term zero Feb 15 comment Is it true that sequence of non negative reals converging to one can not have initial term zero but limit is zero. Feb 15 revised Is it true that sequence of non negative reals converging to one can not have initial term zero deleted 1 character in body; edited title Feb 15 comment Is it true that sequence of non negative reals converging to one can not have initial term zero Sorry I missed [0,1] and limit one Feb 15 revised Is it true that sequence of non negative reals converging to one can not have initial term zero edited body Feb 15 asked Is it true that sequence of non negative reals converging to one can not have initial term zero Jan 12 comment Given a graph $G = (V, E)$, prove $e \leq \frac{n(n-1)}{2}$ for all $n$ Induction hypothesis: If $G$ has $k$ vertices then it has at most $k(k-1)/2$ edges. Suppose if we add another vertex then it can create at most $k$ new edges. So the total number of edges in $k+1$ vertex graph is at most $k+ k(k-1)/2=k(k+1)/2$ Jan 10 awarded Yearling Jan 10 accepted Interval order dimension of a Poset