I have earned points on Stack Exchange for Database related. How do I transfer those points to dba.stackexchange?
I use the Stack Exchange sites very often to find solutions to problems and help me with decision-making.  In some sites I have asked question and received answers, and I have more than 15 reputation. On Stack Overflow I have always found answers to my questions and never needed to post a question (avoiding duplicate questions). However, I would like to vote for the answers that helped me but I do not have the ability to do that, due to low reputation.  Posting a question or answering an answer on each site seems like the only way to get enough reputation.  Since I have no input to give in these areas unless they will be counted as duplications, many answers that I have already used are missing my vote.  I suggest to take into account all of the reputations from all Stack Exchange sites for voting, or thinking about a different way to allow votes.
Every contractible space X is simply connected because X is homotopy equivalent to a point.  Is there a direct proof of this fact? There obviously is a (free) homotopy between any loop and the trivial loop at the base point. But how to construct a based homotopy, which is required for a loop to be trivial in the fundamental group? This is a batch file in Windows.  Here is my .bat file          @echo off copy "C:\Remoting.config-Training" "C:\Remoting.config"  "C:\ThirdParty.exe"   This works fine except the .bat file leaves the command window open the whole time the "ThirdParty" application is running. I need the command window to close.   I would use the short-cut for the application but I must be able to run this copy command first (it actually changes which data base and server to use for the application).    The ThirdParty application does not allow the user to change the source of the db or the application server.    We're doing this to allow users to change from a test environment to the production environment. What is the difference between a HMAC and a hash of data? How does the four card limit work? I'm new to the game and trying to make my first constructed deck. My understanding of the card rule is I can only have four cards of one kind.  What does this precisely mean?  For instance, does this mean I can only have four rat cards total or four rat cards of several kinds? If two different cards do the same thing (like  and ), can I have four of each? What is the meaning of colon (:) operator in "uint isWidget : 1;" in Qt? How to combine multiple commands in terminal? I have the following commands.  cd import zcat urls1.sql.gz | mysql -u root -p urls cd /var/www/project1/ nano 1.php   As of now I'm executing it one by one.  Is there a way to combine those commands in one line? How to use iSight webcam without activating the green light? Recently a the Dutch government advised to put a tape on your webcam to prevent hackers from taking pictures and video using your device ().  The build in iSight camera in Apple laptops have a green light next to the camera, this light turns green when you use the camera.  Is it possible to use the camera without the activation of the green light? Personally I think the green light turns on when the sensor requires power and this is hardwired in the hardware. Am I wrong?  I have found similar questions on stackexchange, but I found non that answer this specific question. How can I link to an external resource in a community-friendly way? I would like to help my fellow Stackizens, using material from my blog or other website.  But external links are sometimes viewed as excessive promotion.  From the FAQ:     Be careful, because the community   frowns on overt self-promotion and   tends to vote it down and flag it as   spam. Post good, relevant answers, and   if they happen to be about your   product or website, so be it. However,   you must disclose your affiliation in   your answers. Also, if a huge   percentage of your posts include a   mention of your product or website,   you're probably here for the wrong   reasons.   I have tried posting answers that reference my blog, and I have followed the above rules, but my answers still get flagged as spam.  How can I craft an answer that references my blog, website or other resource, but is still acceptable to the community? Is it possible to Pivot data using LINQ? Induction Proof that $x^n-y^n=(x-y)(x^{n-1}+x^{n-2}y+\ldots+xy^{n-2}+y^{n-1})$ This question is from [Number Theory George E. Andrews 1-1 #3].     Prove that $$x^n-y^n=(x-y)(x^{n-1}+x^{n-2}y+\ldots+xy^{n-2}+y^{n-1}).$$   This problem is driving me crazy. $$x^n-y^n = (x-y)(x^{n-1}+x^{n-2}y+\dots +xy^{n-2}+y^{n-1)}$$  $(x^n-y^n)/(x-y) =$ the sum for the first $n$ numbers and then I added $(xy^{(n+1)-2}+y^{(n+1)-1})$ which should equal $(x^{n+1}-y^{n+1})/(x-y)$ but I can't figure it out    This is a similar problem in the book and I tried this method but it wasn't working out      $\quad$Thereom $\bf1$-$\bf2$: $\,\,\,\,$ If $\,x$ is any real number other than $1$, then $$\sum_{j=0}^{n-1}x^j=1+x+x^2+\ldots+x^{n-1}=\dfrac{x^n-1}{x-1}.$$    $\quad$Remark: $\displaystyle\sum_{j=0}^{n-1}A_j$ is shorthand for $A_0+A_1+A_2+\ldots+A_{n-1}.$     $\quad$Proof: Again we proceed by mathematical induction. If $n=1$ then $\displaystyle\sum_{j=0}^{1-1}x^j=x^0=1$ and $(x-1)/(x-1)=1$. Thus the theorem is true for $n=1$.  $\quad$ Assuming that $\displaystyle\sum_{j=0}^{k-1}x^j=(x^k-1)/(x-1)$, we find that $$ \eqalign{ \sum^{(k+1)-1}_ {j=0}x^j &amp; = \sum^{k-1}_ {j=0}x^j+x^k=\dfrac{x^k-1}{x-1}+x^k \\ &amp;= \dfrac{x^k-1+x^{k+1}-x^k}{x-1}\\ &amp;= \dfrac{x^{k+1}-1}{x-1}. }$$   Hence condition $(\rm ii)$ is fulfilled, and we have established the theorem.    $\quad$Corollary $\bf1$-$\bf1$: $\,\,$ If $\,m$ and $n$ are positive integers and if $m&gt;1$, then $n&lt;m^n.$ How to change language of a specific application? Could it be that Goldbach conjecture is undecidable? Let $f(x)$ be a monotone non-increasing function such that $\int_{0}^{\infty}f(x) dx$ converges. Prove: $\lim\limits_{x \to \infty} xf(x)=0$. My question is, why can't I simply contradict any other possibility by using the Integral Limit Comparison Test with $1\over x$? I am, after all, to show that $f(x)=o(x)$ as $x\to \infty$. I really don't understand why monotony is crucial here. I could use some help. How do you change the size of figure drawn with Matplotlib? Which edit actions can move a post into Community Wiki mode? Surprisingly, I couldn't find a straight answer to this.  It's not entirely clear in the .  There are (at least?) four different types of edit actions:   Body edits Title edits Retags Rollbacks   And a few actions that show up in the history but aren't really "edits":   Close/Reopen Delete/Undelete   The FAQ seems to indicate that only body edits are important as far as "wikification" is concerned, but I'm not sure if that's really correct or if I'm just interpreting the post too literally.  The FAQ also says that rollbacks don't reverse the calculations - fine, but are they considered to be additional edits or are they ignored?  Can anyone tell me which of these actually count toward the wikification of a post, and whether the rules are any different for owner edits vs. multiple editors? Let $p$ be prime and $(\frac{-3}p)=1$. Prove that $p$ is of the form $p=a^2+3b^2$ Let $p$ be prime and $(\frac{-3}p)=1$, where $(\frac{-3}p)$ is Legendre symbol. Prove that $p$ is of the form $p=a^2+3b^2$.   My progress:  $(\frac{-3}p)=1 \Rightarrow$ $(\frac{-3}p)=(\frac{-1}p)(\frac{3}p)=(-1)^{\frac{p-1}2}(-1)^{\lfloor\frac{p+1}6\rfloor}=1 \Rightarrow$ $\frac{p-1}2+\lfloor\frac{p+1}6\rfloor=2k$  I'm stuck here. This is probably not the way to prove that.  Also tried this way:  $(\frac{-3}p)=1$, thus $-3\equiv x^2\pmod{p} \Rightarrow$ $p|x^2+3 \Rightarrow$ $x^2+3=p\cdot k$ stuck here too.  Any help would be appreciated. Attempting official deploy process with single sandbox may reset/remove all existing work? Should outdated answers be voted down? On Stack Overflow, there are many questions that relate to currently-developing technologies such as HTML5 and CSS3. The accepted answers to these questions may become outdated, and better answers may appear. However, because the answers are accepted, it is likely that they will continue to be upvoted by users reading the answers, and the OP will likely not notice that a better, more up-to-date answer may exist.  Should these outdated answers be voted down? If not, what should we do with them? I need assistance in integrating $ \frac{x \sin x}{1+(\cos x)^2}$ I'm trying to show that $R = \mathbb{Q}[X,Y]/(Y^2-X^3)$ is not a UFD, but I got stuck.  To prove this, I could try to find two "different" factorisations for one element, but I am not familiar with this, so I tried to use a lemma and one of the previous exercises. If my syllabus is right, in every UFD counts $$ x \ \text{is irreducible} \quad \iff \quad x \ \text{is prime}$$ My syllabus also states that the elements $\bar{X}, \bar{Y} \in R$ are irreducible. So I tried to show that at least one of the elements $\bar{X}, \bar{Y} \in R$ does not generate a prime ideal.  This would mean that I should find two polynomials $f,g \in \mathbb{Q}[X,Y]$, such that  $$\exists p \in \mathbb{Q}[X,Y], \quad fg - pX \in (Y^2-X^3)$$ and $$\forall q \in \mathbb{Q}[X,Y], \quad f-qX \notin (Y^2-X^3) \ \wedge \ g-qX \notin(Y^2-X^3)$$ or the same thing but then for $Y$.  I hope that you can tell me if this approach is correct, and provide me a hint. I'd appreciate it if you told me the solution, but please start your answer with a hint, clearly separated from the rest.