Suppose I am talking about the composition $g \circ f$ (or more generally $f_n \circ \cdots \circ f_1$). Is there a generic term for the functions $f$ and $g$ (the functions $f_i$)?  "Compositand"?
What do you call the functions that make a composite function.  Example : $e^{\sin x} $ is made up of $\sin x$ in the argument of $e^x$  So what are $\sin x$ and $e^x$ called here in this context? Basic functions or something?   (Please don't tell me the former is trig and latter is exponential function, I know that, but that's not what I'm asking here, please try to understand)  Hope I made myself clear.
Adding tags to files in OS X: How to use, where are tags stored, and will they work on a network? I exported a map and everything looks fine when viewing the PDF. But when printing it on my plotter, all the text disappears. The scale bar would bring but the text associated to the scale bar wouldn't. The title block also disappears. I've tried messing around with the settings. I've checked/unchecked &quot;Embed All Document Fonts&quot; and &quot;Convert Marker Symbols to Polygons&quot;. I'm not sure what I'm doing wrong here. What's weird is I exported this map a few weeks ago and it printed just fine. Today, I needed to make a change to the map and exported it out, and now I am experiencing this issue. I must have changed one of the export settings in the past few weeks but I'm not sure what it is. Has anyone experienced this? Check Constraint with Case Statement I want to run a command when there are only 10 entities left. I know you can use /execute unless entity to detect when all matching mobs have died, but it doesn't work if you want to run a command when there are for example 10 entities left.  A command like /execute if entity @e[limit=10] does not work, it also triggers if there is only one entity.  Such a counting system could also be used to determine once there is only one player left in an arena, meaning they have won a battle or similar. Prove using induction that from a set of $n+1$ numbers from $\{1,2,..2n\}$, at least one number will evenly divide another. Given a set of $n+1$ numbers out of the first $2n$ natural numbers, $\{1,2,\ldots,2n\}$, prove that there are two numbers in the set, one of which divides the other.  I can't tell if I'm reducing the problem in the right way.  Would it be something like:  Induction Hypothesis: A set of $n+1$ numbers from the first $2n$ natural numbers contains two numbers, one of which evenly divides the other.  Base Case: $n=1$, $\{1,2\}$, 2 is divisible by 1.  Consider a set of $n+2$ numbers, $A$, from the first $2n+2$ natural numbers. There are three cases:   Each number in $A$ is less than or equal to $2n$.  The proof follows from the induction hypothesis. One number in $A$ is greater than $2n$.  The remaining set of $n+1$ numbers must each be less than or equal to $2n$.  The proof follows from the induction hypothesis. $A$ contains both $2n+1$ and $2n+2$. I'm not sure how to solve this case.   I'm working through Udi Manber's Introduction To Algorithms: A Creative Approach for personal development, so in keeping with the spirit of the book, I'm trying to use induction.  Without induction, the question is identical to I want to install Ubuntu on the C: partition where my Windows 7 is, simply to replace the systems. I've also tried to install it on another partition (without formating it), which failed!  All I get is:      No root file system is defined. Please correct this from the partitioning menu.   I want to install Ubuntu without formatting any of my partitions. Is that possible? Java URL encoding of query string parameters Maybe this is an easy question, maybe not.  I have a select box where I hardcode with width. Say 120px.    &lt;select style="width: 120px"&gt;   &lt;option&gt;REALLY LONG TEXT, REALLY LONG TEXT, REALLY LONG TEXT&lt;/option&gt;   &lt;option&gt;ABC&lt;/option&gt; &lt;/select&gt;     I want to be able to show the second option so that the user can see the full length of the text.  Like everything else.  This works fine in Firefox, but doesn't work with Internet Explorer6. How can I network two Ubuntu computers, so that they can "see" each other at an IP address? 301 redirect instead of 404 when URL is a prefix of a post or page name? hey all! i have an odd problem with URL routing. when i request a URL that doesn't exist, e.g. , wordpress correctly returns a 404. however, if that URL is a prefix of a post or page name, it instead returns a 301 redirect to the post or page.  for example, if i have a post on 10/1/2010 named Food Post, it will return a 301 with Location:  (my permalink structure). likewise, if i have a page named Food Page, it will return a 301 with Location: .  you can see this in action on my live site,  . e.g.  redirects to  .  turning off permalinks (ie switching to "default") fixes it, for both posts and pages, but naturally i don't really want to do that.  i see this on three different installations, all wordpress 3.0.1 and apache 2.2, two ubuntu lucid/mysql 5.1 and one freebsd 7.3/mysql 5.0. i've deactivated all plugins and removed everything from my .htaccess except the lines for wordpress below, verbatim, but no luck.  RewriteEngine On RewriteBase / RewriteRule ^wordpress/index\.php$ - [L] RewriteCond %{REQUEST_FILENAME} !-f RewriteCond %{REQUEST_FILENAME} !-d RewriteRule . /wordpress/index.php [L]   thanks in advance... Scaling HUD with variable resolution When should I use "shall" versus "will"? I see questions/information online about how to get rid of corpses but I'm not sure what the consequences to having them lying around are.  I know that I can use a morgue to store them and that they will eventually be taken away in a hearse. However, I've always just left them lying around. This doesn't seem to have any obvious consequences.  Do they upset prisoners or staff (e.g. increasing the danger level beyond what death normally does)? Make them sick? Slow down pathing? Is this something that's not implemented yet or is leaving dead bodies all over the place meant to be completely fine?  The wiki's pages for  and  don't shed any light on this. All I'm finding is the how of getting rid of corpses/glitches related to it but not why it matters in the first place. All I've seen that's related is that apparently prisoners can loot guard corpses for keys, but there's no obvious consequences for prisoner corpses which are what I tend to end up with.  So why not just leave them in the corridors? How do I change how executable files are handled by the file manager? When I double click on text files, nautilus asks me what I would like to do with them. I find this to be intrusive, as I just want them to open.  How can I fix this?  Note: This question is a "canonical" question on the subject; edit if needed. Note 2: Text files can be HTML, CSS, TXT, and more. Does $\sum_{k=1}^{\infty}\ln(\frac{k}{k+1})$ converge/diverges?? Does this series converge or diverge? $$\sum_{k=1}^{\infty}\ln(\frac{k}{k+1})$$   my thought is that, I can break it down to $$\sum_{k=1}^{\infty}\ln(k) - \sum_{k=1}^{\infty}\ln(k+1)$$ then maybe using comparison test or something? But I don't know exactly how to prove whether this series converges or diverges.  Any help would be appreciated! Does Moore's law apply to quantum computing? Plain and simple. Does  apply to quantum computing, or is it similar but with the numbers adjusted (ex. triples every 2 years). Also, if Moore's law doesn't apply, why do qubits change it? How to prove this inequality $\left|x\sin{\frac{1}{x}}-y\sin{\frac{1}{y}}\right|<2\sqrt{|x-y|}$? For any real numbers $x,y\neq 0$,show that $$\left|x\sin{\dfrac{1}{x}}-y\sin{\dfrac{1}{y}}\right|&lt;2\sqrt{|x-y|}$$ I found this problem when I dealt with . But I can't prove it. Maybe the constant $2$ on the right hand side can be replaced by the better constant $\sqrt{2}$? Thank you. Indent math blocks? I want all math blocks \begin{math} in my document to be intended automatically, like it's the case with \begin{itemize}.   Can anyone please give me a hint on how to do this? Thanks :-) It seems that $\{e\}, \{e,s\}, \{e,rs\}, \{e,r^2s\},...,\{e,r^{n-1}s\}, \{e,r,r^2,...,r^{n-1}\}, D_n$ are always subgroups of $D_n$. Especially when $n$ is odd, these seem to be the only subgroups. But when n is even, say $n=4$, then there are also $\{e,s,r^2,r^2s\}$ and $\{e,rs,r^2,r^3s\}$. It makes me wonder, is there a general formula/algorithm for finding all subgroups of $D_n$ when $n$ is even? Confused About Trigonometric Substitution