Why was I not rewarded with the reputation for the 3 upvotes?
I've found some questions and those two badges "Epic" and "Legendary" regarding the "daily reputation cap". What is it and how can I hit it?
Induction on a sum The left hand side has terms involving  $\binom{n}{m}= \dfrac{n!}{(n-m)!m!}$    $$1+\dfrac{1}{2}\binom{n}{1} +\frac{1}{3}\binom{n}{2}+...........+\frac{1}{n+1}\binom{n}{n} = \dfrac{2^{n+1}-1}{n+1}$$  I've done induction and proved $P(0)$ holds and also $P(1),P(2)$ holds (Just in case)  Now I've found $P(K+1)$ so the sum on the left is going to equal $\dfrac{2^{n+1}-1}{n+1}$ + $\dfrac{1}{n+2}$  and the right hand side is going to equal $\dfrac{2^{n+2}-1}{n+2}$  My problem is coming with the algebra though. I can't get those sides to equal. I can't get rid of the $n+1$ in the denominator.   Anyone have any ideas for me? They'd be much appreciated!  P.S. Someone gave me a hint and said that you can use the binomial theorem to solve this. proper usage of didn't had or didnt have Atiyah Macdonald, Exercise 8.3. Let $k$ be a field and $A$ a finitely generated $k$-algebra. Prove that the following are equivalent:   (1) $A$ is Artinian.   (2) $A$ is a finite $k$-algebra.   I have a question in the proof of (1$\Rightarrow$2): By using the structure theorem, we may assume that $(A,m)$ is an Artin local ring. Then $A/m$ is a finite algebraic extension of $k$ by . Since $A$ is Artinian, $m$ is the nilradical of $A$ and thus $m^n=0$ for some $n$. Thus we have a chain $A \supseteq m \supseteq m^2 \supseteq \cdots \supseteq m^n=0$. Since $A$ is Noetherian, $m$ is finitely generated and hence each $m^i/m^{i+1}$ is a finite dimensional $A/m$-vector space, hence a finite dimensional $k$-vector space.  But now how can I deduce that $A$ is a finite dimensional $k$-vector space? Let $\psi: C([0,1]; \mathbb{R}) \mapsto C([0,1]; \mathbb{R})  $, be such that if $x \in [0,1]$ then $$\psi(f)(x) = \int\limits_{0}^{x} f(t) dt $$  I am asked to show that $\psi$ is not a contraction but $\psi^{2}$ is. And then conclude that $\psi$ has a unique fixed point.   I´ve managed to prove a statment that helps me conclude the last part but I´m having trouble proving that the function is not a contraction. This is what I've got.   If $f,g \in  C([0,1]; \mathbb{R})$  then $$ |\psi (f) - \psi(g)| \leq \int\limits_{0}^{x} |f(t)-g(t)| dt \leq \sup\limits_{x\in [0,1]} |f(x)-g(x)| \int\limits_{0}^{x} 1 dt = d(f,g) x  $$ Then $|\psi (f) - \psi(g)| \leq d(f,g) x $,  and taking supremum on the left hand side allows me to conclude that $d(\psi (f),\psi (g)) \leq d(f,g) x$  Is there any problem with this procedure? Does anybody has an insight on how to procede with the $\psi^{2}$ part?   Many Thanks! I am going to install Ubuntu to dual boot with Windows 8 soon, but one of my friends warned me that partitioning my hard drive will slow my computer down. I run on a 500GB HDD and 8GB of ram if that helps at all. Is that true if I do it? I have 3 old 3.5" internal hard drives sitting gathering dust at the moment. 2 are SATA, and one IDE. I want to either start putting them to use, or dispose of them to clear up some space.  What is the best approach towards disposing of the drives in terms of thoroughly cleaning the contents before throwing away or selling? Are there any recommendations for good software to use to do this?   Are there any 100% successful methods which result in having a usable drive at the end? What's a word for someone who is constantly asking for same thing? Identifying which part of a large document is being compiled Difference between [NSMutableArray array] vs [[NSMutableArray alloc] init] What is the motivation behind axiomatically forcing the underpinning group of a ring to be abelian? Noncommutative rings are vastly more complex than commutative ones, so I am assuming that allowing the additive operation to be noncommuting would just make matters worse. Is there something deeper here, or is this a restriction for the sake of convenience and simplicity? Can someone help me figure out the big-O for the recurrence relation $T(n) = T(n^{1/2}) + 1$?  I didn't think the master theorem would work since it requires $T(n) = T(n/b)$... to have $b$ as a constant. I was wondering if anyone could shed some light on a method to approach this problem? (not looking for a solution) Pgfplots with custom axis markers Assume you have a trigonometric function, say for simplicity sin(x). When plotting the function, how can one place the x-axis markers on 0, pi/2, pi, 3pi/2, 2pi, instead of the default numeric values that pgfplots uses? How do I add more categories to Mac OS X Finder's sidebar? My Finder sidebar has two categories: Favorites and Devices. How do I add more categories? Converting a short cage rear derailleur to a long cage derailleur Is it possible to convert a short cage rear derailleur (for example the Huret Svelto) to a long cage derailleur by just taking the lower cage and replacing it by a longer one? What to do with an Ubuntu disk image that appears as a WinRAR file? Let $X$ be a locally compact metric space which is also $\sigma$-compact. Let $C_{c}(X)$ be the continuous functions on $f$ from $X$ to $\mathbb{R}$ with compact support. Is $C_{c}(X)$ separable?  My work so far:   If $X$ is a compact metric space, then by Urysohn's Lemma and Stone-Weierstrass, the continuous functions $C(X)$ on $X$ are separable and hence the result follows as $C_{c}(X) = C(X)$.  Suppose $X = \mathbb{R}$. Write $\mathbb{R} = \bigcup_{N  = 1}^{\infty}[-N, N]$. Let $f \in C_{c}(\mathbb{R})$. Then $f$ is supported on a compact set $K \subset [-N, N]$ for some $N$. Thus $C_{c}(\mathbb{R}) =\bigcup_{N = 1}^{\infty}C([-N, N])$. Each $C([-N, N])$ has a countable dense subset $\{\psi_{N, n}\}_{n = 1}^{\infty}$ and so $\bigcup_{N, n = 1}^{\infty}\{\psi_{N, n}\}$ is a countable dense subset of $C_{c}(\mathbb{R})$.  In the general case, $X = \bigcup_{i = 1}^{\infty}X_{i}$ where each $X_{i}$ is compact and $X_{1} \subset X_{2} \subset \cdots$. Let $f \in C_{c}(X)$. Then $f$ is supported on a compact set $K = \bigcup_{i = 1}^{\infty}K \cap X_{i}$. Is it still true that $C_{c}(X) = \bigcup_{i = 1}^{\infty}C(X_{i})$? How can I get useful error messages in PHP? "Requires 50 reputation" to comment on deleted posts So I recently saw add comment (requires 50 reputation) on a deleted answer. After looking around a bit, it seems to be on all deleted posts now (only deleted posts, normal posts still say just add comment).  I'm sure it wasn't there before (I think it just said add comment (unclickable) or possible nothing).  It is also on , presumably the root cause is the same.  And yes, I do have more than 50 reputation (in case anyone was wondering).  Just to clarify, requires 50 reputation obviously shouldn't be there for users with 50 or more reputation. Choices:   Display nothing Unclickable add comment - probably not ideal Unclickable add comment (disabled for deleted posts) or something along those lines   FYI - You may be somewhat confused right about now if you can't  yet. How do I get the local machine name? A customer of mine wants to pay me from the usa to my account with N26 bank.N26 Bank is a German online bank with no branches but available to customers in the euro-zone.I opened my account online in Portugal.When my customer made the transfer and sent me the slip,i discovered the beneficiary name was completely wrong but the Iban and Swift was correct.Will the wire transfer go through with correct Iban and Swift but incorrect beneficiary name?