Reputation
16,789
Top tag
Next privilege 20,000 Rep.
Access 'trusted user' tools
Badges
2 34 80
Impact
~697k people reached

2d
answered A bipartite graph like $G(X,Y)$ such that $|X|=|Y|=k$ and $\delta(G) \gt \frac {k}{2}$ is Hamiltonian.
2d
comment A bipartite graph like $G(X,Y)$ such that $|X|=|Y|=k$ and $\delta(G) \gt \frac {k}{2}$ is Hamiltonian.
I think your intuition about modifying Dirac is probably the right one.
Apr
27
revised Multiplying binomials to come up with $ y^8 - 256 $
edited title
Apr
27
comment Minimum number of marked squares on $n × n$ board
I missed the part about marked squares also being adjacent to a marked square. Still, you can delete the first and fourth squares of the last row.
Apr
25
revised Is speed an important quality in a mathematician?
typo
Apr
19
answered Why does {0,1,0,0,1,0,0,0,1,0,0,0,0,1…} diverge?
Apr
13
comment Mathematically representing combinations with integers uniquely?
You may as well leave the performance details. I don't think they detract from the discussion.
Apr
13
comment Power set of set of all integers $\Bbb Z$?
The power set of $S$ is the collection of all subsets of $S$. You do not need to "find" the power set, per se, but rather decide which of the sets $\{-3, -2, 1\}$, $\{4\}$, etc. also belong to the power set of $S$.
Apr
13
comment Mathematically representing combinations with integers uniquely?
You seem to be paying meticulous detail to efficiency. Do you have a particular application in mind? I'm just curious.
Apr
12
revised Induction Proof: If $B \subseteq A$, then $|B| \leq |A|$.
added 155 characters in body
Apr
11
reviewed Edit Explaining whether a function is injective/surjection ($f\colon\Bbb N\to P(\Bbb N)$)
Apr
11
revised Explaining whether a function is injective/surjection ($f\colon\Bbb N\to P(\Bbb N)$)
Title formatting updated
Apr
11
answered Explaining whether a function is injective/surjection ($f\colon\Bbb N\to P(\Bbb N)$)
Apr
8
comment Mathematically representing combinations with integers uniquely?
@mathreadler I've updated the scheme to "cycle through" the sets more naturally. You can start with 0, which corresponds to the empty set. Next is 1, which corresponds to the set $\{1\}$. Next is 2 (binary $10$), which corresponds to the set $\{2\}$, and so forth.
Apr
8
revised Mathematically representing combinations with integers uniquely?
added 39 characters in body
Apr
8
revised Mathematically representing combinations with integers uniquely?
added 39 characters in body
Apr
8
answered Mathematically representing combinations with integers uniquely?
Apr
8
revised For what value of constant a is function continuous
deleted 1 character in body
Apr
7
answered For what value of constant a is function continuous
Apr
7
awarded  elementary-set-theory