New to Ubuntu, but have looked everywhere to get this question answered. Found no solution so far. Basically I need to run two terminal commands on startup, which follow each other directly. This will allow me to open a python script on start up. The script works when opened manually, but I'm at a loss to get it to work on boot. In terminal I type:  cd /directory/with/python/script/ python name.py   The script works, but I'm having trouble getting it to run on boot.
How can I run scripts automatically when Ubuntu starts up so I don't have to run them manually after startup?
Why is the amount of photos that fit on one card dependent on ISO? How do I pass a function as a parameter to in elisp? I'm trying to pass one method to another in elisp, and then have that method execute it.  Here is an example:  (defun t1 ()   "t1")  (defun t2 ()   "t1")  (defun call-t (t)   ; how do I execute "t"?   (t))  ; How do I pass in method reference? (call-t 't1) How to find which package provides a file? For example, I can't install package qcad because of error: "can't find qdict.h". How can I find the package which provides the file qdict.h so I can install the package qcad? Protect Google Spreadsheet formatting while allowing changes to data I would like to protect the formatting of a cell (or a range of cells) in a Google Spreadsheet, but still allow changing the data in that (or those) cell(s).  For example, I want to add a validation rule on a cell that says the cell has to contain a number between 1 and 10, and I would like others to be able to change the value in that cell, but not the validation rule itself.  How do I do that?  So far I was only able to completely protect the cell (content + formatting) or not at all (the user can change the content as well as the formatting).  To me this seems to be an important functionality when adding access rights to spreadsheets. Is it possible that it is completely missing from Google Spreadsheets? Inequality of $\vert \text{tanh}(x)-x+\frac{x^3}{3}\vert\leq\frac{1}{8}$ for $x\in[-1/4,1/4]$ I have an assignment, that I cannot seem to find a starting point for. I am not looking for the specific answer, but only where to begin. Any pointers are appreciated.  I have to prove the inequality $\vert \tanh(x)-x+\frac{x^3}{3}\vert\leq\frac{1}{8}$ for $x\in[-1/4,1/4]$ where $x-\frac{x^3}{3}$ is the 3rd order Taylor expansion.  I've tried with the triangle inequalities, Lagrange remainders, and a lot of other stuff, but I am no where near a correct argumentation. Does anyone have any suggestions? List the files containing a particular word in their text I came across a combinatorial proof of the Fermat's Little Theorem which states that    If $p$ is a prime number then the number ($a$$p$-$a$) is a multiple of $p$ for any natural number $a$.  Let me write down the proof.    PROOF  We have pearls of $a$ colours . From these we make necklaces of exactly $p$ pearls .   First,we make a string of pearls . There are $a$$p$ different strings.If we throw away  the $a$ one one -coloured pearls  ($a$$p$-$a$) strings will remain.We connect the ends of each string to get necklaces.We find that two strings that differ only by a cyclic permutation of its pearls result in indistinguishable necklaces.But there are $p$ cyclic permutations of $p$ pearls on a string . Hence the number of distinct necklaces is    [($a$$p$-$a$)/$p$].  Because of this interpretation this is an integer.Thus ($a$$p$-$a$) is a multiple of $p$ for any natural number $a$. [HENCE PROVED]     MY CONFUSIONS    What is the use of the fact that $p$ is a prime in this proof?  If this proof is true then why is this not true for every positve integer $p$? Multiple servers acting like a single one with all the hardware? by now I have 10 servers for hpc, power computing oriented. My users need to launch several processes using qmake. The users are used to work with ubuntu 9.10, and the software from the repositories is switable for them.  I've deployed ubuntu 9.10 to all 10 servers (pxe rocks).  By now we work with parallel-ssh and cluster-ssh, which allows as to launch the same process to all servers. With this tools this tools the servers remain as independent but with the same software and the same launched command.  Now we would like to go to next step and see all the servers as a single one with all the resources from the other 9 as if was its resources.   The difference would be substantial in time to process and also time to design the command to launch.  Any advice on wich software to use will be very useful?  Thanks Mark's generosity in this crisis seems to more than make up for his earlier stinginess.   Should those sentences always be avoided, or are there cases where they are valid? Force applied off center on an object Problem with finding the GCD in the Field of Polynomials mod p I am really having trouble working a problem in my course. I will post it and then add what I have thought etc.  Let p be an odd prime, then using the Euclidian Algorithm, calculated the GCD of of $x^{p-1}-1$ and $x^2+1$ in $\mathbb{Z} / p\mathbb{Z}[x]$  Also, how does $p=1 (mod4)$ tell us that  $-1$ is a square in $\mathbb{Z} / p\mathbb{Z}$, infact that $-1$ is a square here if and only if $p=1(mod4)$.  My thoughts:   I know that $$x^{p}-x=(x)(x-1)(x-2)…(x-(p-1))$$ and so that in this sense our roots will be the congruence classes of $1,2,…p-1$  and also that $$x^{p-1}-1=(x-1)(x-2)…(x-(p-1))$$  But I get lost when trying to apply the EA to these polynomials,  like how can I do it when p is arbitrary?  Preferably id like to be able to understand/see how to do the first part first i.e. using division with residue and then move on to the second part. Any insight/hint or solution to this would be great,  Thank you all  Update:  When I try to do division with residue, I just get  $$x^{p-1}-1=(x^2+1)(x^{p-3}-x^{p-5}+x^{p-7}-x^{p-9}...)$$  for example,  $p=7$  $$(x^{6}-1)=(x^2+1)(x^4-x^2+1)$$  for $p=11$  $$(x^{10}-1)=(x^2+1)(x^{8}-x^{6}+x^{4}-x^{2}+1)$$  which for specific cases tells me that 1 is the gcd, but I dont know how to generalize that for the case with arbitrary prime p. Proof of Divergence for a Sequence Can it hurt to put my GRE score on my resume? OED says:     doobie: a marijuana cigarette    Origin unknown. A relationship with dobby has been suggested.    dobby/dobbie: A silly old man, a dotard, a booby. Dialectal.      First citations:    1967   J. B. Williams Narcotics &amp; Hallucinogenics. Dubbe, Negro slang for a marijuana roach.    1982   A. Maupin Further Tales of City 95,  I smoke a doobie at lunch.   But I just chanced upon  in Yahoo Answers (don't laugh! :) where someone posted:     "It's obvious that Shaggy's a , I'm sure he's been feeding Scoob a bit of his hash and whatnot."    Scoob = , cartoon "pet" dog of constantly-hungry hippie/village idiot Shaggy (from 1969)   I'm not entirely convinced that 1967 dubbe was necessarily a significant factor in the appearance of  since around 1970 (the hippie era, some might say).  So I'd like to know whether it's credible to claim the usage arose (primarily?) through association with the TV show (specifically, the two characters therein closely associated with marijuana). Are there critical hits for spells? How to activate GRASS GIS 7 plugin in QGIS 2.8? I have a matrix which is kind of symmetrical with the other diagonal, i.e., something like  $$A = \left[ \begin{array}{c c c c}    a &amp; b &amp; c &amp; d \\    e &amp; f &amp; g &amp; c \\    h &amp; i &amp; f &amp; b \\    j &amp; h &amp; e &amp; a  \end{array} \right]$$  Does this matrix have a special name in literature? What are it's properties?  And a matrix that is symmetrical by both diagonals   $$A = \left[ \begin{array}{c c c c}    a &amp; b &amp; c &amp; d \\    b &amp; e &amp; f &amp; c \\    c &amp; f &amp; e &amp; b \\    d &amp; c &amp; b &amp; a  \end{array} \right]$$  What's the name of it? Any interesting properties? WITH ROLLUP WHERE x IS NULL I'm writing an article on  and some people pointed out that this is completely useless.  My idea is to amend my article with some theories that seemed useless when they are created but found use after some time.  I came with some ideas like the Turing machine but I think I'm not grasping the right examples.  Can someone point me some theories that seemed like the Lychrel numbers and then become 'useful'? Why does kinetic energy increase quadratically, not linearly, with speed? As  says:     [...] the kinetic energy of a non-rotating object of mass $m$ traveling at a speed $v$ is $\frac{1}{2}mv^2$.   Why does this not increase linearly with speed? Why does it take so much more energy to go from $1\ \mathrm{m/s}$ to $2\ \mathrm{m/s}$ than it does to go from $0\ \mathrm{m/s}$ to $1\ \mathrm{m/s}$?  My intuition is wrong here, please help it out!