How can I enumerate a list using lowercase letters instead of arabic numerals?
I've seen documentation whereby an \alph command is put around the \begin{enumerate} somewhere, but I'm not entirely sure how that operates...
I have this problem as part of a school assignment:  NOTE: In case it's hard to read in the image above, here's the directory tree: $ tree . `-- sample_dir1     `-- sample_dir         |-- admin         |-- cambridge         |   |-- cafeteria         |   |-- library         |   `-- security         |       |-- annex         |       |-- building         |       `-- parking         |-- faculty         |-- history.exe         |-- markham         |   |-- annex         |   |-- building1         |   `-- parking         |-- oxford         |   |-- outline.doc         |   |-- programming         |   |   `-- report.pdf         |   `-- security         `-- stenton             |-- gen_ed             `-- lib_arts                 |-- english.txt                 `-- match.doc  15 directories, 11 files  I tried doing the command: $ cp ../cambridge/security/parking ./parking2  ...but it isn't working. The question in the image above states that the current directory is stenton, and that we need to make a copy of the file named parking (from the security directory), and to name the new file parking2, and place it in the current directory, stenton, using relative pathnames. What am I doing wrong? My cp command seems to be correct. What are the convergent sequences in the cofinite topology I consider the co-finite topology on $\mathbb{R}$ that is $$\{G\subset \mathbb{R}, card(\mathbb{R}\setminus G)&lt;+\infty\}\cup \{\emptyset\}$$  What are the convergent sequences in this space .  thank you For primes $p≡3\pmod 4$, prove that $[(p−1)/2]!≡±1\pmod p$. I know to use Wilson's Theorem and that each element in the second half is congruent to the negative of the first half, but I'm not sure how to construct a proof for it. The following methods can be used to add CSS for specific versions of IE:   Paste the code into html.tpl.php:  &lt;!--[if lt IE 9]&gt;&lt;link type="text/css" rel="stylesheet" src="/sites/all/themes/mytheme/less/ie.css"&gt;&lt;![endif]--&gt; Make use of the plugin  Use drupal_add_css() function   I have always used option #1 above, and adding yet another plugin for something so simple seemed crazy. BUT working with LESS and calling in statically means the file does not get processed by the LESS pre-processor, so the question:  How do you include a stylesheet using drupal_add_css() for specific versions of IE? Euclidean geometry in non-inertial frame Meaning of U suffix $K \subset \mathbb{R}^n$ is compact iff it is closed and bounded I want to prove $\Leftarrow$.  I just need one more step, now. If I find a compact set that contains K, then it will finish the proof. Rudin take a k-cell to do that, but before it he proves that every k-cell is compact, and I think I can take a more simple compact to do this step. I has thinked in the closed ball, but don't know how to prove that it is compact. Can anyone help me to find this set, if it really exists? Thanks. How to use "grep" command to find text including subdirectories I want to find all files which contain a specific string of text. The grep command works, but I don't know how to use it for every directory (I can only do it for my current directory). I tried reading man grep, but it didn't yield any help. If $A$ is a square matrix and $A^2 = 0$ then $A=0$. Is this true? If not, provide a counter-example. Is a citizen of Canada required to apply for a US visitor visa after visiting Iran? Under new rules, non-US citizens from Visa Waiver Program countries who have visited Iraq, Syria, Iran, Sudan, Libya, Somalia, or Yemen are required to apply for a proper visa because they are no longer eligible for the VWP.   Does the above apply to citizens of Canada also? Canada is not a Visa Waiver Program country, but instead Canadian citizens can enter the US visa-free. If a Canadian citizen has visited Iran for example, is the entry procedure to the US any different?  I have looked through  but that page does not mention Canada. My wife wants a 4th baby, but I don't Proving that $\lim\limits_{x \to 0}\frac{e^x-1}{x} = 1$ How do I execute a string containing Python code in Python? why does IE need for me to click twice Suppose that   $$f(x)=1+\sum_{n=1}^\infty a_n \frac{x^n}{n!}\ \ \forall \ x\in \mathbb{R}$$   where $\sup_{x&gt;0}\left|e^xf(x)\right| &lt; \infty$ and $\sup_{n\in\mathbb{N}} |a_n|&lt; \infty$.      Prove that $a_n = (-1)^n$ , $\forall n\in \mathbb{N}$   It seems amazing to me. What we need to prove is $f(x)=e^{-x}$. It seems insufficient to prove this strong conclusion, but actually it is true and all the "counterexamples" I found were wrong.  My attempt  Put $g(x)=e^x f(x)$. $$\left|g^{(n)}(0)\right|=\left|\sum_{k=0}^n \binom{n}{k} f^{(k)}(0)\right|\le 2^n\sup_{n\in\mathbb{N}} |a_n|  $$ Put $h(x)=g(\frac{x}{2})$. Thus  $$h^{(n)}(0)=\frac{1}{2^n}g(0) \le \sup_{n\in\mathbb{N}} |a_n|$$ which implies that $$h(x)=1+\sum_{n=1}^\infty b_n \frac{x^n}{n!}\ \ \forall \ x\in \mathbb{R}$$ where $$|b_n|\le \sup_{n\in\mathbb{N}} |a_n| \ \ \forall \ n\in\mathbb{N}  \,\,\,\,\,\&amp; \,\,\,\,\,  \sup_{x&gt;0}\left|h(x)\right| &lt; \infty $$   And hence if $b_k&lt;0$, then there exists $l&gt;k$ such that $b_l&gt;0$. I want to yield a contradiction by supposing this, but I failed.  Any hints or other new ideas? Thanks in advance!   (I heard that this problem can be solved by complex analysis. This is the reason why I attach the complex-analysis tag.) I know that to better balance paragon and epic level players against similar level monsters, WotC changed the math used for monsters for MM3, and I believe that they changed some of the types of powers they gave monsters.   If I want to update monsters from MM1 or MM2 to be in line with MM3 era monsters, what changes should I make? How should we understand the teletransportation thought experiment? I have a large amount of duplicate records (25.000) in an even larger table (250.000 records). I've done the detection using the reporting function. The criteria I used to detect the duplicates were 3 fields (unique account identifier, unique user identifier and date). Based on a list of criteria, I would like to either merge or delete these records. I've got a handle on the logic associated with the merging and the deleting but what I'm having trouble with is defining the duplicate detection process.   I'm looking at either creating a custom object to take care of the detection or dumping the records into an SQL database and taking care of it offline. Any thoughts on which one of the two is the best approach?  Edit:  After reading the first comment, I think the more appropriate question would be "How do I approach the problem in SOQL".  The object I'm working with is the Event object and I'm really only looking at the standard fields, AccountId, OwnerId and ActivityDate. From what I've found online, there's no easy way to find records that have the same value for these three fields. I think it could be accomplished by nesting SOQL queries but I'd like to use a different approach if at all possible. WHERE IN (array of IDs) I have webservice which is passed an array of ints. I'd like to do the select statement as follows but keep getting errors. Do I need to change the array to a string?  [WebMethod] public MiniEvent[] getAdminEvents(int buildingID, DateTime startDate) {         command.CommandText = @"SELECT id,                             startDateTime, endDateTime From                             tb_bookings WHERE buildingID IN                             (@buildingIDs) AND startDateTime &lt;=                             @fromDate";      SqlParameter buildID = new SqlParameter("@buildingIDs", buildingIDs); } Do gravitational lenses work on gravitational waves? Do gravitational lenses work on gravitational waves? Could we get an Einstein cross of gravity?