THEE Apple, THEE Engine, THEE Imbecile, THEE Orange, THEE uncle and THA...for all [most] words beginning with consonants
I've been told that when "the" is proceeded by a vowel sound, like "apple" or "hour", it's pronounced as "thee" and not as "thu".  But after listening to a couple of songs, I noticed that sometimes this "rule" is not followed. Take for example the two Katy Perry's songs, "Roar" and "The one that got away". In the first she sings "I got thee eye of thu tiger", but in the second she sings "Thu one that got away".  I don't know if it was sang this way to better suit the song melody (I understand nothing about those techniques), but I got confused. What's the correct pronunciation?  Thanks in advance.
In Lieb and Loss's Analysis, I saw that they mentioned  $L^1(\mathbb{R}^n) \cap L^2(\mathbb{R}^n)$ dense in $ L^2(\mathbb{R}^n)$ (dense wrt the $L^2$ norm, I think). But I didn't find its proof in the book. So I wonder why it is?    Does this conclusion hold for $L^1(\Omega, \mathcal{F}, \mu) \cap L^2(\Omega, \mathcal{F}, \mu)$ for any measure space $(\Omega, \mathcal{F}, \mu)$?  Are there similar statements if replace $L^1$ with $L^p$, and  $ L^2$ with $L^q$ for $p \leq q \in (0, \infty ]$ or $\in [1, \infty]$?  Thanks and regards! Find the limit of $\frac{n^{x}}{(1 + x)^{n}}$ Let $x&gt;0$. Find $$\lim_{n\to\infty}\frac{n^{x}}{(1 + x)^{n}}.$$   What I was thinking involved an inequality, by reason of considering the fact that  $$(1 + x)^{n} &gt; C(n, k) x^{k}$$ for some $k$ such that $n&gt;k$. Expanding the binomial coefficient and taking the $n$ common from each bracket, we have something like $$(1 + x)^{n} &gt; C(n, k) x^{n} &gt; \frac {x^{k}n^{k}}{k! 2^{k}}.$$ But now, I am totally clueless. By intuition, I know that the limit has to be zero, so I just want to prove using the concept of inequalities that what I thought was the right approach (being the sandwich theorem). Any help would be appreciated! Invertibility of the Product of Two Matrices I have shown that if two $n\times n$ matrices $A$ and $B$ are invertible, then $AB$ is also invertible. I am having problems though with showing that $(AB)^{-1}=B^{-1} A^{-1}$. I thought of using their left-multiplication transformations but it seems that this is only associative and not commutative so I can reverse $L_A L_B$ How can I set up password-less SSH login? Are there any countable Hausdorff connected spaces? Do countable Hausdorff connected topological spaces exist? Declaring variables inside or outside of a loop I am working on a SQL query that reads from a SQLServer database to produce an extract file. One of the  requirements to remove the leading zeroes from a particular field, which is a simple VARCHAR(10) field. So, for example, if the field contains '00001A', the SELECT statement needs to return the data as '1A'.  Is there a way in SQL to easily remove the leading zeroes in this way? I know there is an RTRIM function, but this seems only to remove spaces. Deleting missing data with CountryData Access is denied because the NTFS volume is already exclusively opened The moderator agreement is visible at the following URL:       I acknowledge and agree that as a moderator for Stack Exchange Inc.      I will abide by the then-current Terms of Service of Meta Stack   Exchange, and other moderator policies made available to me,      I acknowledge that I may have access to potentially   personally-identifying information about Meta Stack Exchange users and   that in connection with such access      I will use such information solely in accordance with the then-current   Privacy Policy of Meta Stack Exchange,      I will not disclose this information to anyone,      I will not store or copy this information and      I will only use such information in connection with performance as a   Meta Stack Exchange moderator for the benefit of Meta Stack Exchange.      I acknowledge and agree that I am an independent volunteer moderator   to Meta Stack Exchange and I am not an employee, agent or   representative of Stack Exchange Inc., and I have no authority to bind   Stack Exchange Inc. in any manner. Stack Exchange Inc. reserves the   right to terminate my privileges as a moderator at any time without   warning.   It hasn't been updated with the new company name and still refers to Stack Exchange Inc. instead of Stack Overflow (Inc.?). Indirect return of all elements in an array The Bash man page describes use of ${!a} to return the contents of the variable whose name is the contents of a (a level of indirection).  I'd like to know how to return all elements in an array using this, i.e.,  a=(one two three) echo ${a[*]}   returns  one two three   I would like for:  b=a echo ${!b[*]}   to return the same.  Unfortunately, it doesn't, but returns 0 instead.  Update  Given the replies, I now realise that my example was too simple, since of course, something like:  b=("${a[@]}")   Will achieve exactly what I said I needed.  So, here's what I was trying to do:  LIST_lys=(lys1 lys2) LIST_diaspar=(diaspar1 diaspar2)  whichone=$1   # 'lys' or 'diaspar'  _LIST=LIST_$whichone LIST=${!_LIST[*]}   Of course, carefully reading the Bash man page shows that this won't work as expected because the last line simply returns the indices of the "array" $_LIST (not an array at all).  In any case, the following should do the job (as pointed out):  LIST=($(eval echo \${$_LIST[*]}))   or ... (the route that I went, eventually):  LIST_lys="lys1 lys2" ... LIST=(${!_LIST})   Assuming, of course, that elements don't contain whitespace. Over the years I've written some libraries. These libraries sometimes depend on each other.  As a result, the "tex" directory is structured as follows:  tex ├── library |   ├── library1.sty |   ├── library2.sty |   └── library3.sty ├── project1 |   ├── master.tex |   ├── chapter1.tex |   └── chapter2.tex ├── project2 |   └── article.tex └── project3     └── paper.tex   The libraries depend on each other. As a result, in every library that depends on another library, this is part of the header:  %library2.sty \ProvidesPackage{library2} \RequirePackage{../library/library1}   In other words, the library is imported from the "root of every project". This is not a good design choice. What if someone copies the libraries in the folder of the root of a project, or what if the folder "library" is renamed...  It is however reasonable the "active directory" still remains in the project root.  What can be done to resolve such library dependencies? Is it possible to configure Windows 7 to use YYYY-MM-DD instead of DD/MM/YYYY as the date format? How? Where? Can't install Oracle JDK 9 I uninstalled jdk packages and now can't install them back. I managed to install oracle-java7-installer and oracle-java8-installer but can't install oracle-java9-installer. It seems that my computer tries to download wrong version of oracle-java9-installer 177 when version i would be able to download is 178.    $ wget http://download.java.net/java/jdk9/archive/178/binaries/jdk-9+178_linux-x64_bin.tar.gz --2017-07-21 11:00:02--  http://download.java.net/java/jdk9/archive/178/binaries/jdk-9+178_linux-x64_bin.tar.gz Connecting to 10.144.1.10:8080... connected. Proxy request sent, awaiting response... 200 OK Length: 293348142 (280M) [application/x-gzip] Saving to: 'jdk-9+178_linux-x64_bin.tar.gz'  jdk-9+178_linux-x64_bin.tar.gz     1%[&gt;                                                          ]   5.42M  5.04MB/s               ^C  $ wget http://download.java.net/java/jdk9/archive/177/binaries/jdk-9+177_linux-x64_bin.tar.gz --2017-07-21 11:00:16--  http://download.java.net/java/jdk9/archive/177/binaries/jdk-9+177_linux-x64_bin.tar.gz Connecting to 10.144.1.10:8080... connected. Proxy request sent, awaiting response... 404 Not Found 2017-07-21 11:00:17 ERROR 404: Not Found.   Can you help? apt-get tries to install Oracle JDK 9.  I run Ubuntu 16.04 in virtual machine hosted by win7  Full error message:  sudo apt-get install oracle-java9-installer Reading package lists... Done Building dependency tree        Reading state information... Done oracle-java9-installer is already the newest version (9b177-1~webupd8~0). 0 upgraded, 0 newly installed, 0 to remove and 147 not upgraded. 1 not fully installed or removed. After this operation, 0 B of additional disk space will be used. Do you want to continue? [Y/n] Y Setting up oracle-java9-installer (9b177-1~webupd8~0) ... Using wget settings from /var/cache/oracle-jdk9-installer/wgetrc Downloading Oracle Java 9... --2017-07-21 10:54:11--  http://download.java.net/java/jdk9/archive/177/binaries/jdk-9+177_linux-x64_bin.tar.gz Connecting to 10.144.1.10:8080... connected. Proxy request sent, awaiting response... 404 Not Found 2017-07-21 10:54:13 ERROR 404: Not Found.  download failed Oracle JDK 9 is NOT installed. dpkg: error processing package oracle-java9-installer (--configure):  subprocess installed post-installation script returned error exit status 1 Errors were encountered while processing:  oracle-java9-installerE: Sub-process /usr/bin/dpkg returned an error code (1) What is the term for the double consecutive use of a word with stress on one of the words to alter its severity? What is the term when a word is used consecutively twice, with intentional stress placed on the first word, as a means to alter the severity of the word's meaning?  I am not referring to a  (had had) or a  (that that), but to the slightly sarcastic use as demonstrated in shows like Seinfeld. Sample sentences, with emphasis:  I know we're going out to eat, but I am only going to pick at an appetizer because I'm not hungry hungry. Don't wear something so formal to the party; I don't think you need to be dressed dressed.  Of personal note, some of my relatives decided a few years ago to nick-name the term a &quot;Celaine&quot; (a combination of their names) due to their own frequent use of it. Note: This question explicitly requests the term of art used by linguists and English scholars when discussing this phenomenon. This question is different from a  which requests a historical explanation for the phenomenon described by this term. None of the answers to the suggested duplicate provide the term.  The author of the similar question requests the term for the pattern in a comment, but does not receive an acceptable answer. The only mention of an acceptable term is in a comment made by the author of this question, in response to the author of the similar question, directing back to this very question. This week I've read two news stories about two different camera lenses that can magnify things that are very far away.  The first is the , which is a point-and-shoot camera that costs $600, has an 83x optical superzoom lens ("the same field of view as a 2,000mm lens on a full-frame camera"), and lets you see the craters of the moon.  The second is the , which weighs 36 pounds, costs $180,000, and can take portraits of people a half mile away.  A non-photographer might ask, "Why would somebody spend their life savings on a gigantic telescope of a lens when you could take far away pictures with a handheld camera for 1/300th the price?"  Well, I am basically a non-photographer, and I would like to ask that question. What does the big one give you that the little one doesn't provide? I understand that small changes in lenses can make a big difference in size and price, but this seems to be of a different scale entirely.   What is going on with the optics of the lenses that makes the small one able to be so small and the big one have to be so...big?   I'm trying to get a basic intuition for what makes lenses different, and I realize I don't understand enough about how lenses work to even know how to compare these apples and watermelons. I'm just trying to review basic terminal commands. Having said that, how do I create a text file using the terminal only? Supersymmetry in Quantum Field Theory I have an idea of supersymmetry in quantum mechanics, can you suggest a book on "supersymmetry in quantum field theory", which has sufficient mathematical rigour like "Peskin and Schroeder" On the importance of the i.i.d. assumption in statistical learning stl::multimap - how do i get groups of data? Multimap essentially has groups of data sorted by the key. I want a method by which I could access these individual groups and get their aggregate values. For example, in a std::multimap&lt; string, int &gt; I store   {"Group1", 1},  {"Group1", 2},  {"Group1", 3},   {"Group2", 10},  {"Group2", 11},  {"Group2", 12}   Having stored these values, I should be able to iterate this multimap and get the aggregate values of each "group". Problem is there aren't any functions defined in STL to access MultiMaps in such a way. I could use lower_bound, upper_bound to manually iterate the multimap and total the group's contents, but I am hoping there could be better ways already defined in STL ? Can anyone propose a solution as to how I could get the aggregate values for a group in the above example.