I'm going to name my new business, I got an idea from another company called "ZZZ Men Supply"  and come up with "XXX Gentlemen Supply" for my business. Since the word Gentlemen slightly longer I want to use the abbreviation for it, which one is better: "XXX Gent Supply", "XXX Gent's Supply" or "XXX Gents Supply"?  Thanks
I've been living in Ireland for almost a year now and I start noticing they use the word "mens" a lot. I can see it used in:   Shops, to denote the area where you can find men's clothes In sport, when they talk about "mens team".    My guess is just that they are lazy about the use of quotes, so that mens should actually be men's. However, there may be some rule I'm not aware of. So, is "mens" only limited to Irish English? When I'm allowed to use it?
Where do I ask where to ask? If I have a specific question I want to ask about, but I don't know which Stack Exchange site would be on topic for asking that question, where can I ask where to ask that question?  Is there any generic place where we can ask for advice? Is it here?  This is not about a specific question but in general.  For example: "Where should I ask for advice about fishing?", or if I need to know where I should ask "What would be the best fishing rod to fish for salmon?" (regardless of how good/bad these examples are) Hungerford's book of algebra has exercise $6$ chapter $3$ section $6$ [Probably impossible with the tools at hand.]:     Let $p \in \mathbb{Z}$ be a prime; let $F$ be a field  and let $c \in  F$. Then $x^p - c$ is irreducible in $F[x]$ if and only if $x^p - c$   has no root  in $F$. [Hint: consider two cases: char$(F) = p$ and   char$(F)$ different of $p$.]   I have attempted this a lot. Anyone has an answer? With \setbeamercovered{transparent} covered parts of a slide are displayed transparently. If there is a (small) picture among the text, it is shown as it is. Beamer has only this picture, so it shows this picture. My question: How can I give a gray version of the picture to beamer such that in covered parts of a slide, this gray version is used? Proof of Dobinski's formula for Bell numbers Run a command without making me wait On the CLI, sometimes a command I type takes a while to complete, and sometimes I know when that's about to happen. I'm a bit confused on "backgrounding" and such in Linux.  What is the most common (or user-friendly way) of telling the CLI that I don't want to wait, please give me back my prompt immediately. And if it could give me a progress bar or just busy-spinner, that would be great! Can I choose which records are copied in a Partial Copy sandbox? We have a partial copy sandbox that we're using for development and testing.  This is really helpful as some of our applications internally store Salesforce id's.  However, there is a limitation with the partial copy as it only brings in 10,000 records per object from the production environment.  Unfortunately some of the id's we internally store are not being brought down into our partial copy which causes errors.  The 10,000 records that it did copy over aren't needed; I realistically only need 1 or 2.  Is there any way I can achieve copying over a specific record from the production environment? Detect init system using the shell I have a number of friends on my battle.net account. However, sometimes I don't want to appear online to some (or all) of them. Is there a way to be hidden from your friends on battle.net? Is doing two PhDs a good path? I am studying a combined bachelor of engineering (electrical) and bachelor of mathematics; I just started this year and will graduate in 2018. The reason why I am doing double degrees and not a single degree is because I love both electrical engineering and mathematics and I could not ignore any of them. So with this in mind, I am thinking of doing two PhDs when I graduate (one in electrical engineering and one in mathematics). Is this a good path or I should concentrate on only one of them? I have a issue with my Drupal installation, for example:   when I enable or disable the modules, It redirects me to a blank page, when I create a new content type and save it, redirects me to a blank page, when I add a new view and save it, it redirects me to a blank page, when I try to clear the cache, it redirects me back to a blank page, or in similar cases.   Basically all the confirmation pages redirect me to a white screen. When I refresh it again, it shows me the page. I tried to increase the PHP memory value but it doesn't help.  Are there any other solutions for this?  The error which I'm having:      Fatal error: Allowed memory size of 100663296 bytes exhausted (tried to allocate 8192 bytes) in sites/all/modules/views/plugins/views_plugin_localization_none.inc on line 1 Can't boot Ubuntu or Windows 8 after Ubuntu 64-bit install on Samsung series 7 Windows 8 laptop, error "All boot options are tried." I have a Samsung Chronos 7 laptop (NP770Z5E) pre-installed with Windows 8, and I wanted to install Ubuntu 13.04 alongside it, so I can dual boot. Here is what I've done:  Updated BIOS to lastest version (P04ABU) using Samsung Updater Reduced Win8 partition by half, I left the others untouched Created a bootable USB stick using  and a Ubuntu 13.04 64-bit image Disabled FastStartup on Win 8 Disabled Fast BIOS Mode Boot Mode changed to CSM OS  Update:  Also disabled Secure Boot (I had to disable it in order to select CSM OS)  After that I saved the BIOS settings, and shut down the computer. I plugged in the USB drive, powered the computer on, entered the BIOS and tried to change the boot order. Oddly, there was only one option in the boot order screen, the USB drive (HDD didn't show up in the boot priority screen). I ignored that and installed Ubuntu. I've created 3 partitions from the unused spaced left: a 8GB swap, a 100MB BIOS boot partition, and the rest to ext4, mounted in /. Boot loader installed on /sda. After a reboot, this message appears:  All boot options are tried. Press &lt;F4&gt; key to recover with factory image using Recovery or any other keys for next boot loop iteration.  So I went to the BIOS to change the boot device priority, and the list is empty! Enabling Secure Boot and Fast BIOS had no effect. I used the Ubuntu Live USB to check the disk contents, I can see the Ubuntu and Win 8 partitions. I've used Boot Repair (using the Recommended Repair), with no avail, the Boot Repair log is here:  Boot Repair showed me a message about the system being a&quot;EFI system&quot;. I suppose that means that I should have checked out the advanced settings. I don't know how to proceed. I don't know if it's a good idea to &quot;recover with factory image&quot; since I have modified the original partitions. Maybe I need to experiment with Boot Repair's advanced settings. Linear vs nonlinear differential equation How to distinguish linear differential equations from nonlinear ones? I know, that e.g.: $$ y''-2y = \ln(x) $$ is linear, but $$ 3+ yy'= x - y $$ is nonlinear. Why? Prove that there exist two integers such that i - j is divisible by n. Here's the full question:  Prove that, for any $n + 1$ integers, $\{x_0, x_1, x_2, . . . , x_n\}$, there exist two integers $x_i$ and $x_j$ with $i \neq j$ such that $x_i − x_j$ is divisible by $n$.  Now, the integers aren't necessarily consecutive, positive, or without repeats. I've tried breaking this into cases, such as "$x_i = x_j, \dfrac{0}{n} = 0$" etc. But I don't think it's possible to exhaust the cases.  I feel like there should be an easy way to contradict this one, by saying that $x_i - x_j$ isn't divisible by $n$. But I just wasn't getting anywhere with that one.  I thought about using induction, but I would have just as hard a time proving this for $n$ integers before $n+1$ integers, so I don't think it would be possible for me to do it that way.  If anyone could help out, that would be wonderful. I'm pretty stuck here. Cardinality of cartesian product of an infinite set with N Here the problem 1.4.26 from Sohrab, Basic Real Analysis  Duplicate  This are not duplicate of this question:    the answer gives no proof  despite the title is not really connected  only finite set   Problem  Show that, if $A$ is an infinite set, then $|A\times\mathbb{N}|=|A|$. Hint: Let $\mathcal{F}$ denote the set of all bijective maps $f:S\times\mathbb{N}\to S$, where $S\subset A$. Since $|\mathbb{N}\times\mathbb{N}|=|\mathbb{N}|$, we have $\mathcal{F}\neq \varnothing$ (Why?) Show that Zorn's Lemma can be applied in $\mathcal{F}$ to produce a maximal bijection $h:B\times\mathbb{N}\to B$, with $B\subset A$, and that we must have $B=A$, by examining the cases where $S\setminus B$ is finite or infinite.  Proof  Let $\mathcal{F}$ denote the set of all bijective maps $f:S\times\mathbb{N}\to S$, where $S\subset A$. Since $|\mathbb{N}\times\mathbb{N}|=|\mathbb{N}|$ (see exercise 1.4.10(i)), we have $\mathcal{F}\neq \varnothing$ (From Exercise 1.4.22(d) we know that for a infinite set $A$, we have $|A|\geq\aleph_0$, and $|\mathbb{N}|=\aleph_0$, thus there is an injection from $g:\mathbb{N}\to A$, and, by defining $S:=g(\mathbb{N})\subset A$, we get a bijective map (composition of two bijective maps) $S\times\mathbb{N}\to\mathbb{N}\times\mathbb{N}\to\mathbb{N}\in\mathcal{F}$).  If we consider the inclusion as partial order, then every chain $S_i\subset A$, $i\in I$, has $A$ as upper bound and applying Zorn's Lemma, we get the existence of a maximal $\bar{S}$ and hence a bijection $h:\bar{S}\times\mathbb{N}\to\bar{S}$, with $\bar{S}\subset A$.  Now we prove that $\bar{S}=A$. $R:=A\setminus \bar{S}$. $\bar{S}$ is infinite, since the example of element of $\mathcal{F}$, that we gave above is bijective to $\mathbb{N}$. We have to do this. The second is trying to follow the hint and is incomplete:   Consider that $A\neq\bar{S}$, then there is $r\in R:=A\setminus\bar{S}$. We chose an element $s\in\bar{S}$ and define the bijection $h':\bar{S}\cup\{r\}\times\mathbb{N}\to \bar{S}\cup\{r\}$ as follow  $h'(a,n)=\begin{cases}h(s,2n-1)&amp;\text{for }a=s\\ r&amp;\text{for }a=r,n=1\\ h(s,2n-2)&amp;\text{for }a=r,n\neq 1\\ h(a,n)&amp;\text{otherwise}\end{cases} $  Since $\bar{S}\subsetneq \bar{S}\cup\{r\}$ we get a contradiction to the maximality of $\bar{S}$. Now either $R$ is finite or infinite. 1) $R$ finite, let say $R=\{r_1,\cdots,r_n\}$. Then chose $n$ elements $s_1,\cdots,s_n\in\bar{S}$ and we define the bijection $h':A\times\mathbb{N}\to A$ as follow $h'(a,n)=\begin{cases}h(a,2n-1)&amp;\text{for }a\in\{s_1,\cdots,s_n\}\\ a&amp;\text{for }n=1,a\in\{r_1,\cdots,r_n\}\\ h(s_i,2n-2)&amp;\text{for }a=r_i\\ h(a,n)&amp;\text{otherwise}\end{cases}$  In case $n&gt;0$ we get a contradiction with $\bar{S}$ being the maximal element.   Thus we have only to exclude the case 2) $R$ infinite. HOW TO DO THAT?   Question  Above I tried two proofs. The first part is the same. The two second parts are given by the two bullets.  The second proof tries to follow the hint.  My questions are:   - Is my proof correct?   - In which direction should go the proof from the hint? How much sleep do adults actually need? The common consensus is that most adults should get 8 hours of sleep a night.  However, sleep needs are highly variable, with some people needing more to function properly, and some gaining little benefit past just a few hours. I'm trying to learn more about the statistics here.  I'd imagine sleep needs would fit a normal distribution, with a median of around 8 hours and a standard deviation of around an hour. The  would then put 68% of adults in the 7-9 hour range, 95% in the 6-10 hour range, and 99.7% in the 5-11 hour range, but that's just a guess.  Has this distribution been studied, and where? GRUB Help and Reinstalling Ubuntu Recently, I installed Ubuntu 10 Netbook edition (on my netbook, yes, obvious). My battery died literally, while I was using Ubuntu.   Now, when I restart the computer, it seems that GRUB has duplicated all of the entries in the MBR that pertain to the partition that houses my Ubuntu install. For example:  Ubuntu ... Ubuntu ... (Recovery Mode) Ubuntu ... Ubuntu ... (Recovery Mode) Memtest ... Memtest ... Windows (Vista loader) Windows (Windows 7 starter loader)    When I try to access either of the two Ubuntu instances in the boot loader it presents me with an error akin to this:   ...numbers... Kernel panic ... VFS unable to mount...   What I would like to do is:  Wipe out grub, and Ubuntu, and then reinstall Ubuntu (I really only use it for emacs and ess for R so there's nothing in the home directory that I need to backup)  How would I go about "resetting" my system? Or fixing the issue that I have.   Thanks in advance!   BEB Show that the function $g(x) = x^2 \sin(\frac{1}{x}) ,(g(0) = 0)$ is everywhere differentiable and that $g′(0) = 0$ Show that the function $g(x) = x^2 \sin\left(\frac{1}{x}\right) ,(g(0) = 0)$ is everywhere differentiable and that $g′(0) = 0$. Why are there holes in the icing? How do you install an APK file in the Android emulator? What is the best (or preferred method) of setting a url parameter on a visualforce page embedded on a standard layout page?    This is easy to do when creating a custom link or a button, but I don't get how to do this on page load via the Apex Controller for the page.   When using a custom button you can do something like /apex/MyPageName?parameter=value  Can I use something like this?   ApexPages.currentPage.getParameters().put('Id',myId)