Double apostrophe-s? I want to say parking of McDonald's, i.e. using an apostrophe S. Would I say McDonald's's parking?
Possessive of a word that is already possessive If the cricket ground Lord's is a possessive, what if you want to describe something belonging to Lord's? Would you say:     I was very impressed by Lord's's customer services.   It doesn't look right, so what is the correct way of writing it?
Why are there 2 packages for some applications (e.g. Chromium) in Ubuntu Software? After the therapy, eight children (43%) became able to crawl/move on their back.   Or should I use "on their backs"?   Singular because each child only has one back, or plural because we're dealing with eight backs? How do I sort an NSMutableArray with custom objects in it? On finding polynomials that approximate a function and its derivative (extensions of Stone-Weierstrass?) MTMFS consuming an entire CPU core and fans running full bore with Lion You may be aware that Lion introduced MTMFS, the Mobile Time Machine File System.  I've had a couple of instances now where MTMFS has been chewing up an entire core of my dual-core (mid 2009) MacBook Pro for hours on end with no evidence that it's actually doing anything constructive.  As a consequence, CPU temperature rises and the cooling fans run fast and noisy.  Restarting the machine quietened things down again, but I'm expecting it to start again.  Does anyone understand MTMFS well enough to suggest why it's keeping itself busy (or is it most likely, simply a bug), or if there's currently any solution? I fear I may have gone deaf or been scalded to death before Apple release an update... Given a DateTime representing a person's birthday, how do I calculate their age in years? When is the limit of a sum equal to the sum of limits? I was trying to solve a problem and got stuck at the following step:  Suppose ${n \to \infty}$ .  $$\lim \limits_{n \to \infty} \frac{n^3}{n^3} = 1$$  Let us rewrite $n^3=n \cdot n^2$ as $n^2 + n^2 + n^2 + n^2 \dots +n^2$,$\space$ n times.  Now we have  $$\lim \limits_{n \to \infty} \frac{n^3}{n^3} = \frac {n^2 + n^2 + n^2 + n^2 + n^2 \dots +n^2}{n^3} $$  As far as I understand, we can always rewrite the limit of a sum as the sum of limits ...  $$\dots = \lim \limits_{n \to \infty} \left(\frac{n^2}{n^3} + \frac{n^2}{n^3} + \dots + \frac{n^2}{n^3}\right)$$  ...but we can only let ${n \to \infty}$ and calculate the limit if all of the individual limits are of defined form (is this correct?). That would be the case here, so we have:  $= \dots \lim \limits_{n \to \infty} \left(\frac{1}{n} + \frac{1}{n} + \dots + \frac{1}{n}\right) =$[ letting ${n \to \infty}]$ $= 0 + 0 + \dots + 0 = 0$  and the results we get are not the same.  Where did I go wrong? When doing an apt-get update/upgrade I see that warning  W: Conflicting distribution: https://downloads.plex.tv/repo/deb public InRelease (expected public but got )   I was upgrading to Ubuntu Zesty 17.04 before and do not know how to fix the above. Already have seen ? but there are no suggested fixes for that.  Maybe one of you can give some hints? Thanks! Can't disable windows 10 PIN complexity I recently linked my Microsoft Office account to my school to have access to Office for students. Right after linking my account, I couldn't login to my computer again with my 4-digit pin code and got the message: "your organization has set the following pin code requirements. Your pincode has to be at least 6 digits long."   I had to change my pincode but I want to change it back to my original 4-digit one. Some internet research has made me enable gpedit.msc, but when I try to find the PIN complexity setting in gpedit (Computer Configuration\Administrative Templates\System\PIN Complexity) it just isnt't there.   Another possible path in gpedit I found on the internet to do this was: Computer Configuration > Administrative Templates > Windows Components > Windows Hello for Business > PIN Complexity, but that also didn't work as I don't have "Windows Hello for Business"   I also tried resetting my computer to the date before I joined my 'organization', but that didn't work either.   Does anyone have an idea how I can resolve this issue? When activating the evolution for a caught Pokemon, it seems to amplify the Combat Power (CP). Thus it seems most beneficial to evolve your Pokemon with the highest CP, if you have multiple of the same kind.   But what I am not sure about is whether it makes an efficiency difference if you spend candies and dust to boost CP before evolving, to gain more from the amplification? Or is it more efficient to just evolve without spending, and then using the leftover candies afterwards, since they now give a bigger CP boost per candy?   I only tested with a Rattata so far, which gained +8 CP per candy before evolving, and +15 CP afterwards. I collected no numbers on the amplification efficiency though, and now ran out of materials for further testing.  Or maybe it is a balanced calculation and makes no difference at all? I would love to have some insight on that.    Some data I collected thus far: (GPC = CP gain per candy)  79 CP Weedle (GPC 6) evolved to: 84 CP Kakuna (GPC 6), evolved at 90 CP to: 297 CP Beedrill    Note: The max-CP "half circle" in the profile stayed filled roughly at the same relative position throughout the evolutions. Before I start, don't lecture me on the fact that FAT32 is old and hasn't been updated for nearly 20 years. Right now I have sorted that. I am trying to install Ubuntu Linux onto a 64GB flash drive and it wants me to format it to one of the EXT file systems.  The problem is if I put the flash drive into a Windows PC, I can't use it. I also can't install the required software onto every Windows PC that I will use. When I tried to install it on FAT32 I got an error and there is no option for NTFS.  Does anyone know how I could do this? Maybe a Windows based tool? Thanks in advance. Combinatorics Distribution - Number of integer solutions Concept Explanation I reading my textbook and I don't understand the concept of distributions or number of solutions to an equation.  It's explained that this problem is 1/4 types of sampling/distributions problems.  An example is provided to illustrate:     In how many ways can 4 identical jobs (indistinguishable balls) be distributed among 26 members (urns) without exclusion (since one member can do multiple jobs)?      A sample outcome might be:   $\text{_____________}$   |  A  |  B  |  C  |...|  Z  |    $\text{--------------------}$      $\text{_____________}$   |  o  | oo|    |   |    ||| o  |    $\text{_____________}$   |  A  |  B  |  C  |...  |  Z  |    $\text{--------------------}$      Thus, the question is reduced to, "How many $(26-1+4)$ letter words are there consisting of four circles and $(26-1)$ vertical lines?"  Therefore, the solution is:  $\binom{26-1+4}{4}$   I really don't understand why its $(26-1+4)$.  There's only 26 different spots or "urns" to place the 4 jobs.  Can someone please explain?    I looked through another text to try and understand and I found it explained as such:       There are $\binom{n+r-1}{r-1}$ distinct nonnegative integer valued vectors $(x_1,...,x_r$ satisfying the equation $(x_1 + ... + x_r = x_n$ for $x\ge0$. $\spadesuit$   How in the world are they deriving this?  For distinct positive integers I understand:  Assume I have 8 balls (n=8) and I have 3 urns (r=3): o^o^o^o^o^o^o^o, where o represents  a ball and ^ represents a place holder where an urn could be placed.  For this scenario:     There are $\binom{n-1}{r-1}$ distinct positive integer valued vectors $(x_1,...,x_n)$ satisfying the equation:  $x_1 + ... + x_n = n, x_i&gt;0, i=1,..,r$ $\clubsuit$   It's clear that I could have this specific case ooo|ooo|oo.  Here the bar represents a divide for the urn and you see I have 3 sections.  So that case is clear.  Can anyone please explain this problem to me?  I don't understand the nonnegative integer case.   Also, people who post tend to be crazy smart and explain things very in a complicated manner.  I'd appreciate it if it could be explained in layman's terms as much as possible.   Thank you!!! Is losing privileges after placing bounty OK? My rep went over 2,000 today which meant I could edit other people's posts. Great! Then I added a bounty to a previous question, which brought me back down to 1,984...and I can no longer edit other posts. Should this changed? Or is this ideal? Delete with Join in MySQL Here is the script to create my tables:   CREATE TABLE clients (    client_i INT(11),    PRIMARY KEY (client_id) ); CREATE TABLE projects (    project_id INT(11) UNSIGNED,    client_id INT(11) UNSIGNED,    PRIMARY KEY (project_id) ); CREATE TABLE posts (    post_id INT(11) UNSIGNED,    project_id INT(11) UNSIGNED,    PRIMARY KEY (post_id) );   In my PHP code, when deleting a client, I want to delete all projects posts:  DELETE  FROM posts INNER JOIN projects ON projects.project_id = posts.project_id WHERE projects.client_id = :client_id;   The posts table does not have a foreign key client_id, only project_id. I want to delete the posts in projects that have the passed client_id.  This is not working right now because no posts are deleted. Conjugacy Class in a matrix group with columns of standard basis I want to find the conjugacy classes of this group: $$G=\{(a_1,a_2,a_3):a_i=\pm e_j\}\subset GL_3(\mathbb C)$$ I know that $S_3$ is one of the subgroups of this group, so I can check which elements of $S_3$ continues to be conjugate in our group, I know that in $Z(G)$ there is two elements $I,-I$. I know that I have to check the diagonal matrices on which ones are conjugate, but I don't know how to finish and find the others conjugacy class of this group, and I don't Know how to find the number of the elements of the conjugacy class. I'll be thankful for help How exactly to compute the ridge regression penalty parameter given the constraint? The accepted answer in  does a great job of showing that there is a one-to-one correspondence between $c$ and $\lambda$ in the two formulations of the ridge regression: $$ \underset{\beta}{min}(y-X\beta)^T(y-X\beta) + \lambda\beta^T\beta $$ and  $$ \underset{\beta}{min}(y-X\beta)^T(y-X\beta) \text{ s.t. }\beta^T\beta\leq{c} $$  The linked answer shows this in the orthogonal case.    In a general (non-orthogonal case), how can I compute $\lambda$ from $c$?  Update Here is an answer for going from $\lambda$ to $c$:   Assuming that the coefs are constrained by the penalty, $$ \beta^T\beta = c $$ and  $$ \beta = (X^TX + \lambda I)^{-1}X^Ty\\ \beta^T\beta = c = \beta^T(X^TX + \lambda I)^{-1}X^Ty $$  Still working on going the other way Quick easy way to migrate SQLite3 to MySQL? Anyone know a quick easy way to migrate a SQLite3 database to MySQL? Autodesk Maya symbol lookup error on start after installing AMD proprietary driver on Ubuntu 18.04 I've installed Maya 2018 on Ubuntu 18.04 and tested it with the amdgpu driver (open source) and it launched without problems, but some components were not working with the open source driver so I tried amd gpu pro 18.20 (amd closed-source driver). I ran  ./amdgpu-pro-install   but since then Maya won't work and gives this warning message:  ./maya.bin: symbol lookup error: /usr/autodesk/maya2018/bin/.. /lib/libOGSDeviceOGL4-16.so: undefined symbol: EVP_CIPHER_CTX_init   My card is hd7770 and it's supported by the amd closed driver, so what am I doing wrong? Understanding the difference between two theorems related to $|G\,:\,K|=|H\,:\,K|\cdot|G\,:\,H|$. How to delete files from a folder using a list of file names in windows? i have a folder with 2K+ files in it, i need to delete around 200, i have a txt file with all the file names i need removed ordered in a list, how do i remove the specific files from the folder using the list? (OS is windows 7)