The newest update update of pstricks-add gives me the following error:  ! Paragraph ended before \ProvidesPackageRCS@i was completed  \documentclass[a4paper,12pt]{article} \usepackage{pstricks-add} \begin{document} test \end{document}   Does anyone know, how to fix this?
Consider the following MWE:  \documentclass{article} \usepackage{pstricks} \begin{document} A \end{document}   It produces the error  Runaway argument? ] {pgffor.code.tex}  ! Paragraph ended before \ProvidesPackageRCS@i was complete. &lt;to be read again&gt;                     \par  l.11   How do I fix this?
How to list files installed by a snap package? After a snap has been installed with sudo snap install [package] how can I list the files which have been installed by the snap? This can probably be fixed quite easily. I tried to research and find the answer to this but couldn't find anything relevant.     Basically, I can access my website perfectly through its url. (ex. example.com)  Whenever I click a link, go to my /wp-admin, or go to any other page, my domain changes into the IP address. (ex. instead of showing example.com/about it would show 192.111.223.4/about)  How do I fix this? Do I have to edit a file or can this be fixed by adding a domain record?  Thanks. Propose Newbie-Overflow site or section Because the perl section is looking like that right now. I believe that Stack Overflow is going out of it's charter in becoming a newbie FAQ when as far as the original reasoning it was meant to be something along the lines of an expert site.   is a good example of what I mean in Perl. It probably could be closed because it's a duplicate, or some other reason.   I would also like to indicate that I don't hold back answering newbie questions. It's just when I think of an obscure "stack overflow" error that's beating you some 3 am close to deadline, that's not "Howcum Perl print ..." and follows with something that causes a vast majority of Perl programmers to say oops, because they know exactly what's going on.   So the proposal is   A new site. "Move to Newbieville" A new "section" A new status somewhat similar to Closed ("Newbied") but still can be updated all the same as an open question.   I'm not against giving some newbies an assist, but I feel a FAQ for rank newbieism is not something that SO started out to be, based on the original concept of a Expert Site.   Including comment to Gnoupi:   I said nothing about making newbies unwelcome. Like I said. I answer them--heck, I think I've even answer homework questions. I've answered on the vague impressions that I can glean from posts that have 4 close votes. It can even lead to avoiding downvoting or yelling at newbies by more established curmudgeons if there is a special action you can do to gently inform newbies that this is a real newbie question.  However, you have to know that to some people newbies are already unwelcome. There is a site ethic, but the individual is also going to decide how much they welcome newbies. And people do post RTFM answers already.   Anyway, I'm one vote away from a peer pressure badge it seems. (Nope, nailed it.)    EDIT  For somebody jumping to the conclusion that I'm hostile to newbies:  just earlier Why is lock(this) {...} bad? The  says that public class SomeObject {   public void SomeOperation()   {     lock(this)     {       //Access instance variables     }   } }  is &quot;a problem if the instance can be accessed publicly&quot;. I'm wondering why? Is it because the lock will be held longer than necessary? Or is there some more insidious reason? Prove that if a function $f: X\to Y$ continuous then its graph is closed I got this question in my maths paper     Test the condition for convergence of $$\sum_{n=1}^\infty \frac{1}{n(n+1)(n+2)}$$   and find the sum if it exists.   I managed to show that the series converges but I was unable to find the sum. Any help/hint will go a long way. Thank you. On one of my machines I have a process running called "whoopsie". I'm running 12.04 server and never specifically installed anything with this name.  Google seems to imply that it has something to with error logs but I'm not finding too much information. The fact that I didn't manually install it and the 3 other servers I checked did in fact have no such running process OR executable made me a bit confused.  Does anyone know what the "whoopsie" process is?  Does anyone know what packages might have installed it? The server is quite plain, it has a LAMP stack, Samba and print servers and the Nagios NRPE plugin, nothing more installed, just standing there being a nice backup-server.  Some more info:  $ whoopsie -h Usage:   whoopsie [OPTION...]  Help Options:   -h, --help           Show help options  Application Options:   -f, --foreground     Run in the foreground   and  USER       PID %CPU %MEM    VSZ   RSS TTY      STAT START   TIME COMMAND   whoopsie   913  0.0  0.4  24448  2092 ?        Ssl  May07   0:00 whoopsie   and  $ sudo cat /etc/passwd | grep whoop whoopsie:x:107:118::/nonexistent:/bin/false How do I format a Decimal to a programatically controlled number of decimals in c#? form in a .tpl.php file This is the code in my template.php file.  function studiga_theme_theme($existing, $type, $theme, $path) {         $items['add_property_form'] = array(         'render element' =&gt; 'form',         'template' =&gt; 'node--14',         'path' =&gt; drupal_get_path('theme', 'studiga_theme') . '/templates/node',     );      return $items; }    function custom_add_property_form($form, &amp;$form_state) {     $form['first_name'] = array(         '#type' =&gt; 'textfield',         '#attributes' =&gt; array('placeholder' =&gt; t('First name')),     );     $form['last_name'] = array(         '#type' =&gt; 'textfield',         '#attributes' =&gt; array('placeholder' =&gt; t('Last name')),     );     $form['address'] = array(         '#type' =&gt; 'textfield',         '#attributes' =&gt; array('placeholder' =&gt; t('Address')),     );     $form['city'] = array(         '#type' =&gt; 'textfield',         '#attributes' =&gt; array('placeholder' =&gt; t('City')),     );     $form['state'] = array(         '#type' =&gt; 'select',         '#options' =&gt; array(             'default' =&gt; 'State',             '...' =&gt; '...',         ),     );     $form['zip'] = array(         '#type' =&gt; 'textfield',         '#attributes' =&gt; array('placeholder' =&gt; t('Zip')),     );     $form['email'] = array(         '#type' =&gt; 'textfield',         '#attributes' =&gt; array('placeholder' =&gt; t('Email')),     );     $form['phone'] = array(         '#type' =&gt; 'textfield',         '#attributes' =&gt; array('placeholder' =&gt; t('Phone')),     );     $form['submit'] = array(         '#type' =&gt; 'submit',         '#value' =&gt; 'Submit',     );      return $form; }   This is the code in node--14.tpl.php.                                          Contact Information                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  &lt;div class="row"&gt;     &lt;div class="small-12 medium-12 large-8 large-offset-2 columns"&gt;         &lt;?php print render($form['submit']); ?&gt;     &lt;/div&gt; &lt;/div&gt;     But no fields are appearing - what am I doing wrong? You can't have a straight forward  in a tpl.php file can you? find $\sum_{k=2}^{\infty}\frac{1}{k^2-1}$ Let $f:R\rightarrow R$ be a function such that all its successive derivatives exist in all $R$ and also $f(x)f''(x)\leq 0$ everywhere.  If $\alpha$ and $\beta$ be two successive roots of $f(x)=0$.   Then prove that $f'''(x)=0$ for atleast one $\gamma \in(\alpha,\beta)$.  My Attempt:  I began by taking an example $f(x)=(x-1)(2-x)$ and let $x=1$ and $x=2$ be its two successive roots.The statement is trivially true.  Then I took the function $f(x)=e^{-x}(x-1)(2-x)$.The statement is true here also so on and so forth.  But what would be the exact proof I wonder. It appears to be a question of Rolle's Theorem. How to make git ignore changes in case? I'm not too sure what is going on here, but sometimes a particular file in my repository will change the case of its name. e.g.,: before: File.h after: file.h I don't really care why this is happening, but this causes git to think it is a new file, and then I have to go and change the file name back. Can you just make git ignore case changes? [edit] I suspect it is Visual Studio doing something weird with that particular file, because it seems to happen most often when I open and save it after changes. I don't have any way to fix bugs in VS however, but git should be a bit more capable I hope. How do I capture the milky way? Can the milky way actually be photographed ? I know the image is manipulated, and is probably a composite, but how do you capture such contrast in the milky way? Is an equitorially mounted scope required? Any advice or pointers are welcome, thanks.  I'm heading out towards much less light polluted areas middle of next week and I want to try some nighttime sky captures with my 7D.  Additional info: I just found  on wikipedia that says: 54s, tripod mounted 5D, 16mm lens, f/2.8, ISO800. What else do I need to be aware of? My 7D is only an APS-C and the widest lens I have is 19mm. I'm thinking that might not be wide enough to capture an interesting shot? A saying for something that's good but also has a downside I'm trying to transition from a list of pros to a list of cons, and would like to have some sort of transition quote. Something in the form of,  "But, alas, (((something something quote quote)))"  Everything that has a beginning has an end, something along the lines of that. Trigger an event with Prototype I'm trying to run a gunicorn_django process in supervisor but it always exits immediately, giving this error:   INFO exited: my_app (exit status 1; not expected) INFO received SIGCLD indicating a child quit INFO gave up: my_app entered FATAL state, too many start retries too quickly   My server script looks like this:  #!/bin/bash set -e LOGFILE=/var/log/gunicorn/my_app.log LOGDIR=$(dirname $LOGFILE) NUM_WORKERS=3 USER=my-www-user GROUP=my-www-user cd /home/my-www-user/my_app source /home/my-www-user/.virtualenvs/my_app/bin/activate test -d $LOGDIR || mkdir -p $LOGDIR gunicorn_django -w $NUM_WORKERS --debug \  --user=$USER --group=$GROUP \  --log-level=debug --log-file=$LOGFILE 2&gt;&gt;$LOGFILE\  --pythonpath=my_app --settings=settings.active \  my_app.wsgi:application   And my supervisor config looks like this:  [program:my_app] directory=/home/my-www-user/my_app/ user=my-www-user command=/home/my-www-user/my_app/server.sh stdout_logfile=/var/log/supervisor/my_app.log stderr_logfile=/var/log/supervisor/my_app-error.log autostart=true autorestart=true   When I su into the my-www-user account the server starts normally. When I do sudo supervisorctl start my_app it simply hangs until I do CTRL-c, then I find the error above in the supervisord.log file.  Does anyone have a clue about what I am missing? Visual Studio: How to break on handled exceptions? I would like Visual Studio to break when a handled exception happens (i.e. I don't just want to see a "First chance" message, I want to debug the actual exception).  e.g. I want the debugger to break at the exception:  try {    System.IO.File.Delete(someFilename); } catch (Exception) {    //we really don't care at runtime if the file couldn't be deleted }   I came across  notes for Visual Studio.NET:     1) In VS.NET go to the Debug Menu >>   "Exceptions..." >> "Common Language   Runtime Exceptions" >> "System" and   select "System.NullReferenceException"      2) In the bottom of that dialog there   is a "When the exception is thrown:"   group box, select "Break into the   debugger"       3) Run your scenario. When the   exception is thrown, the debugger will   stop and notify you with a dialog that   says something like:              "An exception of type "System.NullReferenceException" has   been thrown.              [Break] [Continue]"       Hit [Break]. This will put you on the   line of code that's causing the   problem.   But they do not apply to Visual Studio 2005 (there is no Exceptions option on the Debug menu).  Does anyone know where the find this options dialog in Visual Studio that the "When the exception is thrown" group box, with the option to "Break into the debugger"?  Update: The problem was that my Debug menu didn't have an Exceptions item. I customized the menu to manually add it. If I wave around a bar magnet, the magnetic field in the space around it changes. Is this enough to go through the whole speed of light derivation implying that the motion creates an electromagnetic wave? If so how do I determine the wavelength and direction of the resulting wave? I've got a road bike with brake lever shifters, and it's developed a small problem with age: sometimes, the shifter doesn't catch the first time or two I push it. It'll move easily, with no resistance, since it's not actually pulling on the cable, then after a few tries, catch and work normally. The colder the temperature, the more often this happens.  I don't know how the mechanism works internally, so I'm curious what would cause this, and also whether it's (as I suspect) gradual wear of some part of the mechanism, and if it's likely to fail catastrophically, or gradually worsen. Here is the proof I tried to weave while trying to prove this theorem:     Theorem. Every infinite subset of a countable set is countable.      Proof. Let $A$ be a countable set and $E\subset A$ be infinite. Then $A\thicksim\mathbb{N}$. This implies that there is a sequence $\left\{x_{n}\right\}_{n\in\mathbb{N}}$ where $x_{n}\in A$. Construct a sequence $\left\{n_{k}\right\}_{k\in\mathbb{N}}$ where $x_{n_{k}}\in A$, $n_{1}$ is the smallest positive integer such that $x_{n_{1}}\in A$, and $n_{k+1}&gt;n_{k}$. Then      $$ E=\bigcup_{k=1}^{\infty}x_{n_{k}}, $$      and $E$ is countable, because $E\thicksim\mathbb{N}$. $\blacksquare$   Is it convincing?