How to NOT show "Update Table of Contents" dialog box in MS Word? Is it possible to suppress the appearance of the "Update Table of Contents" when I update the table of contents in MS Word (by positioning the cursor on it ad pressing F9)?  (I always want to "Update entire table", so why asking for it?)
Turning off "Update page numbers only" in Word When I update the fields document-wide (Ctrl + A, then F9) in a Word document that has a table of contents, a dialog appears asking if I want to update page numbers only, or update the entire table. I never want to update page numbers only if the document headings have changed, nor will I ever.  (Apparently this is given as an option in case someone has manually changed an automatically generated ToC, which is almost always a really bad idea.)   Unfortunately, "Update page numbers only" is the default selection in the dialog, which means that I have to select the other option every time. I update the fields all the time when I'm working in a document that has figures and cross-references, so this is an annoying extra step I'd really like to get rid of.   Is there any way to tell Word to stop asking me this stupid unnecessary question?
Motivation for Napier's Logarithms In the wikipedia article on logarithms, I am clueless about the approach and motivation for the following computations done by Napier (and the mysterious appearance of Euler's number) in this . Please help me understand:       By repeated subtractions Napier   calculated $10^7(1 − 10^{−7})^L$ for L   ranging from 1 to 100. The result for   $L=100$ is approximately $0.99999 = 1  − 10^{-5}$. Napier then calculated the   products of these numbers with $10^7(1  − 10^{−5})^L$ for L from 1 to 50, and   did similarly with $0.9995 ≈ (1 −  10^{−5})^{20}$ and $0.99 ≈ 0.995^{20}$.   These computations, which occupied 20   years, allowed him to give, for any   number ''N'' from 5 to 10 million, the   number ''L'' that solves the equation      $$N=10^7 {(1-10^{-7})}^L$$      In modern notation, the relation to   natural logarithms is:      $$L = \log_{(1-10^{-7})} \!\left(  \frac{N}{10^7} \right) \approx 10^7  \log_{ \frac{1}{e}} \!\left(  \frac{N}{10^7} \right) = -10^7 \log_e  \!\left( \frac{N}{10^7} \right)$$      where the very close approximation   corresponds to the observation that      $${(1-10^{-7})}^{10^7} \approx  \frac{1}{e}. $$   I understand the computations, but I don't know what's going on. Is there consensus in the field of statistics that one book is the absolute best source and completely covering every aspect of GLM - detailing everything from estimation to inference? Is a current transformer appropriate for a voltage step up flyback converter? I am designing a flyback converter, input 170V output 1200V at 2mA.  I am having trouble finding an appropriate transformer, most do not have a high enough N. Current transformers seem to have ranges in 1:500, so I could work with that.  Is it proper to use a current transformer as a conventional step up voltage transformer? Is Dirichlet function Riemann integrable? How can I create an instance of the Java console inside of a GUI panel? I'm using Chrome 32 on an Android tablet (not phone) and just can't figure out how to close all open tabs in one go. Erase Windows Vista to Install Ubuntu new here. I have an old E-machine which as Windows Vista on it and I want to erase the Windows Vista, and install Ubuntu on it instead, but I am not sure where to start. Can I first install Ubuntu, and THEN erase Windows Vista, or is there a more sure method? I appreciate your help. Programmatically create a user and assign a role We had a quiz in class today where we had to break the ciphertext with the key given, but not the algorithm. Suffice to say that I wasn't able to decrypt it within the allotted time of 12 mins and will probably get a 0% score on the quiz.  So, I was just wondering if there are some kind of standard techniques that are followed when decrypting a simple substitution ciphertext. Live USB for Ubuntu 13.10 does't recognize Windows 8 OS Sequences in $C(X)$ converging uniformly implies uniform boundedness and equicontinuity Let $X$ be a metric space and let $\{ f_n \}_{n \geq 1}$ be a sequence in $C(X)$. Show that if $\{ f_n \}_{n \geq 1}$ converges uniformly on $X$ then $\{ f_n \}_{n \geq 1}$ is both uniformly bounded and equicontinuous.  Could I get a hint? error in running bash script as root I have a simple shutdown script which i want to run as root  shutdown -h +30; echo "succesfull";   I have followed these answer, to make my script root.  first I run this command  sudo chown root.root $HOME/test/test.sh sudo chmod 4755 $HOME/test/test.sh   and then made changes in sudoers  sudo visudo   added this command after this line %sudo   ALL=(ALL:ALL) ALL  eka ALL=(ALL) NOPASSWD: $HOME/test/test.sh   But when i executed my script its showing this error  shutdown: Need to be root succesfull Setuid bit seems to have no effect on bash Lost my Downloads folder both from Dock and Finder I did something stupid apparently and lost my Downloads folder both from Dock and then when I opened Finder to drag it down to the Dock it somehow got deleted in the desktop.  Now although I can see the folder exists (e.g. by searching in Spotlight) I do not know how to restore it in the Dock and in Finder as well. Any help please? The drive is constantly filling up. You've hunted down all the spare and random files you can. grep'd for coredump files and even removed some of the un-needed backups...  What would be your next move.  The actual server in question has 10GB of website files and the OS shouldn't take any more than 10GB so how do you track down what's filling a 50GB (virtual) drive? How to solve the functional equation $f\left(x^2+f(y)\right)=y+f(x)^2$ How to solve the following functional equation:  Find all $f:\mathbb{R}\to\mathbb{R} $ such that: $$ f\left(x^2+f(y)\right)=y+f(x)^2 $$ Holds for every $x,y\in\mathbb{R}$.  A friend gave it to me, probably its an olympiad question.  I started with the equation $f(f(y))=y+f(0)^2$ which seems to be quite helpful, but I couldn't do it effectively. How to solve it properly? What is $48\div2(9+3)$? There is a huge debate on the internet on the value of $48\div2(9+3)$. I believe the answer $2$ as I believe it is part of the bracket operation in BEDMAS.  yields the same answer. I also believe that if $48\div2\times(9+3)$ was asked it would be $288$ which Mathway agrees with as well. However,  says it is $288$ either way. A friend of mine (who is better at math) told me that there is no such thing as 'implicit multiplication', only shorthand so that is in fact done after the division (going left to right, not necessarily because division occurs before multiplication. But he didn't explicitly give a reason) What is the answer and why? Hide iPhone HTML5 video play button points out that certain key and block lengths were a requirement for the AES submissions:     The candidate algorithm shall be capable of supporting key-block combinations with sizes of 128-128, 192-128, and 256-128 bits.   My question is this; how can having a key length that is greater than the block size enhance security?  If we look at ECB mode for simplicity, when the key length is equal to the block length we have a permutation relationship between the set of all plaintexts and the set of all ciphertexts.  Once you increase the key length beyond that, you start to introduce collisions. In fact, you only introduce collisions from then on don't you? Collisions in the sense that a key will create the same ciphertext-plantext relationship as another key.  This would lead me to believe that only part of the key-space is unique, and only that part of key-space needs to be brute-forced?  I know that I am clearly incorrect, I just don't understand why. How can I withdraw my paper from a fake conference?