Reputation
5,948
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
6 22 44
Impact
~267k people reached

May
26
revised Expected tail and head length of $\rho$ for a finite random function
deleted 11 characters in body
May
18
awarded  Nice Answer
Apr
28
answered Pythagorean theorem and its cause
Apr
24
comment Expected length of a sequence that contains all words of a given length.
I know I'm getting old when a related question was asked by me and I have no memory of asking it.
Apr
24
asked Expected length of a sequence that contains all words of a given length.
Apr
21
comment Prove or disprove isomorphic graphs
It should be classified as "group theory" instead of "graph theory." Even if this problem came from graph theory, your presentation of it leaves no trace of that evolution and you've given it as a pure group theory problem.
Apr
21
answered Prove or disprove isomorphic graphs
Apr
10
answered Classifying Algebraic Structures as Fields
Mar
25
comment What do the symbols d/dx and dy/dx mean?
The confusion often arises from the fact that many writers call $dy/dx$ a "symbol" as if it were atomic, but then later start doing algebra with it. This leads to the question, "well, then what is $dy$ really?"
Mar
10
comment Summation of element of a subset and divition
I think your two added assumptions are reasonable enough to make the original question interesting. But 8 feels quite arbitrary now.
Mar
8
comment Summation of element of a subset and divition
Technically, it is true: the empty set is always a subset of $A$ and 8 divides 0.
Mar
6
revised How to prove $\det(e^A) = e^{\operatorname{tr}(A)}$?
edited title
Mar
1
comment Continued Fraction [1,1,1,…]
You're welcome. This is the cutest (and most elementary) solution I could think of. Good luck.
Feb
26
answered Continued Fraction [1,1,1,…]
Feb
26
comment Continued Fraction [1,1,1,…]
I think this is the argument the OP already has but is worried about. But thanks for the lovely typesetting nonetheless. :)
Feb
16
awarded  Yearling
Feb
14
answered Prove that if $n$ is a composite and $p \gt \sqrt[3]n$, then $n/p$ is a prime.
Jan
19
comment Given $N$, find $ab = N$ with $a$ and $b$ as close as possible
Correct, which is why I was careful to not claim that it was. If you know an efficient (meaning poly-time) factoring algorithm, please send me a private note and we'll write a paper. Or start a company. Or be captured/assassinated before we can do either...
Jan
19
comment Given $N$, find $ab = N$ with $a$ and $b$ as close as possible
Factoring is thought to be hard. Knapsack is NP-Hard, and therefore thought to be hard. If $P = NP$ then all of these are poly-time solvable, but that's unlikely. The best known general factoring algorithms are super-polynomial (on a conventional computer; quantum algorithms are polynomial-time).
Jan
19
answered Given $N$, find $ab = N$ with $a$ and $b$ as close as possible