I've created a website with WordPress about two months ago. The website mainly focuses on content writing services with up to 5 pages for different writing services &amp; also a blog with more than 10 blog posts till now. I've started to create backlinks and also doing some on page SEO since the first week. I've also added Sitemap to google webmaster tools, everything looks fine. Anyway, after about two months, I expected to see some serp improvements, so I've searched for the query and checked google results up to page 15 and yay! I was there. It was a good feeling as I was expecting to get better and better positions everyday. Because my website was mainly focused on the topic, whereas so many results on pages after 7, was not even 1% related to the topic. But, suddenly my website have completely gone from the results, even not on page 20! So I tried to figure out what is happening. I reviewed every section in webmaster tools, fixed crawl some crawl errors and started a live page test, and after that, requested indexing. In less than an hour, I was again on page 15, for a few days actually. Again, I'm not on any pages. And this cycle continues...  I wonder if is something wrong here. I don't think that google is punishing me for building backlinks soon or something like this, because I'm on page 5 on a longtail keyword (based on the main keyword). So what do you suggest? Should I wait? Or continue to live test &amp; request indexing...
What are the best ways to improve a site's position in the Google search results?
File sync error (AUTH_FAILED) Recently I started getting a File sync error on all 3 of my PCs running Ubuntu One.  One is running Ubuntu, the other 2 are running Windows 8.  Looking at the list of clients on the web, none of them were there anymore.    I found this article:      On how to fix the issue for my Ubuntu PC and it worked perfectly.  Now I am looking for a similar fix for Windows but haven't found one yet.  I've tried un-installing Ubuntu One and re-installing it, but it must still be holding the keys somewhere because it never asked me to login again.    Does anyone know where I can clear these keys to get my files syncing on Windows again? Prove that : $\displaystyle \lim_{n\to \infty} \frac{1}{n+1}+\frac{1}{n+2}+\frac{1}{n+3}+\cdots+\frac{1}{2n}=\ln 2$    the only thing I could think of is that it can be written like this :  $$ \lim_{n\to \infty} \sum_{k=1}^n \frac{1}{k+n} =\lim_{n\to \infty} \frac{1}{n} \sum_{k=1}^n \frac{1}{\frac{k}{n}+1}=\int_0^1 \frac{1}{x+1} \ \mathrm{d}x=\ln 2$$  is my answer right ? and are there any other method ?(I'm sure there are) How to convert Wubi install into regular install? I have installed Ubuntu on my D: partition using Wubi. Is there any way in which I can remove my Windows from C: drive and move my existing Ubuntu installation to C: drive and make it a regular install. Partitions of $n$ into distinct odd and even parts proof Let $p_\text{odd}(n)$ denote the number of partitions of $n$ into an odd number of parts, and let $p_\text{even}(n)$ denote the number of partitions of $n$ into an even number of parts.  How do I prove that    $|p_\text{even}(n) - p_\text{odd}(n)|$ is equal to the partitions of $n$ into distinct odd parts. Show that the number of partitions of $n$ for which no part appears exactly once is equal to the number of partitions of n for which every part is divisible by 2 or 3. Show that the number of partitions of $n$ for which no part appears more than twice is equal to the number of partitions of $n$ for which no part is divisible by 3. Would like to emulate google maps' driving directions functionality but use pgRouting instead. google's data over the project area &amp; scale is quite a bit off so we want to use our own transport network data in postGIS.  any hints?  thanks. How to define binary operation on arbitrary set in order to create a group structure. Formula for the $n$th term of $1, 2, 2, 3, 3, 3, 4, 4 ,4, 4, 5, ...$ How to change Ubuntu 18.04 system fonts? I installed Ubuntu 18.04, and I want to customize the fonts. I have already change all the setting by tweak tool. But the system default font not be changed, is anything I need to do? Trying to remember a short story (most likely from the sixties).  It starts with a soldier at the front line fighting an unknown enemy on the other side of the front line.  He then gets withdrawn and you realise that time is passing slower the further he moves from the front. He then spends years in peace away from the front, before being sent back to the front where only a short time (hours or days perhaps) have passed.      I seem to remember their was an inference that they were actually fighting against themselves, with their attacks coming back at themselves, which was perhaps the entire cause of the war, and an interesting critique on war.  I can't remember if this all this was stated explicitly, or just left for the reader to infer. See all shared items in Google Drive In Dropbox there is a place you can see all the shared items in your account (i.e., all the items you have granted others access to).  Is there a similar feature in Google Drive?  I'm not only trying to find items that are shared with other "named people", but also documents that are shared on a "anyone with link can view / edit" or "public on the internet" basis.   Franck's  seemed to work back in 2013, but Google Drive's interface has changed quite a bit since, and I'm struggling to be able to perform the same task with the new interface. I wonder if anyone knows how to do it in the new interface. An example of a regular function over an open set I installed nginx a while ago using the ubuntu PPA repository.  Now I want to compile nginx from source so I can compile in and use the geo-ip module.  I know how to compile the new nginx from source.  How can I remove the nginx binary which was installed by the package?  I want to leave all the configs and logs and upstart stuff etc untouched.  I really just want to remove the old binary.  How can I do this? Infinite coproduct of abelian groups One can see on every text (book, lesson, comments) that a direct sum/coproduct of abelian groups is the same as a finite product but in the infinite case, the direct sum/coproduct is only a subgroup of the product.  Why does an element in an infinite direct sum only have finitely many components different from the neutral elements?  I don't see where the "finite" comes from when I look at the universal property.  Also, in another situation, a condition of "finiteness" appears and I think that is because of the same structure: a freely generated group, vectors space, algebra etc... has elements that are finite product/sum of generating elements. Because, if one really wants an infinite "sum" (or sequence) one may just take a formal serie. That is a ring, hence also an abelian group. If $AD$, $BE$, $CF$ are exterior bisectors then $D,E,F$ are collinear Let $ABC$ be a triangle and AD the exterior bisector of $\angle A$, $BE$ the exterior bisector of $\angle B$, $CF$ the exterior bisector of $\angle C$ where $D\in BC$, $E\in AC$, $F\in AB$.  Show that $D,E,F$ collinear. Is it "re-offend" or "reoffend"? I want to know whether there is a hyphen in the word re-offend, or if it is spelt reoffend. I looked in Oxford English dictionary and the word "reoffend" appears, but then I checked Merriam-Webster and the word is not in there.  So is reoffend a word or is it re-offend?  I'm in Australia where we observe UK English if that matters. Is there a way to configure your Stack Overflow account so that you receive notification emails when posts are made to specific tags?    Or do you simply have to log on to see new posts? (a) Solve the equation $yu_x+xu_y=0$  with the condition $u(0,y) = e^{-y^2}$. (b) In which region of the xy plane is the solution uniquely determined?     I did the first part but I don't understand how to do part b.  I read   But I don't understand how the argument is based. A more clear explanation is appreciated What form of the verb is used with compound subjects containing "or"? Proving question on sets I am unable to understand this question. I have to say whether its true of false and then prove it but I can't proceed with the question unless I understand it.     Let $S$ be the set of stars in our galaxy. There is exactly the same   number of subsets of stars in our galaxy as there are functions   $f:S\rightarrow\{\alpha,\beta\}$ What will be the value of the following Infinite Product :   $$\displaystyle \prod_{k=0}^\infty \left(1+\dfrac{1}{2^{2^k}}\right)$$  It would be nice if anyone could spare the time and boil down to the absolute basics and tell how they reached the solution.