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

Nov
19
revised How to simplify this composition function $g(x)=\underset{n\text{ times}}{\underbrace{f \circ f \circ f \circ f\circ f \circ \cdots\circ f}}(x)$?
latex
Nov
19
comment Permutation & Combination of letters
@mihir: A picture of a text is not a good idea. This is not wanted here. He can type the original text to this post. If he needs assistance in formatting the text he will get help here. If one selects the context menu (right mouse button) 'Show -Math -> TeX Commands' of a TeX graphic, one can see the TeX command that generates this formula. TeX commands must be preceded and terminated by a dollar character (or two dollar characters is it should be positioned in a separate line)
Nov
19
comment Permutation & Combination of letters
@mihir: a picture of the letters and the envelopes?
Nov
19
revised Permutation & Combination of letters
typos. Had to change title, because title without typos already exists
Nov
15
comment Is the minimum of two metrics is again a metric?
what properties of a metric does the minimum have? Wha properies are you not able to prove?
Nov
14
comment Show that $e^x=1+x+\frac{x^2}{2!}+…+\frac{x^n}{n!}+R_{n+1}$
and how is $e^x$ defined?
Nov
12
comment Proof that $ n^{n} \leq {(n+1)}^{n} $
to prove $(1+1/n)^n \geq 1^n$ by induction is almost the same as to prove $n^{n} \leq {(n+1)}^{n}$. So this is not a proof at all. But it seems that some readers are excited by the formulas
Nov
12
revised Prove binomial equation
latex
Nov
12
comment Proof that $ n^{n} \leq {(n+1)}^{n} $
to prove a simple statement by use a rather complex one seems not a very useful idea to me.
Nov
12
answered Proof that $ n^{n} \leq {(n+1)}^{n} $
Nov
12
comment Proof that $ n^{n} \leq {(n+1)}^{n} $
and why $(1+1/n)^n \geq 1^n$? Because exponentiation is an increasing function? Then $(n+1)^n \geq n^n$ follows immediately.
Nov
12
revised Calc 2 Limit Comparison Test
latex
Nov
1
comment How many passwords can be formed?
the throughput my connection to the internet is too weak. I cannot watch videos. but I think it is a sequence of points of a 3x3 grid such that a line segment that connects two consecutive points of this segment does not contain a point from this grid. But maybe I am wrong. Is the length of the sequence limited to 9? It would be fine if you precisely describe the password algorithm..
Nov
1
comment How many passwords can be formed?
I have seen this but I don't have this. Can you describe the allowed passwords/patterns? What are consecutive dots?
Oct
28
answered How to show $a+b=b+a$ correctly?
Oct
28
comment Associative property needed?
@Dave I don't think so. Operators are usually evaluated from left to right if no other rules apply. So $a\cdot b\cdot c$ is defined as $(a\cdot b)\cdot c$.
Oct
14
comment Dimensions in geometry
You are talking about a square (or a rectangl) ABCD.
Oct
14
revised How to prove this inequality? What method should I choose?
added 1350 characters in body
Oct
14
comment How to prove this inequality? What method should I choose?
@tony added proof using binomial theorem
Oct
14
revised How to prove this inequality? What method should I choose?
added proof based on binomial theorem