I have a website and yesterday I renamed all the HTML files to appropriate names to help them show up in searches better. For example one of my pages was called logic.html now its called logic_gates_and_truth_tables.html.   I submitted a new site map to Google and told it to recrawl my site and today I did a site:example.com search and the search results had doubled because it kept"logic.html" in its results and added a new result called logic_gates_and_truth_tables. As you would expect when clicking the old link it gives you a "page not found" error.   How can I get Google to remove the old pages and only list the newly renamed pages?
I have set up my site with sample pages and data (lorem ipsum, etc..) and Google has crawled these pages. I deleted all these pages and actually added real content but in webmaster tools, i still get a lot of 404 errors Google trying to crawl these pages. I have set them to "mark as resolved" but some pages still come back as 404.   Furthermore, I have a lot of these sample pages still listed when i do a search of my site on Google. How to remove them. I think these irrelevant pages are hurting my rating.   I actually wanted to erase all these pages and start getting my site being being indexed as a new one but I read it's not possible? (I have submitted a sitemap and used "Fetch as Google.")
My internet connection used to be a direct LAN connection to my provider. Back then, everything would load fine on both Windows and Ubuntu (dual boot). However, a while ago they started needing me to dial (PPPoE) using a username and password. Gateway, subnet mask, IP, DNS servers all stayed the same. But since then, I haven't been able to browse certain websites on Ubuntu, even though there have been no such issues on Windows. Some example websites are -  (although share.ovi.com loads fine, and nokia.com loads fine),  (works on Chrome(ium) and Opera but not on Firefox (both 3.6 and 4)) Mozilla  and other random websites.  Some of the websites that don't load show timeout messages and for some websites (like the moz addons one), the browser will keep trying to load without an end (I've left it like that even for hours but not noticed anything different happen).  I have tried changing the DNS servers to public ones. I have even tried booting from a Fedora LiveCD and then changing the DNS to those (and even to the ones of OpenDNS), but the exact same thing happens. What could be inherently wrong with some config within Linux itself that is causing this problem?  Does anyone know why this is happening and how it can be fixed?  Note: This question has been  on SU, but not gotten any responses.  Update: Just saw  that someone else was having similar problem and solved it by putting a NetworkManager.conf file in /etc/NetworkManager. What needs to be in that file? How to calculate $\lim \limits_{n \to \infty}(1 +\frac{a}{n})^n$? Keyboard key stuck or not being recognized; how to fix Limit of ${a_n}^{1/n}$ is equal to $\lim_{n\to\infty} a_{n+1}/a_n$ Today my lecturer put up on the board that:  If $\lim\limits_{n\to\infty}\frac{a_{n+1}}{a_n}$ exists and $a_n&gt;0$ then   $\displaystyle \limsup\limits_{n\to\infty}\left(a_n^{\frac{1}{n}}\right)=\lim_{n\to\infty}\frac{a_{n+1}}{a_n}$  however I am not sure why this is true, can somebody give me a hint or something as to how to go about proving this.  thanks for any help Can I solve system of differential equation in a matrix form? Let $n$ be a nonnegative integer, and $k$ a positive integer. Could someone explain to me why the identity $$ \sum_{i=0}^n\binom{i+k-1}{k-1}=\binom{n+k}{k} $$ holds? Let $f:\Bbb{R}\to\Bbb{R}$ be a function given by  $$f(x)=\begin{cases} \exp\left(\frac{1}{x^2-1}\right) &amp; \text{if }\vert x\vert\lt 1\\  0 &amp; \text{if }\vert x\vert\geqslant 1  \end{cases}$$  I would like to prove that $f\in C^\infty$, that is, $f\in C^k$ for all $k\in \mathbb{N}$. I think that it can be done by induction on $k$. If $\vert x\vert\gt1$, the problem is trivial. On other points, the base case is the simplest and the only that I'm be able to do. Can someone help me?  Thanks. Multivariate polynomial with no mixed terms Is there a standard name for multivariate polynomials wherein each term consists of only one coordinate? That is, polynomials of this form: $$p(x_1, \ldots, x_n)= \sum_{i=1}^n \sum_{j=1}^n a_{i,j}x_i^{j}$$ where all of the $a_{i,j}$ are constants. How can I remove the BOM from a UTF-8 file? I have a file in UTF-8 encoding with BOM and want to remove the BOM. Are there any linux command-line tools to remove the BOM from the file?  $ file test.xml test.xml:  XML 1.0 document, UTF-8 Unicode (with BOM) text, with very long lines My colleague and I were discussing about certain types of customers in the IT industry. You have to work extremely hard to convince them so that they think about opening their wallets .  However, they should not be mistaken to be stingy (carries a negative connotation). Cost-conscious is a closely related term but is a bit wordy. Another word that I considered is shrewd but I don't know if it fits my context well.  Usage Sentence:     Nowadays, IT customers are becoming increasingly ________. They demand more for less and probably think a zillion times before reaching for their pockets. If they are not convinced 100%, they simply won't open their wallets.    Is there is a noun or an adjective to describe such people? I am also open to using idioms, if there is one that conveys the intentions well.  N.B:  I am looking for words with neutral to positive connotations. Do the search engines take the number of 404 errors returned by a site into account when calculating the site rank? For example I have 8,000 404 errors and I am thinking that that's affecting my SEO in a negative way.  However, I read  about 404 errors which suggests that they are not always a negative quality indicator.   So I am confused...are high numbers of 404 errors harmful to a site or not? What if the hard disk is partitioned into more than 26 sections in Windows? How can I show that the set of rational numbers with denominator a power of two form a dense subset of the reals? How can I show that the set of rational numbers with denominator a power of two form a dense subset of the reals? How to prove that $p-1$ is squarefree infinitely often, where $p$ is prime?  I had thought of using Dirichlet's theorem on arithmetic progressions.  The number of squareful values of $p-1$ less than or equal to $n$ is bounded by $\sum_{q}{\pi_{q^2,1}(n)}$, each term $\pi_{q^2,1}(n) \approx \frac{\pi(n)}{q \cdot (q-1)}$, and $\sum_{q}{\frac{1}{q \cdot (q-1)}} \lt 1$.  But using for example , the possibility is open that the error in each approximation for $\pi_{q^2,1}(n)$ may continue to increase with $q$, and since the sum runs up to $\sqrt{n}$, this argument is invalid.  Is there a more refined version of Dirichlet's theorem that can be used to circumvent this issue?  Or an entirely different way to prove this statement? What does the 'grep' command do? I would like to learn how to use it so I can start to use the terminal more. Embedding images explodes generated PDF size Can I be admitted into a PhD program with non-thesis MS degree? If I do a non-thesis MS program in statistics, will I be eligible for an admission in to a PhD program in Statistics later in my life? The MS program I am looking into is a non-thesis program but I still have to complete a research project requirement (which involves oral presentation as well as some form of a written report) towards the end of the program...I am still not sure if it can lead to a PhD program though.  Thanks! Shapefile layer no longer editable (toggle edit option greyed out) in QGIS? Is my expansion of the state $| x \rangle$ correct? In my quantum mechanics textbook it says that the relation between the basis $|x\rangle$ and $|p\rangle$ is given by:  $\langle p | x \rangle = \Large \frac{e^{-ip x/ \hbar}}{\sqrt{2\pi \hbar}} \, .$  However, i'm not sure how to go about proving this relation. My idea was that the eigenstates of momentum can be written as below:  $\phi(x,p) = \Large \frac{1}{\sqrt{2\pi \hbar}} e^{-ipx/\hbar},$  which form an orthogonal basis.  But, we can expand any state, $|\text{state}\rangle$, in terms of the othorgonal basis right? So is my notation below correct for the expansion of the state $| x \rangle$ ?  $|x\rangle = \int_{-\infty}^{+\infty} \phi(p', x) |p'\rangle dp'$  If it were correct then the following would also be correct?  Using the fact that $\langle p | p' \rangle = \delta(p - p')$, $\langle p | x \rangle$ can be computed:  \begin{align} \langle p | x \rangle =&amp; \int_{-\infty}^{+\infty} \phi(p', x) \langle p | p' \rangle dp' \\ =&amp; \int_{-\infty}^{+\infty} \phi(p', x) \delta(p - p') dp' \\ =&amp; \phi(p, x) \\ =&amp; \Large \frac{e^{-ip x/ \hbar}}{\sqrt{2\pi \hbar}} \end{align} as required.  Does the logic work here? We've tried this a few times. First time we used an old ceramic container and it started sheding on the inside and ruined it. Next time we used a new metal garbage can with one of those super sized 10 gallon zip lock bags as a liner. It went rank very quickly. This could have been due to our packing though. Before we get into this again, what is you recommendation for a good container? I hate the thought of plastics but it seems it might just be the best choice as long as it's made for food storage.