4,702 reputation
11339
bio website
location
age
visits member for 2 years, 8 months
seen yesterday

An expert is a man who has made all the mistakes, which can be made, in a very narrow field. (Niels Bohr)


Apr
26
reviewed Leave Open Ellipse Diagonal's Length/Equation
Apr
26
reviewed Reject suggested edit on Trailing Zeros Problem - What am I doing wrong?
Apr
26
reviewed Reject suggested edit on 1 to the infinty indeterminate limit
Apr
26
reviewed Approve suggested edit on Sum of Legendre symbols
Apr
25
reviewed Leave Open Reducing a double series into a single series
Apr
24
reviewed Close Need help with math and statistics.
Apr
24
reviewed Close Convergence problem in different norms
Apr
24
reviewed Leave Open Topology of $GL_n(F)$ for a discrete field.
Apr
24
reviewed Close Studying maths for physicists
Apr
24
reviewed Close Game theory:Baye's rule for tournament
Apr
24
comment Intuition on Wald's equation without using the optional stopping theorem.
@Did The English language is not my native language. I understood the expression 'rather moot' as meaning 'debatable'. But it can also be understood as 'irrelevant'.
Apr
24
awarded  Deputy
Apr
24
comment Intuition on Wald's equation without using the optional stopping theorem.
@Did, could you explain me better what becomes the debatable point in wald's equation?
Apr
24
reviewed Approve suggested edit on $ a+b+c+d=6 , a^2+b^2+c^2+d^2=12$ $\implies$ $ 36 \leq 4(a^3+b^3+c^3+d^3)-(a^4+b^4+c^4+d^4) \leq48 $
Apr
24
reviewed Reject suggested edit on The number of rational solutions to the cubic analogue of Pell's equation
Apr
24
accepted Intuition on Wald's equation without using the optional stopping theorem.
Apr
24
reviewed Close Establish that 7 is a primitive root of any prime of the form $p = 2^{4n} + 1$.
Apr
24
reviewed Close Prove if $f(x) = g(x)$ for each rational number x and $f$ and $g$ are continuous, then $f = g$
Apr
24
reviewed Close Showing that $f(x) = g(x)$ $\forall x$ if $f(r) = g(r)$ for all rationals $r$
Apr
24
reviewed Close Fermat's Equation