Reputation
Top tag
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
13 33
Newest
 Nice Answer
Impact
~108k people reached

Feb
4
revised How to prove that $k^3+3k^2+2k$ is always divisible by $3$?
typos
Feb
4
awarded  Nice Answer
Feb
4
revised How to prove that $k^3+3k^2+2k$ is always divisible by $3$?
adding a tag
Feb
4
answered How to prove that $k^3+3k^2+2k$ is always divisible by $3$?
Jan
27
revised $x=2t^3-9t^2+12t+6$ where $x$ is the position of a body at anytime $t$.
articles
Jan
19
comment How to write a definition of less than $<$?
I am not sure if there is a fundamental difference between your answer and my answer but at least you were able to avoid the word "finally".
Jan
19
comment How to write a definition of less than $<$?
@daOnlyBG Maybe it seems to be concise because it uses not much characters. But you first have to define the + binary operator. The answer of Nephente is similar to this answer but avoids + and uses only the successor operator.
Jan
19
comment How to write a definition of less than $<$?
@TheChaz: what is wrong with finally? Is it not possible to use this word here?
Jan
19
revised How to write a definition of less than $<$?
typo
Jan
19
comment How to write a definition of less than $<$?
@fleablood you are right (I posted an answer that uses this definition). But your comment and my answer also use $\lt$ in its own definition. So I think the comment of TheChaz is not well stated.
Jan
19
revised How to write a definition of less than $<$?
added 232 characters in body
Jan
19
comment How to write a definition of less than $<$?
@TheChaz that can happen in a recursive definition.
Jan
19
answered How to write a definition of less than $<$?
Jan
17
revised How to find the length of a line in a tetrahedron
latax; missing brace added
Jan
15
awarded  Custodian
Jan
15
reviewed Reopen Solve the equation $2φ(x)=x $ for $x\in\mathbb N^+.$
Jan
15
revised Find the number of bicycles and tricycles
edited title
Jan
13
revised Congruences and prime numbers
formulas to latex
Jan
12
reviewed Close Given a complete graph of $n$ vertices $K_n$ (has all possible edges – one edge between pair of vertices).
Jan
12
comment How to solve instant insanity puzzle with graphs.
@SteveKass I related your answer to the question "how can I find the path from the graph I attached".