Punctuation before "and" What would be the proper placement of commas before "and" in this situation?  I think that A, B, C and D are useful qualities and will help her complete the assignment.
Should I put a comma before the last item in a list? Should I put a comma before the last item in a list?     I would like crackers, cheese and some soda.   I would like crackers, cheese, and some soda.
If an email message contains an email address in the body, Gmail automatically converts it into a mailto: link, which is helpful.  And many times each day I've enjoyed being able to right-click a mailto: link in an email (within Gmail) and then click "Copy email address" in the context menu.  Then I can paste that email address into a program (such as when I want to search a database).  However, within the past month or so, I've noticed that I can't right-click and click "Copy email address" without Gmail then popping open a "New Message" panel and changing my current URL to have ?compose=new at the end.  I wonder if it's related to .  How can I disable it?  I'm tried of having to click the "Discard draft" trash can button so many times throughout the day. Does the  tag position in HTML affects performance of the webpage? Where are minecraft languages stored and how can I add a new one? I have a Lenovo T570 with Xubuntu 18.04 LTS. My current issue is that my cpu speed stepping is kind of going nuts and does what ever it thinks its best.  Sample: when I run my IDE and cpu load increases during build time, the governor changes automatically. I caught the moment during compiling my project with the following call:  martin@martin-ThinkPad-T570:~$ while cat /sys/devices/system/cpu/cpu0/cpufreq/scaling_governor; do sleep 1; done powersave powersave performance performance   cpufreq-info tells me this:  martin@martin-ThinkPad-T570:~$ cpufreq-info  cpufrequtils 008: cpufreq-info (C) Dominik Brodowski 2004-2009 Report errors and bugs to cpufreq@vger.kernel.org, please. analyzing CPU 0:   driver: intel_pstate   CPUs which run at the same hardware frequency: 0   CPUs which need to have their frequency coordinated by software: 0   maximum transition latency: 4294.55 ms.   hardware limits: 400 MHz - 3.50 GHz   available cpufreq governors: performance, powersave   current policy: frequency should be within 3.50 GHz and 3.50 GHz.                   The governor "performance" may decide which speed to use                   within this range.   current CPU frequency is 3.25 GHz. analyzing CPU 1:   driver: intel_pstate   CPUs which run at the same hardware frequency: 1   CPUs which need to have their frequency coordinated by software: 1   maximum transition latency: 4294.55 ms.   hardware limits: 400 MHz - 3.50 GHz   available cpufreq governors: performance, powersave   current policy: frequency should be within 3.50 GHz and 3.50 GHz.                   The governor "performance" may decide which speed to use                   within this range.   current CPU frequency is 3.36 GHz. analyzing CPU 2:   driver: intel_pstate   CPUs which run at the same hardware frequency: 2   CPUs which need to have their frequency coordinated by software: 2   maximum transition latency: 4294.55 ms.   hardware limits: 400 MHz - 3.50 GHz   available cpufreq governors: performance, powersave   current policy: frequency should be within 3.50 GHz and 3.50 GHz.                   The governor "performance" may decide which speed to use                   within this range.   current CPU frequency is 3.26 GHz. analyzing CPU 3:   driver: intel_pstate   CPUs which run at the same hardware frequency: 3   CPUs which need to have their frequency coordinated by software: 3   maximum transition latency: 4294.55 ms.   hardware limits: 400 MHz - 3.50 GHz   available cpufreq governors: performance, powersave   current policy: frequency should be within 3.50 GHz and 3.50 GHz.                   The governor "performance" may decide which speed to use                   within this range.   current CPU frequency is 3.36 GHz.   Please take a look at     current policy: frequency should be within 3.50 GHz and 3.50 GHz.       The governor "performance" may decide which speed to use   Afterwards to go back to powersave I use my little script:  martin@martin-ThinkPad-T570:~$ cat cpu_freq_save.sh  #!/bin/bash sudo cpufreq-set -g powersave -c 0 --min 400MHz sudo cpufreq-set -g powersave -c 1 --min 400MHz sudo cpufreq-set -g powersave -c 2 --min 400MHz sudo cpufreq-set -g powersave -c 3 --min 400MHz   Which resets the min frequency and the governor but as soon as I compile again with my IDE every time the governor and the min frequency changes again.  Any idea how I can disable that automatic change?  PS: If you need more details, just tell me where to find them and I will provide them How to connect RDS from a different account with allowed IP in AWS? What is the translation of what's written below?  I think it may be the poem of the One Ring, but I'm not sure. I have an 3TB external disk and Windows XP 32 bit. It works as a USB 2 disk with its enclosure, but I want to use it as an internal SATA disk. I don't want to use it as a boot disk, only as a data disk. I understand that normally I need GPT (GUID partition table), and then I can't use Windows XP 32 bit anymore. I would prefer to avoid this. But what I did not understand by googling around is: can I partition the disk in 2 parts (so that each part is less than 2TB) with MBR and use it in Windows 32-bit? If yes, which tools do I need? I want to print two files in two columns -- first file on the left side and second on the right side. paste doesn't do the job, because it can only insert a character as delimiter, so if first file lines have different length output will be twisted: $ cat file1 looooooooong line line $ cat file2 hello world $ paste file1 file2 looooooooong line   hello line    world  If it was a command to add trailing spaces like fmt --add-spaces --width 50 the problem would be solved: $ paste &lt;(fmt --add-spaces --width 50 file1) file2 looooooooong line                                 hello line                                              world  But I don't know a simple way to do this. So how to merge and print several files horizontally without twisting? Actually, I just want to look at them simultaneously.  UPD: command to add trailing spaces does exist (for example, xargs -d '\n' printf '%-50s\n') But solution like $ paste &lt;(add-trailing-spaces file1) file2  does not work as expected when file1 has fewer lines than file2. Always wanting more , of anything, never has enough,never contented with what they have Dilemma: Present Perfect Or Perfect Continuous? I'm new to ArcGIS 10 and am trying to do a really simple field calculator equation and it is not working. I'm just trying to find the percentage of a certain demographic trait by doing:  [asian]/[total]*100   It is populating about 10% of the column correctly and then I get an error:     There was a failure during processing, check the Geoprocessing Results   window for details   Obviously my syntax is not incorrect or else it wouldn't start populating the field correctly.   Does anyone have any idea why this is happening? Who killed Ra's Al Ghul first, Batman or Arrow? Does Auto White-Balance Really Work? How? Proving the Cauchy-Schwarz inequality by induction This question has been asked before, at least twice by people who were trying to cheat on the PROMYS Europe 2020 Application, and once in a  because the OP showed no effort. I haven't been able to solve it, so I'm going to to ask it again.  PROMYS applications have closed, and I hope the effort shown below is enough to keep this question from being closed.     The Mathematical Forest is grown in a two-dimensional plane, where   trees can only grow on points with integer coordinates. To start with,   there are no trees at all. The foresters plant the first tree at   $(0,0)$. Each year, they carry out tree planting according to the   following rule. If there is a tree on the point (𝑚,𝑛) but there are   no trees on the points $(m+1,n)$ and $(m,n+1)$, then they can choose   to remove the tree on $(m,n)$ and plant new trees on the points   $(m,n+1)$ and $(m+1,n)$. For an integer $k\geq1$, the $k$th diagonal   consists of all points $(m,n)$ with $m+n=k−1$. Is it possible for the   foresters to arrange their planting so that eventually there are no   trees on the first $2$ diagonals? What about the first $3$ diagonals?    $4$ diagonals? Can you generalize?   It's easy to get to a position with no trees on the first two diagonals.  (It only takes $4$ plantings.)  I can prove it's impossible to reach a position with no trees on the first $4$ diagonals, and I believe it's impossible to reach a position with no trees on the first $3$ diagonals, but I can't prove it.  For the $k=4$ case, I used a pagoda function, as in a peg solitaire problem.  For $k=1,2,3,\dots$ define the potential of a tree on the $k$th diagonal as $\frac1{2^{k-1}}$, and the potential of the forest as the sum of the potentials of all the trees in it.  When a tree of potential $\frac1{2^{k-1}}$ is removed, it is replaced by $2$ trees of potential $\frac1{2^k}$ so the potential of the forest never changes.  Initially, the potential of the forest is $1$.  Since there are $k$ trees on diagonal $k$, the potential of all points beyond the fourth diagonal is $$\sum_{k=5}^\infty\frac k{2^{k-1}}=\frac34&lt;1,$$ so it is impossible that there are no trees on the first $4$ diagonals.  The potential of the fourth diagonal is $\frac12$, so this argument doesn't show that it's impossible to have no trees on the first $3$ diagonals.  I've done a lot of experimenting, though, and I believe that the statement is true.  (I even wrote a little computer game so I could experiment quickly.)  The best I've been able to do is to get down to one man on the third diagonal.   The black circles are trees eligible for removal, and the gray circles are other trees.  You can see that there is a "traffic jam" in front of the lone tree on diagonal $3$, and there seems to be no way to clear it.  I've been trying to come up with an argument that reflects this traffic jam, but I haven't been at all successful. We know that after $n$ removals there are $n+1$ trees, and I've been trying to prove somehow that they can't all be sufficiently far from the origin to allow all trees to get past diagonal $3$, but I haven't come close.   In the diagram above, if the tree at $(1,1)$ were moved to $(0,2)$, and the tree at $(1,2)$ were moved to $(2,0)$, then it would be possible to remove the tree at $(0,2)$, emptying the second diagonal.  In the fictitious position, we still have one tree on diagonal $2$ and two on diagonal $3$.   So, I think an argument along the lines I was trying cannot just be concerned with the distance from the origin; it must somehow take into account how the trees interfere with one another.  I haven't been able to do this.    I'd be grateful for solutions, hints, or counterexamples.  I wasn't really sure what tags to attach.  Please add any that seem appropriate. I have a script that reads a text stream and generates a file of sed commands that is later run with sed -f. The generated sed commands are like:  s/cid:image002\.gif@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1922/g s/cid:image003\.gif@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1923/g s/cid:image004\.jpg@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1924/g   Assume the script which generates the sed commands is something like:  while read cid fileid do     cidpat="$(echo $cid | sed -e s/\\./\\\\./g)"     echo 's/'"$cidpat"'/https:\/\/mysite.com\/files\/'"$fileid"'/g' &gt;&gt; sedscr done   How can I improve the script to ensure all regex metacharacters in the cid string are escaped and interpolated properly? How do I add a .sty file to my MacTeX/TeXShop installation? I've searched online, but I have not found any clear instructions how to permanently add .sty files to my TeXShop installation. I'm using a Mac with OSX (TeXShop is a mac only program).  What is the best way of doing this? The one comprehensive set of instructions I found .   I've got as far as extracting the files (running LaTeX on the .ins and . dtx files) but after that I don't know what to do. I also don't understand how to update the index of my distribution, and whether there are particular OSX specifics (the instructions are for Windows). This is a canonical question and answer developed by the community to help address common questions. If you've been directed here, or your question has been closed as a duplicate, please look through the resources here and use them to shape more specific questions. To browse all canonical questions and answers, navigate to the  tag. This question and answer is owned by the community! If you can improve it and make it more useful, you're welcome to edit it. I am building a trigger, a unit test, or other Apex code. I'm working with sObject records, and trying to access related record information. For example, I might have a structure like this: Account a = new Account(Name = 'Test'); insert a;  Opportunity o = new Opportunity(Name = 'Donation', AccountId = a.Id); insert o;  System.assertEquals(o.Account.Name, 'Test', 'Correct Account associated'); // Assertion fails!  Or, in a trigger, I might be aiming for something like this: trigger ContactTrigger on Contact (after insert) {     for (Contact c : Trigger.new) {         if (c.Account.Name == 'Test') {             // Take some action here         }      } }  Why doesn't this work? Why am I getting null values, or NullPointerExceptions? How can I save the world from the spread of Hallow and Corruption/Crimson? After the Wall of Flesh, the Hallow appears and Corruption/Crimson spreads even faster.   Corruption/Crimson spreads through everything   Except Hallow  Hallow spreads through everything   Except mud (jungle) Except synthetic blocks like gray-brick  The results of Hallow and Corruption meeting are unpredictable   How can I stop them both permanently and effectively from taking over the world, considering both the top layer and underground?  (Eg, simply placing gray brick on top of the surface won't stop the underground spread?)  And, is it worth the effort? What purpose does downvoting questions serve?