Reputation
Top tag
Next privilege 15,000 Rep.
Protect questions
Badges
3 37 87
Newest
 Yearling
Impact
~489k people reached

Oct
19
reviewed Reviewed The definition of a normal subgroup
Oct
19
reviewed Reviewed Show that there exists a bijection from $(A^B)^C$ into $A^{B \times C} $
Oct
19
reviewed Reviewed Martingale Decomposition
Oct
19
reviewed Reviewed Binary Logistic Regression Model Processing
Oct
19
reviewed Reviewed Definite Integral of $e^{ax+bx^c}$
Oct
19
reviewed Reviewed Comparison of nonlinear system solvers?
Oct
19
reviewed Reviewed Finding the limit of a function $n^{n}/e^{n^{3/2}}$
Oct
19
reviewed Reviewed Find if three points in 3-dimensional space are collinear
Oct
19
reviewed Reviewed G is an abelian group. Prove $G^{(n)}$ is a subgroup of G
Oct
19
reviewed Reviewed Where can I find a description of math language symbols?
Oct
19
reviewed Reviewed Problem with nonhomogeneous ODE
Oct
19
reviewed Reviewed group membership assignment by preferences - optimization problem?
Oct
19
reviewed Reviewed Maximizing a convex function with positive semidefinite constraint
Oct
19
reviewed Reviewed Can we define topology recursively?
Oct
19
reviewed Reviewed Solutions of the equation $ax+by=ab$
Oct
19
reviewed Reviewed diffeomorphism and hyperbolic periodic points
Oct
19
reviewed Reviewed A question about a proof that a compact subset is closed
Oct
19
reviewed Reviewed Algebra: Finding rate
Oct
19
reviewed Reviewed Prove that f is continuous
Oct
18
comment Can every recursive formula be expressed explicitly?
Define $f(0)=1$ and $f(n)=n f(n-1)$, for $n \geq 1$. Thus $f(n)=n!$. Is this "explicit"? It's a matter of opinion: some people say no, others say yes.