Minus one dollar or minus one dollars?
Is -1 followed by a singular or plural noun?
What's the easiest way to download all albums from Google Photos? I have around 950 albums at Google Photos.      I want to back them up now, but organised by albums, not by date.   Whenever I create a backup from within Google Photos, the backup splits my photos by date and adds metadata here and there.  What I am doing now is to click on every album, and choose "Download all". But this will take me ages.  Is there a way through Google Drive or another app to have a easier job? Cutting a circular hole in a hollow cylinder without distorting the cylinder Whenever I try to cut out a circular hole in either a cylinder or sphere the polygons around the circular hole always have distorted normals after smoothing. Is there anyway to fix this. I've tried using the remesh modifier but wind up with some pretty ugly results. Lily Potter chose to die instead of sacrificing her son Harry to Voldemort. In doing so, protective enchantments were created that protected Harry and made him less vulnerable to Voldemort and Voldemort's attempts to kill Harry.   Yet, I don't understand how Lily's enchantments, when Voldemort stole Harry's blood in the graveyard scene in Goblet of Fire (chapter 33, The Death Eaters), were helpful to Voldemort at all.     ‘He took my blood,’ said Harry.   ‘Precisely!’ said Dumbledore. ‘He took your blood and rebuilt his living body with it! Your blood in his veins, Harry, Lily’s protection inside both of you! He tethered you to life while he lives!’   Deathly Hallows - page 568 - Bloomsbury - chapter 35, Kings Cross   Yet I wonder about the following canon information:    Lily's enchantment was contingent upon Petunia Dursley giving Harry a home, which Petunia     grudgingly did&#185;. It was the blood bond between Harry and Petunia, plus the fact that Petunia gave Harry a home, where he could return to once per year, that sealed Lily's   protective enchantments and made them strong. Voldemort was never granted a home at the Dursleys, and in fact never stepped foot into the Dursleys' home at any point in canon. Never having been given a home at the Dursleys, how, then, did Lily, Petunia, and Harry's blood bond exist within Voldemort? Or did it? If it did, would it be because ? Lily's enchantments broke the moment Harry turned 17 and could not protect Harry any more&#178;. According to the 's page on Voldemort, Voldemort was 69 years old when he stole Harry's blood. If Lily's enchantment broke for Harry at age 17, why would the enchantments work for Voldemort when he was 69? Dumbledore tells Harry in Order of the Phoenix that Voldemort would not possess Harry because the love that fills Harry -- Lily's love -- is a force that Voldemort detests so greatly that he cannot bear to come into contact with it&#179;. Yet the love Lily infused into Harry runs in his veins; Voldemort took Harry's blood, the blood that is imbued with Lily's love. How can he bear to be in contact with the love given to Harry in his own veins?   Given this canon information, why did Lily's enchantments work for Voldemort?  &#185;Half-Blood Prince - chapter 3, Will and Won't and Order of the Phoenix - chapter 37, The Lost Prophecy &#178;Half-Blood Prince - chapter 3, Will and Won't &#179;Order of the Phoenix - chapter 37, The Lost Prophecy Fundamental question about dimensional analysis Converting a pointer into an integer I am trying to adapt an existing code to a 64 bit machine. The main problem is that in one function, the previous coder uses a void* argument that is converted into suitable type in the function itself. A short example:  void function(MESSAGE_ID id, void* param) {     if(id == FOO) {         int real_param = (int)param;         // ...     } }   Of course, on a 64 bit machine, I get the error:  error: cast from 'void*' to 'int' loses precision   I would like to correct this so that it still works on a 32 bit machine and as cleanly as possible. Any idea ? Grub does not show a Windows 8 option after dual boot FFMPEG video from images comes out same (yet incorrect) duration regardless of frame rate Using RegEX To Prefix And Append In Notepad++ I have quite a large list of words in a txt file and I'm trying to do a regex find and replace in Notepad++. I need to add a string before each line and after each line.. So that:   wordone wordtwo wordthree   become   able:"wordone" able:"wordtwo" able:"wordthree"   How can I do this? Ignore compile errors How can I set up a permanent compile loop that keeps trying even when there are errors? I'm using latexmk with a remote compile setup as discussed  and . However, if I save a document with a bug (either a legitimate bug, or I save it before closing a tag), then latexmk halts. Any suggests how I can have it pause, try again, and keep trying again, for ever and ever? Where to find the Mac OS X Lion security configuration guide? Which commands to convert a Ubuntu BIOS install to EFI/UEFI without boot-repair on single boot hardware? Can I get the "Diamonds to you!" achievement in singleplayer? How can one get the "Diamonds to you!" achievement in singleplayer? The achievement list cannot be completed without it. Perhaps it can be possible by passing a diamond to a zombie? Why is it possible to get significant F statistic (p<.001) but non-significant regressor t-tests? In a multiple linear regression, why is it possible to have a highly significant F statistic (p&lt;.001) but have very high p-values on all the regressor's t tests?  In my model, there are 10 regressors. One has a p-value of 0.1 and the rest are above 0.9    For dealing with this problem see the . In the simple linear regression case $y=\beta_0+\beta_1x$, you can derive the least square estimator $\hat\beta_1=\frac{\sum(x_i-\bar x)(y_i-\bar y)}{\sum(x_i-\bar x)^2}$ such that you don't have to know $\hat\beta_0$ to estimate $\hat\beta_1$  Suppose I have $y=\beta_1x_1+\beta_2x_2$, how do I derive $\hat\beta_1$ without estimating $\hat\beta_2$? or is this not possible? Solving $ax \equiv c \pmod b$ efficiently when $a,b$ are not coprime I know how to compute modular multiplicative inverses for co-prime variables $a$ and $b$, but is there an efficient method for computing variable $x$ where $x &lt; b$ and $a$ and $b$ are not co-prime, given variables $a$, $b$ and $c$, as described by the equation below?   $ a x \equiv c \mod b $   For example, given  $ 154x \equiv 14 \mod 182 $, is there an efficient method for computing all the possibilities of $x$, without pure bruteforce?  Please note that I'm not necessarily asking for a direct solution, just a more optimized one.    I do not believe that the Extended Euclidean Algorithm will work here, because $a$ and $b$ are not co-prime.   Edit:  Follow up question, since the first one had a shortcut:  Could the be computed efficiently as well?  $12260x \equiv 24560 \mod 24755$.  $107$ needs to be one of the computed answers. Find the limit if it exists of $S_{n+1} = \frac{1}{2}(S_n +\frac{A}{S_n})$ What is the proper etiquette at Japanese onsen? Japan is a volcanically active country which means it has a plethora of onsen (hot springs) all around the country.  Visiting these onsen is supposed to be a popular vacation destination for the work-weary Japanese.    I've been told that, as with other things in Japan, there is a rather strict etiquette surrounding the use of the onsen.  In particular, the two things I've read about so far are   Swimming Suits are not allowed. It is very important that one bathe immediately before entering the onsen.   Are these true?  Are there any other taboos that a naive American should be aware of? Probability of $p(x_1<x_2<\max(x_3,x_4))$ How to render a background image in 2.8? What is a “protected” or "highly active" question?