Can a Wizard tell which Alarm spell was tripped?
If I set multiple Alarms, can I tell them apart?
Decide if the series converges and prove it using comparison test: $\sum_{k=1}^{\infty}\frac{1}{2k+3}$ Decide if the series converges and prove it using comparison test:   $\sum_{k=1}^{\infty}\frac{1}{2k+3}$   $$\frac{1}{2k+3} &lt;\frac{1}{2k}&lt;\frac{1}{k}$$  and since $\sum_{k=1}^{\infty}\frac{1}{k}$ diverges (we have defined that in our readings, so I can claim it here), the complete series will diverge, too.  Did I do everything correctly? What makes me feel a bit unsure is that there is no "$\leq$" sign anywhere and when I look up the comparison test on the internet, I don't see any "&lt;" or ">" in the definition.  Is it correct anyway? Given $a>b>2$ both positive integers, which of $a^b$ and $b^a$ is larger? I have cobbled together a command to return the process ID of a running daemon:  ps aux | grep daemon_name | awk "{ print \$2 }"   It works perfectly and returns the PID, but it also returns a second PID which is presumably the process I'm running now. Is there a way I can exclude my command from the list of returned PIDs?  I've tested it a few times and it appears my command is always the second PID in the list, but I don't want to grab just the first PID in case it's inaccurate. What's the difference between "established" and "founded" In this sentence: "CARE was ...... in 1945 to help people after World War II."    A. founded  B. built C. established D. constructed    The answer is C. But why don't we use "founded" in this case, I think they have the same meaning. Can you help me to give a reason for that? Free GIS workshops, tutorials, and applied learning material This Q&amp;A lists free as in $0 workshops in GIS and related fields that have their material available to view or download online. The list is not limited to FOSS GIS, as GISers usually use a combination of open and closed source tools to accomplish their tasks. Some of these tools are easier than others and some are better documented. This list will be a great benefit to the community especially for new comers to the field. General GIS   from   from   from   from   Open-source GIS   from   from   from   from   from   ESRI Products   from   from   Transportation These links include either theoretical or applied transportation knowledge in transportation planning          Disaster Management    Databases   from   Geo Statistics    from It's really hard to get started on Stack Overflow I have been on Stack Overflow for some time.  It is an AMAZING resource and don't know if I would've got through the past 18 months without it.  I love it!  Problem is that I have "1" reputation.  All of my questions have already been asked and answered.  My "new user restrictions" mean: - I can't vote up answers that were helpful. - I can't comment on answers.  I sometimes have a question to ask one of the users that answered someone else's question but I can't.  This is hard!  How do I get a break?  Do I have to troll for a couple of days/weeks/months to answer enough questions in the hope someone votes some of them up just so I can do some basic functions?  Perhaps the number of site visits and length of membership could count for something? Probability of winning the game 1-2-3-4-5-6-7-8-9-10-J-Q-K A similar question to mine was answered here on stackexchange:    However, I am unable to follow the formulas so perhaps someone could show the calculation and the way they arrived at it to answer this question.  My card game is very similar, except the counting of cards goes all the way from 1 (Ace) through to King and then restarts.  If you can make it through an entire deck of cards without hitting the same ranked card you win.  So, for example, if you call out Ace - 2 -3 - 4 - 5 - 6, etc. and hit "7" when you've just called out "7", you lose.  What is the chance of winning this card game? When transfering data using TLS the browser and server agree the cipher suite to be used - so for example this could be chosen as AES-128 and is (probably) outside of my control. If I separately encrypt a file using AES-256 and then Alice downloads this via her browser (using AES 128) have I still effectively got AES-256 security?  My reasoning goes like this: even if the AES-128 encryption on the TLS link was broken by Eve then all she would get is the AES-256 encrypted file and she would then have to break that encryption to see the plaintext.  Of course the AES-256 key is sent to Alice over a separate channel. How do you keep parents of floated elements from collapsing? Strange GET requests in logs I'm getting the following GET requests in my apache logs:  109.230.251.14 - - [29/Mar/2011:16:28:18 +0100] "GET http://209.191.92.114/config/pwtoken_get?login=jackmcphee232&amp;src=ygodgw&amp;passwd=e59e2240415e6f1aba3da72b8f189f4e&amp;challenge=9TbU_9yfZhKmzlHtK9X4OkQlesTH&amp;md5=1 HTTP/1.0" 404 1226 "-" "-"   Any idea what it could be and how is that possibly a get request? That IP address seems to point to Yahoo! I'm very confused. Error when updating texlive 2015 When I want to update packages of texlive 2015 I get this error? what is the problem?  tlmgr update --list  The locale codeset (cp720) isn't one that perl can decode, stopped at   C:\texlive \2015\tlpkg\tlperl\lib/Encode/Locale.pm line 123. Compilation  failed in require at C:\texlive\2015\tlpkg\tlperl\lib/LWP/UserAgent. pm  line 1001. Firefox application associations not working in the 'Downloads' window Why does `last` show '{' and '|' in the TTY field? optimality of the Carnot cycle It is well-known and is stated always and everywhere that the Carnot cycle is the most efficient thermodynamic cycle. Although stated as such it is rarely proven. One proof is in the article &quot;Engine Efficiencies and the Second Law of Thermodynamics&quot;, (AMERICAN JOURNAL OF PHYSICS VOLUME 37, NUMBER 11 NOVEMBER 1969), Tobin proves that among all engines performing a cycle, so that the engine returns to its starting state, the Carnot cycle is the most efficient where efficiency is defined as $\epsilon= 1-\frac{Q_{rejected}}{Q_{absorbed}}$, and the Carnot cycle is defined as one consisting of an isothermal-adiabatic-isothermal-adiabatic segment. The proof assumes the Clausius equality, that is in a reversible cycle $\oint \frac{\delta Q}{T} = 0$. Then using the geometry of the picture below a simple argument over the areas enclosed in the cycles IABCDJI vs. IAEFGDJI (heat absorbed) or IJDAI vs. GHEAIJDG (heat rejected) will show that any other cycle working between the same temperature limits such as EFGHE will have lower efficiency than the Carnot cycle ABCDA. But this proof assumes tacitly that pieces EFG and GHE are such that $dS&gt;0$ and $dS&lt;0$, respectively. Here I am thinking of a nasty cycle such as shown in the next figure in red where the cycle cannot be neatly separated into two and only two monotonic parts having $dS&gt;0$ or $dS&lt;0$. There is no obvious reason why that restriction should hold in general. Clearly this monotonicity should hold if the engine has only temperature as its independent &quot;force&quot; but if the engine's state needs more than one independent force variable than the situation is more complicated. Instead it is reasonable to assume that any physical cycle should have finite number of monotonic pieces, kind of a &quot;thermodynamic Dirichlet condition&quot; but it could also have self intersections, little loops, and other ugly features when projected on the TS plane. How would then one prove the optimality of a Carnot cycle? Or ugly cycles on the ST plane are non-physical even if there are more than one thermodynamic variables? [] [] Grammar checking program for LibreOffice Is there a tool for checking grammar in LibreOffice? Is there a way to view a comment's source? My Ubuntu 12.04 was normally updated through the Update Manager, something about gtk. Then I rebooted and now all that shows after the splash screen is a blue screen that only shows the cursor. How do the sets $\emptyset\times B,\ A\ \times \emptyset, \ \emptyset \times \emptyset $ look like? If we have a function $f:A \rightarrow B$, then one way to give meaning, I think, to this function, in terms of set theory, is to say, that $f$ is actually a binary relation $f=(A,B,G_f)$, where $G_f \subseteq A \times B$ is the graph of the function. Now my question is: what is $f$ if   $\bullet \ A=\emptyset, \ B\neq\emptyset$,?  $ \bullet \ B=\emptyset, \ A\neq\emptyset$ ?  $ \bullet \ B=\emptyset, \ A=\emptyset$ ?  (Another way to formulate this, I think, would be: How do the sets $\emptyset\times B,\ A\ \times \emptyset, \ \emptyset \times \emptyset $ look like? Are they all $\emptyset$ ?) In how many different ways can you split $10$ people into two groups of $5$ people? In how many different ways can you split $10$ people into two groups with the same amount of people?  My attempt: Since the order in which you choose someone doesn't matter, I chose to calculate the combinations: $10 \choose 5$ It would be similar to trying to be extremely careful or precise.   In French it would be "application", For example: "Qui est fait avec application".   Example usage:      John worked with ________. or ...it was done with _______.